Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r013-tall-174853743000043.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 ASLink-PT-04b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r013-tall-174853743000043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 669K 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 ASLink-PT-04b-UpperBounds-00
FORMULA_NAME ASLink-PT-04b-UpperBounds-01
FORMULA_NAME ASLink-PT-04b-UpperBounds-02
FORMULA_NAME ASLink-PT-04b-UpperBounds-03
FORMULA_NAME ASLink-PT-04b-UpperBounds-04
FORMULA_NAME ASLink-PT-04b-UpperBounds-05
FORMULA_NAME ASLink-PT-04b-UpperBounds-06
FORMULA_NAME ASLink-PT-04b-UpperBounds-07
FORMULA_NAME ASLink-PT-04b-UpperBounds-08
FORMULA_NAME ASLink-PT-04b-UpperBounds-09
FORMULA_NAME ASLink-PT-04b-UpperBounds-10
FORMULA_NAME ASLink-PT-04b-UpperBounds-11
FORMULA_NAME ASLink-PT-04b-UpperBounds-12
FORMULA_NAME ASLink-PT-04b-UpperBounds-13
FORMULA_NAME ASLink-PT-04b-UpperBounds-14
FORMULA_NAME ASLink-PT-04b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748540252219

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:37:33] [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 17:37:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:37:33] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2025-05-29 17:37:33] [INFO ] Transformed 2034 places.
[2025-05-29 17:37:33] [INFO ] Transformed 2567 transitions.
[2025-05-29 17:37:33] [INFO ] Found NUPN structural information;
[2025-05-29 17:37:33] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 269 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 2567 rows 2034 cols
[2025-05-29 17:37:33] [INFO ] Computed 199 invariants in 148 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (27 resets) in 73 ms. (135 steps per ms)
FORMULA ASLink-PT-04b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (27 resets) in 112 ms. (708 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-29 17:37:34] [INFO ] Invariant cache hit.
[2025-05-29 17:37:34] [INFO ] [Real]Absence check using 48 positive place invariants in 121 ms returned sat
[2025-05-29 17:37:34] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 51 ms returned sat
[2025-05-29 17:37:35] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2025-05-29 17:37:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:35] [INFO ] [Nat]Absence check using 48 positive place invariants in 48 ms returned sat
[2025-05-29 17:37:36] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 47 ms returned sat
[2025-05-29 17:37:37] [INFO ] [Nat]Absence check using state equation in 1055 ms returned sat
[2025-05-29 17:37:37] [INFO ] Deduced a trap composed of 21 places in 675 ms of which 79 ms to minimize.
[2025-05-29 17:37:38] [INFO ] Deduced a trap composed of 66 places in 655 ms of which 9 ms to minimize.
[2025-05-29 17:37:39] [INFO ] Deduced a trap composed of 139 places in 607 ms of which 8 ms to minimize.
[2025-05-29 17:37:39] [INFO ] Deduced a trap composed of 68 places in 562 ms of which 8 ms to minimize.
[2025-05-29 17:37:40] [INFO ] Deduced a trap composed of 60 places in 540 ms of which 8 ms to minimize.
[2025-05-29 17:37:41] [INFO ] Deduced a trap composed of 83 places in 534 ms of which 8 ms to minimize.
[2025-05-29 17:37:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 17:37:41] [INFO ] [Real]Absence check using 48 positive place invariants in 45 ms returned sat
[2025-05-29 17:37:41] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 48 ms returned sat
[2025-05-29 17:37:42] [INFO ] [Real]Absence check using state equation in 1005 ms returned sat
[2025-05-29 17:37:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:42] [INFO ] [Nat]Absence check using 48 positive place invariants in 42 ms returned sat
[2025-05-29 17:37:43] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 53 ms returned sat
[2025-05-29 17:37:44] [INFO ] [Nat]Absence check using state equation in 1012 ms returned sat
[2025-05-29 17:37:44] [INFO ] Deduced a trap composed of 225 places in 706 ms of which 10 ms to minimize.
[2025-05-29 17:37:45] [INFO ] Deduced a trap composed of 377 places in 670 ms of which 10 ms to minimize.
[2025-05-29 17:37:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1678 ms
[2025-05-29 17:37:45] [INFO ] Computed and/alt/rep : 2147/4728/2147 causal constraints (skipped 419 transitions) in 145 ms.
[2025-05-29 17:37:47] [INFO ] Added : 10 causal constraints over 2 iterations in 1276 ms. Result :sat
Minimization took 584 ms.
[2025-05-29 17:37:47] [INFO ] [Real]Absence check using 48 positive place invariants in 44 ms returned sat
[2025-05-29 17:37:47] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 54 ms returned sat
[2025-05-29 17:37:49] [INFO ] [Real]Absence check using state equation in 1148 ms returned sat
[2025-05-29 17:37:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:49] [INFO ] [Nat]Absence check using 48 positive place invariants in 43 ms returned sat
[2025-05-29 17:37:49] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 48 ms returned sat
[2025-05-29 17:37:50] [INFO ] [Nat]Absence check using state equation in 1252 ms returned sat
[2025-05-29 17:37:51] [INFO ] Deduced a trap composed of 30 places in 658 ms of which 10 ms to minimize.
[2025-05-29 17:37:52] [INFO ] Deduced a trap composed of 173 places in 661 ms of which 21 ms to minimize.
[2025-05-29 17:37:52] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2004 ms
[2025-05-29 17:37:53] [INFO ] [Real]Absence check using 48 positive place invariants in 41 ms returned sat
[2025-05-29 17:37:53] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 53 ms returned sat
[2025-05-29 17:37:54] [INFO ] [Real]Absence check using state equation in 1000 ms returned sat
[2025-05-29 17:37:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:54] [INFO ] [Nat]Absence check using 48 positive place invariants in 43 ms returned sat
[2025-05-29 17:37:54] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 49 ms returned sat
[2025-05-29 17:37:55] [INFO ] [Nat]Absence check using state equation in 1051 ms returned sat
[2025-05-29 17:37:56] [INFO ] Deduced a trap composed of 113 places in 604 ms of which 10 ms to minimize.
[2025-05-29 17:37:56] [INFO ] Deduced a trap composed of 50 places in 348 ms of which 5 ms to minimize.
[2025-05-29 17:37:57] [INFO ] Deduced a trap composed of 64 places in 468 ms of which 8 ms to minimize.
[2025-05-29 17:37:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1750 ms
[2025-05-29 17:37:57] [INFO ] Computed and/alt/rep : 2147/4728/2147 causal constraints (skipped 419 transitions) in 150 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-29 17:37:59] [INFO ] [Real]Absence check using 48 positive place invariants in 45 ms returned sat
[2025-05-29 17:37:59] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 51 ms returned sat
[2025-05-29 17:38:00] [INFO ] [Real]Absence check using state equation in 1183 ms returned sat
[2025-05-29 17:38:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:01] [INFO ] [Nat]Absence check using 48 positive place invariants in 39 ms returned sat
[2025-05-29 17:38:01] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 47 ms returned sat
[2025-05-29 17:38:02] [INFO ] [Nat]Absence check using state equation in 1144 ms returned sat
[2025-05-29 17:38:03] [INFO ] Deduced a trap composed of 162 places in 542 ms of which 9 ms to minimize.
[2025-05-29 17:38:03] [INFO ] Deduced a trap composed of 44 places in 426 ms of which 6 ms to minimize.
[2025-05-29 17:38:04] [INFO ] Deduced a trap composed of 110 places in 523 ms of which 8 ms to minimize.
[2025-05-29 17:38:04] [INFO ] Deduced a trap composed of 88 places in 537 ms of which 9 ms to minimize.
[2025-05-29 17:38:05] [INFO ] Deduced a trap composed of 163 places in 530 ms of which 9 ms to minimize.
[2025-05-29 17:38:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3050 ms
[2025-05-29 17:38:05] [INFO ] Computed and/alt/rep : 2147/4728/2147 causal constraints (skipped 419 transitions) in 122 ms.
[2025-05-29 17:38:06] [INFO ] Added : 10 causal constraints over 2 iterations in 461 ms. Result :unknown
[2025-05-29 17:38:06] [INFO ] [Real]Absence check using 48 positive place invariants in 42 ms returned sat
[2025-05-29 17:38:06] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 50 ms returned sat
[2025-05-29 17:38:07] [INFO ] [Real]Absence check using state equation in 900 ms returned sat
[2025-05-29 17:38:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:07] [INFO ] [Nat]Absence check using 48 positive place invariants in 40 ms returned sat
[2025-05-29 17:38:07] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 49 ms returned sat
[2025-05-29 17:38:08] [INFO ] [Nat]Absence check using state equation in 1221 ms returned sat
[2025-05-29 17:38:09] [INFO ] Deduced a trap composed of 19 places in 560 ms of which 8 ms to minimize.
[2025-05-29 17:38:10] [INFO ] Deduced a trap composed of 35 places in 555 ms of which 8 ms to minimize.
[2025-05-29 17:38:10] [INFO ] Deduced a trap composed of 94 places in 529 ms of which 8 ms to minimize.
[2025-05-29 17:38:11] [INFO ] Deduced a trap composed of 52 places in 344 ms of which 6 ms to minimize.
[2025-05-29 17:38:11] [INFO ] Deduced a trap composed of 85 places in 230 ms of which 4 ms to minimize.
[2025-05-29 17:38:11] [INFO ] Deduced a trap composed of 36 places in 231 ms of which 5 ms to minimize.
[2025-05-29 17:38:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3028 ms
[2025-05-29 17:38:12] [INFO ] Computed and/alt/rep : 2147/4728/2147 causal constraints (skipped 419 transitions) in 134 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-29 17:38:12] [INFO ] [Real]Absence check using 48 positive place invariants in 40 ms returned sat
[2025-05-29 17:38:12] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 52 ms returned sat
[2025-05-29 17:38:13] [INFO ] [Real]Absence check using state equation in 985 ms returned sat
[2025-05-29 17:38:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:14] [INFO ] [Nat]Absence check using 48 positive place invariants in 42 ms returned sat
[2025-05-29 17:38:14] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 50 ms returned sat
[2025-05-29 17:38:15] [INFO ] [Nat]Absence check using state equation in 1117 ms returned sat
[2025-05-29 17:38:16] [INFO ] Deduced a trap composed of 168 places in 641 ms of which 9 ms to minimize.
[2025-05-29 17:38:16] [INFO ] Deduced a trap composed of 259 places in 623 ms of which 9 ms to minimize.
[2025-05-29 17:38:17] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 5 ms to minimize.
[2025-05-29 17:38:17] [INFO ] Deduced a trap composed of 91 places in 245 ms of which 4 ms to minimize.
[2025-05-29 17:38:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2125 ms
[2025-05-29 17:38:17] [INFO ] Computed and/alt/rep : 2147/4728/2147 causal constraints (skipped 419 transitions) in 126 ms.
[2025-05-29 17:38:18] [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 6
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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 17:38:19] [INFO ] [Real]Absence check using 48 positive place invariants in 39 ms returned sat
[2025-05-29 17:38:19] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 51 ms returned sat
[2025-05-29 17:38:20] [INFO ] [Real]Absence check using state equation in 1023 ms returned sat
[2025-05-29 17:38:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:20] [INFO ] [Nat]Absence check using 48 positive place invariants in 42 ms returned sat
[2025-05-29 17:38:20] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 49 ms returned sat
[2025-05-29 17:38:22] [INFO ] [Nat]Absence check using state equation in 1614 ms returned sat
[2025-05-29 17:38:23] [INFO ] Deduced a trap composed of 20 places in 880 ms of which 11 ms to minimize.
[2025-05-29 17:38:24] [INFO ] Deduced a trap composed of 22 places in 860 ms of which 11 ms to minimize.
[2025-05-29 17:38:25] [INFO ] Deduced a trap composed of 22 places in 874 ms of which 12 ms to minimize.
[2025-05-29 17:38:26] [INFO ] Deduced a trap composed of 43 places in 781 ms of which 11 ms to minimize.
[2025-05-29 17:38:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 2034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 465 transitions
Trivial Post-agglo rules discarded 465 transitions
Performed 465 trivial Post agglomeration. Transition count delta: 465
Iterating post reduction 0 with 465 rules applied. Total rules applied 465 place count 2034 transition count 2102
Reduce places removed 465 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 487 rules applied. Total rules applied 952 place count 1569 transition count 2080
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 960 place count 1563 transition count 2078
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 962 place count 1561 transition count 2078
Performed 468 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 468 Pre rules applied. Total rules applied 962 place count 1561 transition count 1610
Deduced a syphon composed of 468 places in 3 ms
Ensure Unique test removed 43 places
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 4 with 979 rules applied. Total rules applied 1941 place count 1050 transition count 1610
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 4 with 32 rules applied. Total rules applied 1973 place count 1046 transition count 1582
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 2001 place count 1018 transition count 1582
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 2001 place count 1018 transition count 1566
Deduced a syphon composed of 16 places in 7 ms
Ensure Unique test removed 15 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 47 rules applied. Total rules applied 2048 place count 987 transition count 1566
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 2049 place count 986 transition count 1566
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 16 Pre rules applied. Total rules applied 2049 place count 986 transition count 1550
Deduced a syphon composed of 16 places in 7 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 2081 place count 970 transition count 1550
Discarding 64 places :
Symmetric choice reduction at 7 with 64 rule applications. Total rules 2145 place count 906 transition count 1486
Iterating global reduction 7 with 64 rules applied. Total rules applied 2209 place count 906 transition count 1486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2210 place count 906 transition count 1485
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 22 Pre rules applied. Total rules applied 2210 place count 906 transition count 1463
Deduced a syphon composed of 22 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 8 with 45 rules applied. Total rules applied 2255 place count 883 transition count 1463
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2255 place count 883 transition count 1462
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 2258 place count 881 transition count 1462
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 2263 place count 876 transition count 1429
Iterating global reduction 8 with 5 rules applied. Total rules applied 2268 place count 876 transition count 1429
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 2268 place count 876 transition count 1425
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2276 place count 872 transition count 1425
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2277 place count 871 transition count 1417
Iterating global reduction 8 with 1 rules applied. Total rules applied 2278 place count 871 transition count 1417
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2279 place count 870 transition count 1409
Iterating global reduction 8 with 1 rules applied. Total rules applied 2280 place count 870 transition count 1409
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2281 place count 869 transition count 1401
Iterating global reduction 8 with 1 rules applied. Total rules applied 2282 place count 869 transition count 1401
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2283 place count 868 transition count 1393
Iterating global reduction 8 with 1 rules applied. Total rules applied 2284 place count 868 transition count 1393
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2285 place count 867 transition count 1385
Iterating global reduction 8 with 1 rules applied. Total rules applied 2286 place count 867 transition count 1385
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2287 place count 866 transition count 1377
Iterating global reduction 8 with 1 rules applied. Total rules applied 2288 place count 866 transition count 1377
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2289 place count 865 transition count 1369
Iterating global reduction 8 with 1 rules applied. Total rules applied 2290 place count 865 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2291 place count 864 transition count 1361
Iterating global reduction 8 with 1 rules applied. Total rules applied 2292 place count 864 transition count 1361
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2293 place count 863 transition count 1353
Iterating global reduction 8 with 1 rules applied. Total rules applied 2294 place count 863 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2295 place count 862 transition count 1345
Iterating global reduction 8 with 1 rules applied. Total rules applied 2296 place count 862 transition count 1345
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2297 place count 861 transition count 1337
Iterating global reduction 8 with 1 rules applied. Total rules applied 2298 place count 861 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2299 place count 860 transition count 1329
Iterating global reduction 8 with 1 rules applied. Total rules applied 2300 place count 860 transition count 1329
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2301 place count 859 transition count 1321
Iterating global reduction 8 with 1 rules applied. Total rules applied 2302 place count 859 transition count 1321
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2303 place count 858 transition count 1313
Iterating global reduction 8 with 1 rules applied. Total rules applied 2304 place count 858 transition count 1313
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2305 place count 857 transition count 1305
Iterating global reduction 8 with 1 rules applied. Total rules applied 2306 place count 857 transition count 1305
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2307 place count 856 transition count 1297
Iterating global reduction 8 with 1 rules applied. Total rules applied 2308 place count 856 transition count 1297
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 8 with 226 rules applied. Total rules applied 2534 place count 743 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2535 place count 742 transition count 1183
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 2537 place count 741 transition count 1183
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2538 place count 740 transition count 1182
Iterating global reduction 8 with 1 rules applied. Total rules applied 2539 place count 740 transition count 1182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2541 place count 740 transition count 1180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2542 place count 739 transition count 1180
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2544 place count 738 transition count 1189
Free-agglomeration rule applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 2549 place count 738 transition count 1184
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2554 place count 733 transition count 1184
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 2557 place count 733 transition count 1181
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 2560 place count 730 transition count 1181
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2561 place count 729 transition count 1180
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 12 with 12 rules applied. Total rules applied 2573 place count 721 transition count 1176
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 2577 place count 717 transition count 1176
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 12 Pre rules applied. Total rules applied 2577 place count 717 transition count 1164
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 14 with 25 rules applied. Total rules applied 2602 place count 704 transition count 1164
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 14 with 5 rules applied. Total rules applied 2607 place count 699 transition count 1164
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 15 with 18 rules applied. Total rules applied 2625 place count 690 transition count 1155
Discarding 4 places :
Symmetric choice reduction at 15 with 4 rule applications. Total rules 2629 place count 686 transition count 1151
Iterating global reduction 15 with 4 rules applied. Total rules applied 2633 place count 686 transition count 1151
Free-agglomeration rule applied 4 times.
Iterating global reduction 15 with 4 rules applied. Total rules applied 2637 place count 686 transition count 1147
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 2641 place count 682 transition count 1147
Applied a total of 2641 rules in 1173 ms. Remains 682 /2034 variables (removed 1352) and now considering 1147/2567 (removed 1420) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1183 ms. Remains : 682/2034 places, 1147/2567 transitions.
// Phase 1: matrix 1147 rows 682 cols
[2025-05-29 17:38:27] [INFO ] Computed 119 invariants in 45 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (12811 resets) in 2122 ms. (471 steps per ms)
FORMULA ASLink-PT-04b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7000006 steps (20460 resets) in 6615 ms. (1058 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-05-29 17:38:36] [INFO ] Invariant cache hit.
[2025-05-29 17:38:36] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2025-05-29 17:38:36] [INFO ] [Real]Absence check using 31 positive and 88 generalized place invariants in 16 ms returned sat
[2025-05-29 17:38:37] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2025-05-29 17:38:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:37] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2025-05-29 17:38:37] [INFO ] [Nat]Absence check using 31 positive and 88 generalized place invariants in 15 ms returned sat
[2025-05-29 17:38:37] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2025-05-29 17:38:37] [INFO ] Computed and/alt/rep : 447/1710/447 causal constraints (skipped 675 transitions) in 55 ms.
[2025-05-29 17:38:38] [INFO ] Added : 94 causal constraints over 19 iterations in 1302 ms. Result :sat
Minimization took 757 ms.
[2025-05-29 17:38:39] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2025-05-29 17:38:39] [INFO ] [Real]Absence check using 31 positive and 88 generalized place invariants in 16 ms returned sat
[2025-05-29 17:38:40] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2025-05-29 17:38:40] [INFO ] Computed and/alt/rep : 447/1710/447 causal constraints (skipped 675 transitions) in 57 ms.
[2025-05-29 17:38:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:40] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2025-05-29 17:38:40] [INFO ] [Nat]Absence check using 31 positive and 88 generalized place invariants in 17 ms returned sat
[2025-05-29 17:38:40] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2025-05-29 17:38:40] [INFO ] Computed and/alt/rep : 447/1710/447 causal constraints (skipped 675 transitions) in 56 ms.
[2025-05-29 17:38:43] [INFO ] Added : 173 causal constraints over 35 iterations in 2209 ms. Result :sat
Minimization took 576 ms.
[2025-05-29 17:38:43] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2025-05-29 17:38:43] [INFO ] [Real]Absence check using 31 positive and 88 generalized place invariants in 16 ms returned sat
[2025-05-29 17:38:44] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2025-05-29 17:38:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:44] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2025-05-29 17:38:44] [INFO ] [Nat]Absence check using 31 positive and 88 generalized place invariants in 15 ms returned sat
[2025-05-29 17:38:44] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2025-05-29 17:38:44] [INFO ] Computed and/alt/rep : 447/1710/447 causal constraints (skipped 675 transitions) in 58 ms.
[2025-05-29 17:38:47] [INFO ] Added : 266 causal constraints over 54 iterations in 3472 ms. Result :sat
Minimization took 727 ms.
[2025-05-29 17:38:48] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2025-05-29 17:38:48] [INFO ] [Real]Absence check using 31 positive and 88 generalized place invariants in 20 ms returned sat
[2025-05-29 17:38:49] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2025-05-29 17:38:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:49] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2025-05-29 17:38:49] [INFO ] [Nat]Absence check using 31 positive and 88 generalized place invariants in 16 ms returned sat
[2025-05-29 17:38:49] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2025-05-29 17:38:49] [INFO ] Computed and/alt/rep : 447/1710/447 causal constraints (skipped 675 transitions) in 73 ms.
[2025-05-29 17:38:53] [INFO ] Added : 349 causal constraints over 70 iterations in 4159 ms. Result :sat
Minimization took 618 ms.
[2025-05-29 17:38:54] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned sat
[2025-05-29 17:38:54] [INFO ] [Real]Absence check using 31 positive and 88 generalized place invariants in 26 ms returned sat
[2025-05-29 17:38:54] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2025-05-29 17:38:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:54] [INFO ] [Nat]Absence check using 31 positive place invariants in 22 ms returned sat
[2025-05-29 17:38:54] [INFO ] [Nat]Absence check using 31 positive and 88 generalized place invariants in 19 ms returned sat
[2025-05-29 17:38:55] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2025-05-29 17:38:55] [INFO ] Computed and/alt/rep : 447/1710/447 causal constraints (skipped 675 transitions) in 58 ms.
[2025-05-29 17:38:59] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2025-05-29 17:38:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2025-05-29 17:38:59] [INFO ] Added : 308 causal constraints over 62 iterations in 4024 ms. Result :sat
Minimization took 647 ms.
[2025-05-29 17:39:00] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned sat
[2025-05-29 17:39:00] [INFO ] [Real]Absence check using 31 positive and 88 generalized place invariants in 19 ms returned sat
[2025-05-29 17:39:00] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2025-05-29 17:39:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:00] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2025-05-29 17:39:00] [INFO ] [Nat]Absence check using 31 positive and 88 generalized place invariants in 18 ms returned sat
[2025-05-29 17:39:00] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2025-05-29 17:39:00] [INFO ] Computed and/alt/rep : 447/1710/447 causal constraints (skipped 675 transitions) in 58 ms.
[2025-05-29 17:39:01] [INFO ] Added : 77 causal constraints over 16 iterations in 1032 ms. Result :sat
Minimization took 684 ms.
[2025-05-29 17:39:02] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned sat
[2025-05-29 17:39:02] [INFO ] [Real]Absence check using 31 positive and 88 generalized place invariants in 18 ms returned sat
[2025-05-29 17:39:03] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2025-05-29 17:39:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:03] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2025-05-29 17:39:03] [INFO ] [Nat]Absence check using 31 positive and 88 generalized place invariants in 17 ms returned sat
[2025-05-29 17:39:03] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2025-05-29 17:39:03] [INFO ] Computed and/alt/rep : 447/1710/447 causal constraints (skipped 675 transitions) in 55 ms.
[2025-05-29 17:39:07] [INFO ] Added : 322 causal constraints over 65 iterations in 3851 ms. Result :sat
Minimization took 602 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 682/682 places, 1147/1147 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 681 transition count 1146
Applied a total of 2 rules in 33 ms. Remains 681 /682 variables (removed 1) and now considering 1146/1147 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 681/682 places, 1146/1147 transitions.
// Phase 1: matrix 1146 rows 681 cols
[2025-05-29 17:39:10] [INFO ] Computed 119 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (12787 resets) in 2036 ms. (490 steps per ms)
BEST_FIRST walk for 7000005 steps (20419 resets) in 6594 ms. (1061 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-05-29 17:39:18] [INFO ] Invariant cache hit.
[2025-05-29 17:39:19] [INFO ] [Real]Absence check using 32 positive place invariants in 10 ms returned sat
[2025-05-29 17:39:19] [INFO ] [Real]Absence check using 32 positive and 87 generalized place invariants in 18 ms returned sat
[2025-05-29 17:39:19] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2025-05-29 17:39:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:19] [INFO ] [Nat]Absence check using 32 positive place invariants in 9 ms returned sat
[2025-05-29 17:39:19] [INFO ] [Nat]Absence check using 32 positive and 87 generalized place invariants in 17 ms returned sat
[2025-05-29 17:39:19] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2025-05-29 17:39:19] [INFO ] Computed and/alt/rep : 446/1709/446 causal constraints (skipped 675 transitions) in 61 ms.
[2025-05-29 17:39:23] [INFO ] Added : 319 causal constraints over 64 iterations in 3868 ms. Result :sat
Minimization took 665 ms.
[2025-05-29 17:39:24] [INFO ] [Real]Absence check using 32 positive place invariants in 10 ms returned sat
[2025-05-29 17:39:24] [INFO ] [Real]Absence check using 32 positive and 87 generalized place invariants in 17 ms returned sat
[2025-05-29 17:39:24] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2025-05-29 17:39:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:24] [INFO ] [Nat]Absence check using 32 positive place invariants in 10 ms returned sat
[2025-05-29 17:39:24] [INFO ] [Nat]Absence check using 32 positive and 87 generalized place invariants in 18 ms returned sat
[2025-05-29 17:39:25] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2025-05-29 17:39:25] [INFO ] Computed and/alt/rep : 446/1709/446 causal constraints (skipped 675 transitions) in 60 ms.
[2025-05-29 17:39:26] [INFO ] Added : 74 causal constraints over 15 iterations in 1010 ms. Result :sat
Minimization took 598 ms.
[2025-05-29 17:39:26] [INFO ] [Real]Absence check using 32 positive place invariants in 9 ms returned sat
[2025-05-29 17:39:26] [INFO ] [Real]Absence check using 32 positive and 87 generalized place invariants in 16 ms returned sat
[2025-05-29 17:39:27] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2025-05-29 17:39:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:27] [INFO ] [Nat]Absence check using 32 positive place invariants in 10 ms returned sat
[2025-05-29 17:39:27] [INFO ] [Nat]Absence check using 32 positive and 87 generalized place invariants in 17 ms returned sat
[2025-05-29 17:39:27] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2025-05-29 17:39:27] [INFO ] Computed and/alt/rep : 446/1709/446 causal constraints (skipped 675 transitions) in 55 ms.
[2025-05-29 17:39:31] [INFO ] Added : 266 causal constraints over 54 iterations in 3849 ms. Result :sat
Minimization took 562 ms.
[2025-05-29 17:39:32] [INFO ] [Real]Absence check using 32 positive place invariants in 10 ms returned sat
[2025-05-29 17:39:32] [INFO ] [Real]Absence check using 32 positive and 87 generalized place invariants in 17 ms returned sat
[2025-05-29 17:39:32] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2025-05-29 17:39:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:32] [INFO ] [Nat]Absence check using 32 positive place invariants in 10 ms returned sat
[2025-05-29 17:39:32] [INFO ] [Nat]Absence check using 32 positive and 87 generalized place invariants in 19 ms returned sat
[2025-05-29 17:39:33] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2025-05-29 17:39:33] [INFO ] Computed and/alt/rep : 446/1709/446 causal constraints (skipped 675 transitions) in 54 ms.
[2025-05-29 17:39:37] [INFO ] Added : 373 causal constraints over 75 iterations in 4708 ms. Result :sat
Minimization took 608 ms.
[2025-05-29 17:39:38] [INFO ] [Real]Absence check using 32 positive place invariants in 10 ms returned sat
[2025-05-29 17:39:38] [INFO ] [Real]Absence check using 32 positive and 87 generalized place invariants in 17 ms returned sat
[2025-05-29 17:39:38] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2025-05-29 17:39:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:39] [INFO ] [Nat]Absence check using 32 positive place invariants in 10 ms returned sat
[2025-05-29 17:39:39] [INFO ] [Nat]Absence check using 32 positive and 87 generalized place invariants in 16 ms returned sat
[2025-05-29 17:39:39] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2025-05-29 17:39:39] [INFO ] Computed and/alt/rep : 446/1709/446 causal constraints (skipped 675 transitions) in 53 ms.
[2025-05-29 17:39:42] [INFO ] Added : 263 causal constraints over 53 iterations in 3347 ms. Result :sat
Minimization took 607 ms.
[2025-05-29 17:39:43] [INFO ] [Real]Absence check using 32 positive place invariants in 10 ms returned sat
[2025-05-29 17:39:43] [INFO ] [Real]Absence check using 32 positive and 87 generalized place invariants in 17 ms returned sat
[2025-05-29 17:39:43] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2025-05-29 17:39:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:43] [INFO ] [Nat]Absence check using 32 positive place invariants in 9 ms returned sat
[2025-05-29 17:39:43] [INFO ] [Nat]Absence check using 32 positive and 87 generalized place invariants in 16 ms returned sat
[2025-05-29 17:39:44] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2025-05-29 17:39:44] [INFO ] Computed and/alt/rep : 446/1709/446 causal constraints (skipped 675 transitions) in 53 ms.
[2025-05-29 17:39:47] [INFO ] Added : 302 causal constraints over 61 iterations in 3558 ms. Result :sat
Minimization took 719 ms.
[2025-05-29 17:39:48] [INFO ] [Real]Absence check using 32 positive place invariants in 10 ms returned sat
[2025-05-29 17:39:48] [INFO ] [Real]Absence check using 32 positive and 87 generalized place invariants in 25 ms returned sat
[2025-05-29 17:39:48] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2025-05-29 17:39:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:49] [INFO ] [Nat]Absence check using 32 positive place invariants in 11 ms returned sat
[2025-05-29 17:39:49] [INFO ] [Nat]Absence check using 32 positive and 87 generalized place invariants in 15 ms returned sat
[2025-05-29 17:39:49] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2025-05-29 17:39:49] [INFO ] Computed and/alt/rep : 446/1709/446 causal constraints (skipped 675 transitions) in 58 ms.
[2025-05-29 17:39:53] [INFO ] Added : 312 causal constraints over 63 iterations in 3793 ms. Result :sat
Minimization took 620 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 681/681 places, 1146/1146 transitions.
Applied a total of 0 rules in 19 ms. Remains 681 /681 variables (removed 0) and now considering 1146/1146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 681/681 places, 1146/1146 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 681/681 places, 1146/1146 transitions.
Applied a total of 0 rules in 31 ms. Remains 681 /681 variables (removed 0) and now considering 1146/1146 (removed 0) transitions.
[2025-05-29 17:39:56] [INFO ] Invariant cache hit.
[2025-05-29 17:39:57] [INFO ] Implicit Places using invariants in 412 ms returned [1, 18, 19, 31, 48, 66, 139, 143, 153, 154, 156, 173, 191, 261, 265, 266, 277, 278, 280, 297, 315, 384, 388, 389, 400, 401, 403, 420, 438, 507, 511, 512, 515, 526, 527, 528, 546, 548, 552, 570, 571, 572, 573, 585, 591, 597, 603, 609, 615, 621, 627, 633, 639, 645]
[2025-05-29 17:39:57] [INFO ] Actually due to overlaps returned [546, 528, 48, 173, 297, 420, 552, 31, 156, 280, 403, 153, 277, 400, 526, 570, 154, 278, 401, 527, 548, 571, 1, 18, 265, 266, 388, 389, 511, 512, 66, 191, 315, 438, 572, 615, 633, 645, 19, 143, 515, 573, 585, 591, 597, 603, 609, 621, 627, 639]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 416 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 631/681 places, 1146/1146 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 627 transition count 1054
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 98 rules applied. Total rules applied 194 place count 535 transition count 1048
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 196 place count 533 transition count 1048
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 196 place count 533 transition count 1026
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 45 rules applied. Total rules applied 241 place count 510 transition count 1026
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 253 place count 506 transition count 1018
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 261 place count 498 transition count 1018
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 276 place count 483 transition count 1003
Iterating global reduction 5 with 15 rules applied. Total rules applied 291 place count 483 transition count 1003
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 294 place count 483 transition count 1000
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 294 place count 483 transition count 999
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 296 place count 482 transition count 999
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 299 place count 479 transition count 993
Iterating global reduction 6 with 3 rules applied. Total rules applied 302 place count 479 transition count 993
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 303 place count 478 transition count 992
Iterating global reduction 6 with 1 rules applied. Total rules applied 304 place count 478 transition count 992
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 305 place count 477 transition count 990
Iterating global reduction 6 with 1 rules applied. Total rules applied 306 place count 477 transition count 990
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 372 place count 444 transition count 957
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 376 place count 440 transition count 953
Iterating global reduction 6 with 4 rules applied. Total rules applied 380 place count 440 transition count 953
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 384 place count 440 transition count 949
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 388 place count 438 transition count 950
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 397 place count 438 transition count 941
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 407 place count 428 transition count 941
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 419 place count 428 transition count 941
Applied a total of 419 rules in 241 ms. Remains 428 /631 variables (removed 203) and now considering 941/1146 (removed 205) transitions.
// Phase 1: matrix 941 rows 428 cols
[2025-05-29 17:39:57] [INFO ] Computed 59 invariants in 16 ms
[2025-05-29 17:39:57] [INFO ] Implicit Places using invariants in 266 ms returned [73, 95, 101, 104, 106, 110, 111, 163, 181, 187, 190, 192, 197, 198, 250, 267, 273, 276, 278, 283, 284, 336, 353, 359, 362, 364]
[2025-05-29 17:39:57] [INFO ] Actually due to overlaps returned [110, 197, 283, 111, 198, 284, 95, 101, 106, 181, 187, 192, 267, 273, 278, 353, 359, 364, 73, 163, 250, 336]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 268 ms to find 22 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 406/681 places, 941/1146 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 390 transition count 925
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 390 transition count 925
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 386 transition count 921
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 386 transition count 921
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 56 place count 378 transition count 913
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 378 transition count 901
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 80 place count 366 transition count 901
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 366 transition count 897
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 88 place count 362 transition count 897
Applied a total of 88 rules in 113 ms. Remains 362 /406 variables (removed 44) and now considering 897/941 (removed 44) transitions.
// Phase 1: matrix 897 rows 362 cols
[2025-05-29 17:39:57] [INFO ] Computed 37 invariants in 9 ms
[2025-05-29 17:39:57] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-05-29 17:39:57] [INFO ] Invariant cache hit.
[2025-05-29 17:39:58] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 362/681 places, 897/1146 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1895 ms. Remains : 362/681 places, 897/1146 transitions.
[2025-05-29 17:39:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (19585 resets) in 1639 ms. (609 steps per ms)
BEST_FIRST walk for 7000006 steps (38077 resets) in 4823 ms. (1451 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-05-29 17:40:05] [INFO ] Invariant cache hit.
[2025-05-29 17:40:05] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:05] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:40:05] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2025-05-29 17:40:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:05] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:40:05] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2025-05-29 17:40:05] [INFO ] Computed and/alt/rep : 189/905/189 causal constraints (skipped 683 transitions) in 46 ms.
[2025-05-29 17:40:05] [INFO ] Added : 20 causal constraints over 4 iterations in 321 ms. Result :sat
Minimization took 408 ms.
[2025-05-29 17:40:06] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:06] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:40:06] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2025-05-29 17:40:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:06] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 7 ms returned sat
[2025-05-29 17:40:06] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2025-05-29 17:40:06] [INFO ] Computed and/alt/rep : 189/905/189 causal constraints (skipped 683 transitions) in 51 ms.
[2025-05-29 17:40:07] [INFO ] Added : 7 causal constraints over 2 iterations in 194 ms. Result :sat
Minimization took 433 ms.
[2025-05-29 17:40:07] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:07] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:40:07] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2025-05-29 17:40:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:07] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 7 ms returned sat
[2025-05-29 17:40:08] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2025-05-29 17:40:08] [INFO ] Computed and/alt/rep : 189/905/189 causal constraints (skipped 683 transitions) in 44 ms.
[2025-05-29 17:40:08] [INFO ] Added : 10 causal constraints over 2 iterations in 218 ms. Result :sat
Minimization took 386 ms.
[2025-05-29 17:40:08] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:08] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:40:09] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2025-05-29 17:40:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:09] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:40:09] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2025-05-29 17:40:09] [INFO ] Computed and/alt/rep : 189/905/189 causal constraints (skipped 683 transitions) in 42 ms.
[2025-05-29 17:40:09] [INFO ] Added : 11 causal constraints over 3 iterations in 205 ms. Result :sat
Minimization took 373 ms.
[2025-05-29 17:40:10] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-05-29 17:40:10] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:40:10] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2025-05-29 17:40:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:10] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 9 ms returned sat
[2025-05-29 17:40:10] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2025-05-29 17:40:10] [INFO ] Computed and/alt/rep : 189/905/189 causal constraints (skipped 683 transitions) in 42 ms.
[2025-05-29 17:40:11] [INFO ] Added : 26 causal constraints over 6 iterations in 430 ms. Result :sat
Minimization took 417 ms.
[2025-05-29 17:40:11] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:11] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:40:11] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2025-05-29 17:40:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:11] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 9 ms returned sat
[2025-05-29 17:40:11] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2025-05-29 17:40:12] [INFO ] Computed and/alt/rep : 189/905/189 causal constraints (skipped 683 transitions) in 42 ms.
[2025-05-29 17:40:12] [INFO ] Added : 13 causal constraints over 3 iterations in 203 ms. Result :sat
Minimization took 437 ms.
[2025-05-29 17:40:12] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:12] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 8 ms returned sat
[2025-05-29 17:40:12] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2025-05-29 17:40:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:13] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 8 ms returned sat
[2025-05-29 17:40:13] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2025-05-29 17:40:13] [INFO ] Computed and/alt/rep : 189/905/189 causal constraints (skipped 683 transitions) in 43 ms.
[2025-05-29 17:40:13] [INFO ] Added : 10 causal constraints over 2 iterations in 175 ms. Result :sat
Minimization took 375 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-04b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 897/897 transitions.
Applied a total of 0 rules in 9 ms. Remains 362 /362 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 362/362 places, 897/897 transitions.
[2025-05-29 17:40:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (19643 resets) in 1609 ms. (621 steps per ms)
BEST_FIRST walk for 6000004 steps (32624 resets) in 4080 ms. (1470 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-29 17:40:20] [INFO ] Invariant cache hit.
[2025-05-29 17:40:20] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:20] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 7 ms returned sat
[2025-05-29 17:40:20] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2025-05-29 17:40:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:20] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:40:20] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2025-05-29 17:40:20] [INFO ] Computed and/alt/rep : 189/905/189 causal constraints (skipped 683 transitions) in 42 ms.
[2025-05-29 17:40:21] [INFO ] Added : 20 causal constraints over 4 iterations in 328 ms. Result :sat
Minimization took 398 ms.
[2025-05-29 17:40:21] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:21] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:40:21] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2025-05-29 17:40:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:21] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:40:22] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2025-05-29 17:40:22] [INFO ] Computed and/alt/rep : 189/905/189 causal constraints (skipped 683 transitions) in 43 ms.
[2025-05-29 17:40:22] [INFO ] Added : 7 causal constraints over 2 iterations in 174 ms. Result :sat
Minimization took 427 ms.
[2025-05-29 17:40:22] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:22] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 12 ms returned sat
[2025-05-29 17:40:23] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2025-05-29 17:40:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:23] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 8 ms returned sat
[2025-05-29 17:40:23] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2025-05-29 17:40:23] [INFO ] Computed and/alt/rep : 189/905/189 causal constraints (skipped 683 transitions) in 44 ms.
[2025-05-29 17:40:23] [INFO ] Added : 11 causal constraints over 3 iterations in 206 ms. Result :sat
Minimization took 374 ms.
[2025-05-29 17:40:24] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:24] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 7 ms returned sat
[2025-05-29 17:40:24] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2025-05-29 17:40:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-05-29 17:40:24] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 8 ms returned sat
[2025-05-29 17:40:24] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2025-05-29 17:40:24] [INFO ] Computed and/alt/rep : 189/905/189 causal constraints (skipped 683 transitions) in 43 ms.
[2025-05-29 17:40:25] [INFO ] Added : 26 causal constraints over 6 iterations in 442 ms. Result :sat
Minimization took 424 ms.
[2025-05-29 17:40:25] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:25] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:40:25] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2025-05-29 17:40:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-05-29 17:40:25] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:40:26] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2025-05-29 17:40:26] [INFO ] Computed and/alt/rep : 189/905/189 causal constraints (skipped 683 transitions) in 45 ms.
[2025-05-29 17:40:26] [INFO ] Added : 13 causal constraints over 3 iterations in 200 ms. Result :sat
Minimization took 435 ms.
[2025-05-29 17:40:26] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:26] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:40:26] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2025-05-29 17:40:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:40:27] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:40:27] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2025-05-29 17:40:27] [INFO ] Computed and/alt/rep : 189/905/189 causal constraints (skipped 683 transitions) in 55 ms.
[2025-05-29 17:40:27] [INFO ] Added : 10 causal constraints over 2 iterations in 184 ms. Result :sat
Minimization took 375 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 897/897 transitions.
Applied a total of 0 rules in 9 ms. Remains 362 /362 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 362/362 places, 897/897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 897/897 transitions.
Applied a total of 0 rules in 9 ms. Remains 362 /362 variables (removed 0) and now considering 897/897 (removed 0) transitions.
[2025-05-29 17:40:28] [INFO ] Invariant cache hit.
[2025-05-29 17:40:28] [INFO ] Implicit Places using invariants in 186 ms returned []
[2025-05-29 17:40:28] [INFO ] Invariant cache hit.
[2025-05-29 17:40:29] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
[2025-05-29 17:40:29] [INFO ] Redundant transitions in 46 ms returned []
Running 872 sub problems to find dead transitions.
[2025-05-29 17:40:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 3 (OVERLAPS) 1/362 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 872 unsolved
[2025-05-29 17:40:50] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 5 ms to minimize.
[2025-05-29 17:40:55] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2025-05-29 17:40:55] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2025-05-29 17:40:56] [INFO ] Deduced a trap composed of 61 places in 146 ms of which 2 ms to minimize.
[2025-05-29 17:40:58] [INFO ] Deduced a trap composed of 89 places in 160 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 872 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/1259 variables, and 42 constraints, problems are : Problem set: 0 solved, 872 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/362 constraints, PredecessorRefiner: 872/872 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 872 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 3 (OVERLAPS) 1/362 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 872 unsolved
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem 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 TDEAD86 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 TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
At refinement iteration 7 (OVERLAPS) 897/1259 variables, 362/404 constraints. Problems are: Problem set: 102 solved, 770 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1259/1259 variables, and 1174 constraints, problems are : Problem set: 102 solved, 770 unsolved in 30137 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 770/872 constraints, Known Traps: 5/5 constraints]
After SMT, in 60657ms problems are : Problem set: 102 solved, 770 unsolved
Search for dead transitions found 102 dead transitions in 60676ms
Found 102 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 102 transitions
Dead transitions reduction (with SMT) removed 102 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 362/362 places, 795/897 transitions.
Applied a total of 0 rules in 7 ms. Remains 362 /362 variables (removed 0) and now considering 795/795 (removed 0) transitions.
[2025-05-29 17:41:30] [INFO ] Redundant transitions in 35 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61605 ms. Remains : 362/362 places, 795/897 transitions.
// Phase 1: matrix 795 rows 362 cols
[2025-05-29 17:41:30] [INFO ] Computed 37 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (19755 resets) in 1604 ms. (623 steps per ms)
BEST_FIRST walk for 6000006 steps (32464 resets) in 4069 ms. (1474 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-29 17:41:35] [INFO ] Invariant cache hit.
[2025-05-29 17:41:35] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:41:35] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:41:36] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2025-05-29 17:41:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-05-29 17:41:36] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:41:36] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2025-05-29 17:41:36] [INFO ] Computed and/alt/rep : 308/1453/308 causal constraints (skipped 462 transitions) in 39 ms.
[2025-05-29 17:41:37] [INFO ] Added : 96 causal constraints over 20 iterations in 828 ms. Result :sat
Minimization took 332 ms.
[2025-05-29 17:41:37] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:41:37] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:41:37] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2025-05-29 17:41:37] [INFO ] Computed and/alt/rep : 308/1453/308 causal constraints (skipped 462 transitions) in 39 ms.
[2025-05-29 17:41:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:41:37] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:41:38] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2025-05-29 17:41:38] [INFO ] Computed and/alt/rep : 308/1453/308 causal constraints (skipped 462 transitions) in 40 ms.
[2025-05-29 17:41:38] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2025-05-29 17:41:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2025-05-29 17:41:38] [INFO ] Added : 68 causal constraints over 14 iterations in 779 ms. Result :sat
Minimization took 273 ms.
[2025-05-29 17:41:39] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:41:39] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 7 ms returned sat
[2025-05-29 17:41:39] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2025-05-29 17:41:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:41:39] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:41:39] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2025-05-29 17:41:39] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 2 ms to minimize.
[2025-05-29 17:41:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2025-05-29 17:41:39] [INFO ] Computed and/alt/rep : 308/1453/308 causal constraints (skipped 462 transitions) in 38 ms.
[2025-05-29 17:41:40] [INFO ] Added : 109 causal constraints over 23 iterations in 1016 ms. Result :sat
Minimization took 323 ms.
[2025-05-29 17:41:41] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-05-29 17:41:41] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 13 ms returned sat
[2025-05-29 17:41:41] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2025-05-29 17:41:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:41:41] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:41:41] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2025-05-29 17:41:41] [INFO ] Computed and/alt/rep : 308/1453/308 causal constraints (skipped 462 transitions) in 38 ms.
[2025-05-29 17:41:43] [INFO ] Added : 134 causal constraints over 29 iterations in 1422 ms. Result :sat
Minimization took 387 ms.
[2025-05-29 17:41:43] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:41:43] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:41:43] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2025-05-29 17:41:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-05-29 17:41:44] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:41:44] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2025-05-29 17:41:44] [INFO ] Computed and/alt/rep : 308/1453/308 causal constraints (skipped 462 transitions) in 38 ms.
[2025-05-29 17:41:45] [INFO ] Added : 95 causal constraints over 20 iterations in 828 ms. Result :sat
Minimization took 312 ms.
[2025-05-29 17:41:45] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-05-29 17:41:45] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 5 ms returned sat
[2025-05-29 17:41:45] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2025-05-29 17:41:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-05-29 17:41:45] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 5 ms returned sat
[2025-05-29 17:41:45] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2025-05-29 17:41:45] [INFO ] Computed and/alt/rep : 308/1453/308 causal constraints (skipped 462 transitions) in 37 ms.
[2025-05-29 17:41:47] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2025-05-29 17:41:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2025-05-29 17:41:47] [INFO ] Added : 118 causal constraints over 24 iterations in 1275 ms. Result :sat
Minimization took 325 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 795/795 transitions.
Applied a total of 0 rules in 11 ms. Remains 362 /362 variables (removed 0) and now considering 795/795 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 362/362 places, 795/795 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 795/795 transitions.
Applied a total of 0 rules in 21 ms. Remains 362 /362 variables (removed 0) and now considering 795/795 (removed 0) transitions.
[2025-05-29 17:41:48] [INFO ] Invariant cache hit.
[2025-05-29 17:41:48] [INFO ] Implicit Places using invariants in 187 ms returned []
[2025-05-29 17:41:48] [INFO ] Invariant cache hit.
[2025-05-29 17:41:49] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
[2025-05-29 17:41:49] [INFO ] Redundant transitions in 47 ms returned []
Running 770 sub problems to find dead transitions.
[2025-05-29 17:41:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2025-05-29 17:41:53] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2025-05-29 17:41:53] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2025-05-29 17:41:54] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 0 ms to minimize.
[2025-05-29 17:41:55] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2025-05-29 17:41:55] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
Problem TDEAD200 is UNSAT
[2025-05-29 17:41:55] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
[2025-05-29 17:41:56] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
[2025-05-29 17:41:56] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
[2025-05-29 17:41:56] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
[2025-05-29 17:41:56] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
[2025-05-29 17:41:56] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
[2025-05-29 17:41:56] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
[2025-05-29 17:41:56] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD369 is UNSAT
[2025-05-29 17:41:57] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
[2025-05-29 17:41:57] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
Problem TDEAD373 is UNSAT
[2025-05-29 17:41:57] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
[2025-05-29 17:41:57] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
Problem TDEAD377 is UNSAT
[2025-05-29 17:41:57] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
Problem TDEAD378 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
[2025-05-29 17:41:57] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
[2025-05-29 17:41:57] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 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 TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 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 TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD776 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 20/53 constraints. Problems are: Problem set: 119 solved, 651 unsolved
[2025-05-29 17:42:00] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
Problem TDEAD399 is UNSAT
[2025-05-29 17:42:01] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
Problem TDEAD405 is UNSAT
[2025-05-29 17:42:01] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
Problem TDEAD412 is UNSAT
Problem TDEAD415 is UNSAT
[2025-05-29 17:42:01] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
Problem TDEAD507 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD743 is UNSAT
[2025-05-29 17:42:03] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2025-05-29 17:42:04] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 0 ms to minimize.
[2025-05-29 17:42:04] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
Problem TDEAD775 is UNSAT
[2025-05-29 17:42:04] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
Problem TDEAD777 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 8/61 constraints. Problems are: Problem set: 134 solved, 636 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/61 constraints. Problems are: Problem set: 134 solved, 636 unsolved
At refinement iteration 5 (OVERLAPS) 1/362 variables, 3/64 constraints. Problems are: Problem set: 134 solved, 636 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 1/65 constraints. Problems are: Problem set: 134 solved, 636 unsolved
[2025-05-29 17:42:19] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/1157 variables, and 66 constraints, problems are : Problem set: 134 solved, 636 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/362 constraints, PredecessorRefiner: 770/770 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 134 solved, 636 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 8/8 constraints. Problems are: Problem set: 134 solved, 636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 25/33 constraints. Problems are: Problem set: 134 solved, 636 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 28/61 constraints. Problems are: Problem set: 134 solved, 636 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/61 constraints. Problems are: Problem set: 134 solved, 636 unsolved
At refinement iteration 4 (OVERLAPS) 1/362 variables, 3/64 constraints. Problems are: Problem set: 134 solved, 636 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 1/65 constraints. Problems are: Problem set: 134 solved, 636 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 1/66 constraints. Problems are: Problem set: 134 solved, 636 unsolved
[2025-05-29 17:42:30] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 2 ms to minimize.
[2025-05-29 17:42:31] [INFO ] Deduced a trap composed of 63 places in 141 ms of which 2 ms to minimize.
[2025-05-29 17:42:31] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 2 ms to minimize.
[2025-05-29 17:42:33] [INFO ] Deduced a trap composed of 77 places in 155 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 4/70 constraints. Problems are: Problem set: 134 solved, 636 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 0/70 constraints. Problems are: Problem set: 134 solved, 636 unsolved
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
At refinement iteration 9 (OVERLAPS) 795/1157 variables, 362/432 constraints. Problems are: Problem set: 162 solved, 608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1157/1157 variables, and 1040 constraints, problems are : Problem set: 162 solved, 608 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 608/770 constraints, Known Traps: 33/33 constraints]
After SMT, in 60426ms problems are : Problem set: 162 solved, 608 unsolved
Search for dead transitions found 162 dead transitions in 60433ms
Found 162 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 162 transitions
Dead transitions reduction (with SMT) removed 162 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 362/362 places, 633/795 transitions.
Applied a total of 0 rules in 6 ms. Remains 362 /362 variables (removed 0) and now considering 633/633 (removed 0) transitions.
[2025-05-29 17:42:49] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61292 ms. Remains : 362/362 places, 633/795 transitions.
// Phase 1: matrix 633 rows 362 cols
[2025-05-29 17:42:49] [INFO ] Computed 51 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (19671 resets) in 1547 ms. (645 steps per ms)
BEST_FIRST walk for 6000002 steps (32538 resets) in 3995 ms. (1501 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-29 17:42:55] [INFO ] Invariant cache hit.
[2025-05-29 17:42:55] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:42:55] [INFO ] [Real]Absence check using 10 positive and 41 generalized place invariants in 9 ms returned sat
[2025-05-29 17:42:55] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2025-05-29 17:42:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:42:55] [INFO ] [Nat]Absence check using 10 positive and 41 generalized place invariants in 10 ms returned sat
[2025-05-29 17:42:55] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2025-05-29 17:42:55] [INFO ] Computed and/alt/rep : 279/1084/279 causal constraints (skipped 329 transitions) in 30 ms.
[2025-05-29 17:42:56] [INFO ] Added : 72 causal constraints over 16 iterations in 587 ms. Result :sat
Minimization took 329 ms.
[2025-05-29 17:42:56] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:42:56] [INFO ] [Real]Absence check using 10 positive and 41 generalized place invariants in 9 ms returned sat
[2025-05-29 17:42:56] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2025-05-29 17:42:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:42:56] [INFO ] [Nat]Absence check using 10 positive and 41 generalized place invariants in 9 ms returned sat
[2025-05-29 17:42:56] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2025-05-29 17:42:57] [INFO ] Computed and/alt/rep : 279/1084/279 causal constraints (skipped 329 transitions) in 31 ms.
[2025-05-29 17:42:57] [INFO ] Added : 51 causal constraints over 12 iterations in 519 ms. Result :sat
Minimization took 312 ms.
[2025-05-29 17:42:57] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:42:57] [INFO ] [Real]Absence check using 10 positive and 41 generalized place invariants in 10 ms returned sat
[2025-05-29 17:42:58] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2025-05-29 17:42:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 17:42:58] [INFO ] [Nat]Absence check using 10 positive and 41 generalized place invariants in 10 ms returned sat
[2025-05-29 17:42:58] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2025-05-29 17:42:58] [INFO ] Computed and/alt/rep : 279/1084/279 causal constraints (skipped 329 transitions) in 33 ms.
[2025-05-29 17:42:58] [INFO ] Added : 64 causal constraints over 13 iterations in 490 ms. Result :sat
Minimization took 307 ms.
[2025-05-29 17:42:59] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:42:59] [INFO ] [Real]Absence check using 10 positive and 41 generalized place invariants in 10 ms returned sat
[2025-05-29 17:42:59] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2025-05-29 17:42:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:42:59] [INFO ] [Nat]Absence check using 10 positive and 41 generalized place invariants in 9 ms returned sat
[2025-05-29 17:42:59] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2025-05-29 17:42:59] [INFO ] Computed and/alt/rep : 279/1084/279 causal constraints (skipped 329 transitions) in 32 ms.
[2025-05-29 17:43:00] [INFO ] Added : 135 causal constraints over 27 iterations in 976 ms. Result :sat
Minimization took 372 ms.
[2025-05-29 17:43:00] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:43:01] [INFO ] [Real]Absence check using 10 positive and 41 generalized place invariants in 9 ms returned sat
[2025-05-29 17:43:01] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2025-05-29 17:43:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:43:01] [INFO ] [Nat]Absence check using 10 positive and 41 generalized place invariants in 10 ms returned sat
[2025-05-29 17:43:01] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2025-05-29 17:43:01] [INFO ] Computed and/alt/rep : 279/1084/279 causal constraints (skipped 329 transitions) in 30 ms.
[2025-05-29 17:43:02] [INFO ] Added : 93 causal constraints over 19 iterations in 692 ms. Result :sat
Minimization took 340 ms.
[2025-05-29 17:43:02] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:43:02] [INFO ] [Real]Absence check using 10 positive and 41 generalized place invariants in 13 ms returned sat
[2025-05-29 17:43:02] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2025-05-29 17:43:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:43:02] [INFO ] [Nat]Absence check using 10 positive and 41 generalized place invariants in 12 ms returned sat
[2025-05-29 17:43:02] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2025-05-29 17:43:02] [INFO ] Computed and/alt/rep : 279/1084/279 causal constraints (skipped 329 transitions) in 31 ms.
[2025-05-29 17:43:03] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2025-05-29 17:43:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2025-05-29 17:43:03] [INFO ] Added : 105 causal constraints over 22 iterations in 920 ms. Result :sat
Minimization took 324 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 633/633 transitions.
Applied a total of 0 rules in 6 ms. Remains 362 /362 variables (removed 0) and now considering 633/633 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 362/362 places, 633/633 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 633/633 transitions.
Applied a total of 0 rules in 18 ms. Remains 362 /362 variables (removed 0) and now considering 633/633 (removed 0) transitions.
[2025-05-29 17:43:04] [INFO ] Invariant cache hit.
[2025-05-29 17:43:04] [INFO ] Implicit Places using invariants in 206 ms returned [3, 5, 25, 27, 29, 31, 33, 35, 57, 59, 130, 132, 134, 136, 138, 140, 168, 170, 172, 174, 176, 178, 269, 271, 273, 275, 277, 279]
[2025-05-29 17:43:04] [INFO ] Actually due to overlaps returned [3, 5, 25, 27, 29, 31, 33, 35, 168, 170, 172, 174, 176, 178]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 207 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 348/362 places, 633/633 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 334 transition count 619
Applied a total of 28 rules in 9 ms. Remains 334 /348 variables (removed 14) and now considering 619/633 (removed 14) transitions.
// Phase 1: matrix 619 rows 334 cols
[2025-05-29 17:43:05] [INFO ] Computed 37 invariants in 5 ms
[2025-05-29 17:43:05] [INFO ] Implicit Places using invariants in 170 ms returned []
[2025-05-29 17:43:05] [INFO ] Invariant cache hit.
[2025-05-29 17:43:05] [INFO ] Implicit Places using invariants and state equation in 408 ms returned [5, 7, 9, 11]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 582 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 330/362 places, 619/633 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 327 transition count 604
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 327 transition count 604
Applied a total of 6 rules in 19 ms. Remains 327 /330 variables (removed 3) and now considering 604/619 (removed 15) transitions.
// Phase 1: matrix 604 rows 327 cols
[2025-05-29 17:43:05] [INFO ] Computed 36 invariants in 6 ms
[2025-05-29 17:43:05] [INFO ] Implicit Places using invariants in 169 ms returned []
[2025-05-29 17:43:05] [INFO ] Invariant cache hit.
[2025-05-29 17:43:06] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 327/362 places, 604/633 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1409 ms. Remains : 327/362 places, 604/633 transitions.
[2025-05-29 17:43:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (19787 resets) in 1521 ms. (657 steps per ms)
BEST_FIRST walk for 6000002 steps (32711 resets) in 3971 ms. (1510 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-29 17:43:11] [INFO ] Invariant cache hit.
[2025-05-29 17:43:11] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:43:11] [INFO ] [Real]Absence check using 10 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:43:11] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2025-05-29 17:43:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:43:11] [INFO ] [Nat]Absence check using 10 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:43:12] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2025-05-29 17:43:12] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2025-05-29 17:43:12] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2025-05-29 17:43:12] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2025-05-29 17:43:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 230 ms
[2025-05-29 17:43:12] [INFO ] Computed and/alt/rep : 254/1059/254 causal constraints (skipped 325 transitions) in 27 ms.
[2025-05-29 17:43:12] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2025-05-29 17:43:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2025-05-29 17:43:12] [INFO ] Added : 48 causal constraints over 11 iterations in 565 ms. Result :sat
Minimization took 312 ms.
[2025-05-29 17:43:13] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:43:13] [INFO ] [Real]Absence check using 10 positive and 26 generalized place invariants in 7 ms returned sat
[2025-05-29 17:43:13] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2025-05-29 17:43:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-05-29 17:43:13] [INFO ] [Nat]Absence check using 10 positive and 26 generalized place invariants in 5 ms returned sat
[2025-05-29 17:43:13] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2025-05-29 17:43:13] [INFO ] Computed and/alt/rep : 254/1059/254 causal constraints (skipped 325 transitions) in 27 ms.
[2025-05-29 17:43:13] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2025-05-29 17:43:14] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2025-05-29 17:43:14] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2025-05-29 17:43:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 350 ms
[2025-05-29 17:43:14] [INFO ] Added : 31 causal constraints over 7 iterations in 653 ms. Result :sat
Minimization took 309 ms.
[2025-05-29 17:43:14] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-05-29 17:43:14] [INFO ] [Real]Absence check using 10 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:43:14] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2025-05-29 17:43:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-05-29 17:43:14] [INFO ] [Nat]Absence check using 10 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:43:14] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2025-05-29 17:43:15] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2025-05-29 17:43:15] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2025-05-29 17:43:15] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2025-05-29 17:43:15] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 0 ms to minimize.
[2025-05-29 17:43:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 282 ms
[2025-05-29 17:43:15] [INFO ] Computed and/alt/rep : 254/1059/254 causal constraints (skipped 325 transitions) in 27 ms.
[2025-05-29 17:43:15] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2025-05-29 17:43:15] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2025-05-29 17:43:16] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2025-05-29 17:43:16] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2025-05-29 17:43:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 505 ms
[2025-05-29 17:43:16] [INFO ] Added : 65 causal constraints over 14 iterations in 1027 ms. Result :sat
Minimization took 328 ms.
[2025-05-29 17:43:16] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-05-29 17:43:16] [INFO ] [Real]Absence check using 10 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:43:16] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2025-05-29 17:43:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:43:16] [INFO ] [Nat]Absence check using 10 positive and 26 generalized place invariants in 15 ms returned sat
[2025-05-29 17:43:17] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2025-05-29 17:43:17] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2025-05-29 17:43:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2025-05-29 17:43:17] [INFO ] Computed and/alt/rep : 254/1059/254 causal constraints (skipped 325 transitions) in 32 ms.
[2025-05-29 17:43:17] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2025-05-29 17:43:18] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2025-05-29 17:43:18] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2025-05-29 17:43:18] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2025-05-29 17:43:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 459 ms
[2025-05-29 17:43:18] [INFO ] Added : 107 causal constraints over 22 iterations in 1328 ms. Result :sat
Minimization took 362 ms.
[2025-05-29 17:43:18] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:43:18] [INFO ] [Real]Absence check using 10 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:43:19] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2025-05-29 17:43:19] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2025-05-29 17:43:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-05-29 17:43:19] [INFO ] [Nat]Absence check using 10 positive and 26 generalized place invariants in 5 ms returned sat
[2025-05-29 17:43:19] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2025-05-29 17:43:19] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2025-05-29 17:43:19] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2025-05-29 17:43:19] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2025-05-29 17:43:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 235 ms
[2025-05-29 17:43:19] [INFO ] Computed and/alt/rep : 254/1059/254 causal constraints (skipped 325 transitions) in 30 ms.
[2025-05-29 17:43:20] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
[2025-05-29 17:43:20] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2025-05-29 17:43:20] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2025-05-29 17:43:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 390 ms
[2025-05-29 17:43:20] [INFO ] Added : 85 causal constraints over 18 iterations in 1041 ms. Result :sat
Minimization took 331 ms.
[2025-05-29 17:43:20] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:43:21] [INFO ] [Real]Absence check using 10 positive and 26 generalized place invariants in 7 ms returned sat
[2025-05-29 17:43:21] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2025-05-29 17:43:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:43:21] [INFO ] [Nat]Absence check using 10 positive and 26 generalized place invariants in 6 ms returned sat
[2025-05-29 17:43:21] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2025-05-29 17:43:21] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2025-05-29 17:43:21] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 0 ms to minimize.
[2025-05-29 17:43:21] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2025-05-29 17:43:21] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2025-05-29 17:43:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 332 ms
[2025-05-29 17:43:21] [INFO ] Computed and/alt/rep : 254/1059/254 causal constraints (skipped 325 transitions) in 28 ms.
[2025-05-29 17:43:22] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2025-05-29 17:43:22] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
[2025-05-29 17:43:22] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2025-05-29 17:43:22] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2025-05-29 17:43:22] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2025-05-29 17:43:22] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2025-05-29 17:43:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 774 ms
[2025-05-29 17:43:23] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2025-05-29 17:43:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2025-05-29 17:43:23] [INFO ] Added : 57 causal constraints over 14 iterations in 1460 ms. Result :sat
Minimization took 330 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 604/604 transitions.
Applied a total of 0 rules in 6 ms. Remains 327 /327 variables (removed 0) and now considering 604/604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 327/327 places, 604/604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 604/604 transitions.
Applied a total of 0 rules in 5 ms. Remains 327 /327 variables (removed 0) and now considering 604/604 (removed 0) transitions.
[2025-05-29 17:43:24] [INFO ] Invariant cache hit.
[2025-05-29 17:43:24] [INFO ] Implicit Places using invariants in 168 ms returned []
[2025-05-29 17:43:24] [INFO ] Invariant cache hit.
[2025-05-29 17:43:24] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2025-05-29 17:43:24] [INFO ] Redundant transitions in 3 ms returned []
Running 579 sub problems to find dead transitions.
[2025-05-29 17:43:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Problem TDEAD184 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD603 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 25/32 constraints. Problems are: Problem set: 16 solved, 563 unsolved
[2025-05-29 17:43:27] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 0 ms to minimize.
[2025-05-29 17:43:28] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2025-05-29 17:43:28] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2025-05-29 17:43:28] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2025-05-29 17:43:28] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2025-05-29 17:43:28] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2025-05-29 17:43:28] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2025-05-29 17:43:28] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2025-05-29 17:43:29] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
[2025-05-29 17:43:31] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
Problem TDEAD524 is UNSAT
Problem TDEAD530 is UNSAT
[2025-05-29 17:43:32] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD541 is UNSAT
[2025-05-29 17:43:32] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
Problem TDEAD546 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD574 is UNSAT
[2025-05-29 17:43:32] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
Problem TDEAD577 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 13/45 constraints. Problems are: Problem set: 49 solved, 530 unsolved
[2025-05-29 17:43:34] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 1/46 constraints. Problems are: Problem set: 49 solved, 530 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/46 constraints. Problems are: Problem set: 49 solved, 530 unsolved
At refinement iteration 5 (OVERLAPS) 1/327 variables, 3/49 constraints. Problems are: Problem set: 49 solved, 530 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 1/50 constraints. Problems are: Problem set: 49 solved, 530 unsolved
[2025-05-29 17:43:46] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2025-05-29 17:43:47] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
Problem TDEAD188 is UNSAT
[2025-05-29 17:43:47] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
Problem TDEAD189 is UNSAT
[2025-05-29 17:43:49] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 2 ms to minimize.
[2025-05-29 17:43:49] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 5/55 constraints. Problems are: Problem set: 51 solved, 528 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 327/931 variables, and 55 constraints, problems are : Problem set: 51 solved, 528 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/327 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 51 solved, 528 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 7/7 constraints. Problems are: Problem set: 51 solved, 528 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 25/32 constraints. Problems are: Problem set: 51 solved, 528 unsolved
Problem TDEAD564 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 16/48 constraints. Problems are: Problem set: 52 solved, 527 unsolved
[2025-05-29 17:43:55] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2025-05-29 17:43:56] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
Problem TDEAD185 is UNSAT
[2025-05-29 17:43:56] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
Problem TDEAD186 is UNSAT
[2025-05-29 17:43:57] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 0 ms to minimize.
Problem TDEAD253 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 4/52 constraints. Problems are: Problem set: 55 solved, 524 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/52 constraints. Problems are: Problem set: 55 solved, 524 unsolved
At refinement iteration 5 (OVERLAPS) 1/327 variables, 3/55 constraints. Problems are: Problem set: 55 solved, 524 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 1/56 constraints. Problems are: Problem set: 55 solved, 524 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 3/59 constraints. Problems are: Problem set: 55 solved, 524 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/59 constraints. Problems are: Problem set: 55 solved, 524 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 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 TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem 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 TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD578 is UNSAT
At refinement iteration 9 (OVERLAPS) 604/931 variables, 327/386 constraints. Problems are: Problem set: 278 solved, 301 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/931 variables, 301/687 constraints. Problems are: Problem set: 278 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 931/931 variables, and 687 constraints, problems are : Problem set: 278 solved, 301 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 301/579 constraints, Known Traps: 23/23 constraints]
After SMT, in 60254ms problems are : Problem set: 278 solved, 301 unsolved
Search for dead transitions found 278 dead transitions in 60260ms
Found 278 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 278 transitions
Dead transitions reduction (with SMT) removed 278 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 327/327 places, 326/604 transitions.
Ensure Unique test removed 45 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 277 transition count 277
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 148 place count 228 transition count 277
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 148 place count 228 transition count 275
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 152 place count 226 transition count 275
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 155 place count 226 transition count 272
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 158 place count 223 transition count 272
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 159 place count 223 transition count 272
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 160 place count 222 transition count 272
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 222 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 162 place count 221 transition count 271
Applied a total of 162 rules in 19 ms. Remains 221 /327 variables (removed 106) and now considering 271/326 (removed 55) transitions.
// Phase 1: matrix 271 rows 221 cols
[2025-05-29 17:44:24] [INFO ] Computed 32 invariants in 1 ms
[2025-05-29 17:44:25] [INFO ] Implicit Places using invariants in 113 ms returned [2, 10, 99]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 114 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 218/327 places, 271/604 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 218 transition count 268
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 215 transition count 268
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 214 transition count 267
Applied a total of 8 rules in 9 ms. Remains 214 /218 variables (removed 4) and now considering 267/271 (removed 4) transitions.
// Phase 1: matrix 267 rows 214 cols
[2025-05-29 17:44:25] [INFO ] Computed 29 invariants in 1 ms
[2025-05-29 17:44:25] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-05-29 17:44:25] [INFO ] Invariant cache hit.
[2025-05-29 17:44:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-29 17:44:25] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 214/327 places, 267/604 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 61329 ms. Remains : 214/327 places, 267/604 transitions.
[2025-05-29 17:44:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (24393 resets) in 1465 ms. (682 steps per ms)
BEST_FIRST walk for 6000003 steps (34475 resets) in 3384 ms. (1772 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-29 17:44:30] [INFO ] Invariant cache hit.
[2025-05-29 17:44:30] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-05-29 17:44:30] [INFO ] [Real]Absence check using 8 positive and 21 generalized place invariants in 3 ms returned sat
[2025-05-29 17:44:30] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2025-05-29 17:44:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-29 17:44:30] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-05-29 17:44:30] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2025-05-29 17:44:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:44:30] [INFO ] [Nat]Absence check using 8 positive and 21 generalized place invariants in 4 ms returned sat
[2025-05-29 17:44:30] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2025-05-29 17:44:30] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-05-29 17:44:30] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2025-05-29 17:44:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2025-05-29 17:44:30] [INFO ] Computed and/alt/rep : 159/400/159 causal constraints (skipped 83 transitions) in 15 ms.
[2025-05-29 17:44:30] [INFO ] Added : 41 causal constraints over 9 iterations in 156 ms. Result :sat
Minimization took 84 ms.
[2025-05-29 17:44:30] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:44:30] [INFO ] [Real]Absence check using 8 positive and 21 generalized place invariants in 8 ms returned sat
[2025-05-29 17:44:31] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2025-05-29 17:44:31] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-29 17:44:31] [INFO ] Computed and/alt/rep : 159/400/159 causal constraints (skipped 83 transitions) in 13 ms.
[2025-05-29 17:44:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:44:31] [INFO ] [Nat]Absence check using 8 positive and 21 generalized place invariants in 4 ms returned sat
[2025-05-29 17:44:31] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2025-05-29 17:44:31] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-29 17:44:31] [INFO ] Computed and/alt/rep : 159/400/159 causal constraints (skipped 83 transitions) in 13 ms.
[2025-05-29 17:44:31] [INFO ] Added : 31 causal constraints over 7 iterations in 129 ms. Result :sat
Minimization took 84 ms.
[2025-05-29 17:44:31] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:44:31] [INFO ] [Real]Absence check using 8 positive and 21 generalized place invariants in 7 ms returned sat
[2025-05-29 17:44:31] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2025-05-29 17:44:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-05-29 17:44:31] [INFO ] [Nat]Absence check using 8 positive and 21 generalized place invariants in 4 ms returned sat
[2025-05-29 17:44:31] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2025-05-29 17:44:31] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-29 17:44:31] [INFO ] Computed and/alt/rep : 159/400/159 causal constraints (skipped 83 transitions) in 14 ms.
[2025-05-29 17:44:31] [INFO ] Added : 35 causal constraints over 7 iterations in 138 ms. Result :sat
Minimization took 84 ms.
[2025-05-29 17:44:31] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:44:31] [INFO ] [Real]Absence check using 8 positive and 21 generalized place invariants in 4 ms returned sat
[2025-05-29 17:44:31] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2025-05-29 17:44:32] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-29 17:44:32] [INFO ] Computed and/alt/rep : 159/400/159 causal constraints (skipped 83 transitions) in 13 ms.
[2025-05-29 17:44:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:44:32] [INFO ] [Nat]Absence check using 8 positive and 21 generalized place invariants in 4 ms returned sat
[2025-05-29 17:44:32] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2025-05-29 17:44:32] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-29 17:44:32] [INFO ] Computed and/alt/rep : 159/400/159 causal constraints (skipped 83 transitions) in 13 ms.
[2025-05-29 17:44:32] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2025-05-29 17:44:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2025-05-29 17:44:32] [INFO ] Added : 73 causal constraints over 16 iterations in 330 ms. Result :sat
Minimization took 107 ms.
[2025-05-29 17:44:32] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:44:32] [INFO ] [Real]Absence check using 8 positive and 21 generalized place invariants in 4 ms returned sat
[2025-05-29 17:44:32] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-05-29 17:44:32] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-05-29 17:44:32] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2025-05-29 17:44:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:44:32] [INFO ] [Nat]Absence check using 8 positive and 21 generalized place invariants in 10 ms returned sat
[2025-05-29 17:44:32] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2025-05-29 17:44:32] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-05-29 17:44:32] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2025-05-29 17:44:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2025-05-29 17:44:32] [INFO ] Computed and/alt/rep : 159/400/159 causal constraints (skipped 83 transitions) in 11 ms.
[2025-05-29 17:44:33] [INFO ] Added : 48 causal constraints over 10 iterations in 178 ms. Result :sat
Minimization took 94 ms.
[2025-05-29 17:44:33] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:44:33] [INFO ] [Real]Absence check using 8 positive and 21 generalized place invariants in 4 ms returned sat
[2025-05-29 17:44:33] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2025-05-29 17:44:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:44:33] [INFO ] [Nat]Absence check using 8 positive and 21 generalized place invariants in 6 ms returned sat
[2025-05-29 17:44:33] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2025-05-29 17:44:33] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-05-29 17:44:33] [INFO ] Computed and/alt/rep : 159/400/159 causal constraints (skipped 83 transitions) in 16 ms.
[2025-05-29 17:44:33] [INFO ] Added : 73 causal constraints over 15 iterations in 404 ms. Result :sat
Minimization took 102 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-04b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-04b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-04b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 267/267 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 214 transition count 264
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 211 transition count 264
Applied a total of 6 rules in 7 ms. Remains 211 /214 variables (removed 3) and now considering 264/267 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 211/214 places, 264/267 transitions.
// Phase 1: matrix 264 rows 211 cols
[2025-05-29 17:44:34] [INFO ] Computed 29 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (24068 resets) in 1408 ms. (709 steps per ms)
BEST_FIRST walk for 3000001 steps (17210 resets) in 1671 ms. (1794 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 17:44:37] [INFO ] Invariant cache hit.
[2025-05-29 17:44:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 17:44:37] [INFO ] [Real]Absence check using 7 positive and 22 generalized place invariants in 4 ms returned sat
[2025-05-29 17:44:37] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2025-05-29 17:44:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-29 17:44:37] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-29 17:44:37] [INFO ] Computed and/alt/rep : 156/397/156 causal constraints (skipped 83 transitions) in 13 ms.
[2025-05-29 17:44:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-29 17:44:37] [INFO ] [Nat]Absence check using 7 positive and 22 generalized place invariants in 5 ms returned sat
[2025-05-29 17:44:37] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-05-29 17:44:37] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-29 17:44:37] [INFO ] Computed and/alt/rep : 156/397/156 causal constraints (skipped 83 transitions) in 13 ms.
[2025-05-29 17:44:37] [INFO ] Added : 37 causal constraints over 8 iterations in 160 ms. Result :sat
Minimization took 95 ms.
[2025-05-29 17:44:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 17:44:37] [INFO ] [Real]Absence check using 7 positive and 22 generalized place invariants in 4 ms returned sat
[2025-05-29 17:44:37] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2025-05-29 17:44:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-29 17:44:37] [INFO ] [Nat]Absence check using 7 positive and 22 generalized place invariants in 4 ms returned sat
[2025-05-29 17:44:37] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2025-05-29 17:44:37] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-05-29 17:44:38] [INFO ] Computed and/alt/rep : 156/397/156 causal constraints (skipped 83 transitions) in 13 ms.
[2025-05-29 17:44:38] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
[2025-05-29 17:44:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2025-05-29 17:44:38] [INFO ] Added : 71 causal constraints over 15 iterations in 317 ms. Result :sat
Minimization took 100 ms.
[2025-05-29 17:44:38] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-29 17:44:38] [INFO ] [Real]Absence check using 7 positive and 22 generalized place invariants in 4 ms returned sat
[2025-05-29 17:44:38] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2025-05-29 17:44:38] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-29 17:44:38] [INFO ] Computed and/alt/rep : 156/397/156 causal constraints (skipped 83 transitions) in 12 ms.
[2025-05-29 17:44:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-29 17:44:38] [INFO ] [Nat]Absence check using 7 positive and 22 generalized place invariants in 4 ms returned sat
[2025-05-29 17:44:38] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2025-05-29 17:44:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-29 17:44:38] [INFO ] Computed and/alt/rep : 156/397/156 causal constraints (skipped 83 transitions) in 14 ms.
[2025-05-29 17:44:38] [INFO ] Added : 32 causal constraints over 7 iterations in 137 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 264/264 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 211/211 places, 264/264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 264/264 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2025-05-29 17:44:39] [INFO ] Invariant cache hit.
[2025-05-29 17:44:39] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-05-29 17:44:39] [INFO ] Invariant cache hit.
[2025-05-29 17:44:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-29 17:44:39] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2025-05-29 17:44:39] [INFO ] Redundant transitions in 12 ms returned []
Running 239 sub problems to find dead transitions.
[2025-05-29 17:44:39] [INFO ] Invariant cache hit.
[2025-05-29 17:44:39] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (OVERLAPS) 1/211 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2025-05-29 17:44:42] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
At refinement iteration 6 (OVERLAPS) 264/475 variables, 211/241 constraints. Problems are: Problem set: 3 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 3/244 constraints. Problems are: Problem set: 3 solved, 236 unsolved
[2025-05-29 17:44:46] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
[2025-05-29 17:44:46] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 2/246 constraints. Problems are: Problem set: 3 solved, 236 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 0/246 constraints. Problems are: Problem set: 3 solved, 236 unsolved
At refinement iteration 10 (OVERLAPS) 0/475 variables, 0/246 constraints. Problems are: Problem set: 3 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 246 constraints, problems are : Problem set: 3 solved, 236 unsolved in 12997 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 211/211 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 22/27 constraints. Problems are: Problem set: 3 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/27 constraints. Problems are: Problem set: 3 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 1/211 variables, 2/29 constraints. Problems are: Problem set: 3 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 3/32 constraints. Problems are: Problem set: 3 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/32 constraints. Problems are: Problem set: 3 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 264/475 variables, 211/243 constraints. Problems are: Problem set: 3 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 3/246 constraints. Problems are: Problem set: 3 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 236/482 constraints. Problems are: Problem set: 3 solved, 236 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 0/482 constraints. Problems are: Problem set: 3 solved, 236 unsolved
At refinement iteration 10 (OVERLAPS) 0/475 variables, 0/482 constraints. Problems are: Problem set: 3 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 475/475 variables, and 482 constraints, problems are : Problem set: 3 solved, 236 unsolved in 14412 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 211/211 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 236/239 constraints, Known Traps: 3/3 constraints]
After SMT, in 27489ms problems are : Problem set: 3 solved, 236 unsolved
Search for dead transitions found 3 dead transitions in 27494ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 211/211 places, 261/264 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 211 transition count 259
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 209 transition count 259
Applied a total of 4 rules in 15 ms. Remains 209 /211 variables (removed 2) and now considering 259/261 (removed 2) transitions.
// Phase 1: matrix 259 rows 209 cols
[2025-05-29 17:45:06] [INFO ] Computed 32 invariants in 3 ms
[2025-05-29 17:45:07] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-05-29 17:45:07] [INFO ] Invariant cache hit.
[2025-05-29 17:45:07] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/211 places, 259/264 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 28156 ms. Remains : 209/211 places, 259/264 transitions.
[2025-05-29 17:45:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (24406 resets) in 1383 ms. (722 steps per ms)
BEST_FIRST walk for 3000003 steps (17173 resets) in 1642 ms. (1825 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 17:45:10] [INFO ] Invariant cache hit.
[2025-05-29 17:45:10] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2025-05-29 17:45:10] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 3 ms returned sat
[2025-05-29 17:45:10] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2025-05-29 17:45:10] [INFO ] Computed and/alt/rep : 152/387/152 causal constraints (skipped 82 transitions) in 13 ms.
[2025-05-29 17:45:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-05-29 17:45:10] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 3 ms returned sat
[2025-05-29 17:45:10] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2025-05-29 17:45:10] [INFO ] Computed and/alt/rep : 152/387/152 causal constraints (skipped 82 transitions) in 13 ms.
[2025-05-29 17:45:10] [INFO ] Added : 19 causal constraints over 4 iterations in 78 ms. Result :sat
Minimization took 62 ms.
[2025-05-29 17:45:10] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-05-29 17:45:10] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 3 ms returned sat
[2025-05-29 17:45:10] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-05-29 17:45:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2025-05-29 17:45:10] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 3 ms returned sat
[2025-05-29 17:45:10] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2025-05-29 17:45:10] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2025-05-29 17:45:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2025-05-29 17:45:10] [INFO ] Computed and/alt/rep : 152/387/152 causal constraints (skipped 82 transitions) in 14 ms.
[2025-05-29 17:45:11] [INFO ] Added : 44 causal constraints over 9 iterations in 181 ms. Result :sat
Minimization took 80 ms.
[2025-05-29 17:45:11] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-05-29 17:45:11] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 3 ms returned sat
[2025-05-29 17:45:11] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2025-05-29 17:45:11] [INFO ] Computed and/alt/rep : 152/387/152 causal constraints (skipped 82 transitions) in 13 ms.
[2025-05-29 17:45:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2025-05-29 17:45:11] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 3 ms returned sat
[2025-05-29 17:45:11] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2025-05-29 17:45:11] [INFO ] Computed and/alt/rep : 152/387/152 causal constraints (skipped 82 transitions) in 13 ms.
[2025-05-29 17:45:11] [INFO ] Added : 17 causal constraints over 4 iterations in 73 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA ASLink-PT-04b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-04b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-04b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-05-29 17:45:11] [INFO ] Flatten gal took : 51 ms
[2025-05-29 17:45:11] [INFO ] Flatten gal took : 20 ms
[2025-05-29 17:45:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3787317825856294571.gal : 12 ms
[2025-05-29 17:45:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3408301070283236811.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3787317825856294571.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3408301070283236811.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 458605 ms.

BK_STOP 1748540712006

--------------------
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="ASLink-PT-04b"
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 ASLink-PT-04b, 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 r013-tall-174853743000043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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