About the Execution of 2024-gold for BugTracking-PT-q3m002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15688.070 | 669428.00 | 836320.00 | 2740.80 | 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r027-smll-174853774300061.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is BugTracking-PT-q3m002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r027-smll-174853774300061
=====================================================================
--------------------
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 1748549822259
Invoking MCC driver with
BK_TOOL=gold2024
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 202405141337
[2025-05-29 20:17:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 20:17:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:17:06] [INFO ] Load time of PNML (sax parser for PT used): 1917 ms
[2025-05-29 20:17:06] [INFO ] Transformed 754 places.
[2025-05-29 20:17:06] [INFO ] Transformed 27370 transitions.
[2025-05-29 20:17:06] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 2263 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Deduced a syphon composed of 514 places in 201 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-05-29 20:17:07] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2025-05-29 20:17:07] [INFO ] Computed 10 invariants in 72 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 (180 resets) in 171 ms. (58 steps per ms)
FORMULA BugTracking-PT-q3m002-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80006 steps (517 resets) in 339 ms. (235 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, +inf, +inf, 1, +inf, 1]
[2025-05-29 20:17:07] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2025-05-29 20:17:07] [INFO ] Invariant cache hit.
[2025-05-29 20:17:08] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-05-29 20:17:09] [INFO ] [Real]Absence check using state equation in 1190 ms returned sat
[2025-05-29 20:17:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:17:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2025-05-29 20:17:10] [INFO ] [Nat]Absence check using state equation in 896 ms returned sat
[2025-05-29 20:17:10] [INFO ] State equation strengthened by 255 read => feed constraints.
[2025-05-29 20:17:10] [INFO ] [Nat]Added 255 Read/Feed constraints in 149 ms returned sat
[2025-05-29 20:17:11] [INFO ] Deduced a trap composed of 17 places in 583 ms of which 37 ms to minimize.
[2025-05-29 20:17:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 797 ms
[2025-05-29 20:17:11] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 323 ms.
[2025-05-29 20:17:12] [INFO ] Added : 5 causal constraints over 1 iterations in 745 ms. Result :sat
Minimization took 782 ms.
[2025-05-29 20:17:13] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 20:17:13] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2025-05-29 20:17:13] [INFO ] [Real]Added 255 Read/Feed constraints in 59 ms returned sat
[2025-05-29 20:17:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:17:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 20:17:14] [INFO ] [Nat]Absence check using state equation in 803 ms returned sat
[2025-05-29 20:17:15] [INFO ] [Nat]Added 255 Read/Feed constraints in 271 ms returned sat
[2025-05-29 20:17:15] [INFO ] Deduced a trap composed of 11 places in 727 ms of which 5 ms to minimize.
[2025-05-29 20:17:16] [INFO ] Deduced a trap composed of 26 places in 485 ms of which 2 ms to minimize.
[2025-05-29 20:17:17] [INFO ] Deduced a trap composed of 27 places in 436 ms of which 3 ms to minimize.
[2025-05-29 20:17:17] [INFO ] Deduced a trap composed of 51 places in 436 ms of which 2 ms to minimize.
[2025-05-29 20:17:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2601 ms
[2025-05-29 20:17:18] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 269 ms.
[2025-05-29 20:17:19] [INFO ] Deduced a trap composed of 32 places in 391 ms of which 2 ms to minimize.
[2025-05-29 20:17:19] [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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 20:17:19] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:17:20] [INFO ] [Real]Absence check using state equation in 863 ms returned sat
[2025-05-29 20:17:20] [INFO ] [Real]Added 255 Read/Feed constraints in 83 ms returned sat
[2025-05-29 20:17:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:17:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-29 20:17:21] [INFO ] [Nat]Absence check using state equation in 687 ms returned sat
[2025-05-29 20:17:21] [INFO ] [Nat]Added 255 Read/Feed constraints in 193 ms returned sat
[2025-05-29 20:17:21] [INFO ] Deduced a trap composed of 33 places in 394 ms of which 2 ms to minimize.
[2025-05-29 20:17:22] [INFO ] Deduced a trap composed of 40 places in 503 ms of which 2 ms to minimize.
[2025-05-29 20:17:23] [INFO ] Deduced a trap composed of 15 places in 681 ms of which 4 ms to minimize.
[2025-05-29 20:17:24] [INFO ] Deduced a trap composed of 49 places in 709 ms of which 3 ms to minimize.
[2025-05-29 20:17:24] [INFO ] Deduced a trap composed of 58 places in 717 ms of which 4 ms to minimize.
[2025-05-29 20:17:25] [INFO ] Deduced a trap composed of 49 places in 589 ms of which 3 ms to minimize.
[2025-05-29 20:17:25] [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 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 20:17:25] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:17:26] [INFO ] [Real]Absence check using state equation in 879 ms returned sat
[2025-05-29 20:17:26] [INFO ] [Real]Added 255 Read/Feed constraints in 103 ms returned sat
[2025-05-29 20:17:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:17:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:17:27] [INFO ] [Nat]Absence check using state equation in 784 ms returned sat
[2025-05-29 20:17:27] [INFO ] [Nat]Added 255 Read/Feed constraints in 130 ms returned sat
[2025-05-29 20:17:28] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 327 ms.
[2025-05-29 20:17:28] [INFO ] Added : 6 causal constraints over 2 iterations in 923 ms. Result :sat
Minimization took 799 ms.
[2025-05-29 20:17:29] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:17:30] [INFO ] [Real]Absence check using state equation in 770 ms returned sat
[2025-05-29 20:17:30] [INFO ] [Real]Added 255 Read/Feed constraints in 56 ms returned sat
[2025-05-29 20:17:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:17:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 20:17:31] [INFO ] [Nat]Absence check using state equation in 725 ms returned sat
[2025-05-29 20:17:31] [INFO ] [Nat]Added 255 Read/Feed constraints in 187 ms returned sat
[2025-05-29 20:17:32] [INFO ] Deduced a trap composed of 20 places in 577 ms of which 3 ms to minimize.
[2025-05-29 20:17:33] [INFO ] Deduced a trap composed of 40 places in 654 ms of which 3 ms to minimize.
[2025-05-29 20:17:33] [INFO ] Deduced a trap composed of 27 places in 544 ms of which 3 ms to minimize.
[2025-05-29 20:17:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2200 ms
[2025-05-29 20:17:34] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 291 ms.
[2025-05-29 20:17:34] [INFO ] Added : 5 causal constraints over 1 iterations in 730 ms. Result :sat
Minimization took 902 ms.
[2025-05-29 20:17:35] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:17:36] [INFO ] [Real]Absence check using state equation in 878 ms returned sat
[2025-05-29 20:17:36] [INFO ] [Real]Added 255 Read/Feed constraints in 54 ms returned sat
[2025-05-29 20:17:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:17:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:17:37] [INFO ] [Nat]Absence check using state equation in 879 ms returned sat
[2025-05-29 20:17:38] [INFO ] [Nat]Added 255 Read/Feed constraints in 254 ms returned sat
[2025-05-29 20:17:38] [INFO ] Deduced a trap composed of 59 places in 844 ms of which 3 ms to minimize.
[2025-05-29 20:17:39] [INFO ] Deduced a trap composed of 41 places in 871 ms of which 3 ms to minimize.
[2025-05-29 20:17:40] [INFO ] Deduced a trap composed of 68 places in 827 ms of which 4 ms to minimize.
[2025-05-29 20:17:41] [INFO ] Deduced a trap composed of 76 places in 836 ms of which 4 ms to minimize.
[2025-05-29 20:17:41] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 20:17:41] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 20:17:42] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2025-05-29 20:17:42] [INFO ] [Real]Added 255 Read/Feed constraints in 72 ms returned sat
[2025-05-29 20:17:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:17:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:17:43] [INFO ] [Nat]Absence check using state equation in 754 ms returned sat
[2025-05-29 20:17:43] [INFO ] [Nat]Added 255 Read/Feed constraints in 82 ms returned sat
[2025-05-29 20:17:44] [INFO ] Deduced a trap composed of 31 places in 718 ms of which 3 ms to minimize.
[2025-05-29 20:17:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 933 ms
[2025-05-29 20:17:45] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 392 ms.
[2025-05-29 20:17:45] [INFO ] Added : 2 causal constraints over 1 iterations in 844 ms. Result :sat
Minimization took 903 ms.
[2025-05-29 20:17:46] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 20:17:47] [INFO ] [Real]Absence check using state equation in 676 ms returned sat
[2025-05-29 20:17:47] [INFO ] [Real]Added 255 Read/Feed constraints in 63 ms returned sat
[2025-05-29 20:17:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:17:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 20:17:48] [INFO ] [Nat]Absence check using state equation in 757 ms returned sat
[2025-05-29 20:17:48] [INFO ] [Nat]Added 255 Read/Feed constraints in 169 ms returned sat
[2025-05-29 20:17:48] [INFO ] Deduced a trap composed of 13 places in 266 ms of which 2 ms to minimize.
[2025-05-29 20:17:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 420 ms
[2025-05-29 20:17:49] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 272 ms.
[2025-05-29 20:17:50] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 1 ms to minimize.
[2025-05-29 20:17:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 405 ms
[2025-05-29 20:17:50] [INFO ] Added : 15 causal constraints over 3 iterations in 1573 ms. Result :sat
Minimization took 879 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 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, 0, 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.14 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 9 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 337 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 355 ms. Remains : 229/240 places, 2747/2769 transitions.
[2025-05-29 20:17:51] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
Found an invariant !
This invariant on transitions {4=1, 1722=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 1722=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 3 resets, run finished after 404 ms. (steps per millisecond=24 ) 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, 0, 0] Max Struct:[1, 1, +inf, +inf, +inf, 1, +inf, 1]
[2025-05-29 20:17:53] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2025-05-29 20:17:53] [INFO ] Computed 8 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, +inf, +inf, 1, +inf, 1]
RANDOM walk for 1000001 steps (6 resets) in 11447 ms. (87 steps per ms)
BEST_FIRST walk for 8000005 steps (64 resets) in 27809 ms. (287 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, +inf, +inf, 1, +inf, 1]
[2025-05-29 20:18:32] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:18:32] [INFO ] Invariant cache hit.
[2025-05-29 20:18:32] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:18:33] [INFO ] [Real]Absence check using state equation in 816 ms returned sat
[2025-05-29 20:18:33] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-05-29 20:18:33] [INFO ] [Real]Added 241 Read/Feed constraints in 57 ms returned sat
[2025-05-29 20:18:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:18:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:18:34] [INFO ] [Nat]Absence check using state equation in 802 ms returned sat
[2025-05-29 20:18:34] [INFO ] [Nat]Added 241 Read/Feed constraints in 146 ms returned sat
[2025-05-29 20:18:35] [INFO ] Deduced a trap composed of 16 places in 722 ms of which 4 ms to minimize.
[2025-05-29 20:18:36] [INFO ] Deduced a trap composed of 19 places in 549 ms of which 3 ms to minimize.
[2025-05-29 20:18:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1555 ms
[2025-05-29 20:18:36] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 369 ms.
[2025-05-29 20:18:36] [INFO ] Added : 3 causal constraints over 1 iterations in 805 ms. Result :sat
Minimization took 2636 ms.
[2025-05-29 20:18:39] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:18:40] [INFO ] [Real]Absence check using state equation in 674 ms returned sat
[2025-05-29 20:18:40] [INFO ] [Real]Added 241 Read/Feed constraints in 65 ms returned sat
[2025-05-29 20:18:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:18:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:18:41] [INFO ] [Nat]Absence check using state equation in 934 ms returned sat
[2025-05-29 20:18:41] [INFO ] [Nat]Added 241 Read/Feed constraints in 191 ms returned sat
[2025-05-29 20:18:42] [INFO ] Deduced a trap composed of 8 places in 964 ms of which 5 ms to minimize.
[2025-05-29 20:18:43] [INFO ] Deduced a trap composed of 14 places in 843 ms of which 4 ms to minimize.
[2025-05-29 20:18:44] [INFO ] Deduced a trap composed of 22 places in 716 ms of which 3 ms to minimize.
[2025-05-29 20:18:45] [INFO ] Deduced a trap composed of 14 places in 585 ms of which 2 ms to minimize.
[2025-05-29 20:18:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3558 ms
[2025-05-29 20:18:45] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 287 ms.
[2025-05-29 20:18:46] [INFO ] Added : 4 causal constraints over 1 iterations in 646 ms. Result :sat
Minimization took 2757 ms.
[2025-05-29 20:18:49] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:18:49] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2025-05-29 20:18:49] [INFO ] [Real]Added 241 Read/Feed constraints in 47 ms returned sat
[2025-05-29 20:18:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:18:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:18:50] [INFO ] [Nat]Absence check using state equation in 832 ms returned sat
[2025-05-29 20:18:50] [INFO ] [Nat]Added 241 Read/Feed constraints in 146 ms returned sat
[2025-05-29 20:18:51] [INFO ] Deduced a trap composed of 10 places in 535 ms of which 2 ms to minimize.
[2025-05-29 20:18:52] [INFO ] Deduced a trap composed of 50 places in 927 ms of which 4 ms to minimize.
[2025-05-29 20:18:53] [INFO ] Deduced a trap composed of 56 places in 768 ms of which 3 ms to minimize.
[2025-05-29 20:18:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2604 ms
[2025-05-29 20:18:53] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 329 ms.
[2025-05-29 20:18:55] [INFO ] Deduced a trap composed of 17 places in 671 ms of which 4 ms to minimize.
[2025-05-29 20:18:56] [INFO ] Deduced a trap composed of 9 places in 712 ms of which 3 ms to minimize.
[2025-05-29 20:18:57] [INFO ] Deduced a trap composed of 5 places in 593 ms of which 4 ms to minimize.
[2025-05-29 20:18:58] [INFO ] Deduced a trap composed of 39 places in 549 ms of which 7 ms to minimize.
[2025-05-29 20:18:58] [INFO ] Deduced a trap composed of 49 places in 363 ms of which 3 ms to minimize.
[2025-05-29 20:18:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3803 ms
[2025-05-29 20:18:59] [INFO ] Added : 12 causal constraints over 7 iterations in 5843 ms. Result :sat
Minimization took 2564 ms.
[2025-05-29 20:19:02] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:19:02] [INFO ] [Real]Absence check using state equation in 777 ms returned sat
[2025-05-29 20:19:03] [INFO ] [Real]Added 241 Read/Feed constraints in 56 ms returned sat
[2025-05-29 20:19:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:19:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 20:19:03] [INFO ] [Nat]Absence check using state equation in 741 ms returned sat
[2025-05-29 20:19:04] [INFO ] [Nat]Added 241 Read/Feed constraints in 67 ms returned sat
[2025-05-29 20:19:04] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 374 ms.
[2025-05-29 20:19:04] [INFO ] Added : 2 causal constraints over 1 iterations in 785 ms. Result :sat
Minimization took 2656 ms.
[2025-05-29 20:19:07] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:19:08] [INFO ] [Real]Absence check using state equation in 666 ms returned sat
[2025-05-29 20:19:08] [INFO ] [Real]Added 241 Read/Feed constraints in 89 ms returned sat
[2025-05-29 20:19:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:19:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 20:19:09] [INFO ] [Nat]Absence check using state equation in 759 ms returned sat
[2025-05-29 20:19:09] [INFO ] [Nat]Added 241 Read/Feed constraints in 80 ms returned sat
[2025-05-29 20:19:10] [INFO ] Deduced a trap composed of 22 places in 768 ms of which 3 ms to minimize.
[2025-05-29 20:19:11] [INFO ] Deduced a trap composed of 53 places in 881 ms of which 4 ms to minimize.
[2025-05-29 20:19:12] [INFO ] Deduced a trap composed of 48 places in 873 ms of which 2 ms to minimize.
[2025-05-29 20:19:13] [INFO ] Deduced a trap composed of 60 places in 877 ms of which 5 ms to minimize.
[2025-05-29 20:19:14] [INFO ] Deduced a trap composed of 81 places in 816 ms of which 5 ms to minimize.
[2025-05-29 20:19:15] [INFO ] Deduced a trap composed of 66 places in 881 ms of which 4 ms to minimize.
[2025-05-29 20:19:15] [INFO ] Deduced a trap composed of 11 places in 687 ms of which 4 ms to minimize.
[2025-05-29 20:19:16] [INFO ] Deduced a trap composed of 64 places in 734 ms of which 4 ms to minimize.
[2025-05-29 20:19:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 7518 ms
[2025-05-29 20:19:17] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 265 ms.
[2025-05-29 20:19:17] [INFO ] Added : 3 causal constraints over 1 iterations in 628 ms. Result :sat
Minimization took 2852 ms.
[2025-05-29 20:19:20] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:19:21] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2025-05-29 20:19:21] [INFO ] [Real]Added 241 Read/Feed constraints in 47 ms returned sat
[2025-05-29 20:19:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:19:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 20:19:22] [INFO ] [Nat]Absence check using state equation in 750 ms returned sat
[2025-05-29 20:19:22] [INFO ] [Nat]Added 241 Read/Feed constraints in 117 ms returned sat
[2025-05-29 20:19:23] [INFO ] Deduced a trap composed of 69 places in 633 ms of which 4 ms to minimize.
[2025-05-29 20:19:23] [INFO ] Deduced a trap composed of 41 places in 685 ms of which 3 ms to minimize.
[2025-05-29 20:19:24] [INFO ] Deduced a trap composed of 27 places in 488 ms of which 3 ms to minimize.
[2025-05-29 20:19:25] [INFO ] Deduced a trap composed of 52 places in 616 ms of which 4 ms to minimize.
[2025-05-29 20:19:25] [INFO ] Deduced a trap composed of 83 places in 624 ms of which 3 ms to minimize.
[2025-05-29 20:19:26] [INFO ] Deduced a trap composed of 40 places in 455 ms of which 3 ms to minimize.
[2025-05-29 20:19:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4290 ms
[2025-05-29 20:19:26] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 262 ms.
[2025-05-29 20:19:27] [INFO ] Added : 3 causal constraints over 1 iterations in 623 ms. Result :sat
Minimization took 2368 ms.
[2025-05-29 20:19:29] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:19:30] [INFO ] [Real]Absence check using state equation in 699 ms returned sat
[2025-05-29 20:19:30] [INFO ] [Real]Added 241 Read/Feed constraints in 60 ms returned sat
[2025-05-29 20:19:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:19:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:19:31] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2025-05-29 20:19:31] [INFO ] [Nat]Added 241 Read/Feed constraints in 299 ms returned sat
[2025-05-29 20:19:32] [INFO ] Deduced a trap composed of 10 places in 457 ms of which 4 ms to minimize.
[2025-05-29 20:19:33] [INFO ] Deduced a trap composed of 16 places in 585 ms of which 3 ms to minimize.
[2025-05-29 20:19:33] [INFO ] Deduced a trap composed of 28 places in 580 ms of which 3 ms to minimize.
[2025-05-29 20:19:34] [INFO ] Deduced a trap composed of 31 places in 456 ms of which 2 ms to minimize.
[2025-05-29 20:19:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2462 ms
[2025-05-29 20:19:34] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 305 ms.
[2025-05-29 20:19:34] [INFO ] Added : 3 causal constraints over 1 iterations in 663 ms. Result :sat
Minimization took 2525 ms.
[2025-05-29 20:19:37] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:19:38] [INFO ] [Real]Absence check using state equation in 795 ms returned sat
[2025-05-29 20:19:38] [INFO ] [Real]Added 241 Read/Feed constraints in 59 ms returned sat
[2025-05-29 20:19:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:19:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:19:39] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2025-05-29 20:19:39] [INFO ] [Nat]Added 241 Read/Feed constraints in 164 ms returned sat
[2025-05-29 20:19:40] [INFO ] Deduced a trap composed of 12 places in 349 ms of which 2 ms to minimize.
[2025-05-29 20:19:40] [INFO ] Deduced a trap composed of 24 places in 260 ms of which 2 ms to minimize.
[2025-05-29 20:19:40] [INFO ] Deduced a trap composed of 27 places in 284 ms of which 6 ms to minimize.
[2025-05-29 20:19:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1237 ms
[2025-05-29 20:19:41] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 312 ms.
[2025-05-29 20:19:42] [INFO ] Deduced a trap composed of 51 places in 436 ms of which 2 ms to minimize.
[2025-05-29 20:19:43] [INFO ] Deduced a trap composed of 14 places in 347 ms of which 2 ms to minimize.
[2025-05-29 20:19:43] [INFO ] Deduced a trap composed of 48 places in 370 ms of which 2 ms to minimize.
[2025-05-29 20:19:44] [INFO ] Deduced a trap composed of 50 places in 442 ms of which 2 ms to minimize.
[2025-05-29 20:19:44] [INFO ] Deduced a trap composed of 47 places in 436 ms of which 3 ms to minimize.
[2025-05-29 20:19:45] [INFO ] Deduced a trap composed of 45 places in 563 ms of which 3 ms to minimize.
[2025-05-29 20:19:46] [INFO ] Deduced a trap composed of 50 places in 516 ms of which 2 ms to minimize.
[2025-05-29 20:19:47] [INFO ] Deduced a trap composed of 44 places in 559 ms of which 3 ms to minimize.
[2025-05-29 20:19:47] [INFO ] Deduced a trap composed of 44 places in 551 ms of which 2 ms to minimize.
[2025-05-29 20:19:48] [INFO ] Deduced a trap composed of 51 places in 472 ms of which 2 ms to minimize.
[2025-05-29 20:19:49] [INFO ] Deduced a trap composed of 49 places in 538 ms of which 2 ms to minimize.
[2025-05-29 20:19:49] [INFO ] Deduced a trap composed of 52 places in 562 ms of which 3 ms to minimize.
[2025-05-29 20:19:50] [INFO ] Deduced a trap composed of 11 places in 546 ms of which 2 ms to minimize.
[2025-05-29 20:19:51] [INFO ] Deduced a trap composed of 9 places in 711 ms of which 3 ms to minimize.
[2025-05-29 20:19:52] [INFO ] Deduced a trap composed of 53 places in 612 ms of which 3 ms to minimize.
[2025-05-29 20:19:52] [INFO ] Deduced a trap composed of 51 places in 587 ms of which 3 ms to minimize.
[2025-05-29 20:19:53] [INFO ] Deduced a trap composed of 51 places in 571 ms of which 2 ms to minimize.
[2025-05-29 20:19:54] [INFO ] Deduced a trap composed of 5 places in 480 ms of which 3 ms to minimize.
[2025-05-29 20:19:54] [INFO ] Deduced a trap composed of 56 places in 411 ms of which 2 ms to minimize.
[2025-05-29 20:19:55] [INFO ] Deduced a trap composed of 50 places in 440 ms of which 2 ms to minimize.
[2025-05-29 20:19:56] [INFO ] Deduced a trap composed of 51 places in 552 ms of which 2 ms to minimize.
[2025-05-29 20:19:56] [INFO ] Deduced a trap composed of 49 places in 525 ms of which 3 ms to minimize.
[2025-05-29 20:19:57] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 14913 ms
[2025-05-29 20:19:57] [INFO ] Added : 24 causal constraints over 7 iterations in 16787 ms. Result :sat
Minimization took 2645 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 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, 0, 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 54 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 54 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 52 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2025-05-29 20:20:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:20:01] [INFO ] Invariant cache hit.
[2025-05-29 20:20:02] [INFO ] Implicit Places using invariants in 767 ms returned []
[2025-05-29 20:20:02] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:20:02] [INFO ] Invariant cache hit.
[2025-05-29 20:20:03] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-05-29 20:20:05] [INFO ] Implicit Places using invariants and state equation in 3312 ms returned []
Implicit Place search using SMT with State Equation took 4091 ms to find 0 implicit places.
[2025-05-29 20:20:05] [INFO ] Redundant transitions in 397 ms returned []
Running 2746 sub problems to find dead transitions.
[2025-05-29 20:20:06] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:20:06] [INFO ] Invariant cache hit.
[2025-05-29 20:20:06] [INFO ] State equation strengthened by 241 read => feed constraints.
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 30189 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2746/2746 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2746 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
[2025-05-29 20:21:26] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 2 ms to minimize.
[2025-05-29 20:21:32] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 1 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
[2025-05-29 20:21:32] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 1 ms to minimize.
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
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
[2025-05-29 20:21:32] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 1 ms to minimize.
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
[2025-05-29 20:21:32] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
[2025-05-29 20:21:32] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 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
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 0)
(s4 0)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 229/2847 variables, and 14 constraints, problems are : Problem set: 206 solved, 2540 unsolved in 30099 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 0/2746 constraints, Known Traps: 6/6 constraints]
After SMT, in 96267ms problems are : Problem set: 206 solved, 2540 unsolved
Search for dead transitions found 206 dead transitions in 96344ms
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 2 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 2 ms
Applied a total of 88 rules in 111 ms. Remains 143 /229 variables (removed 86) and now considering 1004/2541 (removed 1537) transitions.
[2025-05-29 20:21:42] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
// Phase 1: matrix 946 rows 143 cols
[2025-05-29 20:21:42] [INFO ] Computed 11 invariants in 10 ms
[2025-05-29 20:21:42] [INFO ] Implicit Places using invariants in 429 ms returned []
[2025-05-29 20:21:42] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-05-29 20:21:42] [INFO ] Invariant cache hit.
[2025-05-29 20:21:43] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-05-29 20:21:44] [INFO ] Implicit Places using invariants and state equation in 1254 ms returned []
Implicit Place search using SMT with State Equation took 1698 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 102748 ms. Remains : 143/229 places, 1004/2747 transitions.
Deduced a syphon composed of 3 places in 2 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-05-29 20:21:44] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
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 2 resets, run finished after 100 ms. (steps per millisecond=100 ) 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, 0, 0] Max Struct:[1, 1, +inf, +inf, +inf, 1, +inf, 1]
[2025-05-29 20:21:44] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
// Phase 1: matrix 946 rows 140 cols
[2025-05-29 20:21:44] [INFO ] Computed 8 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
RANDOM walk for 1000000 steps (8 resets) in 5822 ms. (171 steps per ms)
BEST_FIRST walk for 5000005 steps (28 resets) in 9081 ms. (550 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
[2025-05-29 20:21:59] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-05-29 20:21:59] [INFO ] Invariant cache hit.
[2025-05-29 20:21:59] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:22:00] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2025-05-29 20:22:00] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-05-29 20:22:00] [INFO ] [Real]Added 119 Read/Feed constraints in 22 ms returned sat
[2025-05-29 20:22:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:22:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:22:00] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2025-05-29 20:22:00] [INFO ] [Nat]Added 119 Read/Feed constraints in 50 ms returned sat
[2025-05-29 20:22:00] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 2 ms to minimize.
[2025-05-29 20:22:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2025-05-29 20:22:00] [INFO ] Computed and/alt/rep : 232/915/231 causal constraints (skipped 714 transitions) in 119 ms.
[2025-05-29 20:22:01] [INFO ] Deduced a trap composed of 29 places in 263 ms of which 3 ms to minimize.
[2025-05-29 20:22:01] [INFO ] Deduced a trap composed of 28 places in 245 ms of which 2 ms to minimize.
[2025-05-29 20:22:02] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 5 ms to minimize.
[2025-05-29 20:22:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1009 ms
[2025-05-29 20:22:02] [INFO ] Added : 7 causal constraints over 2 iterations in 1408 ms. Result :sat
Minimization took 685 ms.
[2025-05-29 20:22:03] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:22:03] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2025-05-29 20:22:03] [INFO ] [Real]Added 119 Read/Feed constraints in 32 ms returned sat
[2025-05-29 20:22:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:22:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:22:03] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2025-05-29 20:22:03] [INFO ] [Nat]Added 119 Read/Feed constraints in 36 ms returned sat
[2025-05-29 20:22:04] [INFO ] Computed and/alt/rep : 232/915/231 causal constraints (skipped 714 transitions) in 130 ms.
[2025-05-29 20:22:04] [INFO ] Added : 1 causal constraints over 1 iterations in 303 ms. Result :sat
Minimization took 583 ms.
[2025-05-29 20:22:04] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:22:05] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2025-05-29 20:22:05] [INFO ] [Real]Added 119 Read/Feed constraints in 37 ms returned sat
[2025-05-29 20:22:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:22:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 20:22:05] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2025-05-29 20:22:05] [INFO ] [Nat]Added 119 Read/Feed constraints in 57 ms returned sat
[2025-05-29 20:22:06] [INFO ] Deduced a trap composed of 9 places in 325 ms of which 2 ms to minimize.
[2025-05-29 20:22:06] [INFO ] Deduced a trap composed of 36 places in 267 ms of which 2 ms to minimize.
[2025-05-29 20:22:06] [INFO ] Deduced a trap composed of 32 places in 269 ms of which 2 ms to minimize.
[2025-05-29 20:22:07] [INFO ] Deduced a trap composed of 34 places in 276 ms of which 3 ms to minimize.
[2025-05-29 20:22:07] [INFO ] Deduced a trap composed of 30 places in 285 ms of which 2 ms to minimize.
[2025-05-29 20:22:07] [INFO ] Deduced a trap composed of 30 places in 268 ms of which 2 ms to minimize.
[2025-05-29 20:22:08] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 2 ms to minimize.
[2025-05-29 20:22:08] [INFO ] Deduced a trap composed of 30 places in 282 ms of which 2 ms to minimize.
[2025-05-29 20:22:08] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2025-05-29 20:22:08] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2755 ms
[2025-05-29 20:22:08] [INFO ] Computed and/alt/rep : 232/915/231 causal constraints (skipped 714 transitions) in 127 ms.
[2025-05-29 20:22:09] [INFO ] Added : 6 causal constraints over 2 iterations in 367 ms. Result :sat
Minimization took 650 ms.
[2025-05-29 20:22:09] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:22:10] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2025-05-29 20:22:10] [INFO ] [Real]Added 119 Read/Feed constraints in 31 ms returned sat
[2025-05-29 20:22:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:22:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 20:22:10] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2025-05-29 20:22:10] [INFO ] [Nat]Added 119 Read/Feed constraints in 76 ms returned sat
[2025-05-29 20:22:11] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 2 ms to minimize.
[2025-05-29 20:22:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2025-05-29 20:22:11] [INFO ] Computed and/alt/rep : 232/915/231 causal constraints (skipped 714 transitions) in 124 ms.
[2025-05-29 20:22:11] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 2 ms to minimize.
[2025-05-29 20:22:12] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 2 ms to minimize.
[2025-05-29 20:22:12] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 2 ms to minimize.
[2025-05-29 20:22:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 855 ms
[2025-05-29 20:22:12] [INFO ] Added : 11 causal constraints over 4 iterations in 1438 ms. Result :sat
Minimization took 643 ms.
[2025-05-29 20:22:13] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:22:13] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2025-05-29 20:22:13] [INFO ] [Real]Added 119 Read/Feed constraints in 25 ms returned sat
[2025-05-29 20:22:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:22:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:22:14] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2025-05-29 20:22:14] [INFO ] [Nat]Added 119 Read/Feed constraints in 42 ms returned sat
[2025-05-29 20:22:14] [INFO ] Deduced a trap composed of 67 places in 328 ms of which 3 ms to minimize.
[2025-05-29 20:22:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 431 ms
[2025-05-29 20:22:14] [INFO ] Computed and/alt/rep : 232/915/231 causal constraints (skipped 714 transitions) in 124 ms.
[2025-05-29 20:22:14] [INFO ] Added : 1 causal constraints over 1 iterations in 281 ms. Result :sat
Minimization took 542 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 2334, 0, 0, 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, 2334, 0, 0, 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 25 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 26 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 16 ms. Remains 140 /140 variables (removed 0) and now considering 1004/1004 (removed 0) transitions.
[2025-05-29 20:22:21] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-05-29 20:22:21] [INFO ] Invariant cache hit.
[2025-05-29 20:22:22] [INFO ] Implicit Places using invariants in 628 ms returned []
[2025-05-29 20:22:22] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-05-29 20:22:22] [INFO ] Invariant cache hit.
[2025-05-29 20:22:22] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-05-29 20:22:23] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 1471 ms to find 0 implicit places.
[2025-05-29 20:22:23] [INFO ] Redundant transitions in 29 ms returned []
Running 1003 sub problems to find dead transitions.
[2025-05-29 20:22:23] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-05-29 20:22:23] [INFO ] Invariant cache hit.
[2025-05-29 20:22:23] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1003 unsolved
[2025-05-29 20:22:33] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 1 ms to minimize.
[2025-05-29 20:22:36] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2025-05-29 20:22:36] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 2 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
[2025-05-29 20:22:36] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
Problem TDEAD627 is UNSAT
[2025-05-29 20:22:37] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
[2025-05-29 20:22:38] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
[2025-05-29 20:22:38] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
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, 7/15 constraints. Problems are: Problem set: 164 solved, 839 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/15 constraints. Problems are: Problem set: 164 solved, 839 unsolved
Problem TDEAD626 is UNSAT
At refinement iteration 3 (OVERLAPS) 946/1086 variables, 140/155 constraints. Problems are: Problem set: 165 solved, 838 unsolved
SMT process timed out in 34601ms, After SMT, problems are : Problem set: 165 solved, 838 unsolved
Search for dead transitions found 165 dead transitions in 34626ms
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.3 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 46 ms. Remains 120 /140 variables (removed 20) and now considering 711/839 (removed 128) transitions.
[2025-05-29 20:22:57] [INFO ] Flow matrix only has 650 transitions (discarded 61 similar events)
// Phase 1: matrix 650 rows 120 cols
[2025-05-29 20:22:57] [INFO ] Computed 8 invariants in 5 ms
[2025-05-29 20:22:58] [INFO ] Implicit Places using invariants in 343 ms returned []
[2025-05-29 20:22:58] [INFO ] Flow matrix only has 650 transitions (discarded 61 similar events)
[2025-05-29 20:22:58] [INFO ] Invariant cache hit.
[2025-05-29 20:22:58] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-05-29 20:22:58] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1075 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 37278 ms. Remains : 120/140 places, 711/1004 transitions.
[2025-05-29 20:22:58] [INFO ] Flow matrix only has 650 transitions (discarded 61 similar events)
Found an invariant !
This invariant on transitions {5=1, 354=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {2=1, 354=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 3 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :[0, 0, 0, 0, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
[2025-05-29 20:22:59] [INFO ] Flow matrix only has 650 transitions (discarded 61 similar events)
[2025-05-29 20:22:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
RANDOM walk for 1000000 steps (2 resets) in 4665 ms. (214 steps per ms)
BEST_FIRST walk for 5000003 steps (26 resets) in 8289 ms. (603 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
[2025-05-29 20:23:12] [INFO ] Flow matrix only has 650 transitions (discarded 61 similar events)
[2025-05-29 20:23:12] [INFO ] Invariant cache hit.
[2025-05-29 20:23:12] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:23:12] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2025-05-29 20:23:12] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-05-29 20:23:12] [INFO ] [Real]Added 86 Read/Feed constraints in 16 ms returned sat
[2025-05-29 20:23:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:23:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:23:12] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2025-05-29 20:23:12] [INFO ] [Nat]Added 86 Read/Feed constraints in 34 ms returned sat
[2025-05-29 20:23:12] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
[2025-05-29 20:23:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2025-05-29 20:23:13] [INFO ] Computed and/alt/rep : 180/637/179 causal constraints (skipped 470 transitions) in 56 ms.
[2025-05-29 20:23:13] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 2 ms to minimize.
[2025-05-29 20:23:13] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2025-05-29 20:23:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 374 ms
[2025-05-29 20:23:13] [INFO ] Added : 14 causal constraints over 5 iterations in 727 ms. Result :sat
Minimization took 516 ms.
[2025-05-29 20:23:14] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:23:14] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2025-05-29 20:23:14] [INFO ] [Real]Added 86 Read/Feed constraints in 33 ms returned sat
[2025-05-29 20:23:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:23:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:23:14] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2025-05-29 20:23:15] [INFO ] [Nat]Added 86 Read/Feed constraints in 51 ms returned sat
[2025-05-29 20:23:15] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 1 ms to minimize.
[2025-05-29 20:23:15] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 2 ms to minimize.
[2025-05-29 20:23:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 367 ms
[2025-05-29 20:23:15] [INFO ] Computed and/alt/rep : 180/637/179 causal constraints (skipped 470 transitions) in 81 ms.
[2025-05-29 20:23:15] [INFO ] Added : 3 causal constraints over 1 iterations in 197 ms. Result :sat
Minimization took 462 ms.
[2025-05-29 20:23:16] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:23:16] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2025-05-29 20:23:16] [INFO ] [Real]Added 86 Read/Feed constraints in 26 ms returned sat
[2025-05-29 20:23:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:23:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:23:16] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2025-05-29 20:23:16] [INFO ] [Nat]Added 86 Read/Feed constraints in 52 ms returned sat
[2025-05-29 20:23:16] [INFO ] Computed and/alt/rep : 180/637/179 causal constraints (skipped 470 transitions) in 79 ms.
[2025-05-29 20:23:17] [INFO ] Added : 2 causal constraints over 1 iterations in 198 ms. Result :sat
Minimization took 479 ms.
[2025-05-29 20:23:17] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:23:17] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2025-05-29 20:23:17] [INFO ] [Real]Added 86 Read/Feed constraints in 25 ms returned sat
[2025-05-29 20:23:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:23:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:23:18] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2025-05-29 20:23:18] [INFO ] [Nat]Added 86 Read/Feed constraints in 41 ms returned sat
[2025-05-29 20:23:18] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 3 ms to minimize.
[2025-05-29 20:23:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2025-05-29 20:23:18] [INFO ] Computed and/alt/rep : 180/637/179 causal constraints (skipped 470 transitions) in 82 ms.
[2025-05-29 20:23:18] [INFO ] Added : 2 causal constraints over 1 iterations in 196 ms. Result :sat
Minimization took 496 ms.
[2025-05-29 20:23:19] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:23:19] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2025-05-29 20:23:19] [INFO ] [Real]Added 86 Read/Feed constraints in 58 ms returned sat
[2025-05-29 20:23:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:23:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:23:20] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2025-05-29 20:23:20] [INFO ] [Nat]Added 86 Read/Feed constraints in 69 ms returned sat
[2025-05-29 20:23:20] [INFO ] Computed and/alt/rep : 180/637/179 causal constraints (skipped 470 transitions) in 81 ms.
[2025-05-29 20:23:20] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 2 ms to minimize.
[2025-05-29 20:23:20] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 1 ms to minimize.
[2025-05-29 20:23:20] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 2 ms to minimize.
[2025-05-29 20:23:21] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 2 ms to minimize.
[2025-05-29 20:23:21] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 2 ms to minimize.
[2025-05-29 20:23:21] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 1 ms to minimize.
[2025-05-29 20:23:21] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 2 ms to minimize.
[2025-05-29 20:23:21] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 2 ms to minimize.
[2025-05-29 20:23:22] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 2 ms to minimize.
[2025-05-29 20:23:22] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 2 ms to minimize.
[2025-05-29 20:23:22] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 2 ms to minimize.
[2025-05-29 20:23:22] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 1 ms to minimize.
[2025-05-29 20:23:22] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 2 ms to minimize.
[2025-05-29 20:23:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2485 ms
[2025-05-29 20:23:23] [INFO ] Added : 19 causal constraints over 6 iterations in 2990 ms. Result :sat
Minimization took 517 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 2334, 0, 0, 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, 2334, 0, 0, 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 9 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 9 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 8 ms. Remains 120 /120 variables (removed 0) and now considering 711/711 (removed 0) transitions.
[2025-05-29 20:23:29] [INFO ] Flow matrix only has 650 transitions (discarded 61 similar events)
[2025-05-29 20:23:29] [INFO ] Invariant cache hit.
[2025-05-29 20:23:30] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-05-29 20:23:30] [INFO ] Flow matrix only has 650 transitions (discarded 61 similar events)
[2025-05-29 20:23:30] [INFO ] Invariant cache hit.
[2025-05-29 20:23:30] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-05-29 20:23:30] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
[2025-05-29 20:23:30] [INFO ] Redundant transitions in 9 ms returned []
Running 710 sub problems to find dead transitions.
[2025-05-29 20:23:30] [INFO ] Flow matrix only has 650 transitions (discarded 61 similar events)
[2025-05-29 20:23:30] [INFO ] Invariant cache hit.
[2025-05-29 20:23:30] [INFO ] State equation strengthened by 86 read => feed constraints.
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 30028 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]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
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
[2025-05-29 20:24:23] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2025-05-29 20:24:24] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
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
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
[2025-05-29 20:24:28] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2025-05-29 20:24:29] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 770/770 variables, and 928 constraints, problems are : Problem set: 121 solved, 589 unsolved in 30032 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: 4/4 constraints]
After SMT, in 62247ms problems are : Problem set: 121 solved, 589 unsolved
Search for dead transitions found 121 dead transitions in 62261ms
Found 121 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 121 transitions
Dead transitions reduction (with SMT) removed 121 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 120/120 places, 590/711 transitions.
Graph (complete) has 848 edges and 120 vertex of which 117 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 13 places and 181 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 104 transition count 409
Reduce places removed 8 places and 72 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 22 place count 96 transition count 337
Reduce places removed 2 places and 29 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 94 transition count 308
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 92 transition count 292
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 27 place count 91 transition count 283
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 30 place count 88 transition count 258
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 5 with 3 rules applied. Total rules applied 33 place count 88 transition count 258
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 33 rules in 31 ms. Remains 88 /120 variables (removed 32) and now considering 258/590 (removed 332) transitions.
[2025-05-29 20:24:33] [INFO ] Flow matrix only has 241 transitions (discarded 17 similar events)
// Phase 1: matrix 241 rows 88 cols
[2025-05-29 20:24:33] [INFO ] Computed 11 invariants in 2 ms
[2025-05-29 20:24:33] [INFO ] Implicit Places using invariants in 201 ms returned []
[2025-05-29 20:24:33] [INFO ] Flow matrix only has 241 transitions (discarded 17 similar events)
[2025-05-29 20:24:33] [INFO ] Invariant cache hit.
[2025-05-29 20:24:33] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-29 20:24:33] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 88/120 places, 258/711 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63872 ms. Remains : 88/120 places, 258/711 transitions.
Deduced a syphon composed of 3 places in 0 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-05-29 20:24:33] [INFO ] Flow matrix only has 241 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {5=1, 169=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {2=1, 169=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :[0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
[2025-05-29 20:24:33] [INFO ] Flow matrix only has 241 transitions (discarded 17 similar events)
// Phase 1: matrix 241 rows 85 cols
[2025-05-29 20:24:33] [INFO ] Computed 8 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
RANDOM walk for 1000000 steps (2 resets) in 2356 ms. (424 steps per ms)
BEST_FIRST walk for 2000002 steps (10 resets) in 1524 ms. (1311 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
[2025-05-29 20:24:37] [INFO ] Flow matrix only has 241 transitions (discarded 17 similar events)
[2025-05-29 20:24:37] [INFO ] Invariant cache hit.
[2025-05-29 20:24:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 20:24:37] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 15 ms returned sat
[2025-05-29 20:24:37] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2025-05-29 20:24:38] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-29 20:24:38] [INFO ] [Real]Added 49 Read/Feed constraints in 15 ms returned sat
[2025-05-29 20:24:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:24:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 20:24:38] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:24:38] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2025-05-29 20:24:38] [INFO ] [Nat]Added 49 Read/Feed constraints in 16 ms returned sat
[2025-05-29 20:24:38] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 3 ms to minimize.
[2025-05-29 20:24:38] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2025-05-29 20:24:38] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2025-05-29 20:24:38] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2025-05-29 20:24:38] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2025-05-29 20:24:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 519 ms
[2025-05-29 20:24:38] [INFO ] Computed and/alt/rep : 192/973/191 causal constraints (skipped 49 transitions) in 28 ms.
[2025-05-29 20:24:38] [INFO ] Added : 10 causal constraints over 2 iterations in 106 ms. Result :sat
Minimization took 90 ms.
[2025-05-29 20:24:38] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 20:24:38] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:24:39] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2025-05-29 20:24:39] [INFO ] [Real]Added 49 Read/Feed constraints in 12 ms returned sat
[2025-05-29 20:24:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:24:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 20:24:39] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-29 20:24:39] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2025-05-29 20:24:39] [INFO ] [Nat]Added 49 Read/Feed constraints in 10 ms returned sat
[2025-05-29 20:24:39] [INFO ] Computed and/alt/rep : 192/973/191 causal constraints (skipped 49 transitions) in 16 ms.
[2025-05-29 20:24:39] [INFO ] Added : 11 causal constraints over 3 iterations in 73 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 2334, 0, 0, 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, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 258/258 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 85/85 places, 258/258 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 258/258 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2025-05-29 20:24:39] [INFO ] Flow matrix only has 241 transitions (discarded 17 similar events)
[2025-05-29 20:24:39] [INFO ] Invariant cache hit.
[2025-05-29 20:24:39] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-05-29 20:24:39] [INFO ] Flow matrix only has 241 transitions (discarded 17 similar events)
[2025-05-29 20:24:39] [INFO ] Invariant cache hit.
[2025-05-29 20:24:39] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-29 20:24:39] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2025-05-29 20:24:39] [INFO ] Redundant transitions in 2 ms returned []
Running 257 sub problems to find dead transitions.
[2025-05-29 20:24:39] [INFO ] Flow matrix only has 241 transitions (discarded 17 similar events)
[2025-05-29 20:24:39] [INFO ] Invariant cache hit.
[2025-05-29 20:24:39] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
At refinement iteration 3 (OVERLAPS) 241/326 variables, 85/93 constraints. Problems are: Problem set: 2 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 49/142 constraints. Problems are: Problem set: 2 solved, 255 unsolved
[2025-05-29 20:24:45] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2025-05-29 20:24:46] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
[2025-05-29 20:24:46] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
[2025-05-29 20:24:46] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
Problem TDEAD134 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 4/146 constraints. Problems are: Problem set: 6 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/146 constraints. Problems are: Problem set: 6 solved, 251 unsolved
At refinement iteration 7 (OVERLAPS) 0/326 variables, 0/146 constraints. Problems are: Problem set: 6 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 146 constraints, problems are : Problem set: 6 solved, 251 unsolved in 12534 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 6 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 7/7 constraints. Problems are: Problem set: 6 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 1/8 constraints. Problems are: Problem set: 6 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 4/12 constraints. Problems are: Problem set: 6 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 241/326 variables, 85/97 constraints. Problems are: Problem set: 6 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 49/146 constraints. Problems are: Problem set: 6 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 251/397 constraints. Problems are: Problem set: 6 solved, 251 unsolved
[2025-05-29 20:24:56] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 1/398 constraints. Problems are: Problem set: 6 solved, 251 unsolved
[2025-05-29 20:25:00] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2025-05-29 20:25:00] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2025-05-29 20:25:02] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 3/401 constraints. Problems are: Problem set: 6 solved, 251 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/401 constraints. Problems are: Problem set: 6 solved, 251 unsolved
At refinement iteration 10 (OVERLAPS) 0/326 variables, 0/401 constraints. Problems are: Problem set: 6 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 401 constraints, problems are : Problem set: 6 solved, 251 unsolved in 22580 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 251/257 constraints, Known Traps: 8/8 constraints]
After SMT, in 35449ms problems are : Problem set: 6 solved, 251 unsolved
Search for dead transitions found 6 dead transitions in 35460ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 85/85 places, 252/258 transitions.
Reduce places removed 1 places and 14 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 84 transition count 238
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 13 ms. Remains 84 /85 variables (removed 1) and now considering 238/252 (removed 14) transitions.
[2025-05-29 20:25:15] [INFO ] Flow matrix only has 223 transitions (discarded 15 similar events)
// Phase 1: matrix 223 rows 84 cols
[2025-05-29 20:25:15] [INFO ] Computed 9 invariants in 1 ms
[2025-05-29 20:25:15] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-05-29 20:25:15] [INFO ] Flow matrix only has 223 transitions (discarded 15 similar events)
[2025-05-29 20:25:15] [INFO ] Invariant cache hit.
[2025-05-29 20:25:15] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-05-29 20:25:15] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/85 places, 238/258 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 36480 ms. Remains : 84/85 places, 238/258 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-05-29 20:25:15] [INFO ] Flow matrix only has 223 transitions (discarded 15 similar events)
Found an invariant !
This invariant on transitions {4=1, 151=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {2=1, 151=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
[2025-05-29 20:25:16] [INFO ] Flow matrix only has 223 transitions (discarded 15 similar events)
// Phase 1: matrix 223 rows 83 cols
[2025-05-29 20:25:16] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
RANDOM walk for 1000000 steps (2 resets) in 2265 ms. (441 steps per ms)
BEST_FIRST walk for 1000001 steps (6 resets) in 754 ms. (1324 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[665, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
[2025-05-29 20:25:19] [INFO ] Flow matrix only has 223 transitions (discarded 15 similar events)
[2025-05-29 20:25:19] [INFO ] Invariant cache hit.
[2025-05-29 20:25:19] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-29 20:25:19] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:25:19] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2025-05-29 20:25:19] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-05-29 20:25:19] [INFO ] [Real]Added 48 Read/Feed constraints in 15 ms returned sat
[2025-05-29 20:25:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:25:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 20:25:19] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-29 20:25:19] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2025-05-29 20:25:19] [INFO ] [Nat]Added 48 Read/Feed constraints in 10 ms returned sat
[2025-05-29 20:25:19] [INFO ] Computed and/alt/rep : 185/984/185 causal constraints (skipped 37 transitions) in 21 ms.
[2025-05-29 20:25:19] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
[2025-05-29 20:25:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2025-05-29 20:25:19] [INFO ] Added : 25 causal constraints over 5 iterations in 222 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[665, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[665, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
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, 231/231 transitions.
Applied a total of 0 rules in 6 ms. Remains 83 /83 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 83/83 places, 231/231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 231/231 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2025-05-29 20:25:20] [INFO ] Flow matrix only has 216 transitions (discarded 15 similar events)
// Phase 1: matrix 216 rows 83 cols
[2025-05-29 20:25:20] [INFO ] Computed 8 invariants in 1 ms
[2025-05-29 20:25:20] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-05-29 20:25:20] [INFO ] Flow matrix only has 216 transitions (discarded 15 similar events)
[2025-05-29 20:25:20] [INFO ] Invariant cache hit.
[2025-05-29 20:25:20] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-05-29 20:25:21] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2025-05-29 20:25:21] [INFO ] Redundant transitions in 1 ms returned []
Running 230 sub problems to find dead transitions.
[2025-05-29 20:25:21] [INFO ] Flow matrix only has 216 transitions (discarded 15 similar events)
[2025-05-29 20:25:21] [INFO ] Invariant cache hit.
[2025-05-29 20:25:21] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 230 unsolved
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
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
At refinement iteration 3 (OVERLAPS) 216/298 variables, 82/90 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 48/138 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2025-05-29 20:25:25] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 1/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 1/299 variables, 1/140 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/140 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/299 variables, 0/140 constraints. Problems are: Problem set: 12 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 140 constraints, problems are : Problem set: 12 solved, 218 unsolved in 14862 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: 230/230 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 12 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/9 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 216/298 variables, 82/91 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 48/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 164/303 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2025-05-29 20:25:38] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 1/304 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2025-05-29 20:25:42] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 1/305 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/305 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 10 (OVERLAPS) 1/299 variables, 1/306 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 54/360 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 0/360 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 13 (OVERLAPS) 0/299 variables, 0/360 constraints. Problems are: Problem set: 12 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 360 constraints, problems are : Problem set: 12 solved, 218 unsolved in 22460 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: 218/230 constraints, Known Traps: 3/3 constraints]
After SMT, in 37595ms problems are : Problem set: 12 solved, 218 unsolved
Search for dead transitions found 12 dead transitions in 37601ms
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, 219/231 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2025-05-29 20:25:58] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 38064 ms. Remains : 83/83 places, 219/231 transitions.
[2025-05-29 20:25:58] [INFO ] Flow matrix only has 204 transitions (discarded 15 similar events)
Found an invariant !
This invariant on transitions {0=1, 132=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[665, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
[2025-05-29 20:25:58] [INFO ] Flow matrix only has 204 transitions (discarded 15 similar events)
// Phase 1: matrix 204 rows 83 cols
[2025-05-29 20:25:58] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[665, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
RANDOM walk for 1000000 steps (2 resets) in 2227 ms. (448 steps per ms)
BEST_FIRST walk for 1000001 steps (9 resets) in 969 ms. (1030 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2126, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
[2025-05-29 20:26:02] [INFO ] Flow matrix only has 204 transitions (discarded 15 similar events)
[2025-05-29 20:26:02] [INFO ] Invariant cache hit.
[2025-05-29 20:26:02] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 20:26:02] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:26:02] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-05-29 20:26:02] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-05-29 20:26:02] [INFO ] [Real]Added 46 Read/Feed constraints in 15 ms returned sat
[2025-05-29 20:26:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:26:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 20:26:02] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:26:02] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2025-05-29 20:26:02] [INFO ] [Nat]Added 46 Read/Feed constraints in 13 ms returned sat
[2025-05-29 20:26:02] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2025-05-29 20:26:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2025-05-29 20:26:02] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 37 transitions) in 22 ms.
[2025-05-29 20:26:02] [INFO ] Added : 45 causal constraints over 9 iterations in 256 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2126, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2126, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 219/219 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 83/83 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 219/219 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2025-05-29 20:26:04] [INFO ] Flow matrix only has 204 transitions (discarded 15 similar events)
[2025-05-29 20:26:04] [INFO ] Invariant cache hit.
[2025-05-29 20:26:04] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-05-29 20:26:04] [INFO ] Flow matrix only has 204 transitions (discarded 15 similar events)
[2025-05-29 20:26:04] [INFO ] Invariant cache hit.
[2025-05-29 20:26:05] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-05-29 20:26:05] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2025-05-29 20:26:05] [INFO ] Redundant transitions in 1 ms returned []
Running 218 sub problems to find dead transitions.
[2025-05-29 20:26:05] [INFO ] Flow matrix only has 204 transitions (discarded 15 similar events)
[2025-05-29 20:26:05] [INFO ] Invariant cache hit.
[2025-05-29 20:26:05] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 204/286 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 46/136 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 1/287 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/287 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 137 constraints, problems are : Problem set: 0 solved, 218 unsolved in 11293 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: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 204/286 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 46/136 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 164/300 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 1/287 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 54/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 355 constraints, problems are : Problem set: 0 solved, 218 unsolved in 15323 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: 218/218 constraints, Known Traps: 0/0 constraints]
After SMT, in 26767ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 26770ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27242 ms. Remains : 83/83 places, 219/219 transitions.
[2025-05-29 20:26:31] [INFO ] Flow matrix only has 204 transitions (discarded 15 similar events)
Found an invariant !
This invariant on transitions {0=1, 132=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {5=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2126, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
[2025-05-29 20:26:32] [INFO ] Flow matrix only has 204 transitions (discarded 15 similar events)
[2025-05-29 20:26:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2126, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
RANDOM walk for 1000000 steps (2 resets) in 2530 ms. (395 steps per ms)
BEST_FIRST walk for 1000000 steps (3 resets) in 882 ms. (1132 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2126, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
[2025-05-29 20:26:35] [INFO ] Flow matrix only has 204 transitions (discarded 15 similar events)
[2025-05-29 20:26:35] [INFO ] Invariant cache hit.
[2025-05-29 20:26:35] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 20:26:35] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:26:35] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2025-05-29 20:26:35] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-05-29 20:26:35] [INFO ] [Real]Added 46 Read/Feed constraints in 11 ms returned sat
[2025-05-29 20:26:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:26:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 20:26:35] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:26:35] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2025-05-29 20:26:35] [INFO ] [Nat]Added 46 Read/Feed constraints in 14 ms returned sat
[2025-05-29 20:26:35] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2025-05-29 20:26:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2025-05-29 20:26:35] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 37 transitions) in 22 ms.
[2025-05-29 20:26:36] [INFO ] Added : 45 causal constraints over 9 iterations in 214 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2126, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2126, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 83/83 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2025-05-29 20:26:38] [INFO ] Flow matrix only has 204 transitions (discarded 15 similar events)
[2025-05-29 20:26:38] [INFO ] Invariant cache hit.
[2025-05-29 20:26:38] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-05-29 20:26:38] [INFO ] Flow matrix only has 204 transitions (discarded 15 similar events)
[2025-05-29 20:26:38] [INFO ] Invariant cache hit.
[2025-05-29 20:26:38] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-05-29 20:26:38] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2025-05-29 20:26:38] [INFO ] Redundant transitions in 1 ms returned []
Running 218 sub problems to find dead transitions.
[2025-05-29 20:26:38] [INFO ] Flow matrix only has 204 transitions (discarded 15 similar events)
[2025-05-29 20:26:38] [INFO ] Invariant cache hit.
[2025-05-29 20:26:38] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 204/286 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 46/136 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 1/287 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/287 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 137 constraints, problems are : Problem set: 0 solved, 218 unsolved in 9489 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: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 204/286 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 46/136 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 164/300 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 1/287 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 54/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 355 constraints, problems are : Problem set: 0 solved, 218 unsolved in 16603 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: 218/218 constraints, Known Traps: 0/0 constraints]
After SMT, in 26359ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 26364ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26764 ms. Remains : 83/83 places, 219/219 transitions.
[2025-05-29 20:27:05] [INFO ] Flow matrix only has 204 transitions (discarded 15 similar events)
Found an invariant !
This invariant on transitions {0=1, 132=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2126, 0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 0
RANDOM walk for 40000 steps (16 resets) in 1258 ms. (31 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (13 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
[2025-05-29 20:27:05] [INFO ] Flow matrix only has 204 transitions (discarded 15 similar events)
[2025-05-29 20:27:05] [INFO ] Invariant cache hit.
[2025-05-29 20:27:05] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/57 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/58 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:27:06] [INFO ] Flatten gal took : 153 ms
At refinement iteration 9 (OVERLAPS) 61/119 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 82/201 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/201 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/201 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/201 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:27:06] [INFO ] Flatten gal took : 73 ms
At refinement iteration 17 (OVERLAPS) 33/234 variables, 15/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/234 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/234 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 42/276 variables, 15/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/276 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/276 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:27:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8373589783431347208.gal : 23 ms
At refinement iteration 23 (INCLUDED_ONLY) 0/276 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 3/279 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/279 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/279 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:27:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9942456057422992962.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8373589783431347208.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9942456057422992962.prop' '--nowitness' '--gen-order' 'FOLLOW'
At refinement iteration 27 (OVERLAPS) 3/282 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/282 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/282 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 2/284 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
At refinement iteration 31 (INCLUDED_ONLY) 0/284 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 3/287 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/287 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/287 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/287 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 332 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: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Loading property file /tmp/ReachabilityCardinality9942456057422992962.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 50
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :50 after 149
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :149 after 344
At refinement iteration 3 (OVERLAPS) 55/57 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/58 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :344 after 731
At refinement iteration 9 (OVERLAPS) 61/119 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 82/201 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/201 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/201 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/201 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 33/234 variables, 15/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/234 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/276 variables, 15/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/276 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/276 variables, 8/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/276 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 3/279 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/279 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/279 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 3/282 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/282 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/282 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/284 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/284 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 3/287 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/287 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/287 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 0/287 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 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: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 620ms problems are : Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :731 after 1502
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1502 after 3041
Parikh walk visited 0 properties in 2248 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 219/219 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 83/83 places, 219/219 transitions.
RANDOM walk for 40003 steps (14 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (36 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3041 after 6116
Interrupted probabilistic random walk after 1046176 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :0 out of 1
Probabilistic random walk after 1046176 steps, saw 646689 distinct states, run finished after 3016 ms. (steps per millisecond=346 ) properties seen :0
[2025-05-29 20:27:11] [INFO ] Flow matrix only has 204 transitions (discarded 15 similar events)
[2025-05-29 20:27:11] [INFO ] Invariant cache hit.
[2025-05-29 20:27:11] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/57 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/58 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 61/119 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 82/201 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/201 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/201 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/201 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 33/234 variables, 15/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/234 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/234 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 42/276 variables, 15/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/276 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/276 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/276 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 3/279 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/279 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/279 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 3/282 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/282 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/282 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 2/284 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/284 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 3/287 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/287 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/287 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/287 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 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: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/57 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/58 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 61/119 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 82/201 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/201 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/201 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/201 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 33/234 variables, 15/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/234 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/276 variables, 15/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/276 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/276 variables, 8/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/276 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 3/279 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/279 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/279 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 3/282 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/282 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/282 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/284 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/284 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 3/287 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/287 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/287 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 0/287 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 175 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: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 402ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1834 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 219/219 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 83/83 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2025-05-29 20:27:14] [INFO ] Flow matrix only has 204 transitions (discarded 15 similar events)
[2025-05-29 20:27:14] [INFO ] Invariant cache hit.
[2025-05-29 20:27:14] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-05-29 20:27:14] [INFO ] Flow matrix only has 204 transitions (discarded 15 similar events)
[2025-05-29 20:27:14] [INFO ] Invariant cache hit.
[2025-05-29 20:27:14] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-05-29 20:27:14] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2025-05-29 20:27:14] [INFO ] Redundant transitions in 1 ms returned []
Running 218 sub problems to find dead transitions.
[2025-05-29 20:27:14] [INFO ] Flow matrix only has 204 transitions (discarded 15 similar events)
[2025-05-29 20:27:14] [INFO ] Invariant cache hit.
[2025-05-29 20:27:14] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 204/286 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 46/136 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 1/287 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/287 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 137 constraints, problems are : Problem set: 0 solved, 218 unsolved in 9664 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: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 204/286 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 46/136 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 164/300 constraints. Problems are: Problem set: 0 solved, 218 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6116 after 12263
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 1/287 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 54/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 355 constraints, problems are : Problem set: 0 solved, 218 unsolved in 16199 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: 218/218 constraints, Known Traps: 0/0 constraints]
After SMT, in 26213ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 26228ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26746 ms. Remains : 83/83 places, 219/219 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 332 edges and 83 vertex of which 81 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 81 transition count 203
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 17 place count 81 transition count 202
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 80 transition count 202
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 30 place count 69 transition count 158
Iterating global reduction 1 with 11 rules applied. Total rules applied 41 place count 69 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 69 transition count 157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 68 transition count 156
Ensure Unique test removed 1 places
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 67 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 66 transition count 155
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 66 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 66 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 64 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 51 place count 64 transition count 152
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 62 transition count 152
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 62 place count 58 transition count 148
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 70 place count 54 transition count 153
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 74 place count 54 transition count 149
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 78 place count 50 transition count 149
Applied a total of 78 rules in 37 ms. Remains 50 /83 variables (removed 33) and now considering 149/219 (removed 70) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 149 rows 50 cols
[2025-05-29 20:27:40] [INFO ] Computed 6 invariants in 6 ms
[2025-05-29 20:27:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-29 20:27:40] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 20:27:40] [INFO ] After 65ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-05-29 20:27:40] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2025-05-29 20:27:41] [INFO ] Flatten gal took : 22 ms
[2025-05-29 20:27:41] [INFO ] Flatten gal took : 19 ms
[2025-05-29 20:27:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17741531115308020340.gal : 5 ms
[2025-05-29 20:27:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13824654223038334293.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17741531115308020340.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13824654223038334293.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13824654223038334293.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 71
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :71 after 170
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :170 after 365
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :365 after 752
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :752 after 1523
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1523 after 3062
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3062 after 6137
Detected timeout of ITS tools.
[2025-05-29 20:27:56] [INFO ] Flatten gal took : 17 ms
[2025-05-29 20:27:56] [INFO ] Applying decomposition
[2025-05-29 20:27:56] [INFO ] Flatten gal took : 16 ms
Detected timeout of ITS tools.
[2025-05-29 20:27:56] [INFO ] Flatten gal took : 47 ms
[2025-05-29 20:27:56] [INFO ] Applying decomposition
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8648606239334895260.txt' '-o' '/tmp/graph8648606239334895260.bin' '-w' '/tmp/graph8648606239334895260.weights'
[2025-05-29 20:27:56] [INFO ] Flatten gal took : 37 ms
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8648606239334895260.bin' '-l' '-1' '-v' '-w' '/tmp/graph8648606239334895260.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:27:56] [INFO ] Decomposing Gal with order
[2025-05-29 20:27:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:27:56] [INFO ] Removed a total of 150 redundant transitions.
[2025-05-29 20:27:56] [INFO ] Flatten gal took : 68 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4721896318279201201.txt' '-o' '/tmp/graph4721896318279201201.bin' '-w' '/tmp/graph4721896318279201201.weights'
[2025-05-29 20:27:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 9 ms.
[2025-05-29 20:27:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9071253554588386544.gal : 4 ms
[2025-05-29 20:27:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5646626471327561150.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9071253554588386544.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5646626471327561150.prop' '--nowitness'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4721896318279201201.bin' '-l' '-1' '-v' '-w' '/tmp/graph4721896318279201201.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:27:56] [INFO ] Decomposing Gal with order
[2025-05-29 20:27:56] [INFO ] Rewriting arrays to variables to allow decomposition.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5646626471327561150.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 49
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :49 after 123
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :123 after 749
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :749 after 5023
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :5023 after 21035
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :21035 after 70427
[2025-05-29 20:27:56] [INFO ] Removed a total of 4 redundant transitions.
SDD proceeding with computation,1 properties remain. new max is 512
[2025-05-29 20:27:56] [INFO ] Flatten gal took : 42 ms
SDD size :70427 after 2.47036e+06
[2025-05-29 20:27:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2025-05-29 20:27:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16829571792880941862.gal : 13 ms
[2025-05-29 20:27:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17929373104154012007.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16829571792880941862.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17929373104154012007.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality17929373104154012007.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 57
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :57 after 151
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :151 after 205
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :205 after 491
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :491 after 1009
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.47036e+06 after 5.07343e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1009 after 2747
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2747 after 8073
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.07343e+08 after 1.56621e+11
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8073 after 30518
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :30518 after 88171
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.56621e+11 after 5.50421e+13
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :88171 after 254661
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30724 ms.
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:[0, 0, 0, 2334, 0, 0, 0] Max Struct:[1, +inf, 1, +inf, 1, +inf, 1]
All properties solved without resorting to model-checking.
Total runtime 667164 ms.
BK_STOP 1748550491687
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q3m002"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is 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 r027-smll-174853774300061"
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 ;