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-174853743000041.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-03b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r013-tall-174853743000041
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K 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 39K 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.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 544K 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-03b-UpperBounds-00
FORMULA_NAME ASLink-PT-03b-UpperBounds-01
FORMULA_NAME ASLink-PT-03b-UpperBounds-02
FORMULA_NAME ASLink-PT-03b-UpperBounds-03
FORMULA_NAME ASLink-PT-03b-UpperBounds-04
FORMULA_NAME ASLink-PT-03b-UpperBounds-05
FORMULA_NAME ASLink-PT-03b-UpperBounds-06
FORMULA_NAME ASLink-PT-03b-UpperBounds-07
FORMULA_NAME ASLink-PT-03b-UpperBounds-08
FORMULA_NAME ASLink-PT-03b-UpperBounds-09
FORMULA_NAME ASLink-PT-03b-UpperBounds-10
FORMULA_NAME ASLink-PT-03b-UpperBounds-11
FORMULA_NAME ASLink-PT-03b-UpperBounds-12
FORMULA_NAME ASLink-PT-03b-UpperBounds-13
FORMULA_NAME ASLink-PT-03b-UpperBounds-14
FORMULA_NAME ASLink-PT-03b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748540241091

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-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:37:22] [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:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:37:22] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2025-05-29 17:37:22] [INFO ] Transformed 1638 places.
[2025-05-29 17:37:22] [INFO ] Transformed 2094 transitions.
[2025-05-29 17:37:22] [INFO ] Found NUPN structural information;
[2025-05-29 17:37:22] [INFO ] Parsed PT model containing 1638 places and 2094 transitions and 6458 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 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 2094 rows 1638 cols
[2025-05-29 17:37:22] [INFO ] Computed 160 invariants in 129 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 (31 resets) in 57 ms. (172 steps per ms)
FORMULA ASLink-PT-03b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50003 steps (22 resets) in 75 ms. (657 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-05-29 17:37:23] [INFO ] Invariant cache hit.
[2025-05-29 17:37:23] [INFO ] [Real]Absence check using 37 positive place invariants in 52 ms returned sat
[2025-05-29 17:37:23] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 46 ms returned sat
[2025-05-29 17:37:24] [INFO ] [Real]Absence check using state equation in 893 ms returned sat
[2025-05-29 17:37:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:24] [INFO ] [Nat]Absence check using 37 positive place invariants in 43 ms returned sat
[2025-05-29 17:37:24] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 41 ms returned sat
[2025-05-29 17:37:26] [INFO ] [Nat]Absence check using state equation in 1113 ms returned sat
[2025-05-29 17:37:26] [INFO ] Deduced a trap composed of 21 places in 375 ms of which 33 ms to minimize.
[2025-05-29 17:37:26] [INFO ] Deduced a trap composed of 60 places in 241 ms of which 4 ms to minimize.
[2025-05-29 17:37:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 857 ms
[2025-05-29 17:37:27] [INFO ] Computed and/alt/rep : 1742/3856/1742 causal constraints (skipped 351 transitions) in 187 ms.
Maximisation of solution failed !
Minimization took 8 ms.
[2025-05-29 17:37:29] [INFO ] [Real]Absence check using 37 positive place invariants in 36 ms returned sat
[2025-05-29 17:37:30] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 50 ms returned sat
[2025-05-29 17:37:31] [INFO ] [Real]Absence check using state equation in 1024 ms returned sat
[2025-05-29 17:37:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:31] [INFO ] [Nat]Absence check using 37 positive place invariants in 42 ms returned sat
[2025-05-29 17:37:31] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 39 ms returned sat
[2025-05-29 17:37:32] [INFO ] [Nat]Absence check using state equation in 1343 ms returned sat
[2025-05-29 17:37:33] [INFO ] Deduced a trap composed of 21 places in 595 ms of which 9 ms to minimize.
[2025-05-29 17:37:34] [INFO ] Deduced a trap composed of 54 places in 589 ms of which 8 ms to minimize.
[2025-05-29 17:37:34] [INFO ] Deduced a trap composed of 232 places in 549 ms of which 9 ms to minimize.
[2025-05-29 17:37:35] [INFO ] Deduced a trap composed of 51 places in 524 ms of which 8 ms to minimize.
[2025-05-29 17:37:35] [INFO ] Deduced a trap composed of 144 places in 518 ms of which 9 ms to minimize.
[2025-05-29 17:37:36] [INFO ] Deduced a trap composed of 133 places in 503 ms of which 8 ms to minimize.
[2025-05-29 17:37:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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:36] [INFO ] [Real]Absence check using 37 positive place invariants in 32 ms returned sat
[2025-05-29 17:37:36] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 41 ms returned sat
[2025-05-29 17:37:37] [INFO ] [Real]Absence check using state equation in 855 ms returned sat
[2025-05-29 17:37:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:37] [INFO ] [Nat]Absence check using 37 positive place invariants in 40 ms returned sat
[2025-05-29 17:37:37] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 40 ms returned sat
[2025-05-29 17:37:39] [INFO ] [Nat]Absence check using state equation in 1061 ms returned sat
[2025-05-29 17:37:39] [INFO ] Deduced a trap composed of 16 places in 450 ms of which 6 ms to minimize.
[2025-05-29 17:37:39] [INFO ] Deduced a trap composed of 22 places in 434 ms of which 7 ms to minimize.
[2025-05-29 17:37:40] [INFO ] Deduced a trap composed of 85 places in 441 ms of which 6 ms to minimize.
[2025-05-29 17:37:40] [INFO ] Deduced a trap composed of 71 places in 419 ms of which 7 ms to minimize.
[2025-05-29 17:37:41] [INFO ] Deduced a trap composed of 128 places in 423 ms of which 7 ms to minimize.
[2025-05-29 17:37:41] [INFO ] Deduced a trap composed of 98 places in 413 ms of which 7 ms to minimize.
[2025-05-29 17:37:42] [INFO ] Deduced a trap composed of 63 places in 202 ms of which 3 ms to minimize.
[2025-05-29 17:37:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3321 ms
[2025-05-29 17:37:42] [INFO ] Computed and/alt/rep : 1742/3856/1742 causal constraints (skipped 351 transitions) in 107 ms.
[2025-05-29 17:37:42] [INFO ] Added : 10 causal constraints over 2 iterations in 334 ms. Result :unknown
[2025-05-29 17:37:42] [INFO ] [Real]Absence check using 37 positive place invariants in 31 ms returned sat
[2025-05-29 17:37:42] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 42 ms returned sat
[2025-05-29 17:37:43] [INFO ] [Real]Absence check using state equation in 929 ms returned sat
[2025-05-29 17:37:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:44] [INFO ] [Nat]Absence check using 37 positive place invariants in 32 ms returned sat
[2025-05-29 17:37:44] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 39 ms returned sat
[2025-05-29 17:37:45] [INFO ] [Nat]Absence check using state equation in 1079 ms returned sat
[2025-05-29 17:37:45] [INFO ] Deduced a trap composed of 34 places in 251 ms of which 4 ms to minimize.
[2025-05-29 17:37:45] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 4 ms to minimize.
[2025-05-29 17:37:46] [INFO ] Deduced a trap composed of 53 places in 187 ms of which 4 ms to minimize.
[2025-05-29 17:37:46] [INFO ] Deduced a trap composed of 142 places in 180 ms of which 3 ms to minimize.
[2025-05-29 17:37:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1146 ms
[2025-05-29 17:37:46] [INFO ] Computed and/alt/rep : 1742/3856/1742 causal constraints (skipped 351 transitions) in 110 ms.
[2025-05-29 17:37:48] [INFO ] Added : 110 causal constraints over 22 iterations in 2482 ms. Result :unknown
[2025-05-29 17:37:49] [INFO ] [Real]Absence check using 37 positive place invariants in 33 ms returned sat
[2025-05-29 17:37:49] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 45 ms returned sat
[2025-05-29 17:37:50] [INFO ] [Real]Absence check using state equation in 1016 ms returned sat
[2025-05-29 17:37:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:50] [INFO ] [Nat]Absence check using 37 positive place invariants in 34 ms returned sat
[2025-05-29 17:37:50] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 46 ms returned sat
[2025-05-29 17:37:51] [INFO ] [Nat]Absence check using state equation in 918 ms returned sat
[2025-05-29 17:37:52] [INFO ] Deduced a trap composed of 23 places in 343 ms of which 5 ms to minimize.
[2025-05-29 17:37:52] [INFO ] Deduced a trap composed of 42 places in 272 ms of which 5 ms to minimize.
[2025-05-29 17:37:52] [INFO ] Deduced a trap composed of 53 places in 294 ms of which 6 ms to minimize.
[2025-05-29 17:37:52] [INFO ] Deduced a trap composed of 91 places in 204 ms of which 4 ms to minimize.
[2025-05-29 17:37:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1605 ms
[2025-05-29 17:37:53] [INFO ] Computed and/alt/rep : 1742/3856/1742 causal constraints (skipped 351 transitions) in 101 ms.
[2025-05-29 17:37:54] [INFO ] Added : 5 causal constraints over 1 iterations in 1101 ms. Result :sat
Minimization took 708 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA ASLink-PT-03b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 1638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1638/1638 places, 2094/2094 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 371 transitions
Trivial Post-agglo rules discarded 371 transitions
Performed 371 trivial Post agglomeration. Transition count delta: 371
Iterating post reduction 0 with 371 rules applied. Total rules applied 371 place count 1638 transition count 1723
Reduce places removed 371 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 389 rules applied. Total rules applied 760 place count 1267 transition count 1705
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 767 place count 1262 transition count 1703
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 769 place count 1260 transition count 1703
Performed 375 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 375 Pre rules applied. Total rules applied 769 place count 1260 transition count 1328
Deduced a syphon composed of 375 places in 2 ms
Ensure Unique test removed 33 places
Reduce places removed 408 places and 0 transitions.
Iterating global reduction 4 with 783 rules applied. Total rules applied 1552 place count 852 transition count 1328
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 25 rules applied. Total rules applied 1577 place count 849 transition count 1306
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1599 place count 827 transition count 1306
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1599 place count 827 transition count 1294
Deduced a syphon composed of 12 places in 5 ms
Ensure Unique test removed 10 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1633 place count 805 transition count 1294
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 1635 place count 803 transition count 1294
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 12 Pre rules applied. Total rules applied 1635 place count 803 transition count 1282
Deduced a syphon composed of 12 places in 5 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1659 place count 791 transition count 1282
Discarding 51 places :
Symmetric choice reduction at 7 with 51 rule applications. Total rules 1710 place count 740 transition count 1231
Iterating global reduction 7 with 51 rules applied. Total rules applied 1761 place count 740 transition count 1231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1762 place count 740 transition count 1230
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 18 Pre rules applied. Total rules applied 1762 place count 740 transition count 1212
Deduced a syphon composed of 18 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 37 rules applied. Total rules applied 1799 place count 721 transition count 1212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1799 place count 721 transition count 1211
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 1802 place count 719 transition count 1211
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1806 place count 715 transition count 1184
Iterating global reduction 8 with 4 rules applied. Total rules applied 1810 place count 715 transition count 1184
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 1810 place count 715 transition count 1181
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1816 place count 712 transition count 1181
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1817 place count 711 transition count 1173
Iterating global reduction 8 with 1 rules applied. Total rules applied 1818 place count 711 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1819 place count 710 transition count 1165
Iterating global reduction 8 with 1 rules applied. Total rules applied 1820 place count 710 transition count 1165
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1821 place count 709 transition count 1157
Iterating global reduction 8 with 1 rules applied. Total rules applied 1822 place count 709 transition count 1157
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1823 place count 708 transition count 1149
Iterating global reduction 8 with 1 rules applied. Total rules applied 1824 place count 708 transition count 1149
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1825 place count 707 transition count 1141
Iterating global reduction 8 with 1 rules applied. Total rules applied 1826 place count 707 transition count 1141
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1827 place count 706 transition count 1133
Iterating global reduction 8 with 1 rules applied. Total rules applied 1828 place count 706 transition count 1133
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1829 place count 705 transition count 1125
Iterating global reduction 8 with 1 rules applied. Total rules applied 1830 place count 705 transition count 1125
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1831 place count 704 transition count 1117
Iterating global reduction 8 with 1 rules applied. Total rules applied 1832 place count 704 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1833 place count 703 transition count 1109
Iterating global reduction 8 with 1 rules applied. Total rules applied 1834 place count 703 transition count 1109
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1835 place count 702 transition count 1101
Iterating global reduction 8 with 1 rules applied. Total rules applied 1836 place count 702 transition count 1101
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1837 place count 701 transition count 1093
Iterating global reduction 8 with 1 rules applied. Total rules applied 1838 place count 701 transition count 1093
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1839 place count 700 transition count 1085
Iterating global reduction 8 with 1 rules applied. Total rules applied 1840 place count 700 transition count 1085
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1841 place count 699 transition count 1077
Iterating global reduction 8 with 1 rules applied. Total rules applied 1842 place count 699 transition count 1077
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1843 place count 698 transition count 1069
Iterating global reduction 8 with 1 rules applied. Total rules applied 1844 place count 698 transition count 1069
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1845 place count 697 transition count 1061
Iterating global reduction 8 with 1 rules applied. Total rules applied 1846 place count 697 transition count 1061
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1847 place count 696 transition count 1053
Iterating global reduction 8 with 1 rules applied. Total rules applied 1848 place count 696 transition count 1053
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 8 with 178 rules applied. Total rules applied 2026 place count 607 transition count 964
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2027 place count 606 transition count 963
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 2029 place count 605 transition count 963
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2030 place count 604 transition count 962
Iterating global reduction 8 with 1 rules applied. Total rules applied 2031 place count 604 transition count 962
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 2033 place count 604 transition count 960
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2034 place count 603 transition count 960
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2036 place count 602 transition count 969
Free-agglomeration rule applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 2040 place count 602 transition count 965
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2044 place count 598 transition count 965
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2046 place count 598 transition count 963
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 2048 place count 596 transition count 963
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2049 place count 595 transition count 962
Reduce places removed 6 places and 0 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 12 with 9 rules applied. Total rules applied 2058 place count 589 transition count 959
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 2061 place count 586 transition count 959
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 9 Pre rules applied. Total rules applied 2061 place count 586 transition count 950
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 14 with 18 rules applied. Total rules applied 2079 place count 577 transition count 950
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 14 with 3 rules applied. Total rules applied 2082 place count 574 transition count 950
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 15 with 12 rules applied. Total rules applied 2094 place count 568 transition count 944
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 2097 place count 565 transition count 941
Iterating global reduction 15 with 3 rules applied. Total rules applied 2100 place count 565 transition count 941
Free-agglomeration rule applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 2103 place count 565 transition count 938
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 2106 place count 562 transition count 938
Applied a total of 2106 rules in 1169 ms. Remains 562 /1638 variables (removed 1076) and now considering 938/2094 (removed 1156) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1179 ms. Remains : 562/1638 places, 938/2094 transitions.
// Phase 1: matrix 938 rows 562 cols
[2025-05-29 17:37:57] [INFO ] Computed 100 invariants in 33 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (13964 resets) in 1850 ms. (540 steps per ms)
BEST_FIRST walk for 4000003 steps (15559 resets) in 3439 ms. (1162 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-29 17:38:02] [INFO ] Invariant cache hit.
[2025-05-29 17:38:02] [INFO ] [Real]Absence check using 25 positive place invariants in 11 ms returned sat
[2025-05-29 17:38:02] [INFO ] [Real]Absence check using 25 positive and 75 generalized place invariants in 18 ms returned sat
[2025-05-29 17:38:03] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2025-05-29 17:38:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:03] [INFO ] [Nat]Absence check using 25 positive place invariants in 8 ms returned sat
[2025-05-29 17:38:03] [INFO ] [Nat]Absence check using 25 positive and 75 generalized place invariants in 14 ms returned sat
[2025-05-29 17:38:03] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2025-05-29 17:38:03] [INFO ] Computed and/alt/rep : 372/1475/372 causal constraints (skipped 545 transitions) in 48 ms.
[2025-05-29 17:38:05] [INFO ] Added : 115 causal constraints over 23 iterations in 1810 ms. Result :sat
Minimization took 460 ms.
[2025-05-29 17:38:05] [INFO ] [Real]Absence check using 25 positive place invariants in 7 ms returned sat
[2025-05-29 17:38:05] [INFO ] [Real]Absence check using 25 positive and 75 generalized place invariants in 16 ms returned sat
[2025-05-29 17:38:06] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2025-05-29 17:38:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:06] [INFO ] [Nat]Absence check using 25 positive place invariants in 7 ms returned sat
[2025-05-29 17:38:06] [INFO ] [Nat]Absence check using 25 positive and 75 generalized place invariants in 13 ms returned sat
[2025-05-29 17:38:06] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2025-05-29 17:38:06] [INFO ] Computed and/alt/rep : 372/1475/372 causal constraints (skipped 545 transitions) in 47 ms.
[2025-05-29 17:38:09] [INFO ] Added : 276 causal constraints over 56 iterations in 3224 ms. Result :sat
Minimization took 488 ms.
[2025-05-29 17:38:10] [INFO ] [Real]Absence check using 25 positive place invariants in 9 ms returned sat
[2025-05-29 17:38:10] [INFO ] [Real]Absence check using 25 positive and 75 generalized place invariants in 14 ms returned sat
[2025-05-29 17:38:10] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2025-05-29 17:38:10] [INFO ] Computed and/alt/rep : 372/1475/372 causal constraints (skipped 545 transitions) in 47 ms.
[2025-05-29 17:38:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:10] [INFO ] [Nat]Absence check using 25 positive place invariants in 8 ms returned sat
[2025-05-29 17:38:10] [INFO ] [Nat]Absence check using 25 positive and 75 generalized place invariants in 15 ms returned sat
[2025-05-29 17:38:11] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2025-05-29 17:38:11] [INFO ] Computed and/alt/rep : 372/1475/372 causal constraints (skipped 545 transitions) in 58 ms.
[2025-05-29 17:38:14] [INFO ] Added : 296 causal constraints over 60 iterations in 3207 ms. Result :sat
Minimization took 492 ms.
[2025-05-29 17:38:14] [INFO ] [Real]Absence check using 25 positive place invariants in 8 ms returned sat
[2025-05-29 17:38:14] [INFO ] [Real]Absence check using 25 positive and 75 generalized place invariants in 20 ms returned sat
[2025-05-29 17:38:15] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2025-05-29 17:38:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:15] [INFO ] [Nat]Absence check using 25 positive place invariants in 8 ms returned sat
[2025-05-29 17:38:15] [INFO ] [Nat]Absence check using 25 positive and 75 generalized place invariants in 15 ms returned sat
[2025-05-29 17:38:15] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2025-05-29 17:38:15] [INFO ] Computed and/alt/rep : 372/1475/372 causal constraints (skipped 545 transitions) in 49 ms.
[2025-05-29 17:38:18] [INFO ] Added : 268 causal constraints over 54 iterations in 2981 ms. Result :sat
Minimization took 463 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 938/938 transitions.
Applied a total of 0 rules in 30 ms. Remains 562 /562 variables (removed 0) and now considering 938/938 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 562/562 places, 938/938 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 938/938 transitions.
Applied a total of 0 rules in 20 ms. Remains 562 /562 variables (removed 0) and now considering 938/938 (removed 0) transitions.
[2025-05-29 17:38:19] [INFO ] Invariant cache hit.
[2025-05-29 17:38:20] [INFO ] Implicit Places using invariants in 496 ms returned [1, 19, 20, 23, 33, 50, 68, 139, 143, 145, 156, 157, 159, 176, 194, 265, 269, 270, 281, 282, 284, 301, 319, 388, 392, 393, 396, 407, 408, 409, 427, 429, 433, 451, 452, 453, 454, 466, 472, 478, 484, 490, 496, 502, 508, 514, 520, 526]
[2025-05-29 17:38:20] [INFO ] Actually due to overlaps returned [427, 409, 50, 176, 301, 433, 33, 159, 284, 156, 281, 407, 451, 157, 282, 408, 429, 452, 1, 19, 269, 270, 392, 393, 68, 194, 319, 453, 496, 514, 526, 20, 23, 143, 396, 454, 466, 472, 478, 484, 490, 502, 508, 520]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 500 ms to find 44 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 518/562 places, 938/938 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 514 transition count 860
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 83 rules applied. Total rules applied 165 place count 436 transition count 855
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 167 place count 434 transition count 855
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 167 place count 434 transition count 836
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 39 rules applied. Total rules applied 206 place count 414 transition count 836
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 218 place count 410 transition count 828
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 226 place count 402 transition count 828
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 241 place count 387 transition count 813
Iterating global reduction 5 with 15 rules applied. Total rules applied 256 place count 387 transition count 813
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 259 place count 387 transition count 810
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 259 place count 387 transition count 809
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 261 place count 386 transition count 809
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 264 place count 383 transition count 803
Iterating global reduction 6 with 3 rules applied. Total rules applied 267 place count 383 transition count 803
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 268 place count 382 transition count 802
Iterating global reduction 6 with 1 rules applied. Total rules applied 269 place count 382 transition count 802
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 270 place count 381 transition count 800
Iterating global reduction 6 with 1 rules applied. Total rules applied 271 place count 381 transition count 800
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 327 place count 353 transition count 772
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 330 place count 350 transition count 769
Iterating global reduction 6 with 3 rules applied. Total rules applied 333 place count 350 transition count 769
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 336 place count 350 transition count 766
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 340 place count 348 transition count 767
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 346 place count 348 transition count 761
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 353 place count 341 transition count 761
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 362 place count 341 transition count 761
Applied a total of 362 rules in 124 ms. Remains 341 /518 variables (removed 177) and now considering 761/938 (removed 177) transitions.
// Phase 1: matrix 761 rows 341 cols
[2025-05-29 17:38:20] [INFO ] Computed 46 invariants in 6 ms
[2025-05-29 17:38:20] [INFO ] Implicit Places using invariants in 281 ms returned [73, 92, 98, 101, 103, 108, 109, 161, 180, 186, 189, 191, 196, 197, 249, 266, 272, 275, 277]
[2025-05-29 17:38:20] [INFO ] Actually due to overlaps returned [108, 196, 109, 197, 92, 98, 103, 180, 186, 191, 266, 272, 277, 73, 161, 249]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 282 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 325/562 places, 761/938 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 313 transition count 749
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 313 transition count 749
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 310 transition count 746
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 310 transition count 746
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 42 place count 304 transition count 740
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 51 place count 304 transition count 731
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 60 place count 295 transition count 731
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 295 transition count 728
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 66 place count 292 transition count 728
Applied a total of 66 rules in 61 ms. Remains 292 /325 variables (removed 33) and now considering 728/761 (removed 33) transitions.
// Phase 1: matrix 728 rows 292 cols
[2025-05-29 17:38:20] [INFO ] Computed 30 invariants in 8 ms
[2025-05-29 17:38:21] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-05-29 17:38:21] [INFO ] Invariant cache hit.
[2025-05-29 17:38:21] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 292/562 places, 728/938 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1633 ms. Remains : 292/562 places, 728/938 transitions.
[2025-05-29 17:38:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (21609 resets) in 1503 ms. (664 steps per ms)
BEST_FIRST walk for 4000001 steps (27401 resets) in 2651 ms. (1508 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-29 17:38:25] [INFO ] Invariant cache hit.
[2025-05-29 17:38:25] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-05-29 17:38:25] [INFO ] [Real]Absence check using 10 positive and 20 generalized place invariants in 5 ms returned sat
[2025-05-29 17:38:25] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2025-05-29 17:38:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 17:38:25] [INFO ] [Nat]Absence check using 10 positive and 20 generalized place invariants in 6 ms returned sat
[2025-05-29 17:38:26] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2025-05-29 17:38:26] [INFO ] Computed and/alt/rep : 153/817/153 causal constraints (skipped 554 transitions) in 41 ms.
[2025-05-29 17:38:26] [INFO ] Added : 59 causal constraints over 12 iterations in 636 ms. Result :sat
Minimization took 336 ms.
[2025-05-29 17:38:27] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:38:27] [INFO ] [Real]Absence check using 10 positive and 20 generalized place invariants in 6 ms returned sat
[2025-05-29 17:38:27] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2025-05-29 17:38:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:38:27] [INFO ] [Nat]Absence check using 10 positive and 20 generalized place invariants in 5 ms returned sat
[2025-05-29 17:38:27] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2025-05-29 17:38:27] [INFO ] Computed and/alt/rep : 153/817/153 causal constraints (skipped 554 transitions) in 40 ms.
[2025-05-29 17:38:28] [INFO ] Added : 35 causal constraints over 8 iterations in 385 ms. Result :sat
Minimization took 322 ms.
[2025-05-29 17:38:28] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:38:28] [INFO ] [Real]Absence check using 10 positive and 20 generalized place invariants in 6 ms returned sat
[2025-05-29 17:38:28] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2025-05-29 17:38:28] [INFO ] Computed and/alt/rep : 153/817/153 causal constraints (skipped 554 transitions) in 39 ms.
[2025-05-29 17:38:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:38:28] [INFO ] [Nat]Absence check using 10 positive and 20 generalized place invariants in 5 ms returned sat
[2025-05-29 17:38:28] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2025-05-29 17:38:28] [INFO ] Computed and/alt/rep : 153/817/153 causal constraints (skipped 554 transitions) in 35 ms.
[2025-05-29 17:38:29] [INFO ] Added : 13 causal constraints over 3 iterations in 168 ms. Result :sat
Minimization took 275 ms.
[2025-05-29 17:38:29] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-05-29 17:38:29] [INFO ] [Real]Absence check using 10 positive and 20 generalized place invariants in 4 ms returned sat
[2025-05-29 17:38:29] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2025-05-29 17:38:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:38:29] [INFO ] [Nat]Absence check using 10 positive and 20 generalized place invariants in 4 ms returned sat
[2025-05-29 17:38:29] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2025-05-29 17:38:29] [INFO ] Computed and/alt/rep : 153/817/153 causal constraints (skipped 554 transitions) in 42 ms.
[2025-05-29 17:38:30] [INFO ] Added : 12 causal constraints over 3 iterations in 187 ms. Result :sat
Minimization took 275 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA ASLink-PT-03b-UpperBounds-01 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 292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 728/728 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 292 transition count 727
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 291 transition count 727
Applied a total of 2 rules in 25 ms. Remains 291 /292 variables (removed 1) and now considering 727/728 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 291/292 places, 727/728 transitions.
// Phase 1: matrix 727 rows 291 cols
[2025-05-29 17:38:30] [INFO ] Computed 30 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (21699 resets) in 1581 ms. (632 steps per ms)
BEST_FIRST walk for 3000002 steps (20550 resets) in 1990 ms. (1506 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 17:38:34] [INFO ] Invariant cache hit.
[2025-05-29 17:38:34] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:38:34] [INFO ] [Real]Absence check using 8 positive and 22 generalized place invariants in 5 ms returned sat
[2025-05-29 17:38:34] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2025-05-29 17:38:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:38:34] [INFO ] [Nat]Absence check using 8 positive and 22 generalized place invariants in 6 ms returned sat
[2025-05-29 17:38:34] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2025-05-29 17:38:34] [INFO ] Computed and/alt/rep : 144/737/144 causal constraints (skipped 562 transitions) in 42 ms.
[2025-05-29 17:38:35] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2025-05-29 17:38:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2025-05-29 17:38:35] [INFO ] Added : 74 causal constraints over 15 iterations in 818 ms. Result :sat
Minimization took 508 ms.
[2025-05-29 17:38:36] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:38:36] [INFO ] [Real]Absence check using 8 positive and 22 generalized place invariants in 6 ms returned sat
[2025-05-29 17:38:36] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2025-05-29 17:38:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:38:36] [INFO ] [Nat]Absence check using 8 positive and 22 generalized place invariants in 5 ms returned sat
[2025-05-29 17:38:36] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2025-05-29 17:38:36] [INFO ] Computed and/alt/rep : 144/737/144 causal constraints (skipped 562 transitions) in 37 ms.
[2025-05-29 17:38:37] [INFO ] Added : 40 causal constraints over 9 iterations in 544 ms. Result :sat
Minimization took 473 ms.
[2025-05-29 17:38:37] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:38:37] [INFO ] [Real]Absence check using 8 positive and 22 generalized place invariants in 5 ms returned sat
[2025-05-29 17:38:38] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2025-05-29 17:38:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:38:38] [INFO ] [Nat]Absence check using 8 positive and 22 generalized place invariants in 6 ms returned sat
[2025-05-29 17:38:38] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2025-05-29 17:38:38] [INFO ] Computed and/alt/rep : 144/737/144 causal constraints (skipped 562 transitions) in 35 ms.
[2025-05-29 17:38:38] [INFO ] Added : 14 causal constraints over 4 iterations in 204 ms. Result :sat
Minimization took 449 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 291 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 727/727 transitions.
Applied a total of 0 rules in 9 ms. Remains 291 /291 variables (removed 0) and now considering 727/727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 291/291 places, 727/727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 727/727 transitions.
Applied a total of 0 rules in 8 ms. Remains 291 /291 variables (removed 0) and now considering 727/727 (removed 0) transitions.
[2025-05-29 17:38:39] [INFO ] Invariant cache hit.
[2025-05-29 17:38:39] [INFO ] Implicit Places using invariants in 167 ms returned []
[2025-05-29 17:38:39] [INFO ] Invariant cache hit.
[2025-05-29 17:38:39] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2025-05-29 17:38:39] [INFO ] Redundant transitions in 36 ms returned []
Running 706 sub problems to find dead transitions.
[2025-05-29 17:38:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 19/24 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 3 (OVERLAPS) 1/291 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 706 unsolved
[2025-05-29 17:38:54] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2025-05-29 17:38:57] [INFO ] Deduced a trap composed of 66 places in 141 ms of which 2 ms to minimize.
[2025-05-29 17:38:57] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 2 ms to minimize.
[2025-05-29 17:38:58] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 1 ms to minimize.
[2025-05-29 17:38:59] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 7 (OVERLAPS) 727/1018 variables, 291/326 constraints. Problems are: Problem set: 0 solved, 706 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1018/1018 variables, and 326 constraints, problems are : Problem set: 0 solved, 706 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 706/706 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 706 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 19/24 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 3 (OVERLAPS) 1/291 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 706 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 TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 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 TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
At refinement iteration 7 (OVERLAPS) 727/1018 variables, 291/326 constraints. Problems are: Problem set: 106 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1018/1018 variables, and 926 constraints, problems are : Problem set: 106 solved, 600 unsolved in 30121 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 600/706 constraints, Known Traps: 5/5 constraints]
After SMT, in 60540ms problems are : Problem set: 106 solved, 600 unsolved
Search for dead transitions found 106 dead transitions in 60558ms
Found 106 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 106 transitions
Dead transitions reduction (with SMT) removed 106 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 291/291 places, 621/727 transitions.
Applied a total of 0 rules in 7 ms. Remains 291 /291 variables (removed 0) and now considering 621/621 (removed 0) transitions.
[2025-05-29 17:39:40] [INFO ] Redundant transitions in 21 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61301 ms. Remains : 291/291 places, 621/727 transitions.
// Phase 1: matrix 621 rows 291 cols
[2025-05-29 17:39:40] [INFO ] Computed 30 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 (21635 resets) in 1462 ms. (683 steps per ms)
BEST_FIRST walk for 3000002 steps (20711 resets) in 1949 ms. (1538 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 17:39:43] [INFO ] Invariant cache hit.
[2025-05-29 17:39:43] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:39:43] [INFO ] [Real]Absence check using 8 positive and 22 generalized place invariants in 5 ms returned sat
[2025-05-29 17:39:44] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2025-05-29 17:39:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 17:39:44] [INFO ] [Nat]Absence check using 8 positive and 22 generalized place invariants in 5 ms returned sat
[2025-05-29 17:39:44] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2025-05-29 17:39:44] [INFO ] Computed and/alt/rep : 270/1335/270 causal constraints (skipped 330 transitions) in 31 ms.
[2025-05-29 17:39:45] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2025-05-29 17:39:45] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
[2025-05-29 17:39:46] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2025-05-29 17:39:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 339 ms
[2025-05-29 17:39:46] [INFO ] Added : 165 causal constraints over 33 iterations in 1851 ms. Result :sat
Minimization took 394 ms.
[2025-05-29 17:39:46] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:39:46] [INFO ] [Real]Absence check using 8 positive and 22 generalized place invariants in 6 ms returned sat
[2025-05-29 17:39:46] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2025-05-29 17:39:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:39:46] [INFO ] [Nat]Absence check using 8 positive and 22 generalized place invariants in 5 ms returned sat
[2025-05-29 17:39:46] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2025-05-29 17:39:47] [INFO ] Computed and/alt/rep : 270/1335/270 causal constraints (skipped 330 transitions) in 29 ms.
[2025-05-29 17:39:48] [INFO ] Added : 128 causal constraints over 27 iterations in 1126 ms. Result :sat
Minimization took 280 ms.
[2025-05-29 17:39:48] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:39:48] [INFO ] [Real]Absence check using 8 positive and 22 generalized place invariants in 5 ms returned sat
[2025-05-29 17:39:48] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2025-05-29 17:39:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:39:48] [INFO ] [Nat]Absence check using 8 positive and 22 generalized place invariants in 5 ms returned sat
[2025-05-29 17:39:48] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2025-05-29 17:39:48] [INFO ] Computed and/alt/rep : 270/1335/270 causal constraints (skipped 330 transitions) in 31 ms.
[2025-05-29 17:39:49] [INFO ] Added : 57 causal constraints over 12 iterations in 397 ms. Result :sat
Minimization took 233 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 291 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 621/621 transitions.
Applied a total of 0 rules in 6 ms. Remains 291 /291 variables (removed 0) and now considering 621/621 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 291/291 places, 621/621 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 621/621 transitions.
Applied a total of 0 rules in 6 ms. Remains 291 /291 variables (removed 0) and now considering 621/621 (removed 0) transitions.
[2025-05-29 17:39:49] [INFO ] Invariant cache hit.
[2025-05-29 17:39:49] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-05-29 17:39:49] [INFO ] Invariant cache hit.
[2025-05-29 17:39:50] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2025-05-29 17:39:50] [INFO ] Redundant transitions in 3 ms returned []
Running 600 sub problems to find dead transitions.
[2025-05-29 17:39:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 19/24 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2025-05-29 17:39:53] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2025-05-29 17:39:53] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2025-05-29 17:39:53] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
[2025-05-29 17:39:54] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2025-05-29 17:39:54] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
[2025-05-29 17:39:54] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
Problem TDEAD144 is UNSAT
[2025-05-29 17:39:54] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2025-05-29 17:39:54] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 2 ms to minimize.
[2025-05-29 17:39:54] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 2 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
[2025-05-29 17:39:55] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
[2025-05-29 17:39:55] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
Problem TDEAD154 is UNSAT
[2025-05-29 17:39:55] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
Problem TDEAD157 is UNSAT
[2025-05-29 17:39:55] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
[2025-05-29 17:39:55] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2025-05-29 17:39:55] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
Problem TDEAD176 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
[2025-05-29 17:39:55] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2025-05-29 17:39:55] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
[2025-05-29 17:39:55] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 1 ms to minimize.
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
[2025-05-29 17:39:55] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
[2025-05-29 17:39:56] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 1 ms to minimize.
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 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 TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD620 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 20/44 constraints. Problems are: Problem set: 99 solved, 501 unsolved
[2025-05-29 17:39:57] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
Problem TDEAD248 is UNSAT
[2025-05-29 17:39:57] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
Problem TDEAD252 is UNSAT
[2025-05-29 17:39:57] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
Problem TDEAD254 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
[2025-05-29 17:39:58] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 5 ms to minimize.
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
[2025-05-29 17:39:58] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
Problem TDEAD280 is UNSAT
Problem TDEAD286 is UNSAT
[2025-05-29 17:39:58] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
Problem TDEAD287 is UNSAT
Problem TDEAD294 is UNSAT
[2025-05-29 17:39:58] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 2 ms to minimize.
[2025-05-29 17:39:59] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
Problem TDEAD391 is UNSAT
[2025-05-29 17:39:59] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
[2025-05-29 17:40:00] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD562 is UNSAT
[2025-05-29 17:40:00] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2025-05-29 17:40:00] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 2 ms to minimize.
Problem TDEAD565 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
[2025-05-29 17:40:00] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
Problem TDEAD592 is UNSAT
[2025-05-29 17:40:00] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD209 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 14/58 constraints. Problems are: Problem set: 138 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/58 constraints. Problems are: Problem set: 138 solved, 462 unsolved
At refinement iteration 5 (OVERLAPS) 1/291 variables, 3/61 constraints. Problems are: Problem set: 138 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/64 constraints. Problems are: Problem set: 138 solved, 462 unsolved
[2025-05-29 17:40:09] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2025-05-29 17:40:11] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2025-05-29 17:40:11] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 1 ms to minimize.
[2025-05-29 17:40:13] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 4/68 constraints. Problems are: Problem set: 138 solved, 462 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/68 constraints. Problems are: Problem set: 138 solved, 462 unsolved
At refinement iteration 9 (OVERLAPS) 621/912 variables, 291/359 constraints. Problems are: Problem set: 138 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 912/912 variables, and 359 constraints, problems are : Problem set: 138 solved, 462 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 138 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 5/5 constraints. Problems are: Problem set: 138 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 19/24 constraints. Problems are: Problem set: 138 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 34/58 constraints. Problems are: Problem set: 138 solved, 462 unsolved
[2025-05-29 17:40:22] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
Problem TDEAD208 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 1/59 constraints. Problems are: Problem set: 139 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/59 constraints. Problems are: Problem set: 139 solved, 461 unsolved
At refinement iteration 5 (OVERLAPS) 1/291 variables, 3/62 constraints. Problems are: Problem set: 139 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/65 constraints. Problems are: Problem set: 139 solved, 461 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 4/69 constraints. Problems are: Problem set: 139 solved, 461 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/69 constraints. Problems are: Problem set: 139 solved, 461 unsolved
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 TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 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 TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 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 TDEAD255 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 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 TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
At refinement iteration 9 (OVERLAPS) 621/912 variables, 291/360 constraints. Problems are: Problem set: 316 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 912/912 variables, and 644 constraints, problems are : Problem set: 316 solved, 284 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 284/600 constraints, Known Traps: 39/39 constraints]
After SMT, in 60309ms problems are : Problem set: 316 solved, 284 unsolved
Search for dead transitions found 316 dead transitions in 60314ms
Found 316 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 316 transitions
Dead transitions reduction (with SMT) removed 316 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 291/291 places, 305/621 transitions.
Ensure Unique test removed 25 places
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 258 transition count 280
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 83 place count 233 transition count 280
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 83 place count 233 transition count 272
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 99 place count 225 transition count 272
Applied a total of 99 rules in 8 ms. Remains 225 /291 variables (removed 66) and now considering 272/305 (removed 33) transitions.
// Phase 1: matrix 272 rows 225 cols
[2025-05-29 17:40:50] [INFO ] Computed 30 invariants in 3 ms
[2025-05-29 17:40:50] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-05-29 17:40:50] [INFO ] Invariant cache hit.
[2025-05-29 17:40:51] [INFO ] Implicit Places using invariants and state equation in 247 ms returned [88, 114, 117, 119, 121, 123, 125, 126, 146, 174, 176, 179, 181, 183, 185]
Discarding 15 places :
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Implicit Place search using SMT with State Equation took 380 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 210/291 places, 266/621 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 0 with 4 rules applied. Total rules applied 4 place count 210 transition count 262
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 206 transition count 262
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 206 transition count 260
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 12 place count 204 transition count 260
Free-agglomeration rule applied 4 times with reduction of 2 identical transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 204 transition count 254
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 21 place count 200 transition count 253
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 200 transition count 251
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 25 place count 198 transition count 251
Applied a total of 25 rules in 20 ms. Remains 198 /210 variables (removed 12) and now considering 251/266 (removed 15) transitions.
// Phase 1: matrix 251 rows 198 cols
[2025-05-29 17:40:51] [INFO ] Computed 25 invariants in 5 ms
[2025-05-29 17:40:51] [INFO ] Implicit Places using invariants in 105 ms returned [86, 130]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 105 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 196/291 places, 251/621 transitions.
Free-agglomeration rule (complex) applied 3 times with reduction of 1 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 196 transition count 251
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 193 transition count 251
Applied a total of 6 rules in 10 ms. Remains 193 /196 variables (removed 3) and now considering 251/251 (removed 0) transitions.
// Phase 1: matrix 251 rows 193 cols
[2025-05-29 17:40:51] [INFO ] Computed 23 invariants in 1 ms
[2025-05-29 17:40:51] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-05-29 17:40:51] [INFO ] Invariant cache hit.
[2025-05-29 17:40:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-29 17:40:51] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 193/291 places, 251/621 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 61804 ms. Remains : 193/291 places, 251/621 transitions.
[2025-05-29 17:40:51] [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 (26371 resets) in 1333 ms. (749 steps per ms)
BEST_FIRST walk for 3000002 steps (22069 resets) in 1658 ms. (1808 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 17:40:54] [INFO ] Invariant cache hit.
[2025-05-29 17:40:54] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-29 17:40:54] [INFO ] [Real]Absence check using 5 positive and 18 generalized place invariants in 12 ms returned sat
[2025-05-29 17:40:54] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2025-05-29 17:40:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-29 17:40:54] [INFO ] [Nat]Absence check using 5 positive and 18 generalized place invariants in 5 ms returned sat
[2025-05-29 17:40:54] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2025-05-29 17:40:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-29 17:40:54] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-05-29 17:40:54] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2025-05-29 17:40:54] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2025-05-29 17:40:54] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2025-05-29 17:40:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 126 ms
[2025-05-29 17:40:54] [INFO ] Computed and/alt/rep : 145/439/145 causal constraints (skipped 85 transitions) in 14 ms.
[2025-05-29 17:40:55] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2025-05-29 17:40:55] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2025-05-29 17:40:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 121 ms
[2025-05-29 17:40:55] [INFO ] Added : 55 causal constraints over 11 iterations in 319 ms. Result :sat
Minimization took 128 ms.
[2025-05-29 17:40:55] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-29 17:40:55] [INFO ] [Real]Absence check using 5 positive and 18 generalized place invariants in 4 ms returned sat
[2025-05-29 17:40:55] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-05-29 17:40:55] [INFO ] [Real]Added 5 Read/Feed constraints in 5 ms returned sat
[2025-05-29 17:40:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-29 17:40:55] [INFO ] [Nat]Absence check using 5 positive and 18 generalized place invariants in 4 ms returned sat
[2025-05-29 17:40:55] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2025-05-29 17:40:55] [INFO ] [Nat]Added 5 Read/Feed constraints in 8 ms returned sat
[2025-05-29 17:40:55] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2025-05-29 17:40:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2025-05-29 17:40:55] [INFO ] Computed and/alt/rep : 145/439/145 causal constraints (skipped 85 transitions) in 11 ms.
[2025-05-29 17:40:55] [INFO ] Added : 28 causal constraints over 6 iterations in 102 ms. Result :sat
Minimization took 116 ms.
[2025-05-29 17:40:55] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-29 17:40:55] [INFO ] [Real]Absence check using 5 positive and 18 generalized place invariants in 4 ms returned sat
[2025-05-29 17:40:55] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2025-05-29 17:40:55] [INFO ] [Real]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-05-29 17:40:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-29 17:40:55] [INFO ] [Nat]Absence check using 5 positive and 18 generalized place invariants in 4 ms returned sat
[2025-05-29 17:40:56] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2025-05-29 17:40:56] [INFO ] [Nat]Added 5 Read/Feed constraints in 3 ms returned sat
[2025-05-29 17:40:56] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2025-05-29 17:40:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2025-05-29 17:40:56] [INFO ] Computed and/alt/rep : 145/439/145 causal constraints (skipped 85 transitions) in 13 ms.
[2025-05-29 17:40:56] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2025-05-29 17:40:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2025-05-29 17:40:56] [INFO ] Added : 20 causal constraints over 4 iterations in 163 ms. Result :sat
Minimization took 112 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 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 251/251 transitions.
Applied a total of 0 rules in 14 ms. Remains 193 /193 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 193/193 places, 251/251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 251/251 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 251/251 (removed 0) transitions.
[2025-05-29 17:40:56] [INFO ] Invariant cache hit.
[2025-05-29 17:40:56] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-05-29 17:40:56] [INFO ] Invariant cache hit.
[2025-05-29 17:40:56] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-29 17:40:56] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2025-05-29 17:40:56] [INFO ] Redundant transitions in 13 ms returned []
Running 230 sub problems to find dead transitions.
[2025-05-29 17:40:56] [INFO ] Invariant cache hit.
[2025-05-29 17:40:56] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 18/22 constraints. Problems are: Problem set: 3 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/22 constraints. Problems are: Problem set: 3 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 1/193 variables, 1/23 constraints. Problems are: Problem set: 3 solved, 227 unsolved
[2025-05-29 17:40:59] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/24 constraints. Problems are: Problem set: 3 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/24 constraints. Problems are: Problem set: 3 solved, 227 unsolved
Problem TDEAD66 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
At refinement iteration 6 (OVERLAPS) 251/444 variables, 193/217 constraints. Problems are: Problem set: 16 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 5/222 constraints. Problems are: Problem set: 16 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/222 constraints. Problems are: Problem set: 16 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/444 variables, 0/222 constraints. Problems are: Problem set: 16 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 222 constraints, problems are : Problem set: 16 solved, 214 unsolved in 10102 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 193/193 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 16 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 4/4 constraints. Problems are: Problem set: 16 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 18/22 constraints. Problems are: Problem set: 16 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/22 constraints. Problems are: Problem set: 16 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/193 variables, 1/23 constraints. Problems are: Problem set: 16 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/24 constraints. Problems are: Problem set: 16 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/24 constraints. Problems are: Problem set: 16 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 251/444 variables, 193/217 constraints. Problems are: Problem set: 16 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 5/222 constraints. Problems are: Problem set: 16 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 214/436 constraints. Problems are: Problem set: 16 solved, 214 unsolved
[2025-05-29 17:41:10] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2025-05-29 17:41:12] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
Problem TDEAD246 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 2/438 constraints. Problems are: Problem set: 18 solved, 212 unsolved
[2025-05-29 17:41:14] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/439 constraints. Problems are: Problem set: 18 solved, 212 unsolved
[2025-05-29 17:41:18] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/440 constraints. Problems are: Problem set: 18 solved, 212 unsolved
[2025-05-29 17:41:22] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2025-05-29 17:41:22] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 2/442 constraints. Problems are: Problem set: 18 solved, 212 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/444 variables, 0/442 constraints. Problems are: Problem set: 18 solved, 212 unsolved
[2025-05-29 17:41:30] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/444 variables, 1/443 constraints. Problems are: Problem set: 18 solved, 212 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/443 constraints. Problems are: Problem set: 18 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 443 constraints, problems are : Problem set: 18 solved, 212 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 193/193 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 214/230 constraints, Known Traps: 8/8 constraints]
After SMT, in 40183ms problems are : Problem set: 18 solved, 212 unsolved
Search for dead transitions found 18 dead transitions in 40185ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 193/193 places, 233/251 transitions.
Ensure Unique test removed 8 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 183 transition count 224
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 28 place count 174 transition count 224
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 30 place count 173 transition count 223
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 173 transition count 221
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 171 transition count 221
Applied a total of 34 rules in 12 ms. Remains 171 /193 variables (removed 22) and now considering 221/233 (removed 12) transitions.
// Phase 1: matrix 221 rows 171 cols
[2025-05-29 17:41:36] [INFO ] Computed 24 invariants in 3 ms
[2025-05-29 17:41:37] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-05-29 17:41:37] [INFO ] Invariant cache hit.
[2025-05-29 17:41:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-29 17:41:37] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 171/193 places, 221/251 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 40869 ms. Remains : 171/193 places, 221/251 transitions.
[2025-05-29 17:41:37] [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 (27122 resets) in 1339 ms. (746 steps per ms)
BEST_FIRST walk for 3000002 steps (22102 resets) in 1621 ms. (1849 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 17:41:40] [INFO ] Invariant cache hit.
[2025-05-29 17:41:40] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-05-29 17:41:40] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-29 17:41:40] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2025-05-29 17:41:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-29 17:41:40] [INFO ] [Real]Added 2 Read/Feed constraints in 0 ms returned sat
[2025-05-29 17:41:40] [INFO ] Computed and/alt/rep : 119/345/119 causal constraints (skipped 81 transitions) in 12 ms.
[2025-05-29 17:41:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-05-29 17:41:40] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 2 ms returned sat
[2025-05-29 17:41:40] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2025-05-29 17:41:40] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-05-29 17:41:40] [INFO ] Computed and/alt/rep : 119/345/119 causal constraints (skipped 81 transitions) in 10 ms.
[2025-05-29 17:41:40] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2025-05-29 17:41:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2025-05-29 17:41:40] [INFO ] Added : 39 causal constraints over 8 iterations in 201 ms. Result :sat
Minimization took 119 ms.
[2025-05-29 17:41:40] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-05-29 17:41:40] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 4 ms returned sat
[2025-05-29 17:41:40] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2025-05-29 17:41:40] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-05-29 17:41:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-05-29 17:41:40] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-29 17:41:41] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2025-05-29 17:41:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-05-29 17:41:41] [INFO ] Computed and/alt/rep : 119/345/119 causal constraints (skipped 81 transitions) in 10 ms.
[2025-05-29 17:41:41] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2025-05-29 17:41:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2025-05-29 17:41:41] [INFO ] Added : 76 causal constraints over 16 iterations in 379 ms. Result :sat
Minimization took 134 ms.
[2025-05-29 17:41:41] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-05-29 17:41:41] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-29 17:41:41] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2025-05-29 17:41:41] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-05-29 17:41:41] [INFO ] Computed and/alt/rep : 119/345/119 causal constraints (skipped 81 transitions) in 12 ms.
[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 10 positive place invariants in 2 ms returned sat
[2025-05-29 17:41:41] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 7 ms returned sat
[2025-05-29 17:41:41] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2025-05-29 17:41:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2025-05-29 17:41:41] [INFO ] Computed and/alt/rep : 119/345/119 causal constraints (skipped 81 transitions) in 13 ms.
[2025-05-29 17:41:41] [INFO ] Added : 37 causal constraints over 8 iterations in 131 ms. Result :sat
Minimization took 120 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA ASLink-PT-03b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 221/221 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 0 with 1 rules applied. Total rules applied 1 place count 171 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 170 transition count 220
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 170 transition count 219
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 4 place count 169 transition count 219
Applied a total of 4 rules in 6 ms. Remains 169 /171 variables (removed 2) and now considering 219/221 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 169/171 places, 219/221 transitions.
// Phase 1: matrix 219 rows 169 cols
[2025-05-29 17:41:42] [INFO ] Computed 24 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (27330 resets) in 1281 ms. (780 steps per ms)
BEST_FIRST walk for 2000001 steps (14727 resets) in 1052 ms. (1899 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-29 17:41:44] [INFO ] Invariant cache hit.
[2025-05-29 17:41:44] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-05-29 17:41:44] [INFO ] [Real]Absence check using 8 positive and 16 generalized place invariants in 3 ms returned sat
[2025-05-29 17:41:44] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2025-05-29 17:41:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-29 17:41:44] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-05-29 17:41:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 17:41:44] [INFO ] [Nat]Absence check using 8 positive and 16 generalized place invariants in 3 ms returned sat
[2025-05-29 17:41:44] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2025-05-29 17:41:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-05-29 17:41:44] [INFO ] Computed and/alt/rep : 117/343/117 causal constraints (skipped 81 transitions) in 11 ms.
[2025-05-29 17:41:44] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2025-05-29 17:41:44] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-29 17:41:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2025-05-29 17:41:44] [INFO ] Added : 54 causal constraints over 12 iterations in 315 ms. Result :sat
Minimization took 89 ms.
[2025-05-29 17:41:45] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-05-29 17:41:45] [INFO ] [Real]Absence check using 8 positive and 16 generalized place invariants in 2 ms returned sat
[2025-05-29 17:41:45] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2025-05-29 17:41:45] [INFO ] [Real]Added 2 Read/Feed constraints in 1 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 8 positive place invariants in 2 ms returned sat
[2025-05-29 17:41:45] [INFO ] [Nat]Absence check using 8 positive and 16 generalized place invariants in 3 ms returned sat
[2025-05-29 17:41:45] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2025-05-29 17:41:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2025-05-29 17:41:45] [INFO ] Computed and/alt/rep : 117/343/117 causal constraints (skipped 81 transitions) in 11 ms.
[2025-05-29 17:41:45] [INFO ] Added : 36 causal constraints over 8 iterations in 145 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 219/219 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 169/169 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 169 /169 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2025-05-29 17:41:45] [INFO ] Invariant cache hit.
[2025-05-29 17:41:45] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-05-29 17:41:45] [INFO ] Invariant cache hit.
[2025-05-29 17:41:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-29 17:41:45] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2025-05-29 17:41:45] [INFO ] Redundant transitions in 13 ms returned []
Running 198 sub problems to find dead transitions.
[2025-05-29 17:41:45] [INFO ] Invariant cache hit.
[2025-05-29 17:41:45] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 1/169 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2025-05-29 17:41:47] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
At refinement iteration 6 (OVERLAPS) 219/388 variables, 169/194 constraints. Problems are: Problem set: 2 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 2/196 constraints. Problems are: Problem set: 2 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/196 constraints. Problems are: Problem set: 2 solved, 196 unsolved
At refinement iteration 9 (OVERLAPS) 0/388 variables, 0/196 constraints. Problems are: Problem set: 2 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 196 constraints, problems are : Problem set: 2 solved, 196 unsolved in 7627 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 169/169 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 16/22 constraints. Problems are: Problem set: 2 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 1/169 variables, 2/24 constraints. Problems are: Problem set: 2 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 1/25 constraints. Problems are: Problem set: 2 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 219/388 variables, 169/194 constraints. Problems are: Problem set: 2 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 2/196 constraints. Problems are: Problem set: 2 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 196/392 constraints. Problems are: Problem set: 2 solved, 196 unsolved
[2025-05-29 17:41:56] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 1/393 constraints. Problems are: Problem set: 2 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/393 constraints. Problems are: Problem set: 2 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/388 variables, 0/393 constraints. Problems are: Problem set: 2 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 393 constraints, problems are : Problem set: 2 solved, 196 unsolved in 14738 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 169/169 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 196/198 constraints, Known Traps: 2/2 constraints]
After SMT, in 22426ms problems are : Problem set: 2 solved, 196 unsolved
Search for dead transitions found 2 dead transitions in 22430ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 169/169 places, 217/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 169 /169 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2025-05-29 17:42:08] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 22727 ms. Remains : 169/169 places, 217/219 transitions.
// Phase 1: matrix 217 rows 169 cols
[2025-05-29 17:42:08] [INFO ] Computed 26 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (27402 resets) in 1303 ms. (766 steps per ms)
BEST_FIRST walk for 2000002 steps (14742 resets) in 1059 ms. (1886 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-29 17:42:10] [INFO ] Invariant cache hit.
[2025-05-29 17:42:10] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2025-05-29 17:42:10] [INFO ] [Real]Absence check using 12 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-29 17:42:10] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2025-05-29 17:42:10] [INFO ] Computed and/alt/rep : 115/318/115 causal constraints (skipped 81 transitions) in 11 ms.
[2025-05-29 17:42:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-05-29 17:42:10] [INFO ] [Nat]Absence check using 12 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-29 17:42:10] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-05-29 17:42:10] [INFO ] Computed and/alt/rep : 115/318/115 causal constraints (skipped 81 transitions) in 11 ms.
[2025-05-29 17:42:10] [INFO ] Added : 19 causal constraints over 4 iterations in 66 ms. Result :sat
Minimization took 70 ms.
[2025-05-29 17:42:11] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2025-05-29 17:42:11] [INFO ] [Real]Absence check using 12 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-29 17:42:11] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2025-05-29 17:42:11] [INFO ] Computed and/alt/rep : 115/318/115 causal constraints (skipped 81 transitions) in 11 ms.
[2025-05-29 17:42:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:11] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2025-05-29 17:42:11] [INFO ] [Nat]Absence check using 12 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-29 17:42:11] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-05-29 17:42:11] [INFO ] Computed and/alt/rep : 115/318/115 causal constraints (skipped 81 transitions) in 11 ms.
[2025-05-29 17:42:11] [INFO ] Added : 18 causal constraints over 4 iterations in 78 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
FORMULA ASLink-PT-03b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 169 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p416) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 216/216 transitions.
Reduce places removed 1 places and 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 0 with 2 rules applied. Total rules applied 2 place count 168 transition count 214
Reduce places removed 2 places and 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 166 transition count 213
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 166 transition count 212
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 6 place count 165 transition count 212
Applied a total of 6 rules in 18 ms. Remains 165 /169 variables (removed 4) and now considering 212/216 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 165/169 places, 212/216 transitions.
// Phase 1: matrix 212 rows 165 cols
[2025-05-29 17:42:11] [INFO ] Computed 26 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (27279 resets) in 1260 ms. (793 steps per ms)
BEST_FIRST walk for 1000001 steps (7399 resets) in 527 ms. (1893 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-29 17:42:13] [INFO ] Invariant cache hit.
[2025-05-29 17:42:13] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-05-29 17:42:13] [INFO ] [Real]Absence check using 13 positive and 13 generalized place invariants in 2 ms returned sat
[2025-05-29 17:42:13] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2025-05-29 17:42:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-05-29 17:42:13] [INFO ] [Nat]Absence check using 13 positive and 13 generalized place invariants in 2 ms returned sat
[2025-05-29 17:42:13] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-05-29 17:42:13] [INFO ] Computed and/alt/rep : 110/312/110 causal constraints (skipped 81 transitions) in 11 ms.
[2025-05-29 17:42:13] [INFO ] Added : 34 causal constraints over 7 iterations in 128 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 165 /165 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 165/165 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 212/212 transitions.
Applied a total of 0 rules in 2 ms. Remains 165 /165 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2025-05-29 17:42:13] [INFO ] Invariant cache hit.
[2025-05-29 17:42:13] [INFO ] Implicit Places using invariants in 95 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 164/165 places, 212/212 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 164 transition count 205
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 157 transition count 205
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 18 place count 155 transition count 203
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 155 transition count 201
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 153 transition count 201
Applied a total of 22 rules in 9 ms. Remains 153 /164 variables (removed 11) and now considering 201/212 (removed 11) transitions.
// Phase 1: matrix 201 rows 153 cols
[2025-05-29 17:42:13] [INFO ] Computed 25 invariants in 2 ms
[2025-05-29 17:42:13] [INFO ] Implicit Places using invariants in 80 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 152/165 places, 201/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 192 ms. Remains : 152/165 places, 201/212 transitions.
// Phase 1: matrix 201 rows 152 cols
[2025-05-29 17:42:13] [INFO ] Computed 24 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (28399 resets) in 1233 ms. (810 steps per ms)
BEST_FIRST walk for 1000001 steps (7745 resets) in 512 ms. (1949 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-29 17:42:15] [INFO ] Invariant cache hit.
[2025-05-29 17:42:15] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-05-29 17:42:15] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 2 ms returned sat
[2025-05-29 17:42:15] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2025-05-29 17:42:15] [INFO ] Computed and/alt/rep : 99/303/99 causal constraints (skipped 81 transitions) in 11 ms.
[2025-05-29 17:42:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-05-29 17:42:15] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 3 ms returned sat
[2025-05-29 17:42:15] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-05-29 17:42:15] [INFO ] Computed and/alt/rep : 99/303/99 causal constraints (skipped 81 transitions) in 11 ms.
[2025-05-29 17:42:16] [INFO ] Added : 35 causal constraints over 7 iterations in 113 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 201/201 transitions.
Applied a total of 0 rules in 2 ms. Remains 152 /152 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 152/152 places, 201/201 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 201/201 transitions.
Applied a total of 0 rules in 2 ms. Remains 152 /152 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2025-05-29 17:42:16] [INFO ] Invariant cache hit.
[2025-05-29 17:42:16] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-05-29 17:42:16] [INFO ] Invariant cache hit.
[2025-05-29 17:42:16] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2025-05-29 17:42:16] [INFO ] Redundant transitions in 1 ms returned []
Running 180 sub problems to find dead transitions.
[2025-05-29 17:42:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (OVERLAPS) 2/152 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2025-05-29 17:42:18] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (OVERLAPS) 201/353 variables, 152/177 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 0/353 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 177 constraints, problems are : Problem set: 0 solved, 180 unsolved in 5248 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (OVERLAPS) 2/152 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (OVERLAPS) 201/353 variables, 152/177 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 180/357 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2025-05-29 17:42:23] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2025-05-29 17:42:24] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (OVERLAPS) 0/353 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 359 constraints, problems are : Problem set: 0 solved, 180 unsolved in 9017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 3/3 constraints]
After SMT, in 14324ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 14326ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14562 ms. Remains : 152/152 places, 201/201 transitions.
RANDOM walk for 40000 steps (1114 resets) in 768 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (302 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (281 resets) in 176 ms. (226 steps per ms) remains 2/2 properties
[2025-05-29 17:42:31] [INFO ] Flatten gal took : 97 ms
[2025-05-29 17:42:31] [INFO ] Flatten gal took : 31 ms
[2025-05-29 17:42:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5920231136380834401.gal : 9 ms
[2025-05-29 17:42:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12116075048380258100.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5920231136380834401.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12116075048380258100.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12116075048380258100.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 228
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :228 after 1258
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1258 after 2488
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,21285,0.061603,5912,2,1349,12,5933,6,0,808,3247,0
Total reachable state count : 21285

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.062109,5912,2,153,12,5933,7,0,811,3247,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.06235,5912,2,153,12,5933,8,0,812,3247,0
Interrupted probabilistic random walk after 537313 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 2
Probabilistic random walk after 537313 steps, saw 267494 distinct states, run finished after 3004 ms. (steps per millisecond=178 ) properties seen :0
FORMULA ASLink-PT-03b-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 311762 ms.

BK_STOP 1748540554133

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

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