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.r083-tall-174860079700063.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 DoubleExponent-PT-020, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-174860079700063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K 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.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 340K May 29 14:32 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 DoubleExponent-PT-020-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748731012156

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 22:36:53] [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-05-31 22:36:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 22:36:53] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2025-05-31 22:36:53] [INFO ] Transformed 1064 places.
[2025-05-31 22:36:53] [INFO ] Transformed 998 transitions.
[2025-05-31 22:36:53] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 998 rows 1064 cols
[2025-05-31 22:36:53] [INFO ] Invariants computation overflowed in 140 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 10000 steps (333 resets) in 36 ms. (270 steps per ms)
BEST_FIRST walk for 160000 steps (4535 resets) in 300 ms. (531 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 998 rows 1064 cols
[2025-05-31 22:36:54] [INFO ] Invariants computation overflowed in 89 ms
[2025-05-31 22:36:56] [INFO ] [Real]Absence check using state equation in 1389 ms returned sat
[2025-05-31 22:36:56] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 78 ms.
[2025-05-31 22:36:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:58] [INFO ] [Nat]Absence check using state equation in 1569 ms returned unknown
[2025-05-31 22:36:59] [INFO ] [Real]Absence check using state equation in 790 ms returned sat
[2025-05-31 22:36:59] [INFO ] Deduced a trap composed of 103 places in 321 ms of which 48 ms to minimize.
[2025-05-31 22:36:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:00] [INFO ] [Nat]Absence check using state equation in 803 ms returned sat
[2025-05-31 22:37:00] [INFO ] Deduced a trap composed of 388 places in 308 ms of which 8 ms to minimize.
[2025-05-31 22:37:01] [INFO ] Deduced a trap composed of 188 places in 251 ms of which 4 ms to minimize.
[2025-05-31 22:37:01] [INFO ] Deduced a trap composed of 103 places in 232 ms of which 4 ms to minimize.
[2025-05-31 22:37:01] [INFO ] Deduced a trap composed of 187 places in 190 ms of which 3 ms to minimize.
[2025-05-31 22:37:02] [INFO ] Deduced a trap composed of 442 places in 328 ms of which 6 ms to minimize.
[2025-05-31 22:37:02] [INFO ] Deduced a trap composed of 204 places in 215 ms of which 3 ms to minimize.
[2025-05-31 22:37:02] [INFO ] Deduced a trap composed of 192 places in 324 ms of which 6 ms to minimize.
[2025-05-31 22:37:02] [INFO ] Deduced a trap composed of 213 places in 178 ms of which 3 ms to minimize.
[2025-05-31 22:37:03] [INFO ] Deduced a trap composed of 305 places in 190 ms of which 3 ms to minimize.
[2025-05-31 22:37:03] [INFO ] Deduced a trap composed of 199 places in 174 ms of which 3 ms to minimize.
[2025-05-31 22:37:03] [INFO ] Deduced a trap composed of 191 places in 178 ms of which 3 ms to minimize.
[2025-05-31 22:37:03] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3323 ms
[2025-05-31 22:37:03] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 57 ms.
[2025-05-31 22:37:04] [INFO ] Added : 20 causal constraints over 4 iterations in 752 ms. Result :unknown
[2025-05-31 22:37:05] [INFO ] [Real]Absence check using state equation in 237 ms returned unsat
[2025-05-31 22:37:05] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2025-05-31 22:37:06] [INFO ] Deduced a trap composed of 25 places in 304 ms of which 6 ms to minimize.
[2025-05-31 22:37:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:06] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2025-05-31 22:37:07] [INFO ] Deduced a trap composed of 25 places in 295 ms of which 5 ms to minimize.
[2025-05-31 22:37:07] [INFO ] Deduced a trap composed of 31 places in 280 ms of which 5 ms to minimize.
[2025-05-31 22:37:07] [INFO ] Deduced a trap composed of 18 places in 273 ms of which 5 ms to minimize.
[2025-05-31 22:37:07] [INFO ] Deduced a trap composed of 187 places in 189 ms of which 3 ms to minimize.
[2025-05-31 22:37:08] [INFO ] Deduced a trap composed of 161 places in 190 ms of which 3 ms to minimize.
[2025-05-31 22:37:08] [INFO ] Deduced a trap composed of 187 places in 190 ms of which 3 ms to minimize.
[2025-05-31 22:37:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1770 ms
[2025-05-31 22:37:08] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 67 ms.
[2025-05-31 22:37:09] [INFO ] Added : 20 causal constraints over 4 iterations in 950 ms. Result :sat
Minimization took 519 ms.
[2025-05-31 22:37:10] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2025-05-31 22:37:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:10] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2025-05-31 22:37:11] [INFO ] Deduced a trap composed of 398 places in 355 ms of which 7 ms to minimize.
[2025-05-31 22:37:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 541 ms
[2025-05-31 22:37:11] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 59 ms.
[2025-05-31 22:37:12] [INFO ] Added : 5 causal constraints over 1 iterations in 1153 ms. Result :unknown
[2025-05-31 22:37:13] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2025-05-31 22:37:13] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 46 ms.
[2025-05-31 22:37:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:13] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2025-05-31 22:37:13] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 57 ms.
[2025-05-31 22:37:14] [INFO ] Added : 20 causal constraints over 4 iterations in 904 ms. Result :sat
Minimization took 963 ms.
[2025-05-31 22:37:17] [INFO ] [Real]Absence check using state equation in 1538 ms returned unknown
[2025-05-31 22:37:17] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2025-05-31 22:37:18] [INFO ] Deduced a trap composed of 381 places in 347 ms of which 7 ms to minimize.
[2025-05-31 22:37:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:19] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2025-05-31 22:37:19] [INFO ] Deduced a trap composed of 381 places in 389 ms of which 6 ms to minimize.
[2025-05-31 22:37:20] [INFO ] Deduced a trap composed of 35 places in 346 ms of which 6 ms to minimize.
[2025-05-31 22:37:20] [INFO ] Deduced a trap composed of 34 places in 368 ms of which 8 ms to minimize.
[2025-05-31 22:37:20] [INFO ] Deduced a trap composed of 408 places in 357 ms of which 6 ms to minimize.
[2025-05-31 22:37:21] [INFO ] Deduced a trap composed of 423 places in 364 ms of which 6 ms to minimize.
[2025-05-31 22:37:21] [INFO ] Deduced a trap composed of 414 places in 337 ms of which 6 ms to minimize.
[2025-05-31 22:37:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2654 ms
[2025-05-31 22:37:21] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 56 ms.
[2025-05-31 22:37:23] [INFO ] Added : 15 causal constraints over 3 iterations in 1203 ms. Result :unknown
[2025-05-31 22:37:24] [INFO ] [Real]Absence check using state equation in 1217 ms returned sat
[2025-05-31 22:37:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:25] [INFO ] [Nat]Absence check using state equation in 1293 ms returned sat
[2025-05-31 22:37:26] [INFO ] Deduced a trap composed of 7 places in 335 ms of which 6 ms to minimize.
[2025-05-31 22:37:26] [INFO ] Deduced a trap composed of 424 places in 315 ms of which 6 ms to minimize.
[2025-05-31 22:37:26] [INFO ] Deduced a trap composed of 422 places in 322 ms of which 6 ms to minimize.
[2025-05-31 22:37:27] [INFO ] Deduced a trap composed of 434 places in 301 ms of which 5 ms to minimize.
[2025-05-31 22:37:27] [INFO ] Deduced a trap composed of 430 places in 295 ms of which 6 ms to minimize.
[2025-05-31 22:37:27] [INFO ] Deduced a trap composed of 65 places in 284 ms of which 6 ms to minimize.
[2025-05-31 22:37:28] [INFO ] Deduced a trap composed of 149 places in 302 ms of which 6 ms to minimize.
[2025-05-31 22:37:28] [INFO ] Deduced a trap composed of 36 places in 269 ms of which 8 ms to minimize.
[2025-05-31 22:37:29] [INFO ] Deduced a trap composed of 161 places in 190 ms of which 4 ms to minimize.
[2025-05-31 22:37:29] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3316 ms
[2025-05-31 22:37:29] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 51 ms.
[2025-05-31 22:37:29] [INFO ] Added : 20 causal constraints over 4 iterations in 285 ms. Result :unknown
[2025-05-31 22:37:30] [INFO ] [Real]Absence check using state equation in 1133 ms returned sat
[2025-05-31 22:37:31] [INFO ] Deduced a trap composed of 402 places in 320 ms of which 6 ms to minimize.
[2025-05-31 22:37:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:32] [INFO ] [Nat]Absence check using state equation in 1216 ms returned unknown
[2025-05-31 22:37:33] [INFO ] [Real]Absence check using state equation in 681 ms returned sat
[2025-05-31 22:37:33] [INFO ] Deduced a trap composed of 478 places in 308 ms of which 7 ms to minimize.
[2025-05-31 22:37:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:34] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2025-05-31 22:37:34] [INFO ] Deduced a trap composed of 478 places in 304 ms of which 5 ms to minimize.
[2025-05-31 22:37:35] [INFO ] Deduced a trap composed of 443 places in 321 ms of which 6 ms to minimize.
[2025-05-31 22:37:35] [INFO ] Deduced a trap composed of 77 places in 319 ms of which 6 ms to minimize.
[2025-05-31 22:37:35] [INFO ] Deduced a trap composed of 484 places in 315 ms of which 6 ms to minimize.
[2025-05-31 22:37:36] [INFO ] Deduced a trap composed of 472 places in 323 ms of which 6 ms to minimize.
[2025-05-31 22:37:36] [INFO ] Deduced a trap composed of 437 places in 315 ms of which 6 ms to minimize.
[2025-05-31 22:37:37] [INFO ] Deduced a trap composed of 447 places in 331 ms of which 6 ms to minimize.
[2025-05-31 22:37:37] [INFO ] Deduced a trap composed of 409 places in 326 ms of which 20 ms to minimize.
[2025-05-31 22:37:37] [INFO ] Deduced a trap composed of 103 places in 220 ms of which 4 ms to minimize.
[2025-05-31 22:37:37] [INFO ] Deduced a trap composed of 161 places in 180 ms of which 3 ms to minimize.
[2025-05-31 22:37:38] [INFO ] Deduced a trap composed of 261 places in 178 ms of which 3 ms to minimize.
[2025-05-31 22:37:38] [INFO ] Deduced a trap composed of 201 places in 177 ms of which 3 ms to minimize.
[2025-05-31 22:37:38] [INFO ] Deduced a trap composed of 204 places in 166 ms of which 3 ms to minimize.
[2025-05-31 22:37:38] [INFO ] Deduced a trap composed of 199 places in 169 ms of which 3 ms to minimize.
[2025-05-31 22:37:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 22:37:39] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2025-05-31 22:37:39] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 56 ms.
[2025-05-31 22:37:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:40] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2025-05-31 22:37:40] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 48 ms.
[2025-05-31 22:37:42] [INFO ] Added : 25 causal constraints over 5 iterations in 1772 ms. Result :unknown
[2025-05-31 22:37:44] [INFO ] [Real]Absence check using state equation in 1823 ms returned unknown
[2025-05-31 22:37:45] [INFO ] [Real]Absence check using state equation in 819 ms returned sat
[2025-05-31 22:37:45] [INFO ] Deduced a trap composed of 233 places in 207 ms of which 3 ms to minimize.
[2025-05-31 22:37:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:46] [INFO ] [Nat]Absence check using state equation in 834 ms returned sat
[2025-05-31 22:37:46] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 51 ms.
[2025-05-31 22:37:48] [INFO ] Added : 20 causal constraints over 4 iterations in 1521 ms. Result :unknown
[2025-05-31 22:37:53] [INFO ] [Real]Absence check using state equation in 4888 ms returned unknown
[2025-05-31 22:37:53] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2025-05-31 22:37:53] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 44 ms.
[2025-05-31 22:37:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:54] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2025-05-31 22:37:54] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 56 ms.
[2025-05-31 22:37:55] [INFO ] Added : 20 causal constraints over 4 iterations in 843 ms. Result :sat
Minimization took 531 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
FORMULA DoubleExponent-PT-020-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 15 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Graph (complete) has 1816 edges and 1064 vertex of which 1060 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 223 transitions
Trivial Post-agglo rules discarded 223 transitions
Performed 223 trivial Post agglomeration. Transition count delta: 223
Iterating post reduction 0 with 223 rules applied. Total rules applied 224 place count 1060 transition count 775
Reduce places removed 223 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 230 rules applied. Total rules applied 454 place count 837 transition count 768
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 461 place count 830 transition count 768
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 461 place count 830 transition count 727
Deduced a syphon composed of 41 places in 6 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 543 place count 789 transition count 727
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 4 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 899 place count 611 transition count 549
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 19 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 975 place count 573 transition count 549
Free-agglomeration rule (complex) applied 76 times.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1051 place count 573 transition count 473
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 3 with 76 rules applied. Total rules applied 1127 place count 497 transition count 473
Partial Free-agglomeration rule applied 77 times.
Drop transitions (Partial Free agglomeration) removed 77 transitions
Iterating global reduction 4 with 77 rules applied. Total rules applied 1204 place count 497 transition count 473
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1205 place count 496 transition count 472
Applied a total of 1205 rules in 304 ms. Remains 496 /1064 variables (removed 568) and now considering 472/998 (removed 526) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 315 ms. Remains : 496/1064 places, 472/998 transitions.
Found an invariant !
This invariant on transitions {32=1, 43=1, 46=1, 141=1, 144=1, 215=1, 303=1, 424=1, 440=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {32=1, 43=1, 46=1, 141=1, 144=1, 215=1, 303=1, 424=1, 440=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1261 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 15) seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 472 rows 496 cols
[2025-05-31 22:49:06] [INFO ] Invariants computation overflowed in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (127986 resets) in 1102 ms. (906 steps per ms)
BEST_FIRST walk for 15000003 steps (1270808 resets) in 9685 ms. (1548 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 472 rows 496 cols
[2025-05-31 22:49:16] [INFO ] Invariants computation overflowed in 51 ms
[2025-05-31 22:49:17] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2025-05-31 22:49:17] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 22:49:17] [INFO ] [Real]Added 75 Read/Feed constraints in 636 ms returned sat
[2025-05-31 22:49:17] [INFO ] Computed and/alt/rep : 409/2363/409 causal constraints (skipped 62 transitions) in 57 ms.
[2025-05-31 22:49:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:49:19] [INFO ] [Nat]Absence check using state equation in 1041 ms returned sat
[2025-05-31 22:49:20] [INFO ] [Nat]Added 75 Read/Feed constraints in 1303 ms returned sat
[2025-05-31 22:49:20] [INFO ] Computed and/alt/rep : 409/2363/409 causal constraints (skipped 62 transitions) in 30 ms.
[2025-05-31 22:49:23] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2025-05-31 22:49:23] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 3 ms to minimize.
[2025-05-31 22:49:23] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
[2025-05-31 22:49:24] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 10 ms to minimize.
[2025-05-31 22:49:24] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 5 ms to minimize.
[2025-05-31 22:49:24] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 7 ms to minimize.
[2025-05-31 22:49:24] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 3 ms to minimize.
[2025-05-31 22:49:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1673 ms
[2025-05-31 22:49:25] [INFO ] Added : 173 causal constraints over 36 iterations in 4525 ms. Result :sat
Minimization took 2157 ms.
[2025-05-31 22:49:27] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2025-05-31 22:49:29] [INFO ] [Real]Added 75 Read/Feed constraints in 1249 ms returned sat
[2025-05-31 22:49:29] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:49:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:49:30] [INFO ] [Nat]Absence check using state equation in 626 ms returned sat
[2025-05-31 22:49:31] [INFO ] [Nat]Added 75 Read/Feed constraints in 1607 ms returned sat
[2025-05-31 22:49:31] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2025-05-31 22:49:31] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:49:32] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:49:32] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2025-05-31 22:49:32] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 0 ms to minimize.
[2025-05-31 22:49:32] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 1 ms to minimize.
[2025-05-31 22:49:32] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2025-05-31 22:49:32] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 1 ms to minimize.
[2025-05-31 22:49:32] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 2 ms to minimize.
[2025-05-31 22:49:32] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2025-05-31 22:49:33] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 1 ms to minimize.
[2025-05-31 22:49:33] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 1 ms to minimize.
[2025-05-31 22:49:33] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 1 ms to minimize.
[2025-05-31 22:49:33] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2025-05-31 22:49:33] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2025-05-31 22:49:33] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 1 ms to minimize.
[2025-05-31 22:49:33] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2025-05-31 22:49:34] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 1 ms to minimize.
[2025-05-31 22:49:34] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2025-05-31 22:49:34] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2025-05-31 22:49:34] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2025-05-31 22:49:34] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2025-05-31 22:49:34] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 2 ms to minimize.
[2025-05-31 22:49:34] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2025-05-31 22:49:34] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2025-05-31 22:49:35] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 2 ms to minimize.
[2025-05-31 22:49:35] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2025-05-31 22:49:35] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 2 ms to minimize.
[2025-05-31 22:49:35] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 2 ms to minimize.
[2025-05-31 22:49:35] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
[2025-05-31 22:49:35] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 2 ms to minimize.
[2025-05-31 22:49:35] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 4307 ms
[2025-05-31 22:49:36] [INFO ] Computed and/alt/rep : 409/2363/409 causal constraints (skipped 62 transitions) in 43 ms.
[2025-05-31 22:49:53] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 3 ms to minimize.
[2025-05-31 22:49:53] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 2 ms to minimize.
[2025-05-31 22:49:53] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 2 ms to minimize.
[2025-05-31 22:49:54] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 2 ms to minimize.
[2025-05-31 22:49:54] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2025-05-31 22:49:54] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2025-05-31 22:49:54] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:49:54] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:49:54] [INFO ] Deduced a trap composed of 79 places in 77 ms of which 2 ms to minimize.
[2025-05-31 22:49:54] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2025-05-31 22:49:55] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1551 ms
[2025-05-31 22:49:55] [INFO ] Added : 361 causal constraints over 73 iterations in 19144 ms. Result :sat
Minimization took 4247 ms.
[2025-05-31 22:49:59] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2025-05-31 22:50:01] [INFO ] [Real]Added 75 Read/Feed constraints in 1340 ms returned sat
[2025-05-31 22:50:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:50:01] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2025-05-31 22:50:04] [INFO ] [Nat]Added 75 Read/Feed constraints in 2705 ms returned sat
[2025-05-31 22:50:04] [INFO ] Computed and/alt/rep : 409/2363/409 causal constraints (skipped 62 transitions) in 38 ms.
[2025-05-31 22:50:07] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 3 ms to minimize.
[2025-05-31 22:50:07] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 3 ms to minimize.
[2025-05-31 22:50:07] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2025-05-31 22:50:07] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2025-05-31 22:50:07] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2025-05-31 22:50:08] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 2 ms to minimize.
[2025-05-31 22:50:08] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 2 ms to minimize.
[2025-05-31 22:50:08] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 1 ms to minimize.
[2025-05-31 22:50:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1453 ms
[2025-05-31 22:50:08] [INFO ] Added : 194 causal constraints over 40 iterations in 4599 ms. Result :sat
Minimization took 2633 ms.
[2025-05-31 22:50:11] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2025-05-31 22:50:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:50:11] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2025-05-31 22:50:12] [INFO ] [Nat]Added 75 Read/Feed constraints in 692 ms returned sat
[2025-05-31 22:50:12] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 3 ms to minimize.
[2025-05-31 22:50:12] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 2 ms to minimize.
[2025-05-31 22:50:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 336 ms
[2025-05-31 22:50:13] [INFO ] Computed and/alt/rep : 409/2363/409 causal constraints (skipped 62 transitions) in 26 ms.
[2025-05-31 22:50:14] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 2 ms to minimize.
[2025-05-31 22:50:14] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 2 ms to minimize.
[2025-05-31 22:50:14] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 2 ms to minimize.
[2025-05-31 22:50:15] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 3 ms to minimize.
[2025-05-31 22:50:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 730 ms
[2025-05-31 22:50:15] [INFO ] Added : 121 causal constraints over 25 iterations in 2176 ms. Result :sat
Minimization took 749 ms.
[2025-05-31 22:50:16] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2025-05-31 22:50:16] [INFO ] [Real]Added 75 Read/Feed constraints in 147 ms returned sat
[2025-05-31 22:50:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:50:16] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2025-05-31 22:50:16] [INFO ] [Nat]Added 75 Read/Feed constraints in 220 ms returned sat
[2025-05-31 22:50:16] [INFO ] Computed and/alt/rep : 409/2363/409 causal constraints (skipped 62 transitions) in 28 ms.
[2025-05-31 22:50:18] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 2 ms to minimize.
[2025-05-31 22:50:18] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 2 ms to minimize.
[2025-05-31 22:50:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2025-05-31 22:50:18] [INFO ] Added : 102 causal constraints over 21 iterations in 1905 ms. Result :sat
Minimization took 822 ms.
[2025-05-31 22:50:20] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2025-05-31 22:50:20] [INFO ] [Real]Added 75 Read/Feed constraints in 671 ms returned sat
[2025-05-31 22:50:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:50:21] [INFO ] [Nat]Absence check using state equation in 487 ms returned sat
[2025-05-31 22:50:22] [INFO ] [Nat]Added 75 Read/Feed constraints in 754 ms returned sat
[2025-05-31 22:50:22] [INFO ] Computed and/alt/rep : 409/2363/409 causal constraints (skipped 62 transitions) in 28 ms.
[2025-05-31 22:50:23] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
[2025-05-31 22:50:23] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2025-05-31 22:50:23] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 3 ms to minimize.
[2025-05-31 22:50:24] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2025-05-31 22:50:24] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2025-05-31 22:50:24] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2025-05-31 22:50:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1078 ms
[2025-05-31 22:50:24] [INFO ] Added : 149 causal constraints over 30 iterations in 2556 ms. Result :sat
Minimization took 1561 ms.
[2025-05-31 22:50:26] [INFO ] [Real]Absence check using state equation in 586 ms returned unsat
[2025-05-31 22:50:27] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2025-05-31 22:50:28] [INFO ] [Real]Added 75 Read/Feed constraints in 607 ms returned sat
[2025-05-31 22:50:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:50:28] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2025-05-31 22:50:30] [INFO ] [Nat]Added 75 Read/Feed constraints in 1674 ms returned sat
[2025-05-31 22:50:30] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 2 ms to minimize.
[2025-05-31 22:50:30] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2025-05-31 22:50:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 328 ms
[2025-05-31 22:50:30] [INFO ] Computed and/alt/rep : 409/2363/409 causal constraints (skipped 62 transitions) in 26 ms.
[2025-05-31 22:50:35] [INFO ] Added : 216 causal constraints over 44 iterations in 4742 ms. Result :sat
Minimization took 2438 ms.
[2025-05-31 22:50:38] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2025-05-31 22:50:39] [INFO ] [Real]Added 75 Read/Feed constraints in 835 ms returned sat
[2025-05-31 22:50:39] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 3 ms to minimize.
[2025-05-31 22:50:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:50:40] [INFO ] [Nat]Absence check using state equation in 861 ms returned sat
[2025-05-31 22:50:42] [INFO ] [Nat]Added 75 Read/Feed constraints in 1329 ms returned sat
[2025-05-31 22:50:42] [INFO ] Computed and/alt/rep : 409/2363/409 causal constraints (skipped 62 transitions) in 26 ms.
[2025-05-31 22:50:46] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 2 ms to minimize.
[2025-05-31 22:50:46] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
[2025-05-31 22:50:46] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2025-05-31 22:50:47] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
[2025-05-31 22:50:47] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2025-05-31 22:50:47] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2025-05-31 22:50:47] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 2 ms to minimize.
[2025-05-31 22:50:48] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2025-05-31 22:50:48] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2025-05-31 22:50:48] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
[2025-05-31 22:50:48] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2025-05-31 22:50:48] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 1 ms to minimize.
[2025-05-31 22:50:49] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2025-05-31 22:50:49] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:50:49] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 2 ms to minimize.
[2025-05-31 22:50:49] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3141 ms
[2025-05-31 22:50:49] [INFO ] Added : 209 causal constraints over 42 iterations in 7296 ms. Result :sat
Minimization took 2356 ms.
[2025-05-31 22:50:52] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2025-05-31 22:50:52] [INFO ] [Real]Added 75 Read/Feed constraints in 851 ms returned sat
[2025-05-31 22:50:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:50:53] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2025-05-31 22:50:55] [INFO ] [Nat]Added 75 Read/Feed constraints in 1903 ms returned sat
[2025-05-31 22:50:55] [INFO ] Computed and/alt/rep : 409/2363/409 causal constraints (skipped 62 transitions) in 32 ms.
[2025-05-31 22:51:01] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 4 ms to minimize.
[2025-05-31 22:51:01] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 2 ms to minimize.
[2025-05-31 22:51:02] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2025-05-31 22:51:02] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2025-05-31 22:51:02] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 2 ms to minimize.
[2025-05-31 22:51:02] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2025-05-31 22:51:02] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
[2025-05-31 22:51:02] [INFO ] Deduced a trap composed of 60 places in 138 ms of which 2 ms to minimize.
[2025-05-31 22:51:03] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 2 ms to minimize.
[2025-05-31 22:51:03] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 2 ms to minimize.
[2025-05-31 22:51:03] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
[2025-05-31 22:51:03] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2156 ms
[2025-05-31 22:51:03] [INFO ] Added : 258 causal constraints over 53 iterations in 8785 ms. Result :sat
Minimization took 3749 ms.
[2025-05-31 22:51:07] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2025-05-31 22:51:08] [INFO ] [Real]Added 75 Read/Feed constraints in 795 ms returned sat
[2025-05-31 22:51:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:51:09] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2025-05-31 22:51:10] [INFO ] [Nat]Added 75 Read/Feed constraints in 1006 ms returned sat
[2025-05-31 22:51:10] [INFO ] Computed and/alt/rep : 409/2363/409 causal constraints (skipped 62 transitions) in 30 ms.
[2025-05-31 22:51:13] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 2 ms to minimize.
[2025-05-31 22:51:13] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 2 ms to minimize.
[2025-05-31 22:51:14] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2025-05-31 22:51:14] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 3 ms to minimize.
[2025-05-31 22:51:14] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 3 ms to minimize.
[2025-05-31 22:51:14] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 3 ms to minimize.
[2025-05-31 22:51:14] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 3 ms to minimize.
[2025-05-31 22:51:15] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 2 ms to minimize.
[2025-05-31 22:51:15] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 3 ms to minimize.
[2025-05-31 22:51:15] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 3 ms to minimize.
[2025-05-31 22:51:15] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 2 ms to minimize.
[2025-05-31 22:51:15] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 2 ms to minimize.
[2025-05-31 22:51:15] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 2 ms to minimize.
[2025-05-31 22:51:16] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2551 ms
[2025-05-31 22:51:16] [INFO ] Added : 181 causal constraints over 38 iterations in 6056 ms. Result :sat
Minimization took 1304 ms.
[2025-05-31 22:51:17] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2025-05-31 22:51:18] [INFO ] [Real]Added 75 Read/Feed constraints in 1033 ms returned sat
[2025-05-31 22:51:18] [INFO ] Computed and/alt/rep : 409/2363/409 causal constraints (skipped 62 transitions) in 27 ms.
[2025-05-31 22:51:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:51:19] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2025-05-31 22:51:20] [INFO ] [Nat]Added 75 Read/Feed constraints in 811 ms returned sat
[2025-05-31 22:51:20] [INFO ] Computed and/alt/rep : 409/2363/409 causal constraints (skipped 62 transitions) in 27 ms.
[2025-05-31 22:51:23] [INFO ] Added : 186 causal constraints over 38 iterations in 3576 ms. Result :sat
Minimization took 829 ms.
[2025-05-31 22:51:25] [INFO ] [Real]Absence check using state equation in 858 ms returned sat
[2025-05-31 22:51:26] [INFO ] [Real]Added 75 Read/Feed constraints in 1236 ms returned sat
[2025-05-31 22:51:26] [INFO ] Computed and/alt/rep : 409/2363/409 causal constraints (skipped 62 transitions) in 27 ms.
[2025-05-31 22:51:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:51:28] [INFO ] [Nat]Absence check using state equation in 979 ms returned sat
[2025-05-31 22:51:30] [INFO ] [Nat]Added 75 Read/Feed constraints in 1637 ms returned sat
[2025-05-31 22:51:30] [INFO ] Computed and/alt/rep : 409/2363/409 causal constraints (skipped 62 transitions) in 27 ms.
[2025-05-31 22:51:34] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 3 ms to minimize.
[2025-05-31 22:51:34] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2025-05-31 22:51:34] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2025-05-31 22:51:34] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2025-05-31 22:51:34] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 2 ms to minimize.
[2025-05-31 22:51:34] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 1 ms to minimize.
[2025-05-31 22:51:35] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 3 ms to minimize.
[2025-05-31 22:51:35] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 2 ms to minimize.
[2025-05-31 22:51:35] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 2 ms to minimize.
[2025-05-31 22:51:35] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 3 ms to minimize.
[2025-05-31 22:51:36] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 2 ms to minimize.
[2025-05-31 22:51:36] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2025-05-31 22:51:36] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:51:36] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2025-05-31 22:51:36] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2813 ms
[2025-05-31 22:51:36] [INFO ] Added : 214 causal constraints over 44 iterations in 6635 ms. Result :sat
Minimization took 2921 ms.
[2025-05-31 22:51:40] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2025-05-31 22:51:40] [INFO ] [Real]Added 75 Read/Feed constraints in 363 ms returned sat
[2025-05-31 22:51:40] [INFO ] Computed and/alt/rep : 409/2363/409 causal constraints (skipped 62 transitions) in 27 ms.
[2025-05-31 22:51:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:51:41] [INFO ] [Nat]Absence check using state equation in 493 ms returned sat
[2025-05-31 22:51:41] [INFO ] [Nat]Added 75 Read/Feed constraints in 772 ms returned sat
[2025-05-31 22:51:42] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 3 ms to minimize.
[2025-05-31 22:51:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2025-05-31 22:51:42] [INFO ] Computed and/alt/rep : 409/2363/409 causal constraints (skipped 62 transitions) in 26 ms.
[2025-05-31 22:51:43] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 3 ms to minimize.
[2025-05-31 22:51:43] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 3 ms to minimize.
[2025-05-31 22:51:43] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 2 ms to minimize.
[2025-05-31 22:51:43] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 3 ms to minimize.
[2025-05-31 22:51:43] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 2 ms to minimize.
[2025-05-31 22:51:44] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 2 ms to minimize.
[2025-05-31 22:51:44] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 3 ms to minimize.
[2025-05-31 22:51:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1357 ms
[2025-05-31 22:51:44] [INFO ] Added : 97 causal constraints over 20 iterations in 2213 ms. Result :sat
Minimization took 685 ms.
[2025-05-31 22:51:45] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2025-05-31 22:51:45] [INFO ] [Real]Added 75 Read/Feed constraints in 197 ms returned sat
[2025-05-31 22:51:45] [INFO ] Computed and/alt/rep : 409/2363/409 causal constraints (skipped 62 transitions) in 29 ms.
[2025-05-31 22:51:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:51:46] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2025-05-31 22:51:47] [INFO ] [Nat]Added 75 Read/Feed constraints in 1068 ms returned sat
[2025-05-31 22:51:47] [INFO ] Computed and/alt/rep : 409/2363/409 causal constraints (skipped 62 transitions) in 27 ms.
[2025-05-31 22:51:48] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 2 ms to minimize.
[2025-05-31 22:51:48] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 3 ms to minimize.
[2025-05-31 22:51:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 427 ms
[2025-05-31 22:51:48] [INFO ] Added : 56 causal constraints over 13 iterations in 1210 ms. Result :sat
Minimization took 480 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, 1, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
FORMULA DoubleExponent-PT-020-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 14 out of 496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 472/472 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 496 transition count 472
Applied a total of 1 rules in 38 ms. Remains 496 /496 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 496/496 places, 472/472 transitions.
Found an invariant !
This invariant on transitions {31=1, 42=1, 45=1, 56=2, 140=1, 143=1, 214=1, 259=2, 302=1, 355=2, 423=1, 439=1, 470=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 42=1, 45=1, 140=1, 143=1, 214=1, 302=1, 423=1, 439=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1263 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 472 rows 496 cols
[2025-05-31 22:55:32] [INFO ] Invariants computation overflowed in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (128206 resets) in 889 ms. (1123 steps per ms)
BEST_FIRST walk for 14000004 steps (1185922 resets) in 8846 ms. (1582 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 472 rows 496 cols
[2025-05-31 22:55:42] [INFO ] Invariants computation overflowed in 50 ms
[2025-05-31 22:55:42] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2025-05-31 22:55:42] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 22:55:43] [INFO ] [Real]Added 75 Read/Feed constraints in 1013 ms returned sat
[2025-05-31 22:55:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:55:44] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2025-05-31 22:55:45] [INFO ] [Nat]Added 75 Read/Feed constraints in 1243 ms returned sat
[2025-05-31 22:55:45] [INFO ] Computed and/alt/rep : 409/2370/409 causal constraints (skipped 62 transitions) in 26 ms.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 2 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 3 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 2 ms to minimize.
[2025-05-31 22:55:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 943 ms
[2025-05-31 22:55:53] [INFO ] Added : 268 causal constraints over 54 iterations in 7374 ms. Result :sat
Minimization took 1759 ms.
[2025-05-31 22:55:55] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2025-05-31 22:55:56] [INFO ] [Real]Added 75 Read/Feed constraints in 1231 ms returned sat
[2025-05-31 22:55:56] [INFO ] Deduced a trap composed of 66 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:55:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:55:57] [INFO ] [Nat]Absence check using state equation in 737 ms returned sat
[2025-05-31 22:55:58] [INFO ] [Nat]Added 75 Read/Feed constraints in 1233 ms returned sat
[2025-05-31 22:55:59] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2025-05-31 22:55:59] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 1 ms to minimize.
[2025-05-31 22:55:59] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 0 ms to minimize.
[2025-05-31 22:55:59] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 0 ms to minimize.
[2025-05-31 22:55:59] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2025-05-31 22:55:59] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2025-05-31 22:55:59] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:55:59] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:55:59] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:55:59] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2025-05-31 22:56:00] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2025-05-31 22:56:00] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:56:00] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:56:00] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:56:00] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:56:00] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:56:00] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:56:00] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2025-05-31 22:56:00] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2025-05-31 22:56:01] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2025-05-31 22:56:01] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2025-05-31 22:56:01] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2025-05-31 22:56:01] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2025-05-31 22:56:01] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2025-05-31 22:56:01] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2025-05-31 22:56:01] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2025-05-31 22:56:01] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2025-05-31 22:56:02] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 2 ms to minimize.
[2025-05-31 22:56:02] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2025-05-31 22:56:02] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2025-05-31 22:56:02] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2025-05-31 22:56:02] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2025-05-31 22:56:02] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2025-05-31 22:56:03] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:56:03] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2025-05-31 22:56:04] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2025-05-31 22:56:04] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2025-05-31 22:56:05] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2025-05-31 22:56:05] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 2 ms to minimize.
[2025-05-31 22:56:05] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2025-05-31 22:56:05] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 6412 ms
[2025-05-31 22:56:05] [INFO ] Computed and/alt/rep : 409/2370/409 causal constraints (skipped 62 transitions) in 28 ms.
[2025-05-31 22:56:22] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 2 ms to minimize.
[2025-05-31 22:56:22] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2025-05-31 22:56:22] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2025-05-31 22:56:22] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2025-05-31 22:56:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 638 ms
[2025-05-31 22:56:23] [INFO ] Added : 366 causal constraints over 74 iterations in 17702 ms. Result :sat
Minimization took 4279 ms.
[2025-05-31 22:56:27] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2025-05-31 22:56:28] [INFO ] [Real]Added 75 Read/Feed constraints in 733 ms returned sat
[2025-05-31 22:56:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:56:28] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2025-05-31 22:56:31] [INFO ] [Nat]Added 75 Read/Feed constraints in 3042 ms returned sat
[2025-05-31 22:56:31] [INFO ] Computed and/alt/rep : 409/2370/409 causal constraints (skipped 62 transitions) in 31 ms.
[2025-05-31 22:56:39] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 3 ms to minimize.
[2025-05-31 22:56:39] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
[2025-05-31 22:56:39] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2025-05-31 22:56:39] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 3 ms to minimize.
[2025-05-31 22:56:39] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 3 ms to minimize.
[2025-05-31 22:56:39] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2025-05-31 22:56:40] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2025-05-31 22:56:40] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 4 ms to minimize.
[2025-05-31 22:56:40] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2025-05-31 22:56:40] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1529 ms
[2025-05-31 22:56:40] [INFO ] Added : 310 causal constraints over 62 iterations in 8866 ms. Result :sat
Minimization took 4491 ms.
[2025-05-31 22:56:45] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2025-05-31 22:56:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:56:45] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2025-05-31 22:56:46] [INFO ] [Nat]Added 75 Read/Feed constraints in 985 ms returned sat
[2025-05-31 22:56:46] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 3 ms to minimize.
[2025-05-31 22:56:46] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 3 ms to minimize.
[2025-05-31 22:56:47] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 2 ms to minimize.
[2025-05-31 22:56:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 499 ms
[2025-05-31 22:56:47] [INFO ] Computed and/alt/rep : 409/2370/409 causal constraints (skipped 62 transitions) in 29 ms.
[2025-05-31 22:56:48] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 3 ms to minimize.
[2025-05-31 22:56:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2025-05-31 22:56:48] [INFO ] Added : 106 causal constraints over 22 iterations in 1250 ms. Result :sat
Minimization took 577 ms.
[2025-05-31 22:56:49] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2025-05-31 22:56:49] [INFO ] [Real]Added 75 Read/Feed constraints in 217 ms returned sat
[2025-05-31 22:56:49] [INFO ] Computed and/alt/rep : 409/2370/409 causal constraints (skipped 62 transitions) in 30 ms.
[2025-05-31 22:56:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:56:49] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2025-05-31 22:56:50] [INFO ] [Nat]Added 75 Read/Feed constraints in 351 ms returned sat
[2025-05-31 22:56:50] [INFO ] Computed and/alt/rep : 409/2370/409 causal constraints (skipped 62 transitions) in 31 ms.
[2025-05-31 22:56:51] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2025-05-31 22:56:52] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 3 ms to minimize.
[2025-05-31 22:56:52] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2025-05-31 22:56:52] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2025-05-31 22:56:52] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2025-05-31 22:56:52] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 2 ms to minimize.
[2025-05-31 22:56:53] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 3 ms to minimize.
[2025-05-31 22:56:53] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 3 ms to minimize.
[2025-05-31 22:56:53] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2025-05-31 22:56:53] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 3 ms to minimize.
[2025-05-31 22:56:53] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2025-05-31 22:56:53] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2147 ms
[2025-05-31 22:56:54] [INFO ] Added : 129 causal constraints over 28 iterations in 3869 ms. Result :sat
Minimization took 761 ms.
[2025-05-31 22:56:55] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2025-05-31 22:56:55] [INFO ] [Real]Added 75 Read/Feed constraints in 544 ms returned sat
[2025-05-31 22:56:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:56:56] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2025-05-31 22:56:57] [INFO ] [Nat]Added 75 Read/Feed constraints in 1052 ms returned sat
[2025-05-31 22:56:57] [INFO ] Computed and/alt/rep : 409/2370/409 causal constraints (skipped 62 transitions) in 28 ms.
[2025-05-31 22:57:01] [INFO ] Added : 244 causal constraints over 50 iterations in 4690 ms. Result :sat
Minimization took 1618 ms.
[2025-05-31 22:57:04] [INFO ] [Real]Absence check using state equation in 928 ms returned sat
[2025-05-31 22:57:05] [INFO ] [Real]Added 75 Read/Feed constraints in 619 ms returned sat
[2025-05-31 22:57:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:57:05] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2025-05-31 22:57:06] [INFO ] [Nat]Added 75 Read/Feed constraints in 1062 ms returned sat
[2025-05-31 22:57:06] [INFO ] Computed and/alt/rep : 409/2370/409 causal constraints (skipped 62 transitions) in 23 ms.
[2025-05-31 22:57:13] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2025-05-31 22:57:13] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 2 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
[2025-05-31 22:57:14] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2025-05-31 22:57:15] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2025-05-31 22:57:15] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2025-05-31 22:57:15] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2025-05-31 22:57:15] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 1 ms to minimize.
[2025-05-31 22:57:15] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
[2025-05-31 22:57:15] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2025-05-31 22:57:16] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2025-05-31 22:57:16] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2025-05-31 22:57:16] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2025-05-31 22:57:16] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2025-05-31 22:57:16] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 3 ms to minimize.
[2025-05-31 22:57:16] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:57:17] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:57:17] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 2 ms to minimize.
[2025-05-31 22:57:17] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2025-05-31 22:57:17] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:57:18] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:57:18] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 1 ms to minimize.
[2025-05-31 22:57:18] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2025-05-31 22:57:18] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2025-05-31 22:57:19] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 5504 ms
[2025-05-31 22:57:19] [INFO ] Added : 233 causal constraints over 49 iterations in 12323 ms. Result :sat
Minimization took 4502 ms.
[2025-05-31 22:57:24] [INFO ] [Real]Absence check using state equation in 847 ms returned sat
[2025-05-31 22:57:25] [INFO ] [Real]Added 75 Read/Feed constraints in 1067 ms returned sat
[2025-05-31 22:57:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:57:26] [INFO ] [Nat]Absence check using state equation in 887 ms returned sat
[2025-05-31 22:57:28] [INFO ] [Nat]Added 75 Read/Feed constraints in 2112 ms returned sat
[2025-05-31 22:57:28] [INFO ] Computed and/alt/rep : 409/2370/409 causal constraints (skipped 62 transitions) in 30 ms.
[2025-05-31 22:57:36] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 2 ms to minimize.
[2025-05-31 22:57:37] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2025-05-31 22:57:37] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2025-05-31 22:57:37] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2025-05-31 22:57:37] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2025-05-31 22:57:37] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2025-05-31 22:57:37] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2025-05-31 22:57:37] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2025-05-31 22:57:38] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:57:38] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1421 ms
[2025-05-31 22:57:38] [INFO ] Added : 286 causal constraints over 58 iterations in 9368 ms. Result :sat
Minimization took 2862 ms.
[2025-05-31 22:57:41] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2025-05-31 22:57:42] [INFO ] [Real]Added 75 Read/Feed constraints in 709 ms returned sat
[2025-05-31 22:57:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:57:42] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2025-05-31 22:57:43] [INFO ] [Nat]Added 75 Read/Feed constraints in 1167 ms returned sat
[2025-05-31 22:57:43] [INFO ] Computed and/alt/rep : 409/2370/409 causal constraints (skipped 62 transitions) in 28 ms.
[2025-05-31 22:57:54] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2025-05-31 22:57:54] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2025-05-31 22:57:54] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2025-05-31 22:57:54] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
[2025-05-31 22:57:54] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:57:54] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 2 ms to minimize.
[2025-05-31 22:57:55] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:57:55] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:57:55] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:57:55] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 0 ms to minimize.
[2025-05-31 22:57:55] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:57:55] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:57:55] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:57:55] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1870 ms
[2025-05-31 22:57:55] [INFO ] Added : 352 causal constraints over 71 iterations in 12421 ms. Result :sat
Minimization took 4501 ms.
[2025-05-31 22:58:00] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2025-05-31 22:58:01] [INFO ] [Real]Added 75 Read/Feed constraints in 373 ms returned sat
[2025-05-31 22:58:01] [INFO ] Computed and/alt/rep : 409/2370/409 causal constraints (skipped 62 transitions) in 31 ms.
[2025-05-31 22:58:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:58:01] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2025-05-31 22:58:02] [INFO ] [Nat]Added 75 Read/Feed constraints in 917 ms returned sat
[2025-05-31 22:58:02] [INFO ] Computed and/alt/rep : 409/2370/409 causal constraints (skipped 62 transitions) in 26 ms.
[2025-05-31 22:58:08] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 3 ms to minimize.
[2025-05-31 22:58:08] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 3 ms to minimize.
[2025-05-31 22:58:09] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 2 ms to minimize.
[2025-05-31 22:58:09] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 3 ms to minimize.
[2025-05-31 22:58:09] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
[2025-05-31 22:58:09] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2025-05-31 22:58:09] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2025-05-31 22:58:09] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2025-05-31 22:58:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1356 ms
[2025-05-31 22:58:10] [INFO ] Added : 274 causal constraints over 56 iterations in 7500 ms. Result :sat
Minimization took 2760 ms.
[2025-05-31 22:58:13] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2025-05-31 22:58:14] [INFO ] [Real]Added 75 Read/Feed constraints in 806 ms returned sat
[2025-05-31 22:58:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:58:14] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2025-05-31 22:58:15] [INFO ] [Nat]Added 75 Read/Feed constraints in 1147 ms returned sat
[2025-05-31 22:58:16] [INFO ] Computed and/alt/rep : 409/2370/409 causal constraints (skipped 62 transitions) in 28 ms.
[2025-05-31 22:58:18] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
[2025-05-31 22:58:19] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 2 ms to minimize.
[2025-05-31 22:58:19] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 3 ms to minimize.
[2025-05-31 22:58:19] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2025-05-31 22:58:19] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 3 ms to minimize.
[2025-05-31 22:58:19] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 3 ms to minimize.
[2025-05-31 22:58:19] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
[2025-05-31 22:58:20] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2025-05-31 22:58:20] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 2 ms to minimize.
[2025-05-31 22:58:20] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2025-05-31 22:58:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1711 ms
[2025-05-31 22:58:20] [INFO ] Added : 192 causal constraints over 39 iterations in 4551 ms. Result :sat
Minimization took 1912 ms.
[2025-05-31 22:58:22] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2025-05-31 22:58:24] [INFO ] [Real]Added 75 Read/Feed constraints in 1421 ms returned sat
[2025-05-31 22:58:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:58:24] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2025-05-31 22:58:26] [INFO ] [Nat]Added 75 Read/Feed constraints in 1961 ms returned sat
[2025-05-31 22:58:26] [INFO ] Computed and/alt/rep : 409/2370/409 causal constraints (skipped 62 transitions) in 27 ms.
[2025-05-31 22:58:36] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2025-05-31 22:58:36] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2025-05-31 22:58:36] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2025-05-31 22:58:36] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2025-05-31 22:58:36] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 2 ms to minimize.
[2025-05-31 22:58:37] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2025-05-31 22:58:37] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 3 ms to minimize.
[2025-05-31 22:58:37] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2025-05-31 22:58:37] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 2 ms to minimize.
[2025-05-31 22:58:37] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
[2025-05-31 22:58:37] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2025-05-31 22:58:38] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2025-05-31 22:58:38] [INFO ] Deduced a trap composed of 118 places in 111 ms of which 2 ms to minimize.
[2025-05-31 22:58:38] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 3 ms to minimize.
[2025-05-31 22:58:38] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 2 ms to minimize.
[2025-05-31 22:58:38] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 2 ms to minimize.
[2025-05-31 22:58:39] [INFO ] Deduced a trap composed of 129 places in 107 ms of which 2 ms to minimize.
[2025-05-31 22:58:39] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
[2025-05-31 22:58:39] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3180 ms
[2025-05-31 22:58:39] [INFO ] Added : 334 causal constraints over 67 iterations in 12812 ms. Result :sat
Minimization took 3094 ms.
[2025-05-31 22:58:42] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2025-05-31 22:58:43] [INFO ] [Real]Added 75 Read/Feed constraints in 312 ms returned sat
[2025-05-31 22:58:43] [INFO ] Computed and/alt/rep : 409/2370/409 causal constraints (skipped 62 transitions) in 30 ms.
[2025-05-31 22:58:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:58:43] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2025-05-31 22:58:44] [INFO ] [Nat]Added 75 Read/Feed constraints in 985 ms returned sat
[2025-05-31 22:58:44] [INFO ] Computed and/alt/rep : 409/2370/409 causal constraints (skipped 62 transitions) in 26 ms.
[2025-05-31 22:58:46] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 3 ms to minimize.
[2025-05-31 22:58:46] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 2 ms to minimize.
[2025-05-31 22:58:46] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 3 ms to minimize.
[2025-05-31 22:58:46] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 3 ms to minimize.
[2025-05-31 22:58:46] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 2 ms to minimize.
[2025-05-31 22:58:47] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2025-05-31 22:58:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1056 ms
[2025-05-31 22:58:47] [INFO ] Added : 105 causal constraints over 23 iterations in 2513 ms. Result :sat
Minimization took 1006 ms.
[2025-05-31 22:58:49] [INFO ] [Real]Absence check using state equation in 1491 ms returned sat
[2025-05-31 22:58:50] [INFO ] [Real]Added 75 Read/Feed constraints in 427 ms returned sat
[2025-05-31 22:58:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:58:50] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2025-05-31 22:58:51] [INFO ] [Nat]Added 75 Read/Feed constraints in 159 ms returned sat
[2025-05-31 22:58:51] [INFO ] Computed and/alt/rep : 409/2370/409 causal constraints (skipped 62 transitions) in 30 ms.
[2025-05-31 22:58:51] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 2 ms to minimize.
[2025-05-31 22:58:51] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 3 ms to minimize.
[2025-05-31 22:58:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 359 ms
[2025-05-31 22:58:51] [INFO ] Added : 59 causal constraints over 13 iterations in 857 ms. Result :sat
Minimization took 524 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 14 out of 496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 472/472 transitions.
Applied a total of 0 rules in 17 ms. Remains 496 /496 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 496/496 places, 472/472 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 472/472 transitions.
Applied a total of 0 rules in 14 ms. Remains 496 /496 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 496 cols
[2025-05-31 23:01:57] [INFO ] Invariants computation overflowed in 37 ms
[2025-05-31 23:01:58] [INFO ] Implicit Places using invariants in 449 ms returned []
// Phase 1: matrix 472 rows 496 cols
[2025-05-31 23:01:58] [INFO ] Invariants computation overflowed in 36 ms
[2025-05-31 23:01:58] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 23:02:07] [INFO ] Implicit Places using invariants and state equation in 9626 ms returned [14, 20, 26, 49, 77, 82, 104, 109, 160, 165, 166, 186, 192, 213, 219, 226, 240, 245, 268, 274, 297, 302, 322, 328, 351, 356, 377, 383, 408, 412, 432, 439, 461, 466, 470, 488, 494]
[2025-05-31 23:02:07] [INFO ] Actually due to overlaps returned [166, 226, 82, 77, 160, 165]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 10105 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 490/496 places, 472/472 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 490 transition count 469
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 487 transition count 469
Applied a total of 6 rules in 29 ms. Remains 487 /490 variables (removed 3) and now considering 469/472 (removed 3) transitions.
// Phase 1: matrix 469 rows 487 cols
[2025-05-31 23:02:07] [INFO ] Invariants computation overflowed in 40 ms
[2025-05-31 23:02:08] [INFO ] Implicit Places using invariants in 345 ms returned []
// Phase 1: matrix 469 rows 487 cols
[2025-05-31 23:02:08] [INFO ] Invariants computation overflowed in 65 ms
[2025-05-31 23:02:08] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 23:02:22] [INFO ] Implicit Places using invariants and state equation in 14766 ms returned [14, 20, 26, 49, 101, 106, 179, 185, 206, 212, 231, 236, 259, 265, 288, 293, 313, 319, 342, 347, 368, 374, 399, 403, 423, 430, 452, 457, 461, 479, 485]
[2025-05-31 23:02:22] [INFO ] Actually due to overlaps returned [185, 461, 101, 179, 399, 106]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 15117 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 481/496 places, 469/472 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 481 transition count 466
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 478 transition count 466
Applied a total of 6 rules in 24 ms. Remains 478 /481 variables (removed 3) and now considering 466/469 (removed 3) transitions.
// Phase 1: matrix 466 rows 478 cols
[2025-05-31 23:02:22] [INFO ] Invariants computation overflowed in 37 ms
[2025-05-31 23:02:23] [INFO ] Implicit Places using invariants in 336 ms returned []
// Phase 1: matrix 466 rows 478 cols
[2025-05-31 23:02:23] [INFO ] Invariants computation overflowed in 34 ms
[2025-05-31 23:02:23] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 23:02:30] [INFO ] Implicit Places using invariants and state equation in 7035 ms returned [14, 20, 26, 49, 200, 206, 225, 230, 253, 259, 282, 287, 307, 313, 336, 341, 362, 368, 396, 416, 423, 445, 450, 470, 476]
[2025-05-31 23:02:30] [INFO ] Actually due to overlaps returned [206, 49, 200]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 7378 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 475/496 places, 466/472 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 475 transition count 465
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 474 transition count 465
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 474 transition count 465
Applied a total of 3 rules in 34 ms. Remains 474 /475 variables (removed 1) and now considering 465/466 (removed 1) transitions.
// Phase 1: matrix 465 rows 474 cols
[2025-05-31 23:02:30] [INFO ] Invariants computation overflowed in 51 ms
[2025-05-31 23:02:30] [INFO ] Implicit Places using invariants in 325 ms returned []
// Phase 1: matrix 465 rows 474 cols
[2025-05-31 23:02:30] [INFO ] Invariants computation overflowed in 46 ms
[2025-05-31 23:02:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 23:02:37] [INFO ] Implicit Places using invariants and state equation in 6884 ms returned [14, 20, 26, 221, 226, 249, 255, 278, 283, 303, 309, 332, 337, 358, 364, 392, 412, 419, 441, 446, 466, 472]
[2025-05-31 23:02:37] [INFO ] Actually due to overlaps returned [226, 221]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7217 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 472/496 places, 465/472 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 472 transition count 464
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 471 transition count 464
Applied a total of 2 rules in 28 ms. Remains 471 /472 variables (removed 1) and now considering 464/465 (removed 1) transitions.
// Phase 1: matrix 464 rows 471 cols
[2025-05-31 23:02:37] [INFO ] Invariants computation overflowed in 32 ms
[2025-05-31 23:02:37] [INFO ] Implicit Places using invariants in 365 ms returned []
// Phase 1: matrix 464 rows 471 cols
[2025-05-31 23:02:37] [INFO ] Invariants computation overflowed in 23 ms
[2025-05-31 23:02:38] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 23:03:02] [INFO ] Implicit Places using invariants and state equation in 24628 ms returned [14, 20, 26, 246, 252, 275, 280, 300, 306, 329, 334, 355, 361, 389, 409, 416, 438, 443, 463, 469]
[2025-05-31 23:03:02] [INFO ] Actually due to overlaps returned [252, 246]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 25004 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 469/496 places, 464/472 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 469 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 468 transition count 463
Applied a total of 2 rules in 30 ms. Remains 468 /469 variables (removed 1) and now considering 463/464 (removed 1) transitions.
// Phase 1: matrix 463 rows 468 cols
[2025-05-31 23:03:02] [INFO ] Invariants computation overflowed in 31 ms
[2025-05-31 23:03:02] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 463 rows 468 cols
[2025-05-31 23:03:02] [INFO ] Invariants computation overflowed in 31 ms
[2025-05-31 23:03:03] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 23:03:10] [INFO ] Implicit Places using invariants and state equation in 8006 ms returned [14, 20, 26, 272, 277, 297, 303, 326, 331, 352, 358, 386, 406, 413, 435, 440, 460, 466]
[2025-05-31 23:03:10] [INFO ] Actually due to overlaps returned [277, 272]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8309 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 466/496 places, 463/472 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 466 transition count 462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 465 transition count 462
Applied a total of 2 rules in 22 ms. Remains 465 /466 variables (removed 1) and now considering 462/463 (removed 1) transitions.
// Phase 1: matrix 462 rows 465 cols
[2025-05-31 23:03:10] [INFO ] Invariants computation overflowed in 26 ms
[2025-05-31 23:03:11] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 462 rows 465 cols
[2025-05-31 23:03:11] [INFO ] Invariants computation overflowed in 31 ms
[2025-05-31 23:03:11] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 23:03:20] [INFO ] Implicit Places using invariants and state equation in 9345 ms returned [14, 20, 26, 294, 300, 323, 328, 349, 355, 383, 403, 410, 432, 437, 457, 463]
[2025-05-31 23:03:20] [INFO ] Actually due to overlaps returned [300, 294]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9638 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 463/496 places, 462/472 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 463 transition count 462
Applied a total of 1 rules in 21 ms. Remains 463 /463 variables (removed 0) and now considering 462/462 (removed 0) transitions.
// Phase 1: matrix 462 rows 463 cols
[2025-05-31 23:03:20] [INFO ] Invariants computation overflowed in 30 ms
[2025-05-31 23:03:20] [INFO ] Implicit Places using invariants in 278 ms returned []
// Phase 1: matrix 462 rows 463 cols
[2025-05-31 23:03:20] [INFO ] Invariants computation overflowed in 25 ms
[2025-05-31 23:03:21] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 23:03:32] [INFO ] Implicit Places using invariants and state equation in 12145 ms returned [14, 20, 26, 321, 326, 347, 353, 381, 401, 408, 430, 435, 455, 461]
[2025-05-31 23:03:32] [INFO ] Actually due to overlaps returned [326, 321]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12431 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 461/496 places, 462/472 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 461
Applied a total of 2 rules in 27 ms. Remains 460 /461 variables (removed 1) and now considering 461/462 (removed 1) transitions.
// Phase 1: matrix 461 rows 460 cols
[2025-05-31 23:03:33] [INFO ] Invariants computation overflowed in 32 ms
[2025-05-31 23:03:33] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 461 rows 460 cols
[2025-05-31 23:03:33] [INFO ] Invariants computation overflowed in 34 ms
[2025-05-31 23:03:33] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 23:03:38] [INFO ] Implicit Places using invariants and state equation in 5550 ms returned [14, 20, 26, 344, 350, 378, 398, 405, 427, 432, 452, 458]
[2025-05-31 23:03:38] [INFO ] Actually due to overlaps returned [350, 344]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5845 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 458/496 places, 461/472 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 460
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 460
Applied a total of 2 rules in 18 ms. Remains 457 /458 variables (removed 1) and now considering 460/461 (removed 1) transitions.
// Phase 1: matrix 460 rows 457 cols
[2025-05-31 23:03:38] [INFO ] Invariants computation overflowed in 33 ms
[2025-05-31 23:03:39] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 460 rows 457 cols
[2025-05-31 23:03:39] [INFO ] Invariants computation overflowed in 31 ms
[2025-05-31 23:03:39] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 23:03:52] [INFO ] Implicit Places using invariants and state equation in 13426 ms returned [14, 20, 26, 375, 395, 402, 424, 429, 449, 455]
[2025-05-31 23:03:52] [INFO ] Actually due to overlaps returned [375]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 13706 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 456/496 places, 460/472 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 456 transition count 460
Applied a total of 1 rules in 18 ms. Remains 456 /456 variables (removed 0) and now considering 460/460 (removed 0) transitions.
// Phase 1: matrix 460 rows 456 cols
[2025-05-31 23:03:52] [INFO ] Invariants computation overflowed in 28 ms
[2025-05-31 23:03:52] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 460 rows 456 cols
[2025-05-31 23:03:52] [INFO ] Invariants computation overflowed in 23 ms
[2025-05-31 23:03:53] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 23:04:01] [INFO ] Implicit Places using invariants and state equation in 8157 ms returned [14, 20, 26, 394, 401, 423, 428, 448, 454]
[2025-05-31 23:04:01] [INFO ] Actually due to overlaps returned [401, 394]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8425 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 454/496 places, 460/472 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 454 transition count 460
Applied a total of 1 rules in 21 ms. Remains 454 /454 variables (removed 0) and now considering 460/460 (removed 0) transitions.
// Phase 1: matrix 460 rows 454 cols
[2025-05-31 23:04:01] [INFO ] Invariants computation overflowed in 27 ms
[2025-05-31 23:04:01] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 460 rows 454 cols
[2025-05-31 23:04:01] [INFO ] Invariants computation overflowed in 26 ms
[2025-05-31 23:04:01] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 23:04:09] [INFO ] Implicit Places using invariants and state equation in 7733 ms returned [14, 20, 26, 421, 426, 446, 452]
[2025-05-31 23:04:09] [INFO ] Actually due to overlaps returned [426, 421]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8007 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 452/496 places, 460/472 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 459
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 459
Applied a total of 2 rules in 16 ms. Remains 451 /452 variables (removed 1) and now considering 459/460 (removed 1) transitions.
// Phase 1: matrix 459 rows 451 cols
[2025-05-31 23:04:09] [INFO ] Invariants computation overflowed in 34 ms
[2025-05-31 23:04:09] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 459 rows 451 cols
[2025-05-31 23:04:09] [INFO ] Invariants computation overflowed in 35 ms
[2025-05-31 23:04:09] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 23:04:14] [INFO ] Implicit Places using invariants and state equation in 5293 ms returned [14, 20, 26, 443, 449]
[2025-05-31 23:04:14] [INFO ] Actually due to overlaps returned [443, 449]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5574 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 449/496 places, 459/472 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 458
Applied a total of 2 rules in 22 ms. Remains 448 /449 variables (removed 1) and now considering 458/459 (removed 1) transitions.
// Phase 1: matrix 458 rows 448 cols
[2025-05-31 23:04:14] [INFO ] Invariants computation overflowed in 30 ms
[2025-05-31 23:04:14] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 458 rows 448 cols
[2025-05-31 23:04:14] [INFO ] Invariants computation overflowed in 25 ms
[2025-05-31 23:04:15] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 23:04:19] [INFO ] Implicit Places using invariants and state equation in 4845 ms returned [14, 20, 26]
[2025-05-31 23:04:19] [INFO ] Actually due to overlaps returned [14, 26]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5120 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 446/496 places, 458/472 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 445 transition count 457
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 445 transition count 457
Applied a total of 3 rules in 26 ms. Remains 445 /446 variables (removed 1) and now considering 457/458 (removed 1) transitions.
// Phase 1: matrix 457 rows 445 cols
[2025-05-31 23:04:19] [INFO ] Invariants computation overflowed in 34 ms
[2025-05-31 23:04:20] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 457 rows 445 cols
[2025-05-31 23:04:20] [INFO ] Invariants computation overflowed in 35 ms
[2025-05-31 23:04:20] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 23:04:31] [INFO ] Implicit Places using invariants and state equation in 11872 ms returned []
Implicit Place search using SMT with State Equation took 12126 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 445/496 places, 457/472 transitions.
Finished structural reductions in REACHABILITY mode , in 15 iterations and 154364 ms. Remains : 445/496 places, 457/472 transitions.
Found an invariant !
This invariant on transitions {28=1, 40=1, 50=1, 86=1, 119=1, 164=1, 211=1, 256=1, 306=1, 390=1, 404=1, 421=1, 427=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {28=1, 40=1, 119=1, 166=1, 254=1, 374=1, 390=1, 427=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 457 rows 445 cols
[2025-05-31 23:10:30] [INFO ] Invariants computation overflowed in 35 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (144334 resets) in 892 ms. (1119 steps per ms)
BEST_FIRST walk for 14000006 steps (1280434 resets) in 8524 ms. (1642 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 457 rows 445 cols
[2025-05-31 23:10:39] [INFO ] Invariants computation overflowed in 46 ms
[2025-05-31 23:10:39] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2025-05-31 23:10:39] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 23:10:40] [INFO ] [Real]Added 75 Read/Feed constraints in 555 ms returned sat
[2025-05-31 23:10:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:10:40] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2025-05-31 23:10:41] [INFO ] [Nat]Added 75 Read/Feed constraints in 1187 ms returned sat
[2025-05-31 23:10:42] [INFO ] Computed and/alt/rep : 389/2348/389 causal constraints (skipped 67 transitions) in 30 ms.
[2025-05-31 23:10:50] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 2 ms to minimize.
[2025-05-31 23:10:51] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 2 ms to minimize.
[2025-05-31 23:10:51] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2025-05-31 23:10:51] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 3 ms to minimize.
[2025-05-31 23:10:51] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 2 ms to minimize.
[2025-05-31 23:10:51] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 2 ms to minimize.
[2025-05-31 23:10:51] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 2 ms to minimize.
[2025-05-31 23:10:52] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2025-05-31 23:10:52] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2025-05-31 23:10:52] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 1 ms to minimize.
[2025-05-31 23:10:52] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 1 ms to minimize.
[2025-05-31 23:10:52] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2001 ms
[2025-05-31 23:10:52] [INFO ] Added : 268 causal constraints over 54 iterations in 10720 ms. Result :sat
Minimization took 2151 ms.
[2025-05-31 23:10:55] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2025-05-31 23:10:55] [INFO ] [Real]Added 75 Read/Feed constraints in 336 ms returned sat
[2025-05-31 23:10:55] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:10:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:10:56] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2025-05-31 23:10:57] [INFO ] [Nat]Added 75 Read/Feed constraints in 982 ms returned sat
[2025-05-31 23:10:57] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:10:57] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:10:57] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:10:57] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:10:57] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:10:57] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:10:57] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:10:57] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2025-05-31 23:10:58] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:10:58] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:10:58] [INFO ] Deduced a trap composed of 62 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:10:58] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:10:58] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:10:58] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:10:59] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:10:59] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 1 ms to minimize.
[2025-05-31 23:10:59] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 1 ms to minimize.
[2025-05-31 23:10:59] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 1 ms to minimize.
[2025-05-31 23:10:59] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:10:59] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 1 ms to minimize.
[2025-05-31 23:10:59] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 1 ms to minimize.
[2025-05-31 23:10:59] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 1 ms to minimize.
[2025-05-31 23:10:59] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 1 ms to minimize.
[2025-05-31 23:11:00] [INFO ] Deduced a trap composed of 80 places in 74 ms of which 2 ms to minimize.
[2025-05-31 23:11:00] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 1 ms to minimize.
[2025-05-31 23:11:00] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
[2025-05-31 23:11:00] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 1 ms to minimize.
[2025-05-31 23:11:00] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2025-05-31 23:11:00] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 1 ms to minimize.
[2025-05-31 23:11:00] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 1 ms to minimize.
[2025-05-31 23:11:00] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2025-05-31 23:11:01] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 1 ms to minimize.
[2025-05-31 23:11:01] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 1 ms to minimize.
[2025-05-31 23:11:01] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 1 ms to minimize.
[2025-05-31 23:11:01] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2025-05-31 23:11:01] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:11:02] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 1 ms to minimize.
[2025-05-31 23:11:02] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2025-05-31 23:11:02] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2025-05-31 23:11:02] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 1 ms to minimize.
[2025-05-31 23:11:03] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 1 ms to minimize.
[2025-05-31 23:11:03] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2025-05-31 23:11:03] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2025-05-31 23:11:03] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2025-05-31 23:11:03] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2025-05-31 23:11:04] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 2 ms to minimize.
[2025-05-31 23:11:04] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2025-05-31 23:11:04] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2025-05-31 23:11:04] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2025-05-31 23:11:04] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 1 ms to minimize.
[2025-05-31 23:11:04] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2025-05-31 23:11:04] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2025-05-31 23:11:05] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 2 ms to minimize.
[2025-05-31 23:11:05] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2025-05-31 23:11:05] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2025-05-31 23:11:05] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2025-05-31 23:11:05] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 8389 ms
[2025-05-31 23:11:05] [INFO ] Computed and/alt/rep : 389/2348/389 causal constraints (skipped 67 transitions) in 33 ms.
[2025-05-31 23:11:23] [INFO ] Added : 250 causal constraints over 50 iterations in 18430 ms. Result :sat
Minimization took 2702 ms.
[2025-05-31 23:11:27] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2025-05-31 23:11:27] [INFO ] [Real]Added 75 Read/Feed constraints in 440 ms returned sat
[2025-05-31 23:11:27] [INFO ] Computed and/alt/rep : 389/2348/389 causal constraints (skipped 67 transitions) in 26 ms.
[2025-05-31 23:11:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:11:28] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2025-05-31 23:11:29] [INFO ] [Nat]Added 75 Read/Feed constraints in 1787 ms returned sat
[2025-05-31 23:11:30] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 3 ms to minimize.
[2025-05-31 23:11:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2025-05-31 23:11:30] [INFO ] Computed and/alt/rep : 389/2348/389 causal constraints (skipped 67 transitions) in 25 ms.
[2025-05-31 23:11:45] [INFO ] Added : 300 causal constraints over 60 iterations in 15358 ms. Result :sat
Minimization took 1849 ms.
[2025-05-31 23:11:47] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2025-05-31 23:11:47] [INFO ] [Real]Added 75 Read/Feed constraints in 94 ms returned sat
[2025-05-31 23:11:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:11:47] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2025-05-31 23:11:48] [INFO ] [Nat]Added 75 Read/Feed constraints in 822 ms returned sat
[2025-05-31 23:11:48] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 2 ms to minimize.
[2025-05-31 23:11:48] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 2 ms to minimize.
[2025-05-31 23:11:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 308 ms
[2025-05-31 23:11:49] [INFO ] Computed and/alt/rep : 389/2348/389 causal constraints (skipped 67 transitions) in 30 ms.
[2025-05-31 23:11:54] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 2 ms to minimize.
[2025-05-31 23:11:55] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2025-05-31 23:11:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 381 ms
[2025-05-31 23:11:55] [INFO ] Added : 219 causal constraints over 45 iterations in 6266 ms. Result :sat
Minimization took 3066 ms.
[2025-05-31 23:11:58] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2025-05-31 23:11:58] [INFO ] [Real]Added 75 Read/Feed constraints in 276 ms returned sat
[2025-05-31 23:11:58] [INFO ] Computed and/alt/rep : 389/2348/389 causal constraints (skipped 67 transitions) in 26 ms.
[2025-05-31 23:11:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:11:59] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2025-05-31 23:11:59] [INFO ] [Nat]Added 75 Read/Feed constraints in 380 ms returned sat
[2025-05-31 23:11:59] [INFO ] Computed and/alt/rep : 389/2348/389 causal constraints (skipped 67 transitions) in 26 ms.
[2025-05-31 23:12:04] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 2 ms to minimize.
[2025-05-31 23:12:04] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 3 ms to minimize.
[2025-05-31 23:12:04] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
[2025-05-31 23:12:04] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 2 ms to minimize.
[2025-05-31 23:12:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 748 ms
[2025-05-31 23:12:04] [INFO ] Added : 178 causal constraints over 37 iterations in 5078 ms. Result :sat
Minimization took 1033 ms.
[2025-05-31 23:12:05] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2025-05-31 23:12:06] [INFO ] [Real]Added 75 Read/Feed constraints in 655 ms returned sat
[2025-05-31 23:12:06] [INFO ] Computed and/alt/rep : 389/2348/389 causal constraints (skipped 67 transitions) in 26 ms.
[2025-05-31 23:12:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:12:07] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2025-05-31 23:12:08] [INFO ] [Nat]Added 75 Read/Feed constraints in 766 ms returned sat
[2025-05-31 23:12:08] [INFO ] Computed and/alt/rep : 389/2348/389 causal constraints (skipped 67 transitions) in 24 ms.
[2025-05-31 23:12:09] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 2 ms to minimize.
[2025-05-31 23:12:09] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2025-05-31 23:12:09] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2025-05-31 23:12:10] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 2 ms to minimize.
[2025-05-31 23:12:10] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 1 ms to minimize.
[2025-05-31 23:12:10] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2025-05-31 23:12:10] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 2 ms to minimize.
[2025-05-31 23:12:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1145 ms
[2025-05-31 23:12:10] [INFO ] Added : 124 causal constraints over 25 iterations in 2638 ms. Result :sat
Minimization took 888 ms.
[2025-05-31 23:12:12] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2025-05-31 23:12:13] [INFO ] [Real]Added 75 Read/Feed constraints in 1076 ms returned sat
[2025-05-31 23:12:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:12:14] [INFO ] [Nat]Absence check using state equation in 776 ms returned sat
[2025-05-31 23:12:15] [INFO ] [Nat]Added 75 Read/Feed constraints in 1385 ms returned sat
[2025-05-31 23:12:15] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 1 ms to minimize.
[2025-05-31 23:12:16] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:12:16] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 2 ms to minimize.
[2025-05-31 23:12:16] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:12:16] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2025-05-31 23:12:16] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 2 ms to minimize.
[2025-05-31 23:12:16] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 2 ms to minimize.
[2025-05-31 23:12:16] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 71 places in 110 ms of which 2 ms to minimize.
[2025-05-31 23:12:17] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 1 ms to minimize.
[2025-05-31 23:12:18] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 2 ms to minimize.
[2025-05-31 23:12:18] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2025-05-31 23:12:18] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 1 ms to minimize.
[2025-05-31 23:12:18] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2025-05-31 23:12:18] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2025-05-31 23:12:18] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2025-05-31 23:12:18] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2025-05-31 23:12:19] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2025-05-31 23:12:19] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 2 ms to minimize.
[2025-05-31 23:12:19] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 1 ms to minimize.
[2025-05-31 23:12:19] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2025-05-31 23:12:20] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:12:20] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 2 ms to minimize.
[2025-05-31 23:12:21] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2025-05-31 23:12:21] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2025-05-31 23:12:21] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2025-05-31 23:12:21] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2025-05-31 23:12:21] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 2 ms to minimize.
[2025-05-31 23:12:22] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 2 ms to minimize.
[2025-05-31 23:12:22] [INFO ] Deduced a trap composed of 61 places in 121 ms of which 2 ms to minimize.
[2025-05-31 23:12:22] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2025-05-31 23:12:22] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2025-05-31 23:12:22] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 2 ms to minimize.
[2025-05-31 23:12:22] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 2 ms to minimize.
[2025-05-31 23:12:22] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2025-05-31 23:12:23] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 2 ms to minimize.
[2025-05-31 23:12:23] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2025-05-31 23:12:23] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 1 ms to minimize.
[2025-05-31 23:12:23] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 2 ms to minimize.
[2025-05-31 23:12:23] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 7755 ms
[2025-05-31 23:12:23] [INFO ] Computed and/alt/rep : 389/2348/389 causal constraints (skipped 67 transitions) in 25 ms.
[2025-05-31 23:12:36] [INFO ] Added : 195 causal constraints over 39 iterations in 13264 ms. Result :unknown
[2025-05-31 23:12:37] [INFO ] [Real]Absence check using state equation in 978 ms returned sat
[2025-05-31 23:12:38] [INFO ] [Real]Added 75 Read/Feed constraints in 737 ms returned sat
[2025-05-31 23:12:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:12:39] [INFO ] [Nat]Absence check using state equation in 964 ms returned sat
[2025-05-31 23:12:40] [INFO ] [Nat]Added 75 Read/Feed constraints in 1320 ms returned sat
[2025-05-31 23:12:40] [INFO ] Computed and/alt/rep : 389/2348/389 causal constraints (skipped 67 transitions) in 25 ms.
[2025-05-31 23:12:50] [INFO ] Added : 301 causal constraints over 61 iterations in 9618 ms. Result :sat
Minimization took 3523 ms.
[2025-05-31 23:12:54] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2025-05-31 23:12:55] [INFO ] [Real]Added 75 Read/Feed constraints in 1503 ms returned sat
[2025-05-31 23:12:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:12:56] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2025-05-31 23:12:57] [INFO ] [Nat]Added 75 Read/Feed constraints in 1631 ms returned sat
[2025-05-31 23:12:58] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
[2025-05-31 23:12:58] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 2 ms to minimize.
[2025-05-31 23:12:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 312 ms
[2025-05-31 23:12:58] [INFO ] Computed and/alt/rep : 389/2348/389 causal constraints (skipped 67 transitions) in 25 ms.
[2025-05-31 23:13:07] [INFO ] Added : 210 causal constraints over 42 iterations in 9005 ms. Result :sat
Minimization took 2096 ms.
[2025-05-31 23:13:09] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2025-05-31 23:13:10] [INFO ] [Real]Added 75 Read/Feed constraints in 952 ms returned sat
[2025-05-31 23:13:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:13:11] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2025-05-31 23:13:12] [INFO ] [Nat]Added 75 Read/Feed constraints in 989 ms returned sat
[2025-05-31 23:13:12] [INFO ] Computed and/alt/rep : 389/2348/389 causal constraints (skipped 67 transitions) in 25 ms.
[2025-05-31 23:13:22] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2025-05-31 23:13:22] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2025-05-31 23:13:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 352 ms
[2025-05-31 23:13:22] [INFO ] Added : 287 causal constraints over 58 iterations in 10766 ms. Result :sat
Minimization took 1709 ms.
[2025-05-31 23:13:24] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2025-05-31 23:13:25] [INFO ] [Real]Added 75 Read/Feed constraints in 662 ms returned sat
[2025-05-31 23:13:25] [INFO ] Computed and/alt/rep : 389/2348/389 causal constraints (skipped 67 transitions) in 27 ms.
[2025-05-31 23:13:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:13:26] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2025-05-31 23:13:26] [INFO ] [Nat]Added 75 Read/Feed constraints in 849 ms returned sat
[2025-05-31 23:13:26] [INFO ] Computed and/alt/rep : 389/2348/389 causal constraints (skipped 67 transitions) in 25 ms.
[2025-05-31 23:13:36] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 2 ms to minimize.
[2025-05-31 23:13:36] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2025-05-31 23:13:36] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
[2025-05-31 23:13:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 606 ms
[2025-05-31 23:13:36] [INFO ] Added : 249 causal constraints over 50 iterations in 9667 ms. Result :sat
Minimization took 2936 ms.
[2025-05-31 23:13:39] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2025-05-31 23:13:40] [INFO ] [Real]Added 75 Read/Feed constraints in 631 ms returned sat
[2025-05-31 23:13:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:13:40] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2025-05-31 23:13:41] [INFO ] [Nat]Added 75 Read/Feed constraints in 860 ms returned sat
[2025-05-31 23:13:41] [INFO ] Computed and/alt/rep : 389/2348/389 causal constraints (skipped 67 transitions) in 26 ms.
[2025-05-31 23:14:01] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 2 ms to minimize.
[2025-05-31 23:14:01] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2025-05-31 23:14:02] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2025-05-31 23:14:02] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2025-05-31 23:14:02] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2025-05-31 23:14:02] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2025-05-31 23:14:02] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2025-05-31 23:14:02] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2025-05-31 23:14:02] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:14:02] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:14:03] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:14:03] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:14:03] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:14:03] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:14:03] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1880 ms
[2025-05-31 23:14:03] [INFO ] Added : 368 causal constraints over 74 iterations in 21840 ms. Result :sat
Minimization took 4093 ms.
[2025-05-31 23:14:08] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2025-05-31 23:14:08] [INFO ] [Real]Added 75 Read/Feed constraints in 360 ms returned sat
[2025-05-31 23:14:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:14:08] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2025-05-31 23:14:09] [INFO ] [Nat]Added 75 Read/Feed constraints in 721 ms returned sat
[2025-05-31 23:14:09] [INFO ] Computed and/alt/rep : 389/2348/389 causal constraints (skipped 67 transitions) in 26 ms.
[2025-05-31 23:14:10] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2025-05-31 23:14:10] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
[2025-05-31 23:14:10] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 5 ms to minimize.
[2025-05-31 23:14:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 508 ms
[2025-05-31 23:14:10] [INFO ] Added : 84 causal constraints over 18 iterations in 1244 ms. Result :sat
Minimization took 462 ms.
[2025-05-31 23:14:11] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2025-05-31 23:14:11] [INFO ] [Real]Added 75 Read/Feed constraints in 216 ms returned sat
[2025-05-31 23:14:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:14:11] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2025-05-31 23:14:12] [INFO ] [Nat]Added 75 Read/Feed constraints in 83 ms returned sat
[2025-05-31 23:14:12] [INFO ] Computed and/alt/rep : 389/2348/389 causal constraints (skipped 67 transitions) in 27 ms.
[2025-05-31 23:14:12] [INFO ] Added : 93 causal constraints over 19 iterations in 823 ms. Result :sat
Minimization took 499 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 14 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 457/457 transitions.
Applied a total of 0 rules in 21 ms. Remains 445 /445 variables (removed 0) and now considering 457/457 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 445/445 places, 457/457 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 457/457 transitions.
Applied a total of 0 rules in 7 ms. Remains 445 /445 variables (removed 0) and now considering 457/457 (removed 0) transitions.
// Phase 1: matrix 457 rows 445 cols
[2025-05-31 23:17:58] [INFO ] Invariants computation overflowed in 48 ms
[2025-05-31 23:17:58] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 457 rows 445 cols
[2025-05-31 23:17:58] [INFO ] Invariants computation overflowed in 42 ms
[2025-05-31 23:17:58] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 23:18:11] [INFO ] Implicit Places using invariants and state equation in 12411 ms returned []
Implicit Place search using SMT with State Equation took 12700 ms to find 0 implicit places.
[2025-05-31 23:18:11] [INFO ] Redundant transitions in 32 ms returned []
Running 456 sub problems to find dead transitions.
// Phase 1: matrix 457 rows 445 cols
[2025-05-31 23:18:11] [INFO ] Invariants computation overflowed in 47 ms
[2025-05-31 23:18:11] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (OVERLAPS) 457/901 variables, 444/444 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/901 variables, 75/519 constraints. Problems are: Problem set: 0 solved, 456 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/901 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 4 (OVERLAPS) 1/902 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 520 constraints, problems are : Problem set: 0 solved, 456 unsolved in 30023 ms.
Refiners :[State Equation: 445/445 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 456/456 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (OVERLAPS) 457/901 variables, 444/444 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/901 variables, 75/519 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/901 variables, 456/975 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 901/902 variables, and 975 constraints, problems are : Problem set: 0 solved, 456 unsolved in 30013 ms.
Refiners :[State Equation: 444/445 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 456/456 constraints, Known Traps: 0/0 constraints]
After SMT, in 60380ms problems are : Problem set: 0 solved, 456 unsolved
Search for dead transitions found 0 dead transitions in 60395ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73155 ms. Remains : 445/445 places, 457/457 transitions.
Found an invariant !
This invariant on transitions {28=1, 40=1, 50=1, 86=1, 119=1, 164=1, 211=1, 256=1, 306=1, 390=1, 404=1, 421=1, 427=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {28=1, 40=1, 119=1, 166=1, 254=1, 374=1, 390=1, 427=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1427 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40000 steps (5849 resets) in 1268 ms. (31 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (3642 resets) in 467 ms. (85 steps per ms) remains 14/14 properties
[2025-05-31 23:25:13] [INFO ] Flatten gal took : 235 ms
[2025-05-31 23:25:13] [INFO ] Flatten gal took : 82 ms
BEST_FIRST walk for 40000 steps (3704 resets) in 518 ms. (77 steps per ms) remains 14/14 properties
[2025-05-31 23:25:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1521949355859021146.gal : 32 ms
[2025-05-31 23:25:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7291279720680214210.prop : 0 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/ReachabilityCardinality1521949355859021146.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7291279720680214210.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (3752 resets) in 251 ms. (158 steps per ms) remains 14/14 properties

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
BEST_FIRST walk for 40002 steps (3657 resets) in 328 ms. (121 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (3685 resets) in 154 ms. (258 steps per ms) remains 14/14 properties
Loading property file /tmp/ReachabilityCardinality7291279720680214210.prop.
BEST_FIRST walk for 40000 steps (3663 resets) in 181 ms. (219 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :14 after 27
SDD proceeding with computation,14 properties remain. new max is 128
BEST_FIRST walk for 40001 steps (3716 resets) in 323 ms. (123 steps per ms) remains 14/14 properties
SDD size :27 after 46
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :46 after 91
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :91 after 288
BEST_FIRST walk for 40002 steps (3698 resets) in 140 ms. (283 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :288 after 827
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :827 after 6349
BEST_FIRST walk for 40002 steps (3683 resets) in 146 ms. (272 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :6349 after 49374
BEST_FIRST walk for 40001 steps (3676 resets) in 222 ms. (179 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :49374 after 191469
BEST_FIRST walk for 40002 steps (3600 resets) in 203 ms. (196 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (3646 resets) in 126 ms. (314 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (3670 resets) in 150 ms. (264 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (3618 resets) in 119 ms. (333 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :191469 after 487040
Invariant property MIN13 does not hold.
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :487040 after 2.36851e+07
SDD proceeding with computation,13 properties remain. new max is 32768
SDD size :2.36851e+07 after 1.43712e+08
Interrupted probabilistic random walk after 225327 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 14
Probabilistic random walk after 225327 steps, saw 112682 distinct states, run finished after 3004 ms. (steps per millisecond=75 ) properties seen :0
// Phase 1: matrix 457 rows 445 cols
[2025-05-31 23:25:17] [INFO ] Invariants computation overflowed in 35 ms
[2025-05-31 23:25:17] [INFO ] State equation strengthened by 75 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 52/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 287/352 variables, 104/118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 332/684 variables, 190/328 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/684 variables, 33/361 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/684 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 135/819 variables, 88/449 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/819 variables, 15/464 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SDD proceeding with computation,13 properties remain. new max is 65536
SDD size :1.43712e+08 after 5.7823e+08
At refinement iteration 12 (INCLUDED_ONLY) 0/819 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 66/885 variables, 34/498 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/885 variables, 6/504 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/885 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 17/902 variables, 16/520 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/902 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 0/902 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 902/902 variables, and 520 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1368 ms.
Refiners :[State Equation: 445/445 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 52/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 287/352 variables, 104/118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 12/150 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 332/684 variables, 190/340 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/684 variables, 33/373 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/684 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/684 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 135/819 variables, 88/462 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/819 variables, 15/477 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/819 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 66/885 variables, 34/511 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/885 variables, 6/517 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/885 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 533 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5009 ms.
Refiners :[State Equation: 445/445 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 6428ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 457/457 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 445 transition count 454
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 442 transition count 454
Applied a total of 6 rules in 22 ms. Remains 442 /445 variables (removed 3) and now considering 454/457 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 442/445 places, 454/457 transitions.
RANDOM walk for 40000 steps (5826 resets) in 234 ms. (170 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3662 resets) in 126 ms. (314 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3681 resets) in 121 ms. (327 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 131072
SDD size :5.7823e+08 after 1.99287e+09
BEST_FIRST walk for 40003 steps (3674 resets) in 174 ms. (228 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3684 resets) in 203 ms. (196 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3602 resets) in 188 ms. (211 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3712 resets) in 166 ms. (239 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3699 resets) in 145 ms. (273 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3646 resets) in 128 ms. (310 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3676 resets) in 124 ms. (320 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3682 resets) in 120 ms. (330 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3672 resets) in 128 ms. (310 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3612 resets) in 118 ms. (336 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3595 resets) in 147 ms. (270 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 152280 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 13
Probabilistic random walk after 152280 steps, saw 76148 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
// Phase 1: matrix 454 rows 442 cols
[2025-05-31 23:25:27] [INFO ] Invariants computation overflowed in 43 ms
[2025-05-31 23:25:27] [INFO ] State equation strengthened by 75 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 52/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 310/375 variables, 108/122 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 403/778 variables, 224/366 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/778 variables, 39/405 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/778 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 118/896 variables, 97/502 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/896 variables, 15/517 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/896 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/896 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 896/896 variables, and 517 constraints, problems are : Problem set: 0 solved, 13 unsolved in 945 ms.
Refiners :[State Equation: 442/442 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 52/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 310/375 variables, 108/122 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 12/154 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 403/778 variables, 224/378 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/778 variables, 39/417 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/778 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/778 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 118/896 variables, 97/515 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/896 variables, 15/530 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-05-31 23:25:33] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 3 ms to minimize.
[2025-05-31 23:25:33] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 2 ms to minimize.
[2025-05-31 23:25:33] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
[2025-05-31 23:25:34] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 2 ms to minimize.
[2025-05-31 23:25:34] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2025-05-31 23:25:34] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2025-05-31 23:25:34] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2025-05-31 23:25:34] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2025-05-31 23:25:34] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2025-05-31 23:25:34] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 2 ms to minimize.
[2025-05-31 23:25:34] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2025-05-31 23:25:35] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2025-05-31 23:25:35] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 2 ms to minimize.
[2025-05-31 23:25:35] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2025-05-31 23:25:35] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2025-05-31 23:25:35] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2025-05-31 23:25:35] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2025-05-31 23:25:35] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
[2025-05-31 23:25:36] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2025-05-31 23:25:36] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/896 variables, 20/550 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-05-31 23:25:39] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:25:39] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:25:39] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:25:39] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:25:39] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:25:39] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
[2025-05-31 23:25:39] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:25:40] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:25:40] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:25:41] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2025-05-31 23:25:41] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
SDD proceeding with computation,13 properties remain. new max is 262144
SDD size :1.99287e+09 after 6.35084e+09
At refinement iteration 15 (INCLUDED_ONLY) 0/896 variables, 11/561 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-05-31 23:25:49] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 4 ms to minimize.
[2025-05-31 23:25:49] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2025-05-31 23:25:49] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2025-05-31 23:25:49] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2025-05-31 23:25:49] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2025-05-31 23:25:50] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/896 variables, 6/567 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-05-31 23:25:51] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2025-05-31 23:25:51] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/896 variables, 2/569 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-05-31 23:25:53] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:25:53] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:25:53] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/896 variables, 3/572 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/896 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-05-31 23:25:55] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/896 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/896 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (OVERLAPS) 0/896 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 896/896 variables, and 573 constraints, problems are : Problem set: 0 solved, 13 unsolved in 30729 ms.
Refiners :[State Equation: 442/442 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 43/43 constraints]
After SMT, in 31742ms problems are : Problem set: 0 solved, 13 unsolved
Detected timeout of ITS tools.
[2025-05-31 23:26:03] [INFO ] Flatten gal took : 83 ms
[2025-05-31 23:26:03] [INFO ] Applying decomposition
[2025-05-31 23:26:03] [INFO ] Flatten gal took : 59 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/graph11020835623401665257.txt' '-o' '/tmp/graph11020835623401665257.bin' '-w' '/tmp/graph11020835623401665257.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11020835623401665257.bin' '-l' '-1' '-v' '-w' '/tmp/graph11020835623401665257.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:26:04] [INFO ] Decomposing Gal with order
[2025-05-31 23:26:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:26:04] [INFO ] Removed a total of 243 redundant transitions.
[2025-05-31 23:26:04] [INFO ] Flatten gal took : 188 ms
[2025-05-31 23:26:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 182 labels/synchronizations in 37 ms.
[2025-05-31 23:26:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4013826947880144019.gal : 91 ms
[2025-05-31 23:26:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5914705453325411389.prop : 0 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/ReachabilityCardinality4013826947880144019.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5914705453325411389.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityCardinality5914705453325411389.prop.
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :8 after 19
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :19 after 37
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :37 after 60
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :60 after 1143
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :1143 after 1852
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :1852 after 11781
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :11781 after 45043
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :45043 after 52822
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :52822 after 89701
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :89701 after 133770
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :133770 after 188006
Parikh walk visited 0 properties in 30002 ms.
Support contains 13 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 454/454 transitions.
Applied a total of 0 rules in 21 ms. Remains 442 /442 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 442/442 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 454/454 transitions.
Applied a total of 0 rules in 8 ms. Remains 442 /442 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 442 cols
[2025-05-31 23:26:29] [INFO ] Invariants computation overflowed in 40 ms
[2025-05-31 23:26:29] [INFO ] Implicit Places using invariants in 313 ms returned []
// Phase 1: matrix 454 rows 442 cols
[2025-05-31 23:26:30] [INFO ] Invariants computation overflowed in 48 ms
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :188006 after 274552
[2025-05-31 23:26:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 23:26:36] [INFO ] Implicit Places using invariants and state equation in 7004 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7320 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 441/442 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 441 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 440 transition count 453
Applied a total of 2 rules in 35 ms. Remains 440 /441 variables (removed 1) and now considering 453/454 (removed 1) transitions.
// Phase 1: matrix 453 rows 440 cols
[2025-05-31 23:26:37] [INFO ] Computed 64 invariants in 61 ms
[2025-05-31 23:26:37] [INFO ] Implicit Places using invariants in 307 ms returned []
[2025-05-31 23:26:37] [INFO ] Invariant cache hit.
[2025-05-31 23:26:37] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 23:26:43] [INFO ] Implicit Places using invariants and state equation in 6047 ms returned []
Implicit Place search using SMT with State Equation took 6359 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 440/442 places, 453/454 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 13723 ms. Remains : 440/442 places, 453/454 transitions.
RANDOM walk for 40000 steps (5686 resets) in 216 ms. (184 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3634 resets) in 128 ms. (310 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3702 resets) in 181 ms. (219 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3729 resets) in 138 ms. (287 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3675 resets) in 156 ms. (254 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3727 resets) in 131 ms. (303 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3647 resets) in 179 ms. (222 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3597 resets) in 150 ms. (264 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3598 resets) in 145 ms. (273 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3692 resets) in 134 ms. (296 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3648 resets) in 159 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3638 resets) in 151 ms. (263 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3655 resets) in 158 ms. (251 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3652 resets) in 108 ms. (366 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 167143 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 13
Probabilistic random walk after 167143 steps, saw 83579 distinct states, run finished after 3002 ms. (steps per millisecond=55 ) properties seen :0
[2025-05-31 23:26:47] [INFO ] Invariant cache hit.
[2025-05-31 23:26:47] [INFO ] State equation strengthened by 75 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 226/239 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 148/387 variables, 33/54 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 22/409 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 2/411 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 451/862 variables, 411/473 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/862 variables, 74/547 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/862 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 30/892 variables, 28/575 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/892 variables, 2/577 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/892 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/892 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 1/893 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/893 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 0/893 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 893/893 variables, and 579 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1360 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 440/440 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 226/239 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 148/387 variables, 33/54 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 22/409 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 2/411 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 451/862 variables, 411/473 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/862 variables, 74/547 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/862 variables, 8/555 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/862 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 30/892 variables, 28/583 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/892 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/892 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/892 variables, 5/591 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/892 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 1/893 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-05-31 23:26:54] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2025-05-31 23:26:54] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2025-05-31 23:26:54] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
[2025-05-31 23:26:54] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2025-05-31 23:26:55] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2025-05-31 23:26:55] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2025-05-31 23:26:55] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2025-05-31 23:26:56] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2025-05-31 23:26:56] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2025-05-31 23:26:56] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2025-05-31 23:26:56] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2025-05-31 23:26:56] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2025-05-31 23:26:56] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2025-05-31 23:26:56] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2025-05-31 23:26:56] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2025-05-31 23:26:56] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:26:57] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:26:57] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:26:57] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2025-05-31 23:26:57] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/893 variables, 20/612 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-05-31 23:26:59] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2025-05-31 23:26:59] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:26:59] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:26:59] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:27:00] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:27:00] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:27:00] [INFO ] Deduced a trap composed of 67 places in 44 ms of which 0 ms to minimize.
[2025-05-31 23:27:00] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:27:00] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2025-05-31 23:27:00] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/893 variables, 10/622 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/893 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (OVERLAPS) 0/893 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 893/893 variables, and 622 constraints, problems are : Problem set: 0 solved, 13 unsolved in 16544 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 440/440 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 30/30 constraints]
After SMT, in 17918ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 0 properties in 30000 ms.
Support contains 13 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 440 /440 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 440/440 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 453/453 transitions.
Applied a total of 0 rules in 8 ms. Remains 440 /440 variables (removed 0) and now considering 453/453 (removed 0) transitions.
[2025-05-31 23:27:35] [INFO ] Invariant cache hit.
[2025-05-31 23:27:35] [INFO ] Implicit Places using invariants in 255 ms returned []
[2025-05-31 23:27:35] [INFO ] Invariant cache hit.
[2025-05-31 23:27:35] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 23:27:41] [INFO ] Implicit Places using invariants and state equation in 5827 ms returned []
Implicit Place search using SMT with State Equation took 6083 ms to find 0 implicit places.
[2025-05-31 23:27:41] [INFO ] Redundant transitions in 6 ms returned []
Running 452 sub problems to find dead transitions.
[2025-05-31 23:27:41] [INFO ] Invariant cache hit.
[2025-05-31 23:27:41] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (OVERLAPS) 453/892 variables, 439/503 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/892 variables, 75/578 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/892 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (OVERLAPS) 1/893 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 893/893 variables, and 579 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 440/440 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (OVERLAPS) 453/892 variables, 439/503 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/892 variables, 75/578 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/892 variables, 452/1030 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 892/893 variables, and 1030 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 439/440 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 0/0 constraints]
After SMT, in 60260ms problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 60267ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66375 ms. Remains : 440/440 places, 453/453 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-00
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 457 rows 445 cols
[2025-05-31 23:28:41] [INFO ] Invariants computation overflowed in 42 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1432 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10000 steps (900 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 457 rows 445 cols
[2025-05-31 23:28:41] [INFO ] Invariants computation overflowed in 43 ms
[2025-05-31 23:28:42] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2025-05-31 23:28:42] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-31 23:28:42] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:28:42] [INFO ] [Real]Added 75 Read/Feed constraints in 574 ms returned sat
[2025-05-31 23:28:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:28:43] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2025-05-31 23:28:43] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:28:44] [INFO ] [Nat]Added 75 Read/Feed constraints in 1026 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 457/457 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 445 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 444 transition count 455
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 444 transition count 454
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 443 transition count 454
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 13 place count 439 transition count 450
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 438 transition count 450
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 25 place count 438 transition count 440
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 35 place count 428 transition count 440
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 39 place count 428 transition count 440
Applied a total of 39 rules in 47 ms. Remains 428 /445 variables (removed 17) and now considering 440/457 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 428/445 places, 440/457 transitions.
Found an invariant !
This invariant on transitions {24=1, 35=1, 44=1, 74=1, 99=1, 141=1, 178=1, 207=1, 218=1, 277=1, 289=1, 306=1, 312=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {24=1, 35=1, 99=1, 143=1, 205=1, 261=1, 277=1, 312=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1442 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 440 rows 428 cols
[2025-05-31 23:28:46] [INFO ] Computed 66 invariants in 56 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144130 resets) in 878 ms. (1137 steps per ms)
BEST_FIRST walk for 1000000 steps (91162 resets) in 597 ms. (1672 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:28:48] [INFO ] Invariant cache hit.
[2025-05-31 23:28:48] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2025-05-31 23:28:48] [INFO ] [Real]Absence check using 9 positive and 57 generalized place invariants in 16 ms returned sat
[2025-05-31 23:28:48] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2025-05-31 23:28:48] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-05-31 23:28:49] [INFO ] [Real]Added 79 Read/Feed constraints in 435 ms returned sat
[2025-05-31 23:28:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:28:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2025-05-31 23:28:49] [INFO ] [Nat]Absence check using 9 positive and 57 generalized place invariants in 16 ms returned sat
[2025-05-31 23:28:49] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2025-05-31 23:28:50] [INFO ] [Nat]Added 79 Read/Feed constraints in 743 ms returned sat
[2025-05-31 23:28:50] [INFO ] Computed and/alt/rep : 335/2167/335 causal constraints (skipped 104 transitions) in 29 ms.
[2025-05-31 23:28:53] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 3 ms to minimize.
[2025-05-31 23:28:54] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 2 ms to minimize.
[2025-05-31 23:28:54] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 2 ms to minimize.
[2025-05-31 23:28:54] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 1 ms to minimize.
[2025-05-31 23:28:54] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2025-05-31 23:28:54] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2025-05-31 23:28:54] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2025-05-31 23:28:55] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 3 ms to minimize.
[2025-05-31 23:28:55] [INFO ] Deduced a trap composed of 123 places in 186 ms of which 2 ms to minimize.
[2025-05-31 23:28:56] [INFO ] Deduced a trap composed of 123 places in 192 ms of which 3 ms to minimize.
[2025-05-31 23:28:56] [INFO ] Deduced a trap composed of 126 places in 190 ms of which 3 ms to minimize.
[2025-05-31 23:28:57] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2025-05-31 23:28:57] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2025-05-31 23:28:57] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3708 ms
[2025-05-31 23:28:57] [INFO ] Added : 131 causal constraints over 27 iterations in 7087 ms. Result :sat
Minimization took 1603 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 428 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p677) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 438/438 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 427 transition count 437
Applied a total of 1 rules in 10 ms. Remains 427 /428 variables (removed 1) and now considering 437/438 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 427/428 places, 437/438 transitions.
// Phase 1: matrix 437 rows 427 cols
[2025-05-31 23:29:29] [INFO ] Computed 66 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144107 resets) in 888 ms. (1124 steps per ms)
BEST_FIRST walk for 1000000 steps (91414 resets) in 650 ms. (1536 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:29:30] [INFO ] Invariant cache hit.
[2025-05-31 23:29:30] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 23:29:30] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 19 ms returned sat
[2025-05-31 23:29:31] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2025-05-31 23:29:31] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-05-31 23:29:31] [INFO ] [Real]Added 79 Read/Feed constraints in 289 ms returned sat
[2025-05-31 23:29:31] [INFO ] Computed and/alt/rep : 333/2166/333 causal constraints (skipped 103 transitions) in 30 ms.
[2025-05-31 23:29:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:29:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-05-31 23:29:31] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 17 ms returned sat
[2025-05-31 23:29:32] [INFO ] [Nat]Absence check using state equation in 437 ms returned sat
[2025-05-31 23:29:33] [INFO ] [Nat]Added 79 Read/Feed constraints in 859 ms returned sat
[2025-05-31 23:29:33] [INFO ] Computed and/alt/rep : 333/2166/333 causal constraints (skipped 103 transitions) in 32 ms.
[2025-05-31 23:29:36] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 3 ms to minimize.
[2025-05-31 23:29:36] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 2 ms to minimize.
[2025-05-31 23:29:37] [INFO ] Deduced a trap composed of 135 places in 186 ms of which 2 ms to minimize.
[2025-05-31 23:29:37] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 2 ms to minimize.
[2025-05-31 23:29:37] [INFO ] Deduced a trap composed of 138 places in 195 ms of which 3 ms to minimize.
[2025-05-31 23:29:38] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2025-05-31 23:29:38] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 2 ms to minimize.
[2025-05-31 23:29:39] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2025-05-31 23:29:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2925 ms
[2025-05-31 23:29:39] [INFO ] Added : 121 causal constraints over 26 iterations in 6140 ms. Result :sat
Minimization took 940 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 437/437 transitions.
Applied a total of 0 rules in 18 ms. Remains 427 /427 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 427/427 places, 437/437 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 437/437 transitions.
Applied a total of 0 rules in 8 ms. Remains 427 /427 variables (removed 0) and now considering 437/437 (removed 0) transitions.
[2025-05-31 23:30:10] [INFO ] Invariant cache hit.
[2025-05-31 23:30:10] [INFO ] Implicit Places using invariants in 498 ms returned [50, 115, 121, 352]
[2025-05-31 23:30:10] [INFO ] Actually due to overlaps returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 501 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 426/427 places, 437/437 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 426 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 425 transition count 436
Applied a total of 2 rules in 19 ms. Remains 425 /426 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 425 cols
[2025-05-31 23:30:10] [INFO ] Invariants computation overflowed in 37 ms
[2025-05-31 23:30:11] [INFO ] Implicit Places using invariants in 305 ms returned []
// Phase 1: matrix 436 rows 425 cols
[2025-05-31 23:30:11] [INFO ] Invariants computation overflowed in 37 ms
[2025-05-31 23:30:11] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-05-31 23:30:53] [INFO ] Performed 27/425 implicitness test of which 0 returned IMPLICIT in 42 seconds.
[2025-05-31 23:31:08] [INFO ] Implicit Places using invariants and state equation in 57241 ms returned [113, 269, 273]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 57549 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 422/427 places, 436/437 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 421 transition count 435
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 421 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 419 transition count 435
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 419 transition count 435
Applied a total of 7 rules in 30 ms. Remains 419 /422 variables (removed 3) and now considering 435/436 (removed 1) transitions.
// Phase 1: matrix 435 rows 419 cols
[2025-05-31 23:31:08] [INFO ] Invariants computation overflowed in 33 ms
[2025-05-31 23:31:08] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2025-05-31 23:31:08] [INFO ] Invariants computation overflowed in 27 ms
[2025-05-31 23:31:09] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-05-31 23:31:36] [INFO ] Implicit Places using invariants and state equation in 27926 ms returned []
Implicit Place search using SMT with State Equation took 28230 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 419/427 places, 435/437 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 86338 ms. Remains : 419/427 places, 435/437 transitions.
// Phase 1: matrix 435 rows 419 cols
[2025-05-31 23:31:36] [INFO ] Invariants computation overflowed in 30 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144227 resets) in 820 ms. (1218 steps per ms)
BEST_FIRST walk for 1000001 steps (91053 resets) in 573 ms. (1742 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 435 rows 419 cols
[2025-05-31 23:31:38] [INFO ] Invariants computation overflowed in 33 ms
[2025-05-31 23:31:38] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2025-05-31 23:31:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:31:38] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2025-05-31 23:31:38] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-05-31 23:31:39] [INFO ] [Nat]Added 79 Read/Feed constraints in 795 ms returned sat
[2025-05-31 23:31:39] [INFO ] Computed and/alt/rep : 316/2076/316 causal constraints (skipped 118 transitions) in 29 ms.
[2025-05-31 23:31:41] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 2 ms to minimize.
[2025-05-31 23:31:41] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 2 ms to minimize.
[2025-05-31 23:31:41] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
[2025-05-31 23:31:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 530 ms
[2025-05-31 23:31:41] [INFO ] Added : 117 causal constraints over 24 iterations in 2275 ms. Result :sat
Minimization took 554 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 8 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 419/419 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 7 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 419 cols
[2025-05-31 23:32:12] [INFO ] Invariants computation overflowed in 32 ms
[2025-05-31 23:32:12] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2025-05-31 23:32:12] [INFO ] Invariants computation overflowed in 24 ms
[2025-05-31 23:32:13] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-05-31 23:32:40] [INFO ] Implicit Places using invariants and state equation in 27823 ms returned []
Implicit Place search using SMT with State Equation took 28120 ms to find 0 implicit places.
[2025-05-31 23:32:40] [INFO ] Redundant transitions in 3 ms returned []
Running 434 sub problems to find dead transitions.
// Phase 1: matrix 435 rows 419 cols
[2025-05-31 23:32:40] [INFO ] Invariants computation overflowed in 29 ms
[2025-05-31 23:32:40] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 435/852 variables, 417/417 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/852 variables, 79/496 constraints. Problems are: Problem set: 0 solved, 434 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/852 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/854 variables, 2/498 constraints. Problems are: Problem set: 83 solved, 351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 854/854 variables, and 498 constraints, problems are : Problem set: 83 solved, 351 unsolved in 30021 ms.
Refiners :[State Equation: 419/419 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 83 solved, 351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 0/0 constraints. Problems are: Problem set: 83 solved, 351 unsolved
At refinement iteration 1 (OVERLAPS) 428/776 variables, 348/348 constraints. Problems are: Problem set: 83 solved, 351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/776 variables, 73/421 constraints. Problems are: Problem set: 83 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/776 variables, 194/615 constraints. Problems are: Problem set: 83 solved, 351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 776/854 variables, and 615 constraints, problems are : Problem set: 83 solved, 351 unsolved in 30020 ms.
Refiners :[State Equation: 348/419 constraints, ReadFeed: 73/79 constraints, PredecessorRefiner: 194/434 constraints, Known Traps: 0/0 constraints]
After SMT, in 60410ms problems are : Problem set: 83 solved, 351 unsolved
Search for dead transitions found 83 dead transitions in 60415ms
Found 83 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 83 transitions
Dead transitions reduction (with SMT) removed 83 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 419/419 places, 352/435 transitions.
Graph (complete) has 2606 edges and 419 vertex of which 276 are kept as prefixes of interest. Removing 143 places using SCC suffix rule.1 ms
Discarding 143 places :
Also discarding 31 output transitions
Drop transitions (Output transitions of discarded places.) removed 31 transitions
Reduce places removed 3 places and 7 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Graph (complete) has 1589 edges and 273 vertex of which 272 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 272 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 271 transition count 280
Applied a total of 39 rules in 9 ms. Remains 271 /419 variables (removed 148) and now considering 280/352 (removed 72) transitions.
// Phase 1: matrix 280 rows 271 cols
[2025-05-31 23:33:41] [INFO ] Computed 41 invariants in 15 ms
[2025-05-31 23:33:41] [INFO ] Implicit Places using invariants in 256 ms returned [93, 245]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 259 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 269/419 places, 280/435 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 269 transition count 278
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 267 transition count 278
Applied a total of 4 rules in 8 ms. Remains 267 /269 variables (removed 2) and now considering 278/280 (removed 2) transitions.
// Phase 1: matrix 278 rows 267 cols
[2025-05-31 23:33:41] [INFO ] Computed 39 invariants in 23 ms
[2025-05-31 23:33:41] [INFO ] Implicit Places using invariants in 207 ms returned []
[2025-05-31 23:33:41] [INFO ] Invariant cache hit.
[2025-05-31 23:33:41] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 23:33:43] [INFO ] Implicit Places using invariants and state equation in 1995 ms returned []
Implicit Place search using SMT with State Equation took 2204 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 267/419 places, 278/435 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 91039 ms. Remains : 267/419 places, 278/435 transitions.
[2025-05-31 23:33:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144426 resets) in 755 ms. (1322 steps per ms)
BEST_FIRST walk for 1000000 steps (91362 resets) in 547 ms. (1824 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:33:44] [INFO ] Invariant cache hit.
[2025-05-31 23:33:44] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2025-05-31 23:33:44] [INFO ] [Real]Absence check using 16 positive and 23 generalized place invariants in 5 ms returned sat
[2025-05-31 23:33:45] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2025-05-31 23:33:45] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 23:33:45] [INFO ] [Real]Added 49 Read/Feed constraints in 142 ms returned sat
[2025-05-31 23:33:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:33:45] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2025-05-31 23:33:45] [INFO ] [Nat]Absence check using 16 positive and 23 generalized place invariants in 4 ms returned sat
[2025-05-31 23:33:46] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2025-05-31 23:33:46] [INFO ] [Nat]Added 49 Read/Feed constraints in 505 ms returned sat
[2025-05-31 23:33:46] [INFO ] Computed and/alt/rep : 221/1441/221 causal constraints (skipped 56 transitions) in 17 ms.
[2025-05-31 23:33:48] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2025-05-31 23:33:48] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 2 ms to minimize.
[2025-05-31 23:33:48] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2025-05-31 23:33:49] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2025-05-31 23:33:50] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 1 ms to minimize.
[2025-05-31 23:33:50] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2025-05-31 23:33:50] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 1 ms to minimize.
[2025-05-31 23:33:50] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2025-05-31 23:33:50] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2025-05-31 23:33:51] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2025-05-31 23:33:51] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 1 ms to minimize.
[2025-05-31 23:33:51] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
[2025-05-31 23:33:51] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2025-05-31 23:33:51] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2025-05-31 23:33:52] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3693 ms
[2025-05-31 23:33:52] [INFO ] Added : 130 causal constraints over 27 iterations in 5703 ms. Result :sat
Minimization took 698 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 278/278 transitions.
Applied a total of 0 rules in 4 ms. Remains 267 /267 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 267/267 places, 278/278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 278/278 transitions.
Applied a total of 0 rules in 4 ms. Remains 267 /267 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2025-05-31 23:34:23] [INFO ] Invariant cache hit.
[2025-05-31 23:34:23] [INFO ] Implicit Places using invariants in 251 ms returned []
[2025-05-31 23:34:23] [INFO ] Invariant cache hit.
[2025-05-31 23:34:23] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 23:34:25] [INFO ] Implicit Places using invariants and state equation in 2011 ms returned []
Implicit Place search using SMT with State Equation took 2271 ms to find 0 implicit places.
[2025-05-31 23:34:25] [INFO ] Redundant transitions in 1 ms returned []
Running 277 sub problems to find dead transitions.
[2025-05-31 23:34:25] [INFO ] Invariant cache hit.
[2025-05-31 23:34:25] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/265 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 2/267 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (OVERLAPS) 278/545 variables, 267/306 constraints. Problems are: Problem set: 0 solved, 277 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 49/355 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (OVERLAPS) 0/545 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 355 constraints, problems are : Problem set: 0 solved, 277 unsolved in 15183 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 267/267 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/265 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 2/267 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (OVERLAPS) 278/545 variables, 267/306 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 49/355 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 277/632 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2025-05-31 23:34:57] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 2 ms to minimize.
[2025-05-31 23:34:58] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 2 ms to minimize.
[2025-05-31 23:34:58] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 1 ms to minimize.
[2025-05-31 23:34:59] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 1 ms to minimize.
[2025-05-31 23:34:59] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 1 ms to minimize.
[2025-05-31 23:34:59] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 1 ms to minimize.
[2025-05-31 23:34:59] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2025-05-31 23:34:59] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2025-05-31 23:34:59] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 1 ms to minimize.
[2025-05-31 23:34:59] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2025-05-31 23:35:00] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 1 ms to minimize.
[2025-05-31 23:35:00] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 1 ms to minimize.
[2025-05-31 23:35:00] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 1 ms to minimize.
[2025-05-31 23:35:01] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 2 ms to minimize.
[2025-05-31 23:35:01] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 2 ms to minimize.
[2025-05-31 23:35:01] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2025-05-31 23:35:01] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 2 ms to minimize.
[2025-05-31 23:35:01] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 2 ms to minimize.
[2025-05-31 23:35:01] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 2 ms to minimize.
[2025-05-31 23:35:01] [INFO ] Deduced a trap composed of 99 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 20/652 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2025-05-31 23:35:08] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 653 constraints, problems are : Problem set: 0 solved, 277 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 267/267 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 21/21 constraints]
After SMT, in 45341ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 45344ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47633 ms. Remains : 267/267 places, 278/278 transitions.
[2025-05-31 23:35:10] [INFO ] Flatten gal took : 65 ms
RANDOM walk for 40000 steps (5715 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
[2025-05-31 23:35:10] [INFO ] Flatten gal took : 36 ms
[2025-05-31 23:35:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3359590420272919522.gal : 6 ms
[2025-05-31 23:35:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8473807229502898539.prop : 0 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/ReachabilityCardinality3359590420272919522.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8473807229502898539.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
BEST_FIRST walk for 40001 steps (3603 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality8473807229502898539.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 30
BEST_FIRST walk for 40001 steps (3671 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 33
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :33 after 73
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :73 after 218
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :218 after 463
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :463 after 1014
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1014 after 12704
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :12704 after 36821
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :36821 after 78956
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :78956 after 168733
Interrupted probabilistic random walk after 379163 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 2
Probabilistic random walk after 379163 steps, saw 189619 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
[2025-05-31 23:35:13] [INFO ] Invariant cache hit.
[2025-05-31 23:35:13] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 191/192 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:35:13] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 70/262 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 278/540 variables, 262/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :168733 after 347618
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 49/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/545 variables, 5/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/545 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 356 constraints, problems are : Problem set: 0 solved, 2 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 267/267 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 191/192 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 70/262 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 278/540 variables, 262/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 49/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/545 variables, 5/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/545 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/545 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 358 constraints, problems are : Problem set: 0 solved, 2 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 267/267 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 945ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :347618 after 697018
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :697018 after 3.111e+07
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :3.111e+07 after 1.04814e+08
Parikh walk visited 0 properties in 30000 ms.
Support contains 1 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 278/278 transitions.
Applied a total of 0 rules in 5 ms. Remains 267 /267 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 267/267 places, 278/278 transitions.
RANDOM walk for 40000 steps (5714 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3663 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3618 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 421135 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 2
Probabilistic random walk after 421135 steps, saw 210604 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
[2025-05-31 23:35:48] [INFO ] Invariant cache hit.
[2025-05-31 23:35:48] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 191/192 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:35:48] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 70/262 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 278/540 variables, 262/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 49/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/545 variables, 5/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/545 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 356 constraints, problems are : Problem set: 0 solved, 2 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 267/267 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 191/192 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 70/262 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 278/540 variables, 262/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 49/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/545 variables, 5/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/545 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/545 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 358 constraints, problems are : Problem set: 0 solved, 2 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 267/267 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 938ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Detected timeout of ITS tools.
[2025-05-31 23:36:00] [INFO ] Flatten gal took : 34 ms
[2025-05-31 23:36:00] [INFO ] Applying decomposition
[2025-05-31 23:36:00] [INFO ] Flatten gal took : 20 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/graph5314266186806322113.txt' '-o' '/tmp/graph5314266186806322113.bin' '-w' '/tmp/graph5314266186806322113.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5314266186806322113.bin' '-l' '-1' '-v' '-w' '/tmp/graph5314266186806322113.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:36:00] [INFO ] Decomposing Gal with order
[2025-05-31 23:36:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:36:01] [INFO ] Removed a total of 139 redundant transitions.
[2025-05-31 23:36:01] [INFO ] Flatten gal took : 51 ms
[2025-05-31 23:36:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 154 labels/synchronizations in 20 ms.
[2025-05-31 23:36:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12663116822527171123.gal : 4 ms
[2025-05-31 23:36:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16122261623888621624.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/ReachabilityCardinality12663116822527171123.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16122261623888621624.prop' '--nowitness'

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 ...309
Loading property file /tmp/ReachabilityCardinality16122261623888621624.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 87
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :87 after 1154
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1154 after 88920
Parikh walk visited 0 properties in 30002 ms.
Support contains 1 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 278/278 transitions.
Applied a total of 0 rules in 4 ms. Remains 267 /267 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 267/267 places, 278/278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 278/278 transitions.
Applied a total of 0 rules in 4 ms. Remains 267 /267 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2025-05-31 23:36:18] [INFO ] Invariant cache hit.
[2025-05-31 23:36:19] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-05-31 23:36:19] [INFO ] Invariant cache hit.
[2025-05-31 23:36:19] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 23:36:21] [INFO ] Implicit Places using invariants and state equation in 2042 ms returned []
Implicit Place search using SMT with State Equation took 2232 ms to find 0 implicit places.
[2025-05-31 23:36:21] [INFO ] Redundant transitions in 1 ms returned []
Running 277 sub problems to find dead transitions.
[2025-05-31 23:36:21] [INFO ] Invariant cache hit.
[2025-05-31 23:36:21] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/265 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 2/267 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (OVERLAPS) 278/545 variables, 267/306 constraints. Problems are: Problem set: 0 solved, 277 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 49/355 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (OVERLAPS) 0/545 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 355 constraints, problems are : Problem set: 0 solved, 277 unsolved in 15137 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 267/267 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/265 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 2/267 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (OVERLAPS) 278/545 variables, 267/306 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 49/355 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 277/632 constraints. Problems are: Problem set: 0 solved, 277 unsolved
Detected timeout of ITS tools.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="DoubleExponent-PT-020"
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 DoubleExponent-PT-020, 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 r083-tall-174860079700063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 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 ;