fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of ITS-Tools for BugTracking-PT-q8m016

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 482262.00 0.00 0.00 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r016-smll-174853765400573.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 itstools
Input is BugTracking-PT-q8m016, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853765400573
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K 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 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K 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 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q8m016-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749208069111

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m016
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-06 11:07:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 11:07:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 11:07:52] [INFO ] Load time of PNML (sax parser for PT used): 1348 ms
[2025-06-06 11:07:52] [INFO ] Transformed 754 places.
[2025-06-06 11:07:52] [INFO ] Transformed 27370 transitions.
[2025-06-06 11:07:52] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1652 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 22 ms.
Deduced a syphon composed of 474 places in 172 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m016-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-06 11:07:53] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2025-06-06 11:07:53] [INFO ] Computed 10 invariants in 64 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, +inf, +inf, +inf]
RANDOM walk for 10000 steps (28 resets) in 141 ms. (70 steps per ms)
BEST_FIRST walk for 80007 steps (50 resets) in 312 ms. (255 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, +inf, +inf, +inf]
[2025-06-06 11:07:53] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2025-06-06 11:07:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 11:07:54] [INFO ] [Real]Absence check using 10 positive place invariants in 20 ms returned sat
[2025-06-06 11:07:55] [INFO ] [Real]Absence check using state equation in 1221 ms returned sat
[2025-06-06 11:07:55] [INFO ] State equation strengthened by 303 read => feed constraints.
[2025-06-06 11:07:55] [INFO ] [Real]Added 303 Read/Feed constraints in 167 ms returned sat
[2025-06-06 11:07:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 11:07:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-06 11:07:57] [INFO ] [Nat]Absence check using state equation in 1032 ms returned sat
[2025-06-06 11:07:57] [INFO ] [Nat]Added 303 Read/Feed constraints in 318 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:07:58] [INFO ] Deduced a trap composed of 15 places in 632 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:07:58] [INFO ] Deduced a trap composed of 19 places in 482 ms of which 14 ms to minimize.
[2025-06-06 11:07:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1513 ms
[2025-06-06 11:07:59] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 497 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:08:00] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 5 ms to minimize.
[2025-06-06 11:08:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 544 ms
[2025-06-06 11:08:00] [INFO ] Added : 8 causal constraints over 2 iterations in 2085 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 11:08:01] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-06 11:08:01] [INFO ] [Real]Absence check using state equation in 910 ms returned sat
[2025-06-06 11:08:02] [INFO ] [Real]Added 303 Read/Feed constraints in 105 ms returned sat
[2025-06-06 11:08:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 11:08:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-06 11:08:03] [INFO ] [Nat]Absence check using state equation in 928 ms returned sat
[2025-06-06 11:08:03] [INFO ] [Nat]Added 303 Read/Feed constraints in 300 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:08:04] [INFO ] Deduced a trap composed of 14 places in 687 ms of which 22 ms to minimize.
[2025-06-06 11:08:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 913 ms
[2025-06-06 11:08:05] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 731 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:08:06] [INFO ] Deduced a trap composed of 12 places in 545 ms of which 19 ms to minimize.
[2025-06-06 11:08:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 839 ms
[2025-06-06 11:08:07] [INFO ] Added : 9 causal constraints over 3 iterations in 2786 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 11:08:07] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-06 11:08:08] [INFO ] [Real]Absence check using state equation in 952 ms returned sat
[2025-06-06 11:08:08] [INFO ] [Real]Added 303 Read/Feed constraints in 110 ms returned sat
[2025-06-06 11:08:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 11:08:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-06 11:08:09] [INFO ] [Nat]Absence check using state equation in 924 ms returned sat
[2025-06-06 11:08:09] [INFO ] [Nat]Added 303 Read/Feed constraints in 263 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:08:10] [INFO ] Deduced a trap composed of 9 places in 773 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:08:11] [INFO ] Deduced a trap composed of 12 places in 482 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:08:11] [INFO ] Deduced a trap composed of 33 places in 347 ms of which 22 ms to minimize.
[2025-06-06 11:08:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2037 ms
[2025-06-06 11:08:12] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 339 ms.
[2025-06-06 11:08:13] [INFO ] Added : 13 causal constraints over 5 iterations in 1591 ms. Result :sat
Minimization took 117 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 11:08:13] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-06 11:08:14] [INFO ] [Real]Absence check using state equation in 922 ms returned sat
[2025-06-06 11:08:14] [INFO ] [Real]Added 303 Read/Feed constraints in 100 ms returned sat
[2025-06-06 11:08:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 11:08:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-06 11:08:15] [INFO ] [Nat]Absence check using state equation in 911 ms returned sat
[2025-06-06 11:08:15] [INFO ] [Nat]Added 303 Read/Feed constraints in 100 ms returned sat
[2025-06-06 11:08:16] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 345 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:08:18] [INFO ] Deduced a trap composed of 7 places in 760 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:08:19] [INFO ] Deduced a trap composed of 19 places in 712 ms of which 26 ms to minimize.
[2025-06-06 11:08:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1908 ms
[2025-06-06 11:08:19] [INFO ] Added : 10 causal constraints over 3 iterations in 3512 ms. Result :sat
Minimization took 306 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 11:08:19] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-06 11:08:20] [INFO ] [Real]Absence check using state equation in 908 ms returned sat
[2025-06-06 11:08:21] [INFO ] [Real]Added 303 Read/Feed constraints in 120 ms returned sat
[2025-06-06 11:08:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 11:08:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-06 11:08:22] [INFO ] [Nat]Absence check using state equation in 903 ms returned sat
[2025-06-06 11:08:22] [INFO ] [Nat]Added 303 Read/Feed constraints in 217 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:08:23] [INFO ] Deduced a trap composed of 14 places in 714 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:08:23] [INFO ] Deduced a trap composed of 50 places in 692 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:08:24] [INFO ] Deduced a trap composed of 39 places in 518 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:08:25] [INFO ] Deduced a trap composed of 51 places in 539 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:08:26] [INFO ] Deduced a trap composed of 40 places in 532 ms of which 18 ms to minimize.
[2025-06-06 11:08:26] [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 4
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:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 11:08:26] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-06 11:08:27] [INFO ] [Real]Absence check using state equation in 920 ms returned sat
[2025-06-06 11:08:27] [INFO ] [Real]Added 303 Read/Feed constraints in 100 ms returned sat
[2025-06-06 11:08:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 11:08:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-06 11:08:28] [INFO ] [Nat]Absence check using state equation in 919 ms returned sat
[2025-06-06 11:08:29] [INFO ] [Nat]Added 303 Read/Feed constraints in 330 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:08:29] [INFO ] Deduced a trap composed of 33 places in 474 ms of which 23 ms to minimize.
[2025-06-06 11:08:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 688 ms
[2025-06-06 11:08:30] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 318 ms.
[2025-06-06 11:08:30] [INFO ] Added : 7 causal constraints over 2 iterations in 992 ms. Result :sat
Minimization took 1372 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 11:08:32] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-06 11:08:33] [INFO ] [Real]Absence check using state equation in 916 ms returned sat
[2025-06-06 11:08:33] [INFO ] [Real]Added 303 Read/Feed constraints in 126 ms returned sat
[2025-06-06 11:08:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 11:08:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-06 11:08:34] [INFO ] [Nat]Absence check using state equation in 917 ms returned sat
[2025-06-06 11:08:34] [INFO ] [Nat]Added 303 Read/Feed constraints in 133 ms returned sat
[2025-06-06 11:08:34] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 342 ms.
[2025-06-06 11:08:35] [INFO ] Added : 2 causal constraints over 1 iterations in 762 ms. Result :sat
Minimization took 1327 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 11:08:36] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-06 11:08:37] [INFO ] [Real]Absence check using state equation in 855 ms returned sat
[2025-06-06 11:08:37] [INFO ] [Real]Added 303 Read/Feed constraints in 129 ms returned sat
[2025-06-06 11:08:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 11:08:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-06 11:08:38] [INFO ] [Nat]Absence check using state equation in 859 ms returned sat
[2025-06-06 11:08:39] [INFO ] [Nat]Added 303 Read/Feed constraints in 539 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:08:40] [INFO ] Deduced a trap composed of 12 places in 749 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:08:40] [INFO ] Deduced a trap composed of 17 places in 673 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:08:41] [INFO ] Deduced a trap composed of 19 places in 455 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:08:42] [INFO ] Deduced a trap composed of 33 places in 452 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:08:42] [INFO ] Deduced a trap composed of 33 places in 435 ms of which 21 ms to minimize.
[2025-06-06 11:08:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3419 ms
[2025-06-06 11:08:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:957)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, +inf, +inf, +inf]
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 469 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 484 ms. Remains : 269/280 places, 3871/3904 transitions.
[2025-06-06 11:08:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {2=1, 44=1, 3014=1, 3635=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {2=1, 3014=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 8) seen :[0, 0, 0, 0, 0, 1, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, +inf, +inf, +inf]
[2025-06-06 11:08:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2025-06-06 11:08:45] [INFO ] Computed 8 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, +inf, +inf, +inf]
RANDOM walk for 1000001 steps (2 resets) in 3448 ms. (289 steps per ms)
BEST_FIRST walk for 8000007 steps (16 resets) in 20512 ms. (389 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, +inf, +inf, +inf]
[2025-06-06 11:09:09] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-06-06 11:09:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:09:09] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-06 11:09:10] [INFO ] [Real]Absence check using state equation in 907 ms returned sat
[2025-06-06 11:09:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:09:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:09:11] [INFO ] [Nat]Absence check using state equation in 878 ms returned sat
[2025-06-06 11:09:11] [INFO ] State equation strengthened by 283 read => feed constraints.
[2025-06-06 11:09:11] [INFO ] [Nat]Added 283 Read/Feed constraints in 255 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:09:12] [INFO ] Deduced a trap composed of 23 places in 807 ms of which 32 ms to minimize.
[2025-06-06 11:09:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1028 ms
[2025-06-06 11:09:13] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 369 ms.
[2025-06-06 11:09:13] [INFO ] Added : 3 causal constraints over 2 iterations in 1088 ms. Result :sat
Minimization took 4508 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:09:18] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 11:09:19] [INFO ] [Real]Absence check using state equation in 961 ms returned sat
[2025-06-06 11:09:19] [INFO ] [Real]Added 283 Read/Feed constraints in 78 ms returned sat
[2025-06-06 11:09:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:09:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-06 11:09:20] [INFO ] [Nat]Absence check using state equation in 907 ms returned sat
[2025-06-06 11:09:20] [INFO ] [Nat]Added 283 Read/Feed constraints in 309 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:09:21] [INFO ] Deduced a trap composed of 14 places in 753 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:09:22] [INFO ] Deduced a trap composed of 26 places in 643 ms of which 27 ms to minimize.
[2025-06-06 11:09:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1805 ms
[2025-06-06 11:09:23] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 375 ms.
[2025-06-06 11:09:23] [INFO ] Added : 4 causal constraints over 1 iterations in 881 ms. Result :sat
Minimization took 4519 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:09:28] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-06 11:09:29] [INFO ] [Real]Absence check using state equation in 1012 ms returned sat
[2025-06-06 11:09:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:09:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-06 11:09:30] [INFO ] [Nat]Absence check using state equation in 950 ms returned sat
[2025-06-06 11:09:30] [INFO ] [Nat]Added 283 Read/Feed constraints in 338 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:09:31] [INFO ] Deduced a trap composed of 8 places in 1081 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:09:32] [INFO ] Deduced a trap composed of 13 places in 1007 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:09:36] [INFO ] Deduced a trap composed of 31 places in 3570 ms of which 2573 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:09:37] [INFO ] Deduced a trap composed of 47 places in 733 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:09:38] [INFO ] Deduced a trap composed of 48 places in 747 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:09:39] [INFO ] Deduced a trap composed of 48 places in 776 ms of which 35 ms to minimize.
[2025-06-06 11:09:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 8681 ms
[2025-06-06 11:09:39] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 365 ms.
[2025-06-06 11:09:40] [INFO ] Added : 4 causal constraints over 1 iterations in 820 ms. Result :sat
Minimization took 4502 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:09:44] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-06 11:09:45] [INFO ] [Real]Absence check using state equation in 950 ms returned sat
[2025-06-06 11:09:45] [INFO ] [Real]Added 283 Read/Feed constraints in 87 ms returned sat
[2025-06-06 11:09:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:09:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:09:46] [INFO ] [Nat]Absence check using state equation in 933 ms returned sat
[2025-06-06 11:09:47] [INFO ] [Nat]Added 283 Read/Feed constraints in 404 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:09:48] [INFO ] Deduced a trap composed of 7 places in 1017 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:09:49] [INFO ] Deduced a trap composed of 13 places in 897 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:09:50] [INFO ] Deduced a trap composed of 18 places in 797 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:09:51] [INFO ] Deduced a trap composed of 35 places in 762 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:09:52] [INFO ] Deduced a trap composed of 23 places in 745 ms of which 28 ms to minimize.
[2025-06-06 11:09:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4944 ms
[2025-06-06 11:09:52] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 336 ms.
[2025-06-06 11:09:53] [INFO ] Added : 6 causal constraints over 2 iterations in 1013 ms. Result :sat
Minimization took 4517 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:09:57] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-06 11:09:58] [INFO ] [Real]Absence check using state equation in 952 ms returned sat
[2025-06-06 11:09:59] [INFO ] [Real]Added 283 Read/Feed constraints in 93 ms returned sat
[2025-06-06 11:09:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:09:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:10:00] [INFO ] [Nat]Absence check using state equation in 941 ms returned sat
[2025-06-06 11:10:00] [INFO ] [Nat]Added 283 Read/Feed constraints in 331 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:10:01] [INFO ] Deduced a trap composed of 23 places in 463 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:10:01] [INFO ] Deduced a trap composed of 38 places in 457 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:10:02] [INFO ] Deduced a trap composed of 49 places in 437 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:10:02] [INFO ] Deduced a trap composed of 49 places in 485 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:10:03] [INFO ] Deduced a trap composed of 35 places in 452 ms of which 23 ms to minimize.
[2025-06-06 11:10:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3006 ms
[2025-06-06 11:10:03] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 356 ms.
[2025-06-06 11:10:04] [INFO ] Added : 3 causal constraints over 1 iterations in 844 ms. Result :sat
Minimization took 4690 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:10:09] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:10:10] [INFO ] [Real]Absence check using state equation in 933 ms returned sat
[2025-06-06 11:10:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:10:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-06 11:10:11] [INFO ] [Nat]Absence check using state equation in 933 ms returned sat
[2025-06-06 11:10:11] [INFO ] [Nat]Added 283 Read/Feed constraints in 583 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:10:12] [INFO ] Deduced a trap composed of 14 places in 487 ms of which 16 ms to minimize.
[2025-06-06 11:10:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 719 ms
[2025-06-06 11:10:12] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 327 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:10:14] [INFO ] Deduced a trap composed of 17 places in 809 ms of which 30 ms to minimize.
[2025-06-06 11:10:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1109 ms
[2025-06-06 11:10:14] [INFO ] Added : 10 causal constraints over 3 iterations in 2469 ms. Result :sat
Minimization took 4506 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:10:19] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-06 11:10:20] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2025-06-06 11:10:20] [INFO ] [Real]Added 283 Read/Feed constraints in 113 ms returned sat
[2025-06-06 11:10:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:10:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-06 11:10:21] [INFO ] [Nat]Absence check using state equation in 930 ms returned sat
[2025-06-06 11:10:22] [INFO ] [Nat]Added 283 Read/Feed constraints in 448 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:10:22] [INFO ] Deduced a trap composed of 18 places in 543 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:10:23] [INFO ] Deduced a trap composed of 23 places in 479 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:10:24] [INFO ] Deduced a trap composed of 35 places in 549 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:10:24] [INFO ] Deduced a trap composed of 47 places in 446 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:10:25] [INFO ] Deduced a trap composed of 55 places in 376 ms of which 10 ms to minimize.
[2025-06-06 11:10:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3107 ms
[2025-06-06 11:10:25] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 378 ms.
[2025-06-06 11:10:26] [INFO ] Added : 8 causal constraints over 2 iterations in 1029 ms. Result :sat
Minimization took 4508 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:10:30] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-06 11:10:31] [INFO ] [Real]Absence check using state equation in 946 ms returned sat
[2025-06-06 11:10:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:10:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-06 11:10:32] [INFO ] [Nat]Absence check using state equation in 946 ms returned sat
[2025-06-06 11:10:33] [INFO ] [Nat]Added 283 Read/Feed constraints in 324 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:10:34] [INFO ] Deduced a trap composed of 35 places in 853 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:10:35] [INFO ] Deduced a trap composed of 23 places in 742 ms of which 25 ms to minimize.
[2025-06-06 11:10:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1953 ms
[2025-06-06 11:10:35] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 350 ms.
[2025-06-06 11:10:36] [INFO ] Added : 2 causal constraints over 1 iterations in 886 ms. Result :sat
Minimization took 4517 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, +inf, +inf, +inf]
Support contains 8 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 85 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 115 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2025-06-06 11:10:40] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-06-06 11:10:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:10:41] [INFO ] Implicit Places using invariants in 903 ms returned []
[2025-06-06 11:10:41] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-06-06 11:10:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:10:42] [INFO ] State equation strengthened by 283 read => feed constraints.
[2025-06-06 11:10:46] [INFO ] Implicit Places using invariants and state equation in 4667 ms returned []
Implicit Place search using SMT with State Equation took 5573 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 11:10:46] [INFO ] Redundant transitions in 408 ms returned []
Running 3870 sub problems to find dead transitions.
[2025-06-06 11:10:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-06-06 11:10:46] [INFO ] Invariant cache hit.
[2025-06-06 11:10:47] [INFO ] State equation strengthened by 283 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/3968 variables, and 8 constraints, problems are : Problem set: 0 solved, 3870 unsolved in 30160 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3870/598 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3870 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:11:48] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:11:49] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 4 ms to minimize.
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1849 is UNSAT
Problem TDEAD1850 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1868 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1937 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1952 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1955 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD2044 is UNSAT
Problem TDEAD2045 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2048 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2050 is UNSAT
Problem TDEAD2051 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:11:51] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 7 ms to minimize.
Problem TDEAD2052 is UNSAT
Problem TDEAD2053 is UNSAT
Problem TDEAD2054 is UNSAT
Problem TDEAD2055 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2057 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2063 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2070 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2072 is UNSAT
Problem TDEAD2073 is UNSAT
Problem TDEAD2074 is UNSAT
Problem TDEAD2075 is UNSAT
Problem TDEAD2076 is UNSAT
Problem TDEAD2081 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2083 is UNSAT
Problem TDEAD2084 is UNSAT
Problem TDEAD2085 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2088 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:11:51] [INFO ] Deduced a trap composed of 8 places in 285 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:11:52] [INFO ] Deduced a trap composed of 17 places in 298 ms of which 10 ms to minimize.
Problem TDEAD2097 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2100 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2102 is UNSAT
Problem TDEAD2103 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2107 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2120 is UNSAT
Problem TDEAD2121 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2123 is UNSAT
Problem TDEAD2124 is UNSAT
Problem TDEAD2125 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2127 is UNSAT
Problem TDEAD2132 is UNSAT
Problem TDEAD2133 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2138 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2141 is UNSAT
Problem TDEAD2142 is UNSAT
Problem TDEAD2143 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2145 is UNSAT
Problem TDEAD2146 is UNSAT
Problem TDEAD2147 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2162 is UNSAT
Problem TDEAD2167 is UNSAT
Problem TDEAD2168 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2173 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2176 is UNSAT
Problem TDEAD2177 is UNSAT
Problem TDEAD2178 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2195 is UNSAT
Problem TDEAD2196 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2215 is UNSAT
Problem TDEAD2216 is UNSAT
Problem TDEAD2217 is UNSAT
Problem TDEAD2221 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2228 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2231 is UNSAT
Problem TDEAD2232 is UNSAT
Problem TDEAD2373 is UNSAT
Problem TDEAD2374 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2377 is UNSAT
Problem TDEAD2378 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2388 is UNSAT
Problem TDEAD2389 is UNSAT
Problem TDEAD2390 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
Problem TDEAD2402 is UNSAT
Problem TDEAD2403 is UNSAT
Problem TDEAD2404 is UNSAT
Problem TDEAD2405 is UNSAT
Problem TDEAD2406 is UNSAT
Problem TDEAD2407 is UNSAT
Problem TDEAD2408 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2410 is UNSAT
Problem TDEAD2411 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD2413 is UNSAT
Problem TDEAD2414 is UNSAT
Problem TDEAD2415 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2417 is UNSAT
Problem TDEAD2418 is UNSAT
Problem TDEAD2419 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2421 is UNSAT
Problem TDEAD2422 is UNSAT
Problem TDEAD2423 is UNSAT
Problem TDEAD2424 is UNSAT
Problem TDEAD2425 is UNSAT
Problem TDEAD2426 is UNSAT
Problem TDEAD2427 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2429 is UNSAT
Problem TDEAD2430 is UNSAT
Problem TDEAD2431 is UNSAT
Problem TDEAD2432 is UNSAT
Problem TDEAD2433 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2435 is UNSAT
Problem TDEAD2436 is UNSAT
Problem TDEAD2437 is UNSAT
Problem TDEAD2438 is UNSAT
Problem TDEAD2439 is UNSAT
Problem TDEAD2440 is UNSAT
Problem TDEAD2441 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2443 is UNSAT
Problem TDEAD2444 is UNSAT
Problem TDEAD2445 is UNSAT
Problem TDEAD2446 is UNSAT
Problem TDEAD2447 is UNSAT
Problem TDEAD2448 is UNSAT
Problem TDEAD2449 is UNSAT
Problem TDEAD2450 is UNSAT
Problem TDEAD2451 is UNSAT
Problem TDEAD2452 is UNSAT
Problem TDEAD2453 is UNSAT
Problem TDEAD2454 is UNSAT
Problem TDEAD2455 is UNSAT
Problem TDEAD2456 is UNSAT
Problem TDEAD2457 is UNSAT
Problem TDEAD2458 is UNSAT
Problem TDEAD2459 is UNSAT
Problem TDEAD2460 is UNSAT
Problem TDEAD2461 is UNSAT
Problem TDEAD2462 is UNSAT
Problem TDEAD2463 is UNSAT
Problem TDEAD2464 is UNSAT
Problem TDEAD2465 is UNSAT
Problem TDEAD2466 is UNSAT
Problem TDEAD2467 is UNSAT
Problem TDEAD2468 is UNSAT
Problem TDEAD2469 is UNSAT
Problem TDEAD2470 is UNSAT
Problem TDEAD2471 is UNSAT
Problem TDEAD2472 is UNSAT
Problem TDEAD2473 is UNSAT
Problem TDEAD2474 is UNSAT
Problem TDEAD2475 is UNSAT
Problem TDEAD2476 is UNSAT
Problem TDEAD2477 is UNSAT
Problem TDEAD2478 is UNSAT
Problem TDEAD2479 is UNSAT
Problem TDEAD2480 is UNSAT
Problem TDEAD2481 is UNSAT
Problem TDEAD2482 is UNSAT
Problem TDEAD2483 is UNSAT
Problem TDEAD2484 is UNSAT
Problem TDEAD2485 is UNSAT
Problem TDEAD2486 is UNSAT
Problem TDEAD2487 is UNSAT
Problem TDEAD2488 is UNSAT
Problem TDEAD2489 is UNSAT
Problem TDEAD2490 is UNSAT
Problem TDEAD2491 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2493 is UNSAT
Problem TDEAD2494 is UNSAT
Problem TDEAD2495 is UNSAT
Problem TDEAD2496 is UNSAT
Problem TDEAD2497 is UNSAT
Problem TDEAD2498 is UNSAT
Problem TDEAD2499 is UNSAT
Problem TDEAD2500 is UNSAT
Problem TDEAD2501 is UNSAT
Problem TDEAD2502 is UNSAT
Problem TDEAD2503 is UNSAT
Problem TDEAD2504 is UNSAT
Problem TDEAD2505 is UNSAT
Problem TDEAD2506 is UNSAT
Problem TDEAD2507 is UNSAT
Problem TDEAD2508 is UNSAT
Problem TDEAD2509 is UNSAT
Problem TDEAD2510 is UNSAT
Problem TDEAD2511 is UNSAT
Problem TDEAD2512 is UNSAT
Problem TDEAD2513 is UNSAT
Problem TDEAD2514 is UNSAT
Problem TDEAD2515 is UNSAT
Problem TDEAD2516 is UNSAT
Problem TDEAD2517 is UNSAT
Problem TDEAD2518 is UNSAT
Problem TDEAD2519 is UNSAT
Problem TDEAD2520 is UNSAT
Problem TDEAD2521 is UNSAT
Problem TDEAD2522 is UNSAT
Problem TDEAD2523 is UNSAT
Problem TDEAD2524 is UNSAT
Problem TDEAD2525 is UNSAT
Problem TDEAD2526 is UNSAT
Problem TDEAD2527 is UNSAT
Problem TDEAD2528 is UNSAT
Problem TDEAD2529 is UNSAT
Problem TDEAD2530 is UNSAT
Problem TDEAD2531 is UNSAT
Problem TDEAD2532 is UNSAT
Problem TDEAD2533 is UNSAT
Problem TDEAD2534 is UNSAT
Problem TDEAD2535 is UNSAT
Problem TDEAD2536 is UNSAT
Problem TDEAD2537 is UNSAT
Problem TDEAD2538 is UNSAT
Problem TDEAD2539 is UNSAT
Problem TDEAD2540 is UNSAT
Problem TDEAD2541 is UNSAT
Problem TDEAD2542 is UNSAT
Problem TDEAD2543 is UNSAT
Problem TDEAD2544 is UNSAT
Problem TDEAD2545 is UNSAT
Problem TDEAD2546 is UNSAT
Problem TDEAD2547 is UNSAT
Problem TDEAD2548 is UNSAT
Problem TDEAD2549 is UNSAT
Problem TDEAD2550 is UNSAT
Problem TDEAD2551 is UNSAT
Problem TDEAD2552 is UNSAT
Problem TDEAD2553 is UNSAT
Problem TDEAD2554 is UNSAT
Problem TDEAD2555 is UNSAT
Problem TDEAD2556 is UNSAT
Problem TDEAD2557 is UNSAT
Problem TDEAD2558 is UNSAT
Problem TDEAD2559 is UNSAT
Problem TDEAD2560 is UNSAT
Problem TDEAD2561 is UNSAT
Problem TDEAD2562 is UNSAT
Problem TDEAD2563 is UNSAT
Problem TDEAD2564 is UNSAT
Problem TDEAD2565 is UNSAT
Problem TDEAD2566 is UNSAT
Problem TDEAD2567 is UNSAT
Problem TDEAD2568 is UNSAT
Problem TDEAD2569 is UNSAT
Problem TDEAD2570 is UNSAT
Problem TDEAD2571 is UNSAT
Problem TDEAD2572 is UNSAT
Problem TDEAD2573 is UNSAT
Problem TDEAD2574 is UNSAT
Problem TDEAD2575 is UNSAT
Problem TDEAD2576 is UNSAT
Problem TDEAD2577 is UNSAT
Problem TDEAD2578 is UNSAT
Problem TDEAD2579 is UNSAT
Problem TDEAD2580 is UNSAT
Problem TDEAD2581 is UNSAT
Problem TDEAD2582 is UNSAT
Problem TDEAD2583 is UNSAT
Problem TDEAD2584 is UNSAT
Problem TDEAD2585 is UNSAT
Problem TDEAD2586 is UNSAT
Problem TDEAD2587 is UNSAT
Problem TDEAD2588 is UNSAT
Problem TDEAD2589 is UNSAT
Problem TDEAD2590 is UNSAT
Problem TDEAD2591 is UNSAT
Problem TDEAD2592 is UNSAT
Problem TDEAD2593 is UNSAT
Problem TDEAD2594 is UNSAT
Problem TDEAD2595 is UNSAT
Problem TDEAD2596 is UNSAT
Problem TDEAD2597 is UNSAT
Problem TDEAD2598 is UNSAT
Problem TDEAD2599 is UNSAT
Problem TDEAD2600 is UNSAT
Problem TDEAD2601 is UNSAT
Problem TDEAD2602 is UNSAT
Problem TDEAD2603 is UNSAT
Problem TDEAD2604 is UNSAT
Problem TDEAD2605 is UNSAT
Problem TDEAD2606 is UNSAT
Problem TDEAD2607 is UNSAT
Problem TDEAD2608 is UNSAT
Problem TDEAD2609 is UNSAT
Problem TDEAD2610 is UNSAT
Problem TDEAD2611 is UNSAT
Problem TDEAD2612 is UNSAT
Problem TDEAD2613 is UNSAT
Problem TDEAD2614 is UNSAT
Problem TDEAD2615 is UNSAT
Problem TDEAD2616 is UNSAT
Problem TDEAD2617 is UNSAT
Problem TDEAD2618 is UNSAT
Problem TDEAD2619 is UNSAT
Problem TDEAD2620 is UNSAT
Problem TDEAD2621 is UNSAT
Problem TDEAD2622 is UNSAT
Problem TDEAD2623 is UNSAT
Problem TDEAD2624 is UNSAT
Problem TDEAD2625 is UNSAT
Problem TDEAD2626 is UNSAT
Problem TDEAD2627 is UNSAT
Problem TDEAD2628 is UNSAT
Problem TDEAD2629 is UNSAT
Problem TDEAD2630 is UNSAT
Problem TDEAD2631 is UNSAT
Problem TDEAD2632 is UNSAT
Problem TDEAD2633 is UNSAT
Problem TDEAD2634 is UNSAT
Problem TDEAD2635 is UNSAT
Problem TDEAD2636 is UNSAT
Problem TDEAD2637 is UNSAT
Problem TDEAD2638 is UNSAT
Problem TDEAD2639 is UNSAT
Problem TDEAD2640 is UNSAT
Problem TDEAD2641 is UNSAT
Problem TDEAD2642 is UNSAT
Problem TDEAD2643 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2648 is UNSAT
Problem TDEAD2649 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Problem TDEAD2657 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2659 is UNSAT
Problem TDEAD2660 is UNSAT
Problem TDEAD2661 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2663 is UNSAT
Problem TDEAD2664 is UNSAT
Problem TDEAD2665 is UNSAT
Problem TDEAD2666 is UNSAT
Problem TDEAD2667 is UNSAT
Problem TDEAD2668 is UNSAT
Problem TDEAD2669 is UNSAT
Problem TDEAD2670 is UNSAT
Problem TDEAD2671 is UNSAT
Problem TDEAD2672 is UNSAT
Problem TDEAD2673 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2678 is UNSAT
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/3968 variables, and 13 constraints, problems are : Problem set: 776 solved, 3094 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3272/598 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 70489ms problems are : Problem set: 776 solved, 3094 unsolved
Search for dead transitions found 776 dead transitions in 70549ms
Found 776 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 776 transitions
Dead transitions reduction (with SMT) removed 776 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 269/269 places, 3095/3871 transitions.
Reduce places removed 13 places and 348 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 256 transition count 2747
Reduce places removed 9 places and 170 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 22 place count 247 transition count 2577
Reduce places removed 9 places and 290 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 31 place count 238 transition count 2287
Reduce places removed 7 places and 167 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 38 place count 231 transition count 2120
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 50 place count 219 transition count 2096
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 4 with 12 rules applied. Total rules applied 62 place count 219 transition count 2096
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 74 place count 207 transition count 1988
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 4 with 12 rules applied. Total rules applied 86 place count 207 transition count 1988
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 86 rules in 105 ms. Remains 207 /269 variables (removed 62) and now considering 1988/3095 (removed 1107) transitions.
[2025-06-06 11:11:57] [INFO ] Flow matrix only has 1839 transitions (discarded 149 similar events)
// Phase 1: matrix 1839 rows 207 cols
[2025-06-06 11:11:57] [INFO ] Computed 9 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:11:58] [INFO ] Implicit Places using invariants in 602 ms returned []
[2025-06-06 11:11:58] [INFO ] Flow matrix only has 1839 transitions (discarded 149 similar events)
[2025-06-06 11:11:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:11:58] [INFO ] State equation strengthened by 175 read => feed constraints.
[2025-06-06 11:12:00] [INFO ] Implicit Places using invariants and state equation in 2290 ms returned []
Implicit Place search using SMT with State Equation took 2895 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/269 places, 1988/3871 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 79710 ms. Remains : 207/269 places, 1988/3871 transitions.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q8m016-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 11:12:00] [INFO ] Flow matrix only has 1839 transitions (discarded 149 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {6=1, 1383=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {4=1, 1383=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 7) seen :[0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, +inf, +inf, +inf]
[2025-06-06 11:12:01] [INFO ] Flow matrix only has 1839 transitions (discarded 149 similar events)
// Phase 1: matrix 1839 rows 206 cols
[2025-06-06 11:12:01] [INFO ] Computed 8 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, +inf, +inf, +inf]
RANDOM walk for 1000008 steps (2 resets) in 2618 ms. (381 steps per ms)
FORMULA BugTracking-PT-q8m016-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6000006 steps (12 resets) in 12624 ms. (475 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
[2025-06-06 11:12:16] [INFO ] Flow matrix only has 1839 transitions (discarded 149 similar events)
[2025-06-06 11:12:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:12:16] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:12:17] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2025-06-06 11:12:17] [INFO ] State equation strengthened by 175 read => feed constraints.
[2025-06-06 11:12:17] [INFO ] [Real]Added 175 Read/Feed constraints in 59 ms returned sat
[2025-06-06 11:12:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:12:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-06 11:12:17] [INFO ] [Nat]Absence check using state equation in 506 ms returned sat
[2025-06-06 11:12:18] [INFO ] [Nat]Added 175 Read/Feed constraints in 132 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:12:18] [INFO ] Deduced a trap composed of 21 places in 434 ms of which 15 ms to minimize.
[2025-06-06 11:12:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 544 ms
[2025-06-06 11:12:18] [INFO ] Computed and/alt/rep : 452/1676/452 causal constraints (skipped 1386 transitions) in 161 ms.
[2025-06-06 11:12:19] [INFO ] Added : 2 causal constraints over 1 iterations in 387 ms. Result :sat
Minimization took 1411 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:12:20] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:12:21] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2025-06-06 11:12:21] [INFO ] [Real]Added 175 Read/Feed constraints in 45 ms returned sat
[2025-06-06 11:12:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:12:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:12:21] [INFO ] [Nat]Absence check using state equation in 483 ms returned sat
[2025-06-06 11:12:21] [INFO ] [Nat]Added 175 Read/Feed constraints in 98 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:12:22] [INFO ] Deduced a trap composed of 10 places in 434 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:12:22] [INFO ] Deduced a trap composed of 21 places in 467 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:12:23] [INFO ] Deduced a trap composed of 33 places in 461 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:12:23] [INFO ] Deduced a trap composed of 50 places in 392 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:12:24] [INFO ] Deduced a trap composed of 37 places in 430 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:12:24] [INFO ] Deduced a trap composed of 38 places in 425 ms of which 32 ms to minimize.
[2025-06-06 11:12:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3167 ms
[2025-06-06 11:12:25] [INFO ] Computed and/alt/rep : 452/1676/452 causal constraints (skipped 1386 transitions) in 162 ms.
[2025-06-06 11:12:25] [INFO ] Added : 7 causal constraints over 2 iterations in 566 ms. Result :sat
Minimization took 1521 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:12:27] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:12:27] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2025-06-06 11:12:27] [INFO ] [Real]Added 175 Read/Feed constraints in 62 ms returned sat
[2025-06-06 11:12:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:12:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:12:28] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2025-06-06 11:12:28] [INFO ] [Nat]Added 175 Read/Feed constraints in 134 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:12:29] [INFO ] Deduced a trap composed of 7 places in 334 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:12:29] [INFO ] Deduced a trap composed of 21 places in 326 ms of which 17 ms to minimize.
[2025-06-06 11:12:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 817 ms
[2025-06-06 11:12:29] [INFO ] Computed and/alt/rep : 452/1676/452 causal constraints (skipped 1386 transitions) in 155 ms.
[2025-06-06 11:12:29] [INFO ] Added : 3 causal constraints over 1 iterations in 377 ms. Result :sat
Minimization took 1346 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:12:31] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:12:31] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2025-06-06 11:12:31] [INFO ] [Real]Added 175 Read/Feed constraints in 88 ms returned sat
[2025-06-06 11:12:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:12:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-06 11:12:32] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2025-06-06 11:12:32] [INFO ] [Nat]Added 175 Read/Feed constraints in 116 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:12:32] [INFO ] Deduced a trap composed of 12 places in 270 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:12:33] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 12 ms to minimize.
[2025-06-06 11:12:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 704 ms
[2025-06-06 11:12:33] [INFO ] Computed and/alt/rep : 452/1676/452 causal constraints (skipped 1386 transitions) in 153 ms.
[2025-06-06 11:12:33] [INFO ] Added : 9 causal constraints over 2 iterations in 536 ms. Result :sat
Minimization took 1436 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:12:35] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:12:35] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2025-06-06 11:12:36] [INFO ] [Real]Added 175 Read/Feed constraints in 91 ms returned sat
[2025-06-06 11:12:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:12:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:12:36] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2025-06-06 11:12:36] [INFO ] [Nat]Added 175 Read/Feed constraints in 113 ms returned sat
[2025-06-06 11:12:37] [INFO ] Computed and/alt/rep : 452/1676/452 causal constraints (skipped 1386 transitions) in 154 ms.
[2025-06-06 11:12:37] [INFO ] Added : 2 causal constraints over 1 iterations in 372 ms. Result :sat
Minimization took 1352 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:12:38] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:12:39] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2025-06-06 11:12:39] [INFO ] [Real]Added 175 Read/Feed constraints in 61 ms returned sat
[2025-06-06 11:12:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:12:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:12:39] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2025-06-06 11:12:40] [INFO ] [Nat]Added 175 Read/Feed constraints in 129 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:12:40] [INFO ] Deduced a trap composed of 21 places in 434 ms of which 14 ms to minimize.
[2025-06-06 11:12:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 542 ms
[2025-06-06 11:12:40] [INFO ] Computed and/alt/rep : 452/1676/452 causal constraints (skipped 1386 transitions) in 150 ms.
[2025-06-06 11:12:40] [INFO ] Added : 3 causal constraints over 1 iterations in 379 ms. Result :sat
Minimization took 1358 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
Support contains 6 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 1988/1988 transitions.
Applied a total of 0 rules in 35 ms. Remains 206 /206 variables (removed 0) and now considering 1988/1988 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 206/206 places, 1988/1988 transitions.
[2025-06-06 11:12:42] [INFO ] Flow matrix only has 1839 transitions (discarded 149 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {6=1, 1383=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {4=1, 1383=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 6) seen :[0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
[2025-06-06 11:12:43] [INFO ] Flow matrix only has 1839 transitions (discarded 149 similar events)
[2025-06-06 11:12:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
RANDOM walk for 1000007 steps (2 resets) in 2861 ms. (349 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 12126 ms. (494 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
[2025-06-06 11:12:58] [INFO ] Flow matrix only has 1839 transitions (discarded 149 similar events)
[2025-06-06 11:12:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:12:58] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:12:59] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2025-06-06 11:12:59] [INFO ] State equation strengthened by 175 read => feed constraints.
[2025-06-06 11:12:59] [INFO ] [Real]Added 175 Read/Feed constraints in 59 ms returned sat
[2025-06-06 11:12:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:12:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:12:59] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2025-06-06 11:12:59] [INFO ] [Nat]Added 175 Read/Feed constraints in 134 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:13:00] [INFO ] Deduced a trap composed of 21 places in 459 ms of which 15 ms to minimize.
[2025-06-06 11:13:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 566 ms
[2025-06-06 11:13:00] [INFO ] Computed and/alt/rep : 452/1676/452 causal constraints (skipped 1386 transitions) in 150 ms.
[2025-06-06 11:13:00] [INFO ] Added : 2 causal constraints over 1 iterations in 374 ms. Result :sat
Minimization took 1358 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:13:02] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-06 11:13:02] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2025-06-06 11:13:03] [INFO ] [Real]Added 175 Read/Feed constraints in 49 ms returned sat
[2025-06-06 11:13:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:13:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:13:03] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2025-06-06 11:13:03] [INFO ] [Nat]Added 175 Read/Feed constraints in 103 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:13:04] [INFO ] Deduced a trap composed of 10 places in 409 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:13:04] [INFO ] Deduced a trap composed of 21 places in 475 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:13:05] [INFO ] Deduced a trap composed of 33 places in 487 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:13:05] [INFO ] Deduced a trap composed of 50 places in 469 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:13:06] [INFO ] Deduced a trap composed of 37 places in 485 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:13:07] [INFO ] Deduced a trap composed of 38 places in 485 ms of which 35 ms to minimize.
[2025-06-06 11:13:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3382 ms
[2025-06-06 11:13:07] [INFO ] Computed and/alt/rep : 452/1676/452 causal constraints (skipped 1386 transitions) in 173 ms.
[2025-06-06 11:13:07] [INFO ] Added : 7 causal constraints over 2 iterations in 562 ms. Result :sat
Minimization took 1482 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:13:09] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 11:13:09] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2025-06-06 11:13:09] [INFO ] [Real]Added 175 Read/Feed constraints in 58 ms returned sat
[2025-06-06 11:13:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:13:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:13:10] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2025-06-06 11:13:10] [INFO ] [Nat]Added 175 Read/Feed constraints in 131 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:13:11] [INFO ] Deduced a trap composed of 7 places in 356 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:13:11] [INFO ] Deduced a trap composed of 21 places in 368 ms of which 18 ms to minimize.
[2025-06-06 11:13:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 874 ms
[2025-06-06 11:13:11] [INFO ] Computed and/alt/rep : 452/1676/452 causal constraints (skipped 1386 transitions) in 170 ms.
[2025-06-06 11:13:11] [INFO ] Added : 3 causal constraints over 1 iterations in 395 ms. Result :sat
Minimization took 1323 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:13:13] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:13:13] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2025-06-06 11:13:14] [INFO ] [Real]Added 175 Read/Feed constraints in 98 ms returned sat
[2025-06-06 11:13:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:13:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:13:14] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2025-06-06 11:13:14] [INFO ] [Nat]Added 175 Read/Feed constraints in 110 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:13:15] [INFO ] Deduced a trap composed of 12 places in 289 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:13:15] [INFO ] Deduced a trap composed of 24 places in 281 ms of which 12 ms to minimize.
[2025-06-06 11:13:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 742 ms
[2025-06-06 11:13:15] [INFO ] Computed and/alt/rep : 452/1676/452 causal constraints (skipped 1386 transitions) in 165 ms.
[2025-06-06 11:13:16] [INFO ] Added : 9 causal constraints over 2 iterations in 535 ms. Result :sat
Minimization took 1346 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:13:17] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 11:13:17] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2025-06-06 11:13:18] [INFO ] [Real]Added 175 Read/Feed constraints in 93 ms returned sat
[2025-06-06 11:13:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:13:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-06 11:13:18] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2025-06-06 11:13:18] [INFO ] [Nat]Added 175 Read/Feed constraints in 107 ms returned sat
[2025-06-06 11:13:19] [INFO ] Computed and/alt/rep : 452/1676/452 causal constraints (skipped 1386 transitions) in 154 ms.
[2025-06-06 11:13:19] [INFO ] Added : 2 causal constraints over 1 iterations in 369 ms. Result :sat
Minimization took 1282 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:13:20] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:13:21] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2025-06-06 11:13:21] [INFO ] [Real]Added 175 Read/Feed constraints in 60 ms returned sat
[2025-06-06 11:13:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:13:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-06 11:13:21] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2025-06-06 11:13:21] [INFO ] [Nat]Added 175 Read/Feed constraints in 140 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:13:22] [INFO ] Deduced a trap composed of 21 places in 371 ms of which 13 ms to minimize.
[2025-06-06 11:13:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 481 ms
[2025-06-06 11:13:22] [INFO ] Computed and/alt/rep : 452/1676/452 causal constraints (skipped 1386 transitions) in 164 ms.
[2025-06-06 11:13:22] [INFO ] Added : 3 causal constraints over 1 iterations in 397 ms. Result :sat
Minimization took 1343 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
Support contains 6 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 1988/1988 transitions.
Applied a total of 0 rules in 36 ms. Remains 206 /206 variables (removed 0) and now considering 1988/1988 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 206/206 places, 1988/1988 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 1988/1988 transitions.
Applied a total of 0 rules in 35 ms. Remains 206 /206 variables (removed 0) and now considering 1988/1988 (removed 0) transitions.
[2025-06-06 11:13:24] [INFO ] Flow matrix only has 1839 transitions (discarded 149 similar events)
[2025-06-06 11:13:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:13:25] [INFO ] Implicit Places using invariants in 531 ms returned []
[2025-06-06 11:13:25] [INFO ] Flow matrix only has 1839 transitions (discarded 149 similar events)
[2025-06-06 11:13:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:13:25] [INFO ] State equation strengthened by 175 read => feed constraints.
[2025-06-06 11:13:27] [INFO ] Implicit Places using invariants and state equation in 2314 ms returned []
Implicit Place search using SMT with State Equation took 2847 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 11:13:27] [INFO ] Redundant transitions in 179 ms returned []
Running 1987 sub problems to find dead transitions.
[2025-06-06 11:13:27] [INFO ] Flow matrix only has 1839 transitions (discarded 149 similar events)
[2025-06-06 11:13:27] [INFO ] Invariant cache hit.
[2025-06-06 11:13:27] [INFO ] State equation strengthened by 175 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1987 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:13:52] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:13:53] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:13:55] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 5 ms to minimize.
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1395 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:13:55] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 9 ms to minimize.
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:13:56] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 10 ms to minimize.
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:13:56] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 6 ms to minimize.
Problem TDEAD1440 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1464 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:13:56] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 8 ms to minimize.
Problem TDEAD1465 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:13:56] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 7 ms to minimize.
Problem TDEAD1477 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1500 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:00] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 4 ms to minimize.
Problem TDEAD1944 is UNSAT
Problem TDEAD1956 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:00] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 3 ms to minimize.
Problem TDEAD1967 is UNSAT
Problem TDEAD1968 is UNSAT
Problem TDEAD1971 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD1980 is UNSAT
Problem TDEAD1981 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1985 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 10/18 constraints. Problems are: Problem set: 175 solved, 1812 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 206/2045 variables, and 18 constraints, problems are : Problem set: 175 solved, 1812 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/206 constraints, ReadFeed: 0/175 constraints, PredecessorRefiner: 1987/1344 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 175 solved, 1812 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 7/7 constraints. Problems are: Problem set: 175 solved, 1812 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 10/17 constraints. Problems are: Problem set: 175 solved, 1812 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/17 constraints. Problems are: Problem set: 175 solved, 1812 unsolved
At refinement iteration 3 (OVERLAPS) 11/206 variables, 1/18 constraints. Problems are: Problem set: 175 solved, 1812 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 206/2045 variables, and 18 constraints, problems are : Problem set: 175 solved, 1812 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/206 constraints, ReadFeed: 0/175 constraints, PredecessorRefiner: 643/1344 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64703ms problems are : Problem set: 175 solved, 1812 unsolved
Search for dead transitions found 175 dead transitions in 64720ms
Found 175 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 175 transitions
Dead transitions reduction (with SMT) removed 175 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 206/206 places, 1813/1988 transitions.
Graph (complete) has 2301 edges and 206 vertex of which 196 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Reduce places removed 22 places and 544 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 174 transition count 1269
Reduce places removed 17 places and 225 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 40 place count 157 transition count 1044
Reduce places removed 9 places and 115 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 49 place count 148 transition count 929
Reduce places removed 5 places and 34 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 54 place count 143 transition count 895
Reduce places removed 3 places and 64 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 140 transition count 831
Reduce places removed 0 places and 15 transitions.
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 65 place count 132 transition count 732
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 3 places and 39 transitions.
Iterating global reduction 5 with 11 rules applied. Total rules applied 76 place count 129 transition count 693
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 76 rules in 42 ms. Remains 129 /206 variables (removed 77) and now considering 693/1813 (removed 1120) transitions.
[2025-06-06 11:14:32] [INFO ] Flow matrix only has 612 transitions (discarded 81 similar events)
// Phase 1: matrix 612 rows 129 cols
[2025-06-06 11:14:32] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:14:32] [INFO ] Implicit Places using invariants in 272 ms returned []
[2025-06-06 11:14:32] [INFO ] Flow matrix only has 612 transitions (discarded 81 similar events)
[2025-06-06 11:14:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:14:32] [INFO ] State equation strengthened by 82 read => feed constraints.
[2025-06-06 11:14:34] [INFO ] Implicit Places using invariants and state equation in 1763 ms returned []
Implicit Place search using SMT with State Equation took 2037 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 129/206 places, 693/1988 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 69884 ms. Remains : 129/206 places, 693/1988 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q8m016-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 11:14:34] [INFO ] Flow matrix only has 612 transitions (discarded 81 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {3=1, 43=1, 514=1, 584=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 514=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :[0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
[2025-06-06 11:14:34] [INFO ] Flow matrix only has 612 transitions (discarded 81 similar events)
// Phase 1: matrix 612 rows 127 cols
[2025-06-06 11:14:34] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
RANDOM walk for 1000006 steps (2 resets) in 1487 ms. (672 steps per ms)
BEST_FIRST walk for 4000003 steps (8 resets) in 3681 ms. (1086 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
[2025-06-06 11:14:40] [INFO ] Flow matrix only has 612 transitions (discarded 81 similar events)
[2025-06-06 11:14:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:14:40] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-06 11:14:40] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2025-06-06 11:14:40] [INFO ] State equation strengthened by 82 read => feed constraints.
[2025-06-06 11:14:40] [INFO ] [Real]Added 82 Read/Feed constraints in 19 ms returned sat
[2025-06-06 11:14:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:14:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-06 11:14:40] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2025-06-06 11:14:40] [INFO ] [Nat]Added 82 Read/Feed constraints in 37 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:40] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 8 ms to minimize.
[2025-06-06 11:14:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2025-06-06 11:14:40] [INFO ] Computed and/alt/rep : 318/1358/317 causal constraints (skipped 294 transitions) in 48 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:41] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:41] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:41] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 11 ms to minimize.
[2025-06-06 11:14:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 549 ms
[2025-06-06 11:14:41] [INFO ] Added : 48 causal constraints over 10 iterations in 1051 ms. Result :sat
Minimization took 238 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:14:42] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-06 11:14:42] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2025-06-06 11:14:42] [INFO ] [Real]Added 82 Read/Feed constraints in 17 ms returned sat
[2025-06-06 11:14:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:14:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-06 11:14:42] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2025-06-06 11:14:42] [INFO ] [Nat]Added 82 Read/Feed constraints in 34 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:42] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:42] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 7 ms to minimize.
[2025-06-06 11:14:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 401 ms
[2025-06-06 11:14:43] [INFO ] Computed and/alt/rep : 318/1358/317 causal constraints (skipped 294 transitions) in 51 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:43] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:43] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 9 ms to minimize.
[2025-06-06 11:14:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 419 ms
[2025-06-06 11:14:43] [INFO ] Added : 42 causal constraints over 9 iterations in 873 ms. Result :sat
Minimization took 257 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:14:44] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-06 11:14:44] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2025-06-06 11:14:44] [INFO ] [Real]Added 82 Read/Feed constraints in 21 ms returned sat
[2025-06-06 11:14:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:14:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-06 11:14:44] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2025-06-06 11:14:44] [INFO ] [Nat]Added 82 Read/Feed constraints in 40 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:44] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:45] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:45] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:45] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:45] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:45] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:46] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 8 ms to minimize.
[2025-06-06 11:14:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1324 ms
[2025-06-06 11:14:46] [INFO ] Computed and/alt/rep : 318/1358/317 causal constraints (skipped 294 transitions) in 51 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:46] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:46] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 7 ms to minimize.
[2025-06-06 11:14:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 393 ms
[2025-06-06 11:14:46] [INFO ] Added : 19 causal constraints over 5 iterations in 710 ms. Result :sat
Minimization took 260 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:14:47] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-06 11:14:47] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2025-06-06 11:14:47] [INFO ] [Real]Added 82 Read/Feed constraints in 18 ms returned sat
[2025-06-06 11:14:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 11:14:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-06 11:14:47] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2025-06-06 11:14:47] [INFO ] [Nat]Added 82 Read/Feed constraints in 26 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:47] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:47] [INFO ] Deduced a trap composed of 30 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:48] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 11 ms to minimize.
[2025-06-06 11:14:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 642 ms
[2025-06-06 11:14:48] [INFO ] Computed and/alt/rep : 318/1358/317 causal constraints (skipped 294 transitions) in 56 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:48] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 10 ms to minimize.
[2025-06-06 11:14:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2025-06-06 11:14:48] [INFO ] Added : 11 causal constraints over 3 iterations in 470 ms. Result :sat
Minimization took 233 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 693/693 transitions.
Applied a total of 0 rules in 14 ms. Remains 127 /127 variables (removed 0) and now considering 693/693 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 127/127 places, 693/693 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 693/693 transitions.
Applied a total of 0 rules in 11 ms. Remains 127 /127 variables (removed 0) and now considering 693/693 (removed 0) transitions.
[2025-06-06 11:14:49] [INFO ] Flow matrix only has 612 transitions (discarded 81 similar events)
[2025-06-06 11:14:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:14:49] [INFO ] Implicit Places using invariants in 302 ms returned []
[2025-06-06 11:14:49] [INFO ] Flow matrix only has 612 transitions (discarded 81 similar events)
[2025-06-06 11:14:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:14:49] [INFO ] State equation strengthened by 82 read => feed constraints.
[2025-06-06 11:14:50] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1160 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 11:14:50] [INFO ] Redundant transitions in 7 ms returned []
Running 692 sub problems to find dead transitions.
[2025-06-06 11:14:50] [INFO ] Flow matrix only has 612 transitions (discarded 81 similar events)
[2025-06-06 11:14:50] [INFO ] Invariant cache hit.
[2025-06-06 11:14:50] [INFO ] State equation strengthened by 82 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 692 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:14:53] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 2 ms to minimize.
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 4 solved, 688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 688 unsolved
At refinement iteration 3 (OVERLAPS) 612/738 variables, 126/134 constraints. Problems are: Problem set: 4 solved, 688 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 82/216 constraints. Problems are: Problem set: 4 solved, 688 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/738 variables, 0/216 constraints. Problems are: Problem set: 4 solved, 688 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 1/739 variables, 1/217 constraints. Problems are: Problem set: 4 solved, 688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 739/739 variables, and 217 constraints, problems are : Problem set: 4 solved, 688 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 692/692 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 688 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 4 solved, 688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 688 unsolved
At refinement iteration 3 (OVERLAPS) 612/738 variables, 126/134 constraints. Problems are: Problem set: 4 solved, 688 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 82/216 constraints. Problems are: Problem set: 4 solved, 688 unsolved
Problem TDEAD63 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD684 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/738 variables, 542/758 constraints. Problems are: Problem set: 93 solved, 599 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:15:40] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:15:40] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 11:15:40] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 3 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 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 TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/739 variables, and 761 constraints, problems are : Problem set: 143 solved, 549 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/127 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 542/692 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60695ms problems are : Problem set: 143 solved, 549 unsolved
Search for dead transitions found 143 dead transitions in 60699ms
Found 143 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 143 transitions
Dead transitions reduction (with SMT) removed 143 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 127/127 places, 550/693 transitions.
Graph (complete) has 821 edges and 127 vertex of which 124 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 12 places and 131 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 112 transition count 419
Reduce places removed 1 places and 18 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 111 transition count 401
Reduce places removed 1 places and 10 transitions.
Graph (complete) has 609 edges and 110 vertex of which 4 are kept as prefixes of interest. Removing 106 places using SCC suffix rule.0 ms
Discarding 106 places :
Also discarding 391 output transitions
Drop transitions (Output transitions of discarded places.) removed 391 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 4 transition count 0
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 16 rules in 14 ms. Remains 4 /127 variables (removed 123) and now considering 0/550 (removed 550) transitions.
[2025-06-06 11:15:51] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:15:51] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-06 11:15:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 11:15:51] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 4/127 places, 0/693 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61959 ms. Remains : 4/127 places, 0/693 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
FORMULA BugTracking-PT-q8m016-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 480306 ms.

BK_STOP 1749208551373

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="BugTracking-PT-q8m016"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BugTracking-PT-q8m016, 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 r016-smll-174853765400573"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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