MCC'2025- Execution of r027-smll-174853774300067

About the Execution of 2024-gold for BugTracking-PT-q3m128

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r027-smll-174853774300067.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-q3m128, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r027-smll-174853774300067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K 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 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 16M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748550935174

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-q3m128
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 20:35:37] [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:35:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:35:38] [INFO ] Load time of PNML (sax parser for PT used): 1499 ms
[2025-05-29 20:35:39] [INFO ] Transformed 754 places.
[2025-05-29 20:35:39] [INFO ] Transformed 27370 transitions.
[2025-05-29 20:35:39] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1907 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 28 ms.
Deduced a syphon composed of 514 places in 164 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m128-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-29 20:35:39] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2025-05-29 20:35:39] [INFO ] Computed 10 invariants in 67 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, +inf, +inf, 1]
RANDOM walk for 10000 steps (2 resets) in 95 ms. (104 steps per ms)
FORMULA BugTracking-PT-q3m128-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (12 resets) in 213 ms. (280 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 17, 0, 0] Max Struct:[+inf, 1, +inf, +inf, +inf, 1]
[2025-05-29 20:35:40] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2025-05-29 20:35:40] [INFO ] Invariant cache hit.
[2025-05-29 20:35:40] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2025-05-29 20:35:41] [INFO ] [Real]Absence check using state equation in 993 ms returned sat
[2025-05-29 20:35:41] [INFO ] State equation strengthened by 255 read => feed constraints.
[2025-05-29 20:35:41] [INFO ] [Real]Added 255 Read/Feed constraints in 85 ms returned sat
[2025-05-29 20:35:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:35:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 20:35:42] [INFO ] [Nat]Absence check using state equation in 749 ms returned sat
[2025-05-29 20:35:42] [INFO ] [Nat]Added 255 Read/Feed constraints in 99 ms returned sat
[2025-05-29 20:35:43] [INFO ] Deduced a trap composed of 54 places in 612 ms of which 33 ms to minimize.
[2025-05-29 20:35:44] [INFO ] Deduced a trap composed of 23 places in 643 ms of which 4 ms to minimize.
[2025-05-29 20:35:45] [INFO ] Deduced a trap composed of 73 places in 721 ms of which 4 ms to minimize.
[2025-05-29 20:35:45] [INFO ] Deduced a trap composed of 60 places in 685 ms of which 4 ms to minimize.
[2025-05-29 20:35:46] [INFO ] Deduced a trap composed of 56 places in 716 ms of which 3 ms to minimize.
[2025-05-29 20:35:47] [INFO ] Deduced a trap composed of 55 places in 782 ms of which 4 ms to minimize.
[2025-05-29 20:35:47] [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 0
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:35:47] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:35:48] [INFO ] [Real]Absence check using state equation in 866 ms returned sat
[2025-05-29 20:35:48] [INFO ] [Real]Added 255 Read/Feed constraints in 62 ms returned sat
[2025-05-29 20:35:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:35:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:35:50] [INFO ] [Nat]Absence check using state equation in 1093 ms returned sat
[2025-05-29 20:35:50] [INFO ] [Nat]Added 255 Read/Feed constraints in 311 ms returned sat
[2025-05-29 20:35:50] [INFO ] Deduced a trap composed of 54 places in 565 ms of which 2 ms to minimize.
[2025-05-29 20:35:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 729 ms
[2025-05-29 20:35:51] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 375 ms.
[2025-05-29 20:35:51] [INFO ] Added : 8 causal constraints over 2 iterations in 817 ms. Result :sat
Minimization took 750 ms.
[2025-05-29 20:35:52] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 20:35:53] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2025-05-29 20:35:53] [INFO ] [Real]Added 255 Read/Feed constraints in 106 ms returned sat
[2025-05-29 20:35:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:35:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:35:54] [INFO ] [Nat]Absence check using state equation in 833 ms returned sat
[2025-05-29 20:35:54] [INFO ] [Nat]Added 255 Read/Feed constraints in 98 ms returned sat
[2025-05-29 20:35:55] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 379 ms.
[2025-05-29 20:35:55] [INFO ] Added : 2 causal constraints over 1 iterations in 848 ms. Result :sat
Minimization took 788 ms.
[2025-05-29 20:35:56] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 20:35:57] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2025-05-29 20:35:57] [INFO ] [Real]Added 255 Read/Feed constraints in 98 ms returned sat
[2025-05-29 20:35:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:35:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:35:58] [INFO ] [Nat]Absence check using state equation in 817 ms returned sat
[2025-05-29 20:35:58] [INFO ] [Nat]Added 255 Read/Feed constraints in 134 ms returned sat
[2025-05-29 20:35:59] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 323 ms.
[2025-05-29 20:35:59] [INFO ] Added : 3 causal constraints over 1 iterations in 757 ms. Result :sat
Minimization took 850 ms.
[2025-05-29 20:36:00] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:36:01] [INFO ] [Real]Absence check using state equation in 842 ms returned sat
[2025-05-29 20:36:01] [INFO ] [Real]Added 255 Read/Feed constraints in 74 ms returned sat
[2025-05-29 20:36:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:36:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:36:02] [INFO ] [Nat]Absence check using state equation in 925 ms returned sat
[2025-05-29 20:36:02] [INFO ] [Nat]Added 255 Read/Feed constraints in 249 ms returned sat
[2025-05-29 20:36:03] [INFO ] Deduced a trap composed of 19 places in 762 ms of which 8 ms to minimize.
[2025-05-29 20:36:04] [INFO ] Deduced a trap composed of 20 places in 712 ms of which 3 ms to minimize.
[2025-05-29 20:36:05] [INFO ] Deduced a trap composed of 72 places in 738 ms of which 4 ms to minimize.
[2025-05-29 20:36:06] [INFO ] Deduced a trap composed of 73 places in 621 ms of which 4 ms to minimize.
[2025-05-29 20:36:06] [INFO ] Deduced a trap composed of 35 places in 596 ms of which 3 ms to minimize.
[2025-05-29 20:36:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:36:06] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:36:07] [INFO ] [Real]Absence check using state equation in 916 ms returned sat
[2025-05-29 20:36:08] [INFO ] [Real]Added 255 Read/Feed constraints in 95 ms returned sat
[2025-05-29 20:36:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:36:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:36:09] [INFO ] [Nat]Absence check using state equation in 794 ms returned sat
[2025-05-29 20:36:09] [INFO ] [Nat]Added 255 Read/Feed constraints in 76 ms returned sat
[2025-05-29 20:36:09] [INFO ] Deduced a trap composed of 11 places in 517 ms of which 4 ms to minimize.
[2025-05-29 20:36:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 688 ms
[2025-05-29 20:36:10] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 478 ms.
[2025-05-29 20:36:10] [INFO ] Added : 2 causal constraints over 1 iterations in 852 ms. Result :sat
Minimization took 929 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 17, 0, 0] Max Struct:[+inf, 1, +inf, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1, 17, 0, 0] Max Struct:[+inf, 1, +inf, +inf, +inf, 1]
Support contains 6 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 5 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 392 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 415 ms. Remains : 229/240 places, 2747/2769 transitions.
[2025-05-29 20:36:12] [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 2 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 6) seen :[0, 0, 0, 2147483647, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 1, +inf, 0, 0] Max Struct:[+inf, 1, +inf, +inf, +inf, 1]
[2025-05-29 20:36:13] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2025-05-29 20:36:13] [INFO ] Computed 8 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, +inf, 0, 0] Max Struct:[+inf, 1, +inf, +inf, +inf, 1]
RANDOM walk for 1000115 steps (2 resets) in 1380 ms. (724 steps per ms)
FORMULA BugTracking-PT-q3m128-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 5000005 steps (10 resets) in 15163 ms. (329 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-05-29 20:36:30] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:36:30] [INFO ] Invariant cache hit.
[2025-05-29 20:36:30] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 20:36:31] [INFO ] [Real]Absence check using state equation in 864 ms returned sat
[2025-05-29 20:36:31] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-05-29 20:36:31] [INFO ] [Real]Added 241 Read/Feed constraints in 63 ms returned sat
[2025-05-29 20:36:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:36:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:36:32] [INFO ] [Nat]Absence check using state equation in 894 ms returned sat
[2025-05-29 20:36:32] [INFO ] [Nat]Added 241 Read/Feed constraints in 178 ms returned sat
[2025-05-29 20:36:33] [INFO ] Deduced a trap composed of 25 places in 834 ms of which 3 ms to minimize.
[2025-05-29 20:36:34] [INFO ] Deduced a trap composed of 114 places in 592 ms of which 2 ms to minimize.
[2025-05-29 20:36:35] [INFO ] Deduced a trap composed of 47 places in 662 ms of which 3 ms to minimize.
[2025-05-29 20:36:36] [INFO ] Deduced a trap composed of 58 places in 744 ms of which 3 ms to minimize.
[2025-05-29 20:36:36] [INFO ] Deduced a trap composed of 22 places in 705 ms of which 3 ms to minimize.
[2025-05-29 20:36:37] [INFO ] Deduced a trap composed of 111 places in 707 ms of which 3 ms to minimize.
[2025-05-29 20:36:38] [INFO ] Deduced a trap composed of 59 places in 684 ms of which 4 ms to minimize.
[2025-05-29 20:36:39] [INFO ] Deduced a trap composed of 103 places in 761 ms of which 3 ms to minimize.
[2025-05-29 20:36:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 6894 ms
[2025-05-29 20:36:40] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 337 ms.
[2025-05-29 20:36:40] [INFO ] Added : 4 causal constraints over 2 iterations in 856 ms. Result :sat
Minimization took 2493 ms.
[2025-05-29 20:36:43] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:36:44] [INFO ] [Real]Absence check using state equation in 795 ms returned sat
[2025-05-29 20:36:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:36:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:36:44] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2025-05-29 20:36:44] [INFO ] [Nat]Added 241 Read/Feed constraints in 152 ms returned sat
[2025-05-29 20:36:45] [INFO ] Deduced a trap composed of 61 places in 706 ms of which 4 ms to minimize.
[2025-05-29 20:36:46] [INFO ] Deduced a trap composed of 19 places in 501 ms of which 3 ms to minimize.
[2025-05-29 20:36:46] [INFO ] Deduced a trap composed of 30 places in 549 ms of which 3 ms to minimize.
[2025-05-29 20:36:47] [INFO ] Deduced a trap composed of 15 places in 493 ms of which 3 ms to minimize.
[2025-05-29 20:36:48] [INFO ] Deduced a trap composed of 31 places in 490 ms of which 4 ms to minimize.
[2025-05-29 20:36:48] [INFO ] Deduced a trap composed of 65 places in 474 ms of which 3 ms to minimize.
[2025-05-29 20:36:49] [INFO ] Deduced a trap composed of 31 places in 311 ms of which 2 ms to minimize.
[2025-05-29 20:36:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4128 ms
[2025-05-29 20:36:49] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 266 ms.
[2025-05-29 20:36:49] [INFO ] Added : 3 causal constraints over 1 iterations in 629 ms. Result :sat
Minimization took 2811 ms.
[2025-05-29 20:36:52] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:36:53] [INFO ] [Real]Absence check using state equation in 823 ms returned sat
[2025-05-29 20:36:53] [INFO ] [Real]Added 241 Read/Feed constraints in 78 ms returned sat
[2025-05-29 20:36:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:36:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:36:54] [INFO ] [Nat]Absence check using state equation in 726 ms returned sat
[2025-05-29 20:36:54] [INFO ] [Nat]Added 241 Read/Feed constraints in 59 ms returned sat
[2025-05-29 20:36:54] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 227 ms.
[2025-05-29 20:36:55] [INFO ] Added : 2 causal constraints over 1 iterations in 494 ms. Result :sat
Minimization took 2722 ms.
[2025-05-29 20:36:58] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:36:58] [INFO ] [Real]Absence check using state equation in 733 ms returned sat
[2025-05-29 20:36:58] [INFO ] [Real]Added 241 Read/Feed constraints in 65 ms returned sat
[2025-05-29 20:36:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:36:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:36:59] [INFO ] [Nat]Absence check using state equation in 763 ms returned sat
[2025-05-29 20:37:00] [INFO ] [Nat]Added 241 Read/Feed constraints in 312 ms returned sat
[2025-05-29 20:37:00] [INFO ] Deduced a trap composed of 19 places in 428 ms of which 2 ms to minimize.
[2025-05-29 20:37:01] [INFO ] Deduced a trap composed of 19 places in 671 ms of which 2 ms to minimize.
[2025-05-29 20:37:01] [INFO ] Deduced a trap composed of 25 places in 338 ms of which 2 ms to minimize.
[2025-05-29 20:37:02] [INFO ] Deduced a trap composed of 27 places in 348 ms of which 1 ms to minimize.
[2025-05-29 20:37:02] [INFO ] Deduced a trap composed of 10 places in 382 ms of which 2 ms to minimize.
[2025-05-29 20:37:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2637 ms
[2025-05-29 20:37:03] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 285 ms.
[2025-05-29 20:37:03] [INFO ] Added : 9 causal constraints over 3 iterations in 950 ms. Result :sat
Minimization took 2900 ms.
[2025-05-29 20:37:06] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:37:07] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2025-05-29 20:37:07] [INFO ] [Real]Added 241 Read/Feed constraints in 71 ms returned sat
[2025-05-29 20:37:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:37:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-29 20:37:08] [INFO ] [Nat]Absence check using state equation in 883 ms returned sat
[2025-05-29 20:37:08] [INFO ] [Nat]Added 241 Read/Feed constraints in 79 ms returned sat
[2025-05-29 20:37:09] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 331 ms.
[2025-05-29 20:37:09] [INFO ] Added : 2 causal constraints over 1 iterations in 765 ms. Result :sat
Minimization took 2450 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Support contains 5 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 93 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 93 ms. Remains : 229/229 places, 2747/2747 transitions.
[2025-05-29 20:37:13] [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 0 ms.
This minimized invariant on transitions {0=1, 1722=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 5) seen :[0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-05-29 20:37:15] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:37:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
RANDOM walk for 1000000 steps (2 resets) in 1027 ms. (972 steps per ms)
BEST_FIRST walk for 5000004 steps (10 resets) in 15535 ms. (321 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-05-29 20:37:31] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:37:31] [INFO ] Invariant cache hit.
[2025-05-29 20:37:31] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:37:32] [INFO ] [Real]Absence check using state equation in 914 ms returned sat
[2025-05-29 20:37:32] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-05-29 20:37:32] [INFO ] [Real]Added 241 Read/Feed constraints in 79 ms returned sat
[2025-05-29 20:37:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:37:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 20:37:33] [INFO ] [Nat]Absence check using state equation in 943 ms returned sat
[2025-05-29 20:37:34] [INFO ] [Nat]Added 241 Read/Feed constraints in 179 ms returned sat
[2025-05-29 20:37:35] [INFO ] Deduced a trap composed of 25 places in 908 ms of which 5 ms to minimize.
[2025-05-29 20:37:36] [INFO ] Deduced a trap composed of 114 places in 917 ms of which 5 ms to minimize.
[2025-05-29 20:37:37] [INFO ] Deduced a trap composed of 47 places in 929 ms of which 4 ms to minimize.
[2025-05-29 20:37:38] [INFO ] Deduced a trap composed of 58 places in 811 ms of which 3 ms to minimize.
[2025-05-29 20:37:38] [INFO ] Deduced a trap composed of 22 places in 566 ms of which 2 ms to minimize.
[2025-05-29 20:37:39] [INFO ] Deduced a trap composed of 111 places in 654 ms of which 4 ms to minimize.
[2025-05-29 20:37:40] [INFO ] Deduced a trap composed of 59 places in 909 ms of which 5 ms to minimize.
[2025-05-29 20:37:41] [INFO ] Deduced a trap composed of 103 places in 886 ms of which 5 ms to minimize.
[2025-05-29 20:37:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 8117 ms
[2025-05-29 20:37:42] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 374 ms.
[2025-05-29 20:37:43] [INFO ] Added : 4 causal constraints over 2 iterations in 1021 ms. Result :sat
Minimization took 2855 ms.
[2025-05-29 20:37:46] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-29 20:37:47] [INFO ] [Real]Absence check using state equation in 944 ms returned sat
[2025-05-29 20:37:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:37:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:37:48] [INFO ] [Nat]Absence check using state equation in 978 ms returned sat
[2025-05-29 20:37:48] [INFO ] [Nat]Added 241 Read/Feed constraints in 232 ms returned sat
[2025-05-29 20:37:49] [INFO ] Deduced a trap composed of 61 places in 740 ms of which 4 ms to minimize.
[2025-05-29 20:37:50] [INFO ] Deduced a trap composed of 19 places in 717 ms of which 3 ms to minimize.
[2025-05-29 20:37:51] [INFO ] Deduced a trap composed of 30 places in 688 ms of which 3 ms to minimize.
[2025-05-29 20:37:51] [INFO ] Deduced a trap composed of 15 places in 613 ms of which 3 ms to minimize.
[2025-05-29 20:37:52] [INFO ] Deduced a trap composed of 31 places in 604 ms of which 3 ms to minimize.
[2025-05-29 20:37:53] [INFO ] Deduced a trap composed of 65 places in 592 ms of which 3 ms to minimize.
[2025-05-29 20:37:53] [INFO ] Deduced a trap composed of 31 places in 540 ms of which 3 ms to minimize.
[2025-05-29 20:37:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5325 ms
[2025-05-29 20:37:54] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 353 ms.
[2025-05-29 20:37:54] [INFO ] Added : 3 causal constraints over 1 iterations in 792 ms. Result :sat
Minimization took 2446 ms.
[2025-05-29 20:37:57] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:37:58] [INFO ] [Real]Absence check using state equation in 879 ms returned sat
[2025-05-29 20:37:58] [INFO ] [Real]Added 241 Read/Feed constraints in 109 ms returned sat
[2025-05-29 20:37:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:37:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:37:59] [INFO ] [Nat]Absence check using state equation in 931 ms returned sat
[2025-05-29 20:37:59] [INFO ] [Nat]Added 241 Read/Feed constraints in 101 ms returned sat
[2025-05-29 20:38:00] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 369 ms.
[2025-05-29 20:38:00] [INFO ] Added : 2 causal constraints over 1 iterations in 810 ms. Result :sat
Minimization took 2545 ms.
[2025-05-29 20:38:03] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:38:03] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2025-05-29 20:38:04] [INFO ] [Real]Added 241 Read/Feed constraints in 49 ms returned sat
[2025-05-29 20:38:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:38:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:38:04] [INFO ] [Nat]Absence check using state equation in 755 ms returned sat
[2025-05-29 20:38:05] [INFO ] [Nat]Added 241 Read/Feed constraints in 285 ms returned sat
[2025-05-29 20:38:05] [INFO ] Deduced a trap composed of 19 places in 634 ms of which 3 ms to minimize.
[2025-05-29 20:38:06] [INFO ] Deduced a trap composed of 19 places in 667 ms of which 4 ms to minimize.
[2025-05-29 20:38:07] [INFO ] Deduced a trap composed of 25 places in 592 ms of which 4 ms to minimize.
[2025-05-29 20:38:08] [INFO ] Deduced a trap composed of 27 places in 601 ms of which 3 ms to minimize.
[2025-05-29 20:38:08] [INFO ] Deduced a trap composed of 10 places in 593 ms of which 3 ms to minimize.
[2025-05-29 20:38:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3662 ms
[2025-05-29 20:38:09] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 354 ms.
[2025-05-29 20:38:09] [INFO ] Added : 9 causal constraints over 3 iterations in 1037 ms. Result :sat
Minimization took 2411 ms.
[2025-05-29 20:38:12] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:38:13] [INFO ] [Real]Absence check using state equation in 739 ms returned sat
[2025-05-29 20:38:13] [INFO ] [Real]Added 241 Read/Feed constraints in 70 ms returned sat
[2025-05-29 20:38:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:38:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 20:38:14] [INFO ] [Nat]Absence check using state equation in 946 ms returned sat
[2025-05-29 20:38:14] [INFO ] [Nat]Added 241 Read/Feed constraints in 80 ms returned sat
[2025-05-29 20:38:15] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 361 ms.
[2025-05-29 20:38:15] [INFO ] Added : 2 causal constraints over 1 iterations in 767 ms. Result :sat
Minimization took 2499 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Support contains 5 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 88 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 89 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 95 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2025-05-29 20:38:18] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:38:18] [INFO ] Invariant cache hit.
[2025-05-29 20:38:19] [INFO ] Implicit Places using invariants in 836 ms returned []
[2025-05-29 20:38:19] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:38:19] [INFO ] Invariant cache hit.
[2025-05-29 20:38:20] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-05-29 20:38:23] [INFO ] Implicit Places using invariants and state equation in 3432 ms returned []
Implicit Place search using SMT with State Equation took 4272 ms to find 0 implicit places.
[2025-05-29 20:38:23] [INFO ] Redundant transitions in 606 ms returned []
Running 2746 sub problems to find dead transitions.
[2025-05-29 20:38:23] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:38:23] [INFO ] Invariant cache hit.
[2025-05-29 20:38:23] [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
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 229/2847 variables, and 8 constraints, problems are : Problem set: 0 solved, 2746 unsolved in 30149 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:39:42] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 2 ms to minimize.
[2025-05-29 20:39:46] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 2 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:39:46] [INFO ] Deduced a trap composed of 8 places in 150 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:39:46] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 2 ms to minimize.
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
[2025-05-29 20:39:46] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 1 ms to minimize.
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
[2025-05-29 20:39:46] [INFO ] Deduced a trap composed of 11 places in 68 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
[2025-05-29 20:39:58] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 1 ms to minimize.
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 7/15 constraints. Problems are: Problem set: 222 solved, 2524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 229/2847 variables, and 15 constraints, problems are : Problem set: 222 solved, 2524 unsolved in 30276 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: 7/7 constraints]
After SMT, in 95601ms problems are : Problem set: 222 solved, 2524 unsolved
Search for dead transitions found 222 dead transitions in 95670ms
Found 222 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 222 transitions
Dead transitions reduction (with SMT) removed 222 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 229/229 places, 2525/2747 transitions.
Reduce places removed 26 places and 563 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 203 transition count 1962
Reduce places removed 19 places and 260 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 45 place count 184 transition count 1702
Reduce places removed 8 places and 198 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 53 place count 176 transition count 1504
Reduce places removed 9 places and 118 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 62 place count 167 transition count 1386
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 1320
Reduce places removed 3 places and 52 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 68 place count 161 transition count 1268
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 71 place count 158 transition count 1225
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 16 places and 270 transitions.
Iterating global reduction 6 with 19 rules applied. Total rules applied 90 place count 142 transition count 955
Deduced a syphon composed of 4 places in 3 ms
Applied a total of 90 rules in 105 ms. Remains 142 /229 variables (removed 87) and now considering 955/2525 (removed 1570) transitions.
[2025-05-29 20:39:59] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
// Phase 1: matrix 904 rows 142 cols
[2025-05-29 20:39:59] [INFO ] Computed 12 invariants in 9 ms
[2025-05-29 20:40:00] [INFO ] Implicit Places using invariants in 391 ms returned []
[2025-05-29 20:40:00] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
[2025-05-29 20:40:00] [INFO ] Invariant cache hit.
[2025-05-29 20:40:00] [INFO ] State equation strengthened by 113 read => feed constraints.
[2025-05-29 20:40:01] [INFO ] Implicit Places using invariants and state equation in 1220 ms returned []
Implicit Place search using SMT with State Equation took 1616 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 142/229 places, 955/2747 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 102413 ms. Remains : 142/229 places, 955/2747 transitions.
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
FORMULA BugTracking-PT-q3m128-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 20:40:01] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
Found an invariant !
This invariant on transitions {1=1, 589=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {7=1, 589=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-05-29 20:40:01] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
// Phase 1: matrix 904 rows 138 cols
[2025-05-29 20:40:01] [INFO ] Computed 8 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
RANDOM walk for 1000041 steps (2 resets) in 889 ms. (1123 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1473 ms. (678 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-05-29 20:40:04] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
[2025-05-29 20:40:04] [INFO ] Invariant cache hit.
[2025-05-29 20:40:04] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:40:04] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2025-05-29 20:40:04] [INFO ] State equation strengthened by 113 read => feed constraints.
[2025-05-29 20:40:04] [INFO ] [Real]Added 113 Read/Feed constraints in 25 ms returned sat
[2025-05-29 20:40:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:40:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:40:04] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2025-05-29 20:40:05] [INFO ] [Nat]Added 113 Read/Feed constraints in 66 ms returned sat
[2025-05-29 20:40:05] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 2 ms to minimize.
[2025-05-29 20:40:05] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 1 ms to minimize.
[2025-05-29 20:40:05] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 2 ms to minimize.
[2025-05-29 20:40:05] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2025-05-29 20:40:06] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2025-05-29 20:40:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1018 ms
[2025-05-29 20:40:06] [INFO ] Computed and/alt/rep : 231/857/230 causal constraints (skipped 673 transitions) in 129 ms.
[2025-05-29 20:40:06] [INFO ] Added : 17 causal constraints over 4 iterations in 490 ms. Result :sat
Minimization took 796 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 955/955 transitions.
Applied a total of 0 rules in 17 ms. Remains 138 /138 variables (removed 0) and now considering 955/955 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 138/138 places, 955/955 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 955/955 transitions.
Applied a total of 0 rules in 16 ms. Remains 138 /138 variables (removed 0) and now considering 955/955 (removed 0) transitions.
[2025-05-29 20:40:07] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
[2025-05-29 20:40:07] [INFO ] Invariant cache hit.
[2025-05-29 20:40:07] [INFO ] Implicit Places using invariants in 231 ms returned []
[2025-05-29 20:40:07] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
[2025-05-29 20:40:07] [INFO ] Invariant cache hit.
[2025-05-29 20:40:08] [INFO ] State equation strengthened by 113 read => feed constraints.
[2025-05-29 20:40:08] [INFO ] Implicit Places using invariants and state equation in 965 ms returned []
Implicit Place search using SMT with State Equation took 1206 ms to find 0 implicit places.
[2025-05-29 20:40:08] [INFO ] Redundant transitions in 39 ms returned []
Running 954 sub problems to find dead transitions.
[2025-05-29 20:40:08] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
[2025-05-29 20:40:08] [INFO ] Invariant cache hit.
[2025-05-29 20:40:08] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2025-05-29 20:40:17] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
[2025-05-29 20:40:19] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 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 TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 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
[2025-05-29 20:40:20] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
Problem TDEAD620 is UNSAT
[2025-05-29 20:40:20] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 4/12 constraints. Problems are: Problem set: 150 solved, 804 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/12 constraints. Problems are: Problem set: 150 solved, 804 unsolved
Problem TDEAD619 is UNSAT
At refinement iteration 3 (OVERLAPS) 904/1042 variables, 138/150 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1042 variables, 113/263 constraints. Problems are: Problem set: 151 solved, 803 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1042/1042 variables, and 263 constraints, problems are : Problem set: 151 solved, 803 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 138/138 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 151 solved, 803 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 7/7 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 4/11 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/11 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 1/12 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/12 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 5 (OVERLAPS) 904/1042 variables, 138/150 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1042 variables, 113/263 constraints. Problems are: Problem set: 151 solved, 803 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 TDEAD595 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/1042 variables, 803/1066 constraints. Problems are: Problem set: 221 solved, 733 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1042/1042 variables, and 1066 constraints, problems are : Problem set: 221 solved, 733 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 138/138 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 803/954 constraints, Known Traps: 4/4 constraints]
After SMT, in 64068ms problems are : Problem set: 221 solved, 733 unsolved
Search for dead transitions found 221 dead transitions in 64080ms
Found 221 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 221 transitions
Dead transitions reduction (with SMT) removed 221 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 138/138 places, 734/955 transitions.
Graph (complete) has 1052 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 19 places and 231 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 118 transition count 503
Reduce places removed 16 places and 91 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 36 place count 102 transition count 412
Reduce places removed 4 places and 31 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 40 place count 98 transition count 381
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 96 transition count 365
Reduce places removed 1 places and 14 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 43 place count 95 transition count 351
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 48 place count 90 transition count 316
Iterating global reduction 5 with 5 rules applied. Total rules applied 53 place count 90 transition count 316
Applied a total of 53 rules in 21 ms. Remains 90 /138 variables (removed 48) and now considering 316/734 (removed 418) transitions.
[2025-05-29 20:41:12] [INFO ] Flow matrix only has 296 transitions (discarded 20 similar events)
// Phase 1: matrix 296 rows 90 cols
[2025-05-29 20:41:12] [INFO ] Computed 9 invariants in 2 ms
[2025-05-29 20:41:13] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-05-29 20:41:13] [INFO ] Flow matrix only has 296 transitions (discarded 20 similar events)
[2025-05-29 20:41:13] [INFO ] Invariant cache hit.
[2025-05-29 20:41:13] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-05-29 20:41:13] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 90/138 places, 316/955 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65964 ms. Remains : 90/138 places, 316/955 transitions.
[2025-05-29 20:41:13] [INFO ] Flow matrix only has 296 transitions (discarded 20 similar events)
Found an invariant !
This invariant on transitions {1=1, 220=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 220=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-05-29 20:41:13] [INFO ] Flow matrix only has 296 transitions (discarded 20 similar events)
[2025-05-29 20:41:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
RANDOM walk for 1000017 steps (2 resets) in 753 ms. (1326 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 800 ms. (1248 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-05-29 20:41:15] [INFO ] Flow matrix only has 296 transitions (discarded 20 similar events)
[2025-05-29 20:41:15] [INFO ] Invariant cache hit.
[2025-05-29 20:41:15] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:41:15] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:41:15] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2025-05-29 20:41:15] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-05-29 20:41:15] [INFO ] [Real]Added 54 Read/Feed constraints in 10 ms returned sat
[2025-05-29 20:41:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:41:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:41:15] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-29 20:41:15] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2025-05-29 20:41:15] [INFO ] [Nat]Added 54 Read/Feed constraints in 12 ms returned sat
[2025-05-29 20:41:15] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2025-05-29 20:41:15] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2025-05-29 20:41:15] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2025-05-29 20:41:15] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2025-05-29 20:41:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 312 ms
[2025-05-29 20:41:15] [INFO ] Computed and/alt/rep : 182/885/182 causal constraints (skipped 113 transitions) in 27 ms.
[2025-05-29 20:41:16] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2025-05-29 20:41:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2025-05-29 20:41:16] [INFO ] Added : 36 causal constraints over 8 iterations in 337 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 316/316 transitions.
Applied a total of 0 rules in 7 ms. Remains 90 /90 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 90/90 places, 316/316 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 316/316 transitions.
Applied a total of 0 rules in 8 ms. Remains 90 /90 variables (removed 0) and now considering 316/316 (removed 0) transitions.
[2025-05-29 20:41:16] [INFO ] Flow matrix only has 296 transitions (discarded 20 similar events)
[2025-05-29 20:41:16] [INFO ] Invariant cache hit.
[2025-05-29 20:41:16] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-05-29 20:41:16] [INFO ] Flow matrix only has 296 transitions (discarded 20 similar events)
[2025-05-29 20:41:16] [INFO ] Invariant cache hit.
[2025-05-29 20:41:16] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-05-29 20:41:16] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2025-05-29 20:41:16] [INFO ] Redundant transitions in 2 ms returned []
Running 315 sub problems to find dead transitions.
[2025-05-29 20:41:16] [INFO ] Flow matrix only has 296 transitions (discarded 20 similar events)
[2025-05-29 20:41:16] [INFO ] Invariant cache hit.
[2025-05-29 20:41:16] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
At refinement iteration 3 (OVERLAPS) 296/386 variables, 90/99 constraints. Problems are: Problem set: 4 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 54/153 constraints. Problems are: Problem set: 4 solved, 311 unsolved
[2025-05-29 20:41:23] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 1/154 constraints. Problems are: Problem set: 4 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/154 constraints. Problems are: Problem set: 4 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 0/386 variables, 0/154 constraints. Problems are: Problem set: 4 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 154 constraints, problems are : Problem set: 4 solved, 311 unsolved in 14756 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 4 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/10 constraints. Problems are: Problem set: 4 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 296/386 variables, 90/100 constraints. Problems are: Problem set: 4 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 54/154 constraints. Problems are: Problem set: 4 solved, 311 unsolved
Problem TDEAD173 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD311 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 311/465 constraints. Problems are: Problem set: 12 solved, 303 unsolved
[2025-05-29 20:41:38] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2025-05-29 20:41:38] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2025-05-29 20:41:38] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2025-05-29 20:41:38] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2025-05-29 20:41:39] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
[2025-05-29 20:41:39] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 4 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
[2025-05-29 20:41:39] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 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
[2025-05-29 20:41:41] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2025-05-29 20:41:41] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
Problem TDEAD214 is UNSAT
Problem TDEAD67 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 9/474 constraints. Problems are: Problem set: 53 solved, 262 unsolved
[2025-05-29 20:41:44] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2025-05-29 20:41:46] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2025-05-29 20:41:47] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 3/477 constraints. Problems are: Problem set: 55 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/477 constraints. Problems are: Problem set: 55 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/386 variables, 0/477 constraints. Problems are: Problem set: 55 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 477 constraints, problems are : Problem set: 55 solved, 260 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 311/315 constraints, Known Traps: 13/13 constraints]
After SMT, in 45193ms problems are : Problem set: 55 solved, 260 unsolved
Search for dead transitions found 55 dead transitions in 45196ms
Found 55 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 55 transitions
Dead transitions reduction (with SMT) removed 55 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/90 places, 261/316 transitions.
Graph (complete) has 460 edges and 90 vertex of which 86 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 84 transition count 245
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 82 transition count 231
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 82 transition count 231
Applied a total of 7 rules in 12 ms. Remains 82 /90 variables (removed 8) and now considering 231/261 (removed 30) transitions.
[2025-05-29 20:42:02] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
// Phase 1: matrix 215 rows 82 cols
[2025-05-29 20:42:02] [INFO ] Computed 8 invariants in 2 ms
[2025-05-29 20:42:02] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-05-29 20:42:02] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2025-05-29 20:42:02] [INFO ] Invariant cache hit.
[2025-05-29 20:42:02] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-05-29 20:42:02] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 82/90 places, 231/316 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 46367 ms. Remains : 82/90 places, 231/316 transitions.
[2025-05-29 20:42:02] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {1=1, 144=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 144=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-05-29 20:42:02] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2025-05-29 20:42:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
RANDOM walk for 1000064 steps (2 resets) in 697 ms. (1432 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 704 ms. (1418 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-05-29 20:42:04] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2025-05-29 20:42:04] [INFO ] Invariant cache hit.
[2025-05-29 20:42:04] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 20:42:04] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-29 20:42:04] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2025-05-29 20:42:04] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-05-29 20:42:04] [INFO ] [Real]Added 47 Read/Feed constraints in 14 ms returned sat
[2025-05-29 20:42:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:42:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 20:42:04] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:42:04] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2025-05-29 20:42:04] [INFO ] [Nat]Added 47 Read/Feed constraints in 18 ms returned sat
[2025-05-29 20:42:04] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 2 ms to minimize.
[2025-05-29 20:42:04] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2025-05-29 20:42:05] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2025-05-29 20:42:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 388 ms
[2025-05-29 20:42:05] [INFO ] Computed and/alt/rep : 178/955/178 causal constraints (skipped 36 transitions) in 19 ms.
[2025-05-29 20:42:05] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2025-05-29 20:42:05] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2025-05-29 20:42:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2025-05-29 20:42:05] [INFO ] Added : 47 causal constraints over 10 iterations in 427 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 231/231 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 231/231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 231/231 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2025-05-29 20:42:05] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2025-05-29 20:42:05] [INFO ] Invariant cache hit.
[2025-05-29 20:42:05] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-05-29 20:42:05] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2025-05-29 20:42:05] [INFO ] Invariant cache hit.
[2025-05-29 20:42:05] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-05-29 20:42:06] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2025-05-29 20:42:06] [INFO ] Redundant transitions in 1 ms returned []
Running 230 sub problems to find dead transitions.
[2025-05-29 20:42:06] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2025-05-29 20:42:06] [INFO ] Invariant cache hit.
[2025-05-29 20:42:06] [INFO ] State equation strengthened by 47 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) 215/297 variables, 82/90 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 47/137 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2025-05-29 20:42:09] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 1/138 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/138 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/138 constraints. Problems are: Problem set: 12 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 138 constraints, problems are : Problem set: 12 solved, 218 unsolved in 9747 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 47/47 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) 215/297 variables, 82/91 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 47/138 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 218/356 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2025-05-29 20:42:18] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2025-05-29 20:42:19] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2025-05-29 20:42:19] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2025-05-29 20:42:19] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2025-05-29 20:42:20] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 5/361 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/361 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/297 variables, 0/361 constraints. Problems are: Problem set: 12 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 361 constraints, problems are : Problem set: 12 solved, 218 unsolved in 15547 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 218/230 constraints, Known Traps: 6/6 constraints]
After SMT, in 25482ms problems are : Problem set: 12 solved, 218 unsolved
Search for dead transitions found 12 dead transitions in 25485ms
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 : 82/82 places, 219/231 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2025-05-29 20:42:31] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 26055 ms. Remains : 82/82 places, 219/231 transitions.
[2025-05-29 20:42:31] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-05-29 20:42:31] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
// Phase 1: matrix 203 rows 82 cols
[2025-05-29 20:42:31] [INFO ] Computed 8 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
RANDOM walk for 1000059 steps (2 resets) in 677 ms. (1475 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 864 ms. (1156 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-05-29 20:42:33] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2025-05-29 20:42:33] [INFO ] Invariant cache hit.
[2025-05-29 20:42:33] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 20:42:33] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:42:33] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2025-05-29 20:42:33] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-29 20:42:33] [INFO ] [Real]Added 45 Read/Feed constraints in 14 ms returned sat
[2025-05-29 20:42:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:42:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-29 20:42:33] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:42:33] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2025-05-29 20:42:33] [INFO ] [Nat]Added 45 Read/Feed constraints in 22 ms returned sat
[2025-05-29 20:42:33] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
[2025-05-29 20:42:34] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2025-05-29 20:42:34] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2025-05-29 20:42:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 392 ms
[2025-05-29 20:42:34] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 24 ms.
[2025-05-29 20:42:34] [INFO ] Added : 65 causal constraints over 14 iterations in 390 ms. Result :sat
Minimization took 114 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 82/82 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2025-05-29 20:42:34] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2025-05-29 20:42:34] [INFO ] Invariant cache hit.
[2025-05-29 20:42:34] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-05-29 20:42:34] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2025-05-29 20:42:34] [INFO ] Invariant cache hit.
[2025-05-29 20:42:35] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-29 20:42:35] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2025-05-29 20:42:35] [INFO ] Redundant transitions in 1 ms returned []
Running 218 sub problems to find dead transitions.
[2025-05-29 20:42:35] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2025-05-29 20:42:35] [INFO ] Invariant cache hit.
[2025-05-29 20:42:35] [INFO ] State equation strengthened by 45 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) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 218 unsolved in 9875 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 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) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 218/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2025-05-29 20:42:49] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 354 constraints, problems are : Problem set: 0 solved, 218 unsolved in 15450 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 1/1 constraints]
After SMT, in 25607ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 25611ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26227 ms. Remains : 82/82 places, 219/219 transitions.
[2025-05-29 20:43:01] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
RANDOM walk for 40212 steps (8 resets) in 158 ms. (252 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 258 ms. (154 steps per ms) remains 1/1 properties
[2025-05-29 20:43:01] [INFO ] Flatten gal took : 149 ms
[2025-05-29 20:43:01] [INFO ] Flatten gal took : 65 ms
[2025-05-29 20:43:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18242047387181313375.gal : 17 ms
[2025-05-29 20:43:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16577698934322627142.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/ReachabilityCardinality18242047387181313375.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16577698934322627142.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/ReachabilityCardinality16577698934322627142.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 129
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :129 after 15092
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :15092 after 48245
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :48245 after 114422
Interrupted probabilistic random walk after 897347 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :0 out of 1
Probabilistic random walk after 897347 steps, saw 566410 distinct states, run finished after 3009 ms. (steps per millisecond=298 ) properties seen :0
[2025-05-29 20:43:04] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2025-05-29 20:43:04] [INFO ] Invariant cache hit.
[2025-05-29 20:43:04] [INFO ] State equation strengthened by 45 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/88 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/91 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/93 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/93 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 63/156 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/156 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/156 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 85/241 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/241 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/241 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/241 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/243 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/243 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 40/283 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/283 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/283 variables, 11/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/283 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/285 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/88 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/91 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/91 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/93 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/93 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 63/156 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/156 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 85/241 variables, 14/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/241 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/241 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/241 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/243 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/243 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 40/283 variables, 32/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/283 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/283 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:43:04] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/283 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/283 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/285 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 20:43:04] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2025-05-29 20:43:04] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2025-05-29 20:43:05] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/285 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/285 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/285 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 729ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 82/82 places, 219/219 transitions.
RANDOM walk for 39954 steps (8 resets) in 30 ms. (1288 steps per ms) remains 0/1 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 0, 4, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Starting property specific reduction for BugTracking-PT-q3m128-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-05-29 20:43:05] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2025-05-29 20:43:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10106 steps (2 resets) in 8 ms. (1122 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-05-29 20:43:05] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2025-05-29 20:43:05] [INFO ] Invariant cache hit.
[2025-05-29 20:43:05] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 20:43:05] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:43:05] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2025-05-29 20:43:05] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-29 20:43:05] [INFO ] [Real]Added 45 Read/Feed constraints in 13 ms returned sat
[2025-05-29 20:43:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:43:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 20:43:05] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-29 20:43:05] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2025-05-29 20:43:05] [INFO ] [Nat]Added 45 Read/Feed constraints in 15 ms returned sat
[2025-05-29 20:43:05] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
[2025-05-29 20:43:05] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2025-05-29 20:43:05] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2025-05-29 20:43:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 386 ms
[2025-05-29 20:43:05] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 18 ms.
[2025-05-29 20:43:06] [INFO ] Added : 65 causal constraints over 14 iterations in 322 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 82/82 places, 219/219 transitions.
[2025-05-29 20:43:06] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 132=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 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-05-29 20:43:06] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2025-05-29 20:43:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000034 steps (2 resets) in 789 ms. (1265 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 709 ms. (1408 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-05-29 20:43:08] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2025-05-29 20:43:08] [INFO ] Invariant cache hit.
[2025-05-29 20:43:08] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 20:43:08] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:43:08] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-05-29 20:43:08] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-29 20:43:08] [INFO ] [Real]Added 45 Read/Feed constraints in 8 ms returned sat
[2025-05-29 20:43:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:43:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 20:43:08] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 20:43:08] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2025-05-29 20:43:08] [INFO ] [Nat]Added 45 Read/Feed constraints in 16 ms returned sat
[2025-05-29 20:43:08] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2025-05-29 20:43:08] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2025-05-29 20:43:08] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2025-05-29 20:43:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 402 ms
[2025-05-29 20:43:08] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 24 ms.
[2025-05-29 20:43:09] [INFO ] Added : 65 causal constraints over 14 iterations in 393 ms. Result :sat
Minimization took 104 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 15 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 82/82 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2025-05-29 20:43:09] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2025-05-29 20:43:09] [INFO ] Invariant cache hit.
[2025-05-29 20:43:09] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-05-29 20:43:09] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2025-05-29 20:43:09] [INFO ] Invariant cache hit.
[2025-05-29 20:43:09] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-29 20:43:09] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2025-05-29 20:43:10] [INFO ] Redundant transitions in 0 ms returned []
Running 218 sub problems to find dead transitions.
[2025-05-29 20:43:10] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2025-05-29 20:43:10] [INFO ] Invariant cache hit.
[2025-05-29 20:43:10] [INFO ] State equation strengthened by 45 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) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 218 unsolved in 9874 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 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) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 218/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2025-05-29 20:43:24] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 354 constraints, problems are : Problem set: 0 solved, 218 unsolved in 14220 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 1/1 constraints]
After SMT, in 24435ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 24442ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25120 ms. Remains : 82/82 places, 219/219 transitions.
[2025-05-29 20:43:34] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {4=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 40331 steps (8 resets) in 40 ms. (983 steps per ms) remains 1/1 properties
[2025-05-29 20:43:34] [INFO ] Flatten gal took : 30 ms
[2025-05-29 20:43:34] [INFO ] Flatten gal took : 28 ms
[2025-05-29 20:43:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15993126829979930244.gal : 7 ms
[2025-05-29 20:43:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8670579250561758844.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/ReachabilityCardinality15993126829979930244.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8670579250561758844.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 37586 steps (8 resets) in 149 ms. (250 steps per ms) remains 0/1 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[+inf]
Ending property specific reduction for BugTracking-PT-q3m128-UpperBounds-12 in 29626 ms.
[2025-05-29 20:43:34] [INFO ] Flatten gal took : 50 ms
[2025-05-29 20:43:34] [INFO ] Applying decomposition
[2025-05-29 20:43:34] [INFO ] Flatten gal took : 39 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/graph2190653400161532981.txt' '-o' '/tmp/graph2190653400161532981.bin' '-w' '/tmp/graph2190653400161532981.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2190653400161532981.bin' '-l' '-1' '-v' '-w' '/tmp/graph2190653400161532981.weights' '-q' '0' '-e' '0.001'
[2025-05-29 20:43:35] [INFO ] Decomposing Gal with order
[2025-05-29 20:43:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 20:43:35] [INFO ] Removed a total of 5 redundant transitions.
[2025-05-29 20:43:35] [INFO ] Flatten gal took : 109 ms
[2025-05-29 20:43:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 5 ms.
[2025-05-29 20:43:35] [INFO ] Time to serialize gal into /tmp/UpperBounds2315357351768832330.gal : 9 ms
[2025-05-29 20:43:35] [INFO ] Time to serialize properties into /tmp/UpperBounds18251678695729876162.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/UpperBounds2315357351768832330.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18251678695729876162.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 ...284
Loading property file /tmp/UpperBounds18251678695729876162.prop.

BK_STOP 1748551652224

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

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m128.tgz
mv BugTracking-PT-q3m128 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;