About the Execution of ITS-Tools for BugTracking-PT-q3m002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 593303.00 | 0.00 | 0.00 | 0 0 0 0 0 0 1 0 0 0 0 0 1 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-174853765200485.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-q3m002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853765200485
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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.2K 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-q3m002-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m002-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749115564005
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-q3m002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-05 09:26:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 09:26:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 09:26:07] [INFO ] Load time of PNML (sax parser for PT used): 1414 ms
[2025-06-05 09:26:07] [INFO ] Transformed 754 places.
[2025-06-05 09:26:07] [INFO ] Transformed 27370 transitions.
[2025-06-05 09:26:08] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1718 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Deduced a syphon composed of 514 places in 204 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m002-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-05 09:26:08] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2025-06-05 09:26:08] [INFO ] Computed 10 invariants in 103 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, +inf, 1, +inf, 1]
RANDOM walk for 10000 steps (236 resets) in 155 ms. (64 steps per ms)
FORMULA BugTracking-PT-q3m002-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80006 steps (506 resets) in 358 ms. (222 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[1, 1, +inf, +inf, +inf, 1, +inf, 1]
[2025-06-05 09:26:09] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2025-06-05 09:26:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 09:26:09] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2025-06-05 09:26:10] [INFO ] [Real]Absence check using state equation in 1223 ms returned sat
[2025-06-05 09:26:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 09:26:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2025-06-05 09:26:11] [INFO ] [Nat]Absence check using state equation in 874 ms returned sat
[2025-06-05 09:26:11] [INFO ] State equation strengthened by 255 read => feed constraints.
[2025-06-05 09:26:12] [INFO ] [Nat]Added 255 Read/Feed constraints in 125 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:12] [INFO ] Deduced a trap composed of 14 places in 744 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:13] [INFO ] Deduced a trap composed of 17 places in 672 ms of which 21 ms to minimize.
[2025-06-05 09:26:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1763 ms
[2025-06-05 09:26:14] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 573 ms.
[2025-06-05 09:26:15] [INFO ] Added : 5 causal constraints over 1 iterations in 1182 ms. Result :sat
Minimization took 680 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 09:26:15] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-05 09:26:16] [INFO ] [Real]Absence check using state equation in 738 ms returned sat
[2025-06-05 09:26:16] [INFO ] [Real]Added 255 Read/Feed constraints in 95 ms returned sat
[2025-06-05 09:26:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 09:26:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-05 09:26:17] [INFO ] [Nat]Absence check using state equation in 955 ms returned sat
[2025-06-05 09:26:18] [INFO ] [Nat]Added 255 Read/Feed constraints in 277 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:19] [INFO ] Deduced a trap composed of 10 places in 1115 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:20] [INFO ] Deduced a trap composed of 12 places in 969 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:21] [INFO ] Deduced a trap composed of 45 places in 822 ms of which 20 ms to minimize.
[2025-06-05 09:26:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3367 ms
[2025-06-05 09:26:21] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 316 ms.
[2025-06-05 09:26:21] [INFO ] Added : 0 causal constraints over 0 iterations in 332 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 09:26:21] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-05 09:26:22] [INFO ] [Real]Absence check using state equation in 839 ms returned sat
[2025-06-05 09:26:22] [INFO ] [Real]Added 255 Read/Feed constraints in 69 ms returned sat
[2025-06-05 09:26:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 09:26:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-05 09:26:23] [INFO ] [Nat]Absence check using state equation in 676 ms returned sat
[2025-06-05 09:26:23] [INFO ] [Nat]Added 255 Read/Feed constraints in 193 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:24] [INFO ] Deduced a trap composed of 12 places in 441 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:25] [INFO ] Deduced a trap composed of 12 places in 466 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:25] [INFO ] Deduced a trap composed of 45 places in 575 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:26] [INFO ] Deduced a trap composed of 31 places in 525 ms of which 25 ms to minimize.
[2025-06-05 09:26:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2495 ms
[2025-06-05 09:26:26] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 284 ms.
[2025-06-05 09:26:27] [INFO ] Added : 7 causal constraints over 2 iterations in 847 ms. Result :sat
Minimization took 710 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 09:26:28] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-05 09:26:28] [INFO ] [Real]Absence check using state equation in 816 ms returned sat
[2025-06-05 09:26:29] [INFO ] [Real]Added 255 Read/Feed constraints in 79 ms returned sat
[2025-06-05 09:26:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 09:26:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-05 09:26:29] [INFO ] [Nat]Absence check using state equation in 725 ms returned sat
[2025-06-05 09:26:30] [INFO ] [Nat]Added 255 Read/Feed constraints in 171 ms returned sat
[2025-06-05 09:26:30] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 309 ms.
[2025-06-05 09:26:30] [INFO ] Added : 5 causal constraints over 1 iterations in 725 ms. Result :sat
Minimization took 695 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 09:26:31] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-05 09:26:32] [INFO ] [Real]Absence check using state equation in 776 ms returned sat
[2025-06-05 09:26:32] [INFO ] [Real]Added 255 Read/Feed constraints in 49 ms returned sat
[2025-06-05 09:26:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 09:26:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-05 09:26:33] [INFO ] [Nat]Absence check using state equation in 759 ms returned sat
[2025-06-05 09:26:33] [INFO ] [Nat]Added 255 Read/Feed constraints in 154 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:34] [INFO ] Deduced a trap composed of 12 places in 361 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:34] [INFO ] Deduced a trap composed of 11 places in 582 ms of which 18 ms to minimize.
[2025-06-05 09:26:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1211 ms
[2025-06-05 09:26:35] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 330 ms.
[2025-06-05 09:26:35] [INFO ] Added : 6 causal constraints over 2 iterations in 993 ms. Result :sat
Minimization took 908 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 09:26:36] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-05 09:26:37] [INFO ] [Real]Absence check using state equation in 690 ms returned sat
[2025-06-05 09:26:37] [INFO ] [Real]Added 255 Read/Feed constraints in 72 ms returned sat
[2025-06-05 09:26: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-05 09:26:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-05 09:26:38] [INFO ] [Nat]Absence check using state equation in 877 ms returned sat
[2025-06-05 09:26:38] [INFO ] [Nat]Added 255 Read/Feed constraints in 230 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:39] [INFO ] Deduced a trap composed of 11 places in 900 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:40] [INFO ] Deduced a trap composed of 27 places in 729 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:41] [INFO ] Deduced a trap composed of 13 places in 911 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:42] [INFO ] Deduced a trap composed of 41 places in 924 ms of which 51 ms to minimize.
[2025-06-05 09:26:42] [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 5
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-05 09:26:43] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-05 09:26:43] [INFO ] [Real]Absence check using state equation in 790 ms returned sat
[2025-06-05 09:26:43] [INFO ] [Real]Added 255 Read/Feed constraints in 64 ms returned sat
[2025-06-05 09:26:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 09:26:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-05 09:26:44] [INFO ] [Nat]Absence check using state equation in 765 ms returned sat
[2025-06-05 09:26:44] [INFO ] [Nat]Added 255 Read/Feed constraints in 84 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:45] [INFO ] Deduced a trap composed of 7 places in 838 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:46] [INFO ] Deduced a trap composed of 31 places in 863 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:47] [INFO ] Deduced a trap composed of 31 places in 798 ms of which 47 ms to minimize.
[2025-06-05 09:26:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2882 ms
[2025-06-05 09:26:48] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 346 ms.
[2025-06-05 09:26:48] [INFO ] Added : 2 causal constraints over 1 iterations in 827 ms. Result :sat
Minimization took 373 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 09:26:49] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-05 09:26:49] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2025-06-05 09:26:50] [INFO ] [Real]Added 255 Read/Feed constraints in 57 ms returned sat
[2025-06-05 09:26:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 09:26:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-05 09:26:50] [INFO ] [Nat]Absence check using state equation in 800 ms returned sat
[2025-06-05 09:26:51] [INFO ] [Nat]Added 255 Read/Feed constraints in 188 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:51] [INFO ] Deduced a trap composed of 10 places in 524 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:52] [INFO ] Deduced a trap composed of 13 places in 382 ms of which 17 ms to minimize.
[2025-06-05 09:26:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1205 ms
[2025-06-05 09:26:52] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 345 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:54] [INFO ] Deduced a trap composed of 45 places in 604 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:26:55] [INFO ] Deduced a trap composed of 64 places in 642 ms of which 34 ms to minimize.
[2025-06-05 09:26:55] [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 7
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.refineWithCausalOrder(DeadlockTester.java:1131)
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, 0, 1, 0] Max Struct:[1, 1, +inf, +inf, +inf, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[1, 1, +inf, +inf, +inf, 1, +inf, 1]
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 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 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 495 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 513 ms. Remains : 229/240 places, 2747/2769 transitions.
[2025-06-05 09:26:55] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {4=1, 1722=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 1722=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 8) seen :[0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[1, 1, +inf, +inf, +inf, 1, +inf, 1]
[2025-06-05 09:26:57] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2025-06-05 09:26:57] [INFO ] Computed 8 invariants in 35 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[1, 1, +inf, +inf, +inf, 1, +inf, 1]
RANDOM walk for 1000001 steps (10 resets) in 12226 ms. (81 steps per ms)
BEST_FIRST walk for 8000003 steps (37 resets) in 26735 ms. (299 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 1140, 0] Max Struct:[1, 1, +inf, +inf, +inf, 1, +inf, 1]
[2025-06-05 09:27:36] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-06-05 09:27:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:27:36] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 09:27:37] [INFO ] [Real]Absence check using state equation in 784 ms returned sat
[2025-06-05 09:27:37] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 09:27:37] [INFO ] [Real]Added 241 Read/Feed constraints in 84 ms returned sat
[2025-06-05 09:27:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:27:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2025-06-05 09:27:38] [INFO ] [Nat]Absence check using state equation in 840 ms returned sat
[2025-06-05 09:27:38] [INFO ] [Nat]Added 241 Read/Feed constraints in 100 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:38] [INFO ] Deduced a trap composed of 19 places in 375 ms of which 15 ms to minimize.
[2025-06-05 09:27:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 506 ms
[2025-06-05 09:27:39] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 250 ms.
[2025-06-05 09:27:39] [INFO ] Added : 3 causal constraints over 1 iterations in 753 ms. Result :sat
Minimization took 2550 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:27:42] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-05 09:27:43] [INFO ] [Real]Absence check using state equation in 838 ms returned sat
[2025-06-05 09:27:43] [INFO ] [Real]Added 241 Read/Feed constraints in 67 ms returned sat
[2025-06-05 09:27:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:27:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 09:27:44] [INFO ] [Nat]Absence check using state equation in 800 ms returned sat
[2025-06-05 09:27:44] [INFO ] [Nat]Added 241 Read/Feed constraints in 166 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:45] [INFO ] Deduced a trap composed of 8 places in 439 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:45] [INFO ] Deduced a trap composed of 24 places in 536 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:46] [INFO ] Deduced a trap composed of 12 places in 312 ms of which 11 ms to minimize.
[2025-06-05 09:27:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1544 ms
[2025-06-05 09:27:46] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 363 ms.
[2025-06-05 09:27:47] [INFO ] Added : 3 causal constraints over 1 iterations in 867 ms. Result :sat
Minimization took 2414 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:27:49] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 09:27:50] [INFO ] [Real]Absence check using state equation in 770 ms returned sat
[2025-06-05 09:27:50] [INFO ] [Real]Added 241 Read/Feed constraints in 86 ms returned sat
[2025-06-05 09:27:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:27:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-05 09:27:51] [INFO ] [Nat]Absence check using state equation in 915 ms returned sat
[2025-06-05 09:27:51] [INFO ] [Nat]Added 241 Read/Feed constraints in 191 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:52] [INFO ] Deduced a trap composed of 29 places in 868 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:53] [INFO ] Deduced a trap composed of 31 places in 832 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:54] [INFO ] Deduced a trap composed of 43 places in 562 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:55] [INFO ] Deduced a trap composed of 38 places in 731 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:55] [INFO ] Deduced a trap composed of 43 places in 589 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:56] [INFO ] Deduced a trap composed of 63 places in 674 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:27:57] [INFO ] Deduced a trap composed of 11 places in 786 ms of which 35 ms to minimize.
[2025-06-05 09:27:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 6025 ms
[2025-06-05 09:27:58] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 229 ms.
[2025-06-05 09:27:58] [INFO ] Added : 5 causal constraints over 1 iterations in 682 ms. Result :sat
Minimization took 2274 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:28:00] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 09:28:01] [INFO ] [Real]Absence check using state equation in 767 ms returned sat
[2025-06-05 09:28:01] [INFO ] [Real]Added 241 Read/Feed constraints in 54 ms returned sat
[2025-06-05 09:28:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:28:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 09:28:02] [INFO ] [Nat]Absence check using state equation in 757 ms returned sat
[2025-06-05 09:28:02] [INFO ] [Nat]Added 241 Read/Feed constraints in 69 ms returned sat
[2025-06-05 09:28:03] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 222 ms.
[2025-06-05 09:28:03] [INFO ] Added : 2 causal constraints over 1 iterations in 586 ms. Result :sat
Minimization took 2277 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:28:05] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 09:28:06] [INFO ] [Real]Absence check using state equation in 751 ms returned sat
[2025-06-05 09:28:06] [INFO ] [Real]Added 241 Read/Feed constraints in 101 ms returned sat
[2025-06-05 09:28:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:28:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-05 09:28:07] [INFO ] [Nat]Absence check using state equation in 844 ms returned sat
[2025-06-05 09:28:07] [INFO ] [Nat]Added 241 Read/Feed constraints in 88 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:08] [INFO ] Deduced a trap composed of 11 places in 686 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:09] [INFO ] Deduced a trap composed of 34 places in 733 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:10] [INFO ] Deduced a trap composed of 43 places in 759 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:11] [INFO ] Deduced a trap composed of 43 places in 796 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:11] [INFO ] Deduced a trap composed of 44 places in 570 ms of which 17 ms to minimize.
[2025-06-05 09:28:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4007 ms
[2025-06-05 09:28:12] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 227 ms.
[2025-06-05 09:28:12] [INFO ] Added : 3 causal constraints over 1 iterations in 687 ms. Result :sat
Minimization took 2284 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:28:15] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 09:28:15] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2025-06-05 09:28:15] [INFO ] [Real]Added 241 Read/Feed constraints in 76 ms returned sat
[2025-06-05 09:28:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:28:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-05 09:28:16] [INFO ] [Nat]Absence check using state equation in 860 ms returned sat
[2025-06-05 09:28:16] [INFO ] [Nat]Added 241 Read/Feed constraints in 121 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:17] [INFO ] Deduced a trap composed of 27 places in 550 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:18] [INFO ] Deduced a trap composed of 34 places in 731 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:19] [INFO ] Deduced a trap composed of 10 places in 578 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:19] [INFO ] Deduced a trap composed of 39 places in 468 ms of which 18 ms to minimize.
[2025-06-05 09:28:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2717 ms
[2025-06-05 09:28:19] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 239 ms.
[2025-06-05 09:28:20] [INFO ] Added : 3 causal constraints over 1 iterations in 594 ms. Result :sat
Minimization took 2379 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:28:22] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-05 09:28:23] [INFO ] [Real]Absence check using state equation in 855 ms returned sat
[2025-06-05 09:28:24] [INFO ] [Real]Added 241 Read/Feed constraints in 276 ms returned sat
[2025-06-05 09:28:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:28:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-05 09:28:24] [INFO ] [Nat]Absence check using state equation in 797 ms returned sat
[2025-06-05 09:28:25] [INFO ] [Nat]Added 241 Read/Feed constraints in 160 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:25] [INFO ] Deduced a trap composed of 11 places in 497 ms of which 18 ms to minimize.
[2025-06-05 09:28:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 663 ms
[2025-06-05 09:28:26] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 340 ms.
[2025-06-05 09:28:26] [INFO ] Added : 3 causal constraints over 1 iterations in 841 ms. Result :sat
Minimization took 2247 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:28:29] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 09:28:29] [INFO ] [Real]Absence check using state equation in 799 ms returned sat
[2025-06-05 09:28:29] [INFO ] [Real]Added 241 Read/Feed constraints in 58 ms returned sat
[2025-06-05 09:28:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:28:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 09:28:30] [INFO ] [Nat]Absence check using state equation in 698 ms returned sat
[2025-06-05 09:28:30] [INFO ] [Nat]Added 241 Read/Feed constraints in 193 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:31] [INFO ] Deduced a trap composed of 10 places in 414 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:31] [INFO ] Deduced a trap composed of 12 places in 415 ms of which 16 ms to minimize.
[2025-06-05 09:28:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1062 ms
[2025-06-05 09:28:32] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 278 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:33] [INFO ] Deduced a trap composed of 24 places in 689 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:34] [INFO ] Deduced a trap composed of 11 places in 393 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:34] [INFO ] Deduced a trap composed of 62 places in 511 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:28:35] [INFO ] Deduced a trap composed of 43 places in 617 ms of which 27 ms to minimize.
[2025-06-05 09:28:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2876 ms
[2025-06-05 09:28:36] [INFO ] Added : 14 causal constraints over 4 iterations in 4342 ms. Result :sat
Minimization took 2434 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 1140, 0] Max Struct:[1, 1, +inf, +inf, +inf, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 1140, 0] Max Struct:[1, 1, +inf, +inf, +inf, 1, +inf, 1]
Support contains 8 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 51 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 54 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2025-06-05 09:29:09] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-06-05 09:29:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:29:10] [INFO ] Implicit Places using invariants in 563 ms returned []
[2025-06-05 09:29:10] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-06-05 09:29:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:29:11] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 09:29:16] [INFO ] Implicit Places using invariants and state equation in 6714 ms returned []
Implicit Place search using SMT with State Equation took 7282 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 09:29:17] [INFO ] Redundant transitions in 231 ms returned []
Running 2746 sub problems to find dead transitions.
[2025-06-05 09:29:17] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-06-05 09:29:17] [INFO ] Invariant cache hit.
[2025-06-05 09:29:17] [INFO ] State equation strengthened by 241 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 229/2847 variables, and 8 constraints, problems are : Problem set: 0 solved, 2746 unsolved in 30167 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2746/1184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2746 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:30:08] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:30:13] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 6 ms to minimize.
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 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 TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:30:14] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 6 ms to minimize.
Problem TDEAD1456 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 TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:30:14] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 4 ms to minimize.
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 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 TDEAD1575 is UNSAT
Problem TDEAD1576 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 TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 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 TDEAD1595 is UNSAT
Problem TDEAD1596 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 TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 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 TDEAD1615 is UNSAT
Problem TDEAD1616 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 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 TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 229/2847 variables, and 12 constraints, problems are : Problem set: 206 solved, 2540 unsolved in 30093 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 1562/1184 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67564ms problems are : Problem set: 206 solved, 2540 unsolved
Search for dead transitions found 206 dead transitions in 67611ms
Found 206 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 206 transitions
Dead transitions reduction (with SMT) removed 206 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 229/229 places, 2541/2747 transitions.
Reduce places removed 25 places and 534 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 204 transition count 2007
Reduce places removed 20 places and 264 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 45 place count 184 transition count 1743
Reduce places removed 9 places and 198 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 54 place count 175 transition count 1545
Reduce places removed 8 places and 121 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 62 place count 167 transition count 1424
Reduce places removed 3 places and 66 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 65 place count 164 transition count 1358
Reduce places removed 2 places and 53 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 67 place count 162 transition count 1305
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 69 place count 160 transition count 1280
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 17 places and 276 transitions.
Iterating global reduction 6 with 19 rules applied. Total rules applied 88 place count 143 transition count 1004
Deduced a syphon composed of 3 places in 3 ms
Applied a total of 88 rules in 122 ms. Remains 143 /229 variables (removed 86) and now considering 1004/2541 (removed 1537) transitions.
[2025-06-05 09:30:24] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
// Phase 1: matrix 946 rows 143 cols
[2025-06-05 09:30:24] [INFO ] Computed 11 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:30:25] [INFO ] Implicit Places using invariants in 418 ms returned []
[2025-06-05 09:30:25] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-06-05 09:30:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:30:25] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-06-05 09:30:26] [INFO ] Implicit Places using invariants and state equation in 1264 ms returned []
Implicit Place search using SMT with State Equation took 1684 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 143/229 places, 1004/2747 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 77026 ms. Remains : 143/229 places, 1004/2747 transitions.
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q3m002-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 09:30:26] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {0=1, 594=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {4=1, 594=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 3 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :[0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 1140, 0] Max Struct:[1, 1, +inf, +inf, +inf, 1, +inf, 1]
[2025-06-05 09:30:27] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
// Phase 1: matrix 946 rows 140 cols
[2025-06-05 09:30:27] [INFO ] Computed 8 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
RANDOM walk for 1000000 steps (6 resets) in 5358 ms. (186 steps per ms)
BEST_FIRST walk for 5000004 steps (37 resets) in 8019 ms. (623 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
[2025-06-05 09:30:40] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-06-05 09:30:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:30:40] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 09:30:40] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2025-06-05 09:30:40] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-06-05 09:30:40] [INFO ] [Real]Added 119 Read/Feed constraints in 24 ms returned sat
[2025-06-05 09:30: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-05 09:30:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-05 09:30:41] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2025-06-05 09:30:41] [INFO ] [Nat]Added 119 Read/Feed constraints in 42 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:30:41] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:30:41] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 11 ms to minimize.
[2025-06-05 09:30:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 581 ms
[2025-06-05 09:30:41] [INFO ] Computed and/alt/rep : 232/915/231 causal constraints (skipped 714 transitions) in 120 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:30:42] [INFO ] Deduced a trap composed of 7 places in 292 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:30:42] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 15 ms to minimize.
[2025-06-05 09:30:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 729 ms
[2025-06-05 09:30:42] [INFO ] Added : 8 causal constraints over 2 iterations in 1170 ms. Result :sat
Minimization took 636 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:30:43] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-05 09:30:44] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2025-06-05 09:30:44] [INFO ] [Real]Added 119 Read/Feed constraints in 32 ms returned sat
[2025-06-05 09:30: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-05 09:30:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 09:30:44] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2025-06-05 09:30:44] [INFO ] [Nat]Added 119 Read/Feed constraints in 36 ms returned sat
[2025-06-05 09:30:44] [INFO ] Computed and/alt/rep : 232/915/231 causal constraints (skipped 714 transitions) in 122 ms.
[2025-06-05 09:30:44] [INFO ] Added : 1 causal constraints over 1 iterations in 290 ms. Result :sat
Minimization took 529 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:30:45] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 09:30:45] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2025-06-05 09:30:46] [INFO ] [Real]Added 119 Read/Feed constraints in 36 ms returned sat
[2025-06-05 09:30:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:30:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 09:30:46] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2025-06-05 09:30:46] [INFO ] [Nat]Added 119 Read/Feed constraints in 57 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:30:46] [INFO ] Deduced a trap composed of 8 places in 321 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:30:47] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:30:47] [INFO ] Deduced a trap composed of 10 places in 276 ms of which 15 ms to minimize.
[2025-06-05 09:30:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1033 ms
[2025-06-05 09:30:47] [INFO ] Computed and/alt/rep : 232/915/231 causal constraints (skipped 714 transitions) in 119 ms.
[2025-06-05 09:30:47] [INFO ] Added : 5 causal constraints over 1 iterations in 299 ms. Result :sat
Minimization took 574 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:30:48] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 09:30:48] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2025-06-05 09:30:48] [INFO ] [Real]Added 119 Read/Feed constraints in 29 ms returned sat
[2025-06-05 09:30:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:30:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 09:30:49] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2025-06-05 09:30:49] [INFO ] [Nat]Added 119 Read/Feed constraints in 77 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:30:49] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:30:49] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 13 ms to minimize.
[2025-06-05 09:30:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 506 ms
[2025-06-05 09:30:50] [INFO ] Computed and/alt/rep : 232/915/231 causal constraints (skipped 714 transitions) in 103 ms.
[2025-06-05 09:30:50] [INFO ] Added : 7 causal constraints over 2 iterations in 341 ms. Result :sat
Minimization took 565 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:30:50] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 09:30:51] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2025-06-05 09:30:51] [INFO ] [Real]Added 119 Read/Feed constraints in 40 ms returned sat
[2025-06-05 09:30:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:30:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 09:30:51] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2025-06-05 09:30:51] [INFO ] [Nat]Added 119 Read/Feed constraints in 50 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:30:52] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 16 ms to minimize.
[2025-06-05 09:30:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2025-06-05 09:30:52] [INFO ] Computed and/alt/rep : 232/915/231 causal constraints (skipped 714 transitions) in 122 ms.
[2025-06-05 09:30:52] [INFO ] Added : 2 causal constraints over 1 iterations in 296 ms. Result :sat
Minimization took 537 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Support contains 5 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1004/1004 transitions.
Applied a total of 0 rules in 24 ms. Remains 140 /140 variables (removed 0) and now considering 1004/1004 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 140/140 places, 1004/1004 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1004/1004 transitions.
Applied a total of 0 rules in 17 ms. Remains 140 /140 variables (removed 0) and now considering 1004/1004 (removed 0) transitions.
[2025-06-05 09:30:57] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-06-05 09:30:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:30:57] [INFO ] Implicit Places using invariants in 261 ms returned []
[2025-06-05 09:30:57] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-06-05 09:30:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:30:57] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-06-05 09:30:58] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 09:30:58] [INFO ] Redundant transitions in 76 ms returned []
Running 1003 sub problems to find dead transitions.
[2025-06-05 09:30:58] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-06-05 09:30:58] [INFO ] Invariant cache hit.
[2025-06-05 09:30:58] [INFO ] State equation strengthened by 119 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1003 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:31:05] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:31:07] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:31:08] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 3 ms to minimize.
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 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 TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:31:09] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 3 ms to minimize.
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 4/12 constraints. Problems are: Problem set: 164 solved, 839 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/12 constraints. Problems are: Problem set: 164 solved, 839 unsolved
Problem TDEAD626 is UNSAT
At refinement iteration 3 (OVERLAPS) 946/1086 variables, 140/152 constraints. Problems are: Problem set: 165 solved, 838 unsolved
SMT process timed out in 31719ms, After SMT, problems are : Problem set: 165 solved, 838 unsolved
Search for dead transitions found 165 dead transitions in 31728ms
Found 165 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 165 transitions
Dead transitions reduction (with SMT) removed 165 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 140/140 places, 839/1004 transitions.
Graph (complete) has 1200 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 18 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 138 transition count 821
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 127 transition count 760
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 127 transition count 760
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 120 transition count 711
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 120 transition count 711
Applied a total of 38 rules in 33 ms. Remains 120 /140 variables (removed 20) and now considering 711/839 (removed 128) transitions.
[2025-06-05 09:31:30] [INFO ] Flow matrix only has 650 transitions (discarded 61 similar events)
// Phase 1: matrix 650 rows 120 cols
[2025-06-05 09:31:30] [INFO ] Computed 8 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:31:30] [INFO ] Implicit Places using invariants in 265 ms returned []
[2025-06-05 09:31:30] [INFO ] Flow matrix only has 650 transitions (discarded 61 similar events)
[2025-06-05 09:31:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:31:30] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 09:31:31] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 120/140 places, 711/1004 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 34324 ms. Remains : 120/140 places, 711/1004 transitions.
[2025-06-05 09:31:31] [INFO ] Flow matrix only has 650 transitions (discarded 61 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {5=1, 354=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {2=1, 354=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :[0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
[2025-06-05 09:31:31] [INFO ] Flow matrix only has 650 transitions (discarded 61 similar events)
[2025-06-05 09:31:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
RANDOM walk for 1000000 steps (3 resets) in 4644 ms. (215 steps per ms)
BEST_FIRST walk for 5000003 steps (53 resets) in 7282 ms. (686 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
[2025-06-05 09:31:43] [INFO ] Flow matrix only has 650 transitions (discarded 61 similar events)
[2025-06-05 09:31:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:31:43] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 09:31:43] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2025-06-05 09:31:43] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 09:31:43] [INFO ] [Real]Added 86 Read/Feed constraints in 23 ms returned sat
[2025-06-05 09:31: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-05 09:31:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 09:31:44] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2025-06-05 09:31:44] [INFO ] [Nat]Added 86 Read/Feed constraints in 42 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:31:44] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 7 ms to minimize.
[2025-06-05 09:31:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2025-06-05 09:31:44] [INFO ] Computed and/alt/rep : 180/637/179 causal constraints (skipped 470 transitions) in 54 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:31:44] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:31:44] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:31:45] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:31:45] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:31:45] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:31:45] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 15 ms to minimize.
[2025-06-05 09:31:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1090 ms
[2025-06-05 09:31:45] [INFO ] Added : 14 causal constraints over 4 iterations in 1418 ms. Result :sat
Minimization took 359 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:31:46] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 09:31:46] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2025-06-05 09:31:46] [INFO ] [Real]Added 86 Read/Feed constraints in 25 ms returned sat
[2025-06-05 09:31:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:31:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 09:31:46] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2025-06-05 09:31:46] [INFO ] [Nat]Added 86 Read/Feed constraints in 55 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:31:47] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 11 ms to minimize.
[2025-06-05 09:31:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2025-06-05 09:31:47] [INFO ] Computed and/alt/rep : 180/637/179 causal constraints (skipped 470 transitions) in 60 ms.
[2025-06-05 09:31:47] [INFO ] Added : 3 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 457 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:31:47] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 09:31:48] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2025-06-05 09:31:48] [INFO ] [Real]Added 86 Read/Feed constraints in 23 ms returned sat
[2025-06-05 09:31:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:31:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 09:31:48] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2025-06-05 09:31:48] [INFO ] [Nat]Added 86 Read/Feed constraints in 43 ms returned sat
[2025-06-05 09:31:48] [INFO ] Computed and/alt/rep : 180/637/179 causal constraints (skipped 470 transitions) in 58 ms.
[2025-06-05 09:31:48] [INFO ] Added : 4 causal constraints over 2 iterations in 202 ms. Result :sat
Minimization took 448 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:31:49] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 09:31:49] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2025-06-05 09:31:49] [INFO ] [Real]Added 86 Read/Feed constraints in 23 ms returned sat
[2025-06-05 09:31:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:31:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 09:31:49] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2025-06-05 09:31:49] [INFO ] [Nat]Added 86 Read/Feed constraints in 52 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:31:50] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 11 ms to minimize.
[2025-06-05 09:31:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2025-06-05 09:31:50] [INFO ] Computed and/alt/rep : 180/637/179 causal constraints (skipped 470 transitions) in 59 ms.
[2025-06-05 09:31:50] [INFO ] Added : 2 causal constraints over 1 iterations in 162 ms. Result :sat
Minimization took 449 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:31:50] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-05 09:31:50] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2025-06-05 09:31:51] [INFO ] [Real]Added 86 Read/Feed constraints in 45 ms returned sat
[2025-06-05 09:31:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:31:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 09:31:51] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2025-06-05 09:31:51] [INFO ] [Nat]Added 86 Read/Feed constraints in 73 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:31:51] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:31:51] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 5 ms to minimize.
[2025-06-05 09:31:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 337 ms
[2025-06-05 09:31:51] [INFO ] Computed and/alt/rep : 180/637/179 causal constraints (skipped 470 transitions) in 74 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:31:52] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 11 ms to minimize.
[2025-06-05 09:31:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2025-06-05 09:31:52] [INFO ] Added : 7 causal constraints over 3 iterations in 576 ms. Result :sat
Minimization took 450 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Support contains 5 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 711/711 transitions.
Applied a total of 0 rules in 10 ms. Remains 120 /120 variables (removed 0) and now considering 711/711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 120/120 places, 711/711 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 711/711 transitions.
Applied a total of 0 rules in 15 ms. Remains 120 /120 variables (removed 0) and now considering 711/711 (removed 0) transitions.
[2025-06-05 09:31:55] [INFO ] Flow matrix only has 650 transitions (discarded 61 similar events)
[2025-06-05 09:31:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:31:56] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-05 09:31:56] [INFO ] Flow matrix only has 650 transitions (discarded 61 similar events)
[2025-06-05 09:31:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:31:56] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 09:31:57] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 09:31:57] [INFO ] Redundant transitions in 10 ms returned []
Running 710 sub problems to find dead transitions.
[2025-06-05 09:31:57] [INFO ] Flow matrix only has 650 transitions (discarded 61 similar events)
[2025-06-05 09:31:57] [INFO ] Invariant cache hit.
[2025-06-05 09:31:57] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (OVERLAPS) 650/770 variables, 120/128 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/770 variables, 86/214 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/770 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 770/770 variables, and 214 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (OVERLAPS) 650/770 variables, 120/128 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/770 variables, 86/214 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 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 TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 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 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 TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 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 TDEAD377 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD705 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/770 variables, 710/924 constraints. Problems are: Problem set: 76 solved, 634 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:32:53] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:32:56] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 3 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:32:57] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 5 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 770/770 variables, and 927 constraints, problems are : Problem set: 104 solved, 606 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60830ms problems are : Problem set: 104 solved, 606 unsolved
Search for dead transitions found 104 dead transitions in 60835ms
Found 104 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 104 transitions
Dead transitions reduction (with SMT) removed 104 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 120/120 places, 607/711 transitions.
Graph (complete) has 864 edges and 120 vertex of which 119 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 13 places and 180 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 106 transition count 427
Reduce places removed 8 places and 72 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 22 place count 98 transition count 355
Reduce places removed 2 places and 29 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 96 transition count 326
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 94 transition count 310
Reduce places removed 1 places and 11 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 27 place count 93 transition count 299
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 29 place count 91 transition count 283
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 31 place count 91 transition count 283
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 31 rules in 21 ms. Remains 91 /120 variables (removed 29) and now considering 283/607 (removed 324) transitions.
[2025-06-05 09:32:57] [INFO ] Flow matrix only has 267 transitions (discarded 16 similar events)
// Phase 1: matrix 267 rows 91 cols
[2025-06-05 09:32:57] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:32:58] [INFO ] Implicit Places using invariants in 185 ms returned []
[2025-06-05 09:32:58] [INFO ] Flow matrix only has 267 transitions (discarded 16 similar events)
[2025-06-05 09:32:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:32:58] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-06-05 09:32:58] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 91/120 places, 283/711 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62617 ms. Remains : 91/120 places, 283/711 transitions.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q3m002-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 09:32:58] [INFO ] Flow matrix only has 267 transitions (discarded 16 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {3=1, 194=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 194=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :[0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
[2025-06-05 09:32:58] [INFO ] Flow matrix only has 267 transitions (discarded 16 similar events)
// Phase 1: matrix 267 rows 88 cols
[2025-06-05 09:32:58] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
RANDOM walk for 1000000 steps (2 resets) in 2298 ms. (434 steps per ms)
BEST_FIRST walk for 2000002 steps (15 resets) in 1461 ms. (1367 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 3599, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
[2025-06-05 09:33:02] [INFO ] Flow matrix only has 267 transitions (discarded 16 similar events)
[2025-06-05 09:33:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:33:02] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-05 09:33:02] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 09:33:02] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2025-06-05 09:33:02] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-06-05 09:33:02] [INFO ] [Real]Added 52 Read/Feed constraints in 17 ms returned sat
[2025-06-05 09:33:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:33:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-05 09:33:02] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 09:33:02] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2025-06-05 09:33:02] [INFO ] [Nat]Added 52 Read/Feed constraints in 15 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:33:03] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:33:03] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:33:03] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 8 ms to minimize.
[2025-06-05 09:33:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 365 ms
[2025-06-05 09:33:03] [INFO ] Computed and/alt/rep : 182/840/181 causal constraints (skipped 85 transitions) in 26 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:33:03] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:33:03] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 7 ms to minimize.
[2025-06-05 09:33:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 262 ms
[2025-06-05 09:33:03] [INFO ] Added : 49 causal constraints over 11 iterations in 624 ms. Result :sat
Minimization took 123 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:33:04] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-05 09:33:04] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 09:33:04] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2025-06-05 09:33:04] [INFO ] [Real]Added 52 Read/Feed constraints in 23 ms returned sat
[2025-06-05 09:33:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:33:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-05 09:33:04] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 09:33:04] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2025-06-05 09:33:04] [INFO ] [Nat]Added 52 Read/Feed constraints in 19 ms returned sat
[2025-06-05 09:33:04] [INFO ] Computed and/alt/rep : 182/840/181 causal constraints (skipped 85 transitions) in 27 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:33:04] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:33:05] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 8 ms to minimize.
[2025-06-05 09:33:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 297 ms
[2025-06-05 09:33:05] [INFO ] Added : 51 causal constraints over 11 iterations in 710 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 3599, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 3599, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 283/283 transitions.
Applied a total of 0 rules in 8 ms. Remains 88 /88 variables (removed 0) and now considering 283/283 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 88/88 places, 283/283 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 283/283 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 283/283 (removed 0) transitions.
[2025-06-05 09:33:11] [INFO ] Flow matrix only has 267 transitions (discarded 16 similar events)
[2025-06-05 09:33:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:33:11] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-05 09:33:11] [INFO ] Flow matrix only has 267 transitions (discarded 16 similar events)
[2025-06-05 09:33:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:33:12] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-06-05 09:33:12] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 09:33:12] [INFO ] Redundant transitions in 1 ms returned []
Running 282 sub problems to find dead transitions.
[2025-06-05 09:33:12] [INFO ] Flow matrix only has 267 transitions (discarded 16 similar events)
[2025-06-05 09:33:12] [INFO ] Invariant cache hit.
[2025-06-05 09:33:12] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
At refinement iteration 3 (OVERLAPS) 267/355 variables, 88/96 constraints. Problems are: Problem set: 2 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 52/148 constraints. Problems are: Problem set: 2 solved, 280 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:33:19] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:33:20] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 3 ms to minimize.
Problem TDEAD150 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:33:20] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 3 ms to minimize.
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:33:20] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 4 ms to minimize.
Problem TDEAD159 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 4/152 constraints. Problems are: Problem set: 6 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/152 constraints. Problems are: Problem set: 6 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/355 variables, 0/152 constraints. Problems are: Problem set: 6 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 152 constraints, problems are : Problem set: 6 solved, 276 unsolved in 23312 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 7/7 constraints. Problems are: Problem set: 6 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/8 constraints. Problems are: Problem set: 6 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 4/12 constraints. Problems are: Problem set: 6 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 267/355 variables, 88/100 constraints. Problems are: Problem set: 6 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 52/152 constraints. Problems are: Problem set: 6 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 276/428 constraints. Problems are: Problem set: 6 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:33:46] [INFO ] Deduced a trap along path composed of 6 places in 32 ms of which 3 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/429 constraints. Problems are: Problem set: 11 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:33:58] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:33:59] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:34:01] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 3 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:34:01] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:34:03] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 5/434 constraints. Problems are: Problem set: 27 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 434 constraints, problems are : Problem set: 27 solved, 255 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 276/282 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53502ms problems are : Problem set: 27 solved, 255 unsolved
Search for dead transitions found 27 dead transitions in 53505ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 88/88 places, 256/283 transitions.
Graph (complete) has 442 edges and 88 vertex of which 86 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 16 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 84 transition count 233
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 84 transition count 233
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 4 rules in 10 ms. Remains 84 /88 variables (removed 4) and now considering 233/256 (removed 23) transitions.
[2025-06-05 09:34:05] [INFO ] Flow matrix only has 218 transitions (discarded 15 similar events)
// Phase 1: matrix 218 rows 84 cols
[2025-06-05 09:34:05] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:34:05] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-05 09:34:05] [INFO ] Flow matrix only has 218 transitions (discarded 15 similar events)
[2025-06-05 09:34:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:34:05] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-05 09:34:06] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/88 places, 233/283 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 54400 ms. Remains : 84/88 places, 233/283 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q3m002-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 09:34:06] [INFO ] Flow matrix only has 218 transitions (discarded 15 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {4=1, 146=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 146=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 3599, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
[2025-06-05 09:34:06] [INFO ] Flow matrix only has 218 transitions (discarded 15 similar events)
// Phase 1: matrix 218 rows 83 cols
[2025-06-05 09:34:06] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 3599, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
RANDOM walk for 1000001 steps (3 resets) in 1894 ms. (527 steps per ms)
BEST_FIRST walk for 1000001 steps (4 resets) in 706 ms. (1414 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 3599, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
[2025-06-05 09:34:09] [INFO ] Flow matrix only has 218 transitions (discarded 15 similar events)
[2025-06-05 09:34:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:34:09] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-05 09:34:09] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 09:34:09] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-06-05 09:34:09] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-05 09:34:09] [INFO ] [Real]Added 48 Read/Feed constraints in 8 ms returned sat
[2025-06-05 09:34: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-05 09:34:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-05 09:34:09] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 09:34:09] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2025-06-05 09:34:09] [INFO ] [Nat]Added 48 Read/Feed constraints in 19 ms returned sat
[2025-06-05 09:34:09] [INFO ] Computed and/alt/rep : 186/1009/186 causal constraints (skipped 31 transitions) in 25 ms.
[2025-06-05 09:34:09] [INFO ] Added : 15 causal constraints over 4 iterations in 149 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 3599, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 3599, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
Support contains 1 out of 83 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place ch2_MORE_INFO_q8) removed 7 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 226/226 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 83/83 places, 226/226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 226/226 transitions.
Applied a total of 0 rules in 6 ms. Remains 83 /83 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2025-06-05 09:34:09] [INFO ] Flow matrix only has 211 transitions (discarded 15 similar events)
// Phase 1: matrix 211 rows 83 cols
[2025-06-05 09:34:09] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:34:09] [INFO ] Implicit Places using invariants in 167 ms returned []
[2025-06-05 09:34:09] [INFO ] Flow matrix only has 211 transitions (discarded 15 similar events)
[2025-06-05 09:34:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:34:09] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-05 09:34:10] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 09:34:10] [INFO ] Redundant transitions in 1 ms returned []
Running 225 sub problems to find dead transitions.
[2025-06-05 09:34:10] [INFO ] Flow matrix only has 211 transitions (discarded 15 similar events)
[2025-06-05 09:34:10] [INFO ] Invariant cache hit.
[2025-06-05 09:34:10] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
At refinement iteration 3 (OVERLAPS) 211/293 variables, 82/90 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 48/138 constraints. Problems are: Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:34:15] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 1/139 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/139 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 1/294 variables, 1/140 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/140 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 9 (OVERLAPS) 0/294 variables, 0/140 constraints. Problems are: Problem set: 12 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 140 constraints, problems are : Problem set: 12 solved, 213 unsolved in 21420 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/9 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 211/293 variables, 82/91 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 48/139 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 164/303 constraints. Problems are: Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:34:36] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:34:36] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:34:37] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 3/306 constraints. Problems are: Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:34:40] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 1/307 constraints. Problems are: Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:34:45] [INFO ] Deduced a trap along path composed of 6 places in 27 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 1/308 constraints. Problems are: Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:34:50] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:34:50] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:34:50] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:34:50] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:34:52] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 5/313 constraints. Problems are: Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:34:55] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:34:55] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:34:56] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 3/316 constraints. Problems are: Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:35:00] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:35:01] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:35:01] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 293/294 variables, and 319 constraints, problems are : Problem set: 12 solved, 213 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/83 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 164/225 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51542ms problems are : Problem set: 12 solved, 213 unsolved
Search for dead transitions found 12 dead transitions in 51543ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 83/83 places, 214/226 transitions.
Applied a total of 0 rules in 6 ms. Remains 83 /83 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 09:35:01] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 52180 ms. Remains : 83/83 places, 214/226 transitions.
[2025-06-05 09:35:01] [INFO ] Flow matrix only has 199 transitions (discarded 15 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {2=1, 127=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {5=1, 127=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 3599, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
[2025-06-05 09:35:01] [INFO ] Flow matrix only has 199 transitions (discarded 15 similar events)
// Phase 1: matrix 199 rows 83 cols
[2025-06-05 09:35:01] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 3599, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
RANDOM walk for 1000000 steps (2 resets) in 2334 ms. (428 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 873 ms. (1144 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 3599, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
[2025-06-05 09:35:05] [INFO ] Flow matrix only has 199 transitions (discarded 15 similar events)
[2025-06-05 09:35:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:35:05] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-05 09:35:05] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 09:35:05] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-06-05 09:35:05] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-05 09:35:05] [INFO ] [Real]Added 46 Read/Feed constraints in 8 ms returned sat
[2025-06-05 09:35:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 09:35:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-05 09:35:05] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-05 09:35:05] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2025-06-05 09:35:05] [INFO ] [Nat]Added 46 Read/Feed constraints in 11 ms returned sat
[2025-06-05 09:35:05] [INFO ] Computed and/alt/rep : 167/872/167 causal constraints (skipped 31 transitions) in 12 ms.
[2025-06-05 09:35:05] [INFO ] Added : 13 causal constraints over 3 iterations in 71 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 3599, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 3599, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 83/83 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2025-06-05 09:35:05] [INFO ] Flow matrix only has 199 transitions (discarded 15 similar events)
[2025-06-05 09:35:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:35:05] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-05 09:35:05] [INFO ] Flow matrix only has 199 transitions (discarded 15 similar events)
[2025-06-05 09:35:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 09:35:05] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-05 09:35:06] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 09:35:06] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2025-06-05 09:35:06] [INFO ] Flow matrix only has 199 transitions (discarded 15 similar events)
[2025-06-05 09:35:06] [INFO ] Invariant cache hit.
[2025-06-05 09:35:06] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 199/281 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 46/136 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 1/282 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 137 constraints, problems are : Problem set: 0 solved, 213 unsolved in 20282 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 199/281 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 46/136 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 164/300 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:35:31] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:35:36] [INFO ] Deduced a trap along path composed of 6 places in 35 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:35:41] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:35:41] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:35:42] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:35:42] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:35:42] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:35:42] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:35:43] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 7/309 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:35:46] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:35:46] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:35:46] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:35:52] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:35:52] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 09:35:55] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 281/282 variables, and 315 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/83 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 164/213 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50392ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 50394ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50899 ms. Remains : 83/83 places, 214/214 transitions.
[2025-06-05 09:35:56] [INFO ] Flow matrix only has 199 transitions (discarded 15 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {2=1, 127=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 127=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 3599, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
RANDOM walk for 23859 steps (20 resets) in 850 ms. (28 steps per ms) remains 0/2 properties
[2025-06-05 09:35:57] [INFO ] Flatten gal took : 123 ms
[2025-06-05 09:35:57] [INFO ] Flatten gal took : 62 ms
[2025-06-05 09:35:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8540162926190889826.gal : 19 ms
[2025-06-05 09:35:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2186890074370416706.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8540162926190889826.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2186890074370416706.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA BugTracking-PT-q3m002-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[3599, 0, 0, 1178, 0, 1140, 0] Max Struct:[1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
All properties solved without resorting to model-checking.
Total runtime 590989 ms.
BK_STOP 1749116157308
--------------------
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-q3m002"
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-q3m002, 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-174853765200485"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m002.tgz
mv BugTracking-PT-q3m002 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;