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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 1.2M 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-08b-UpperBounds-00
FORMULA_NAME ASLink-PT-08b-UpperBounds-01
FORMULA_NAME ASLink-PT-08b-UpperBounds-02
FORMULA_NAME ASLink-PT-08b-UpperBounds-03
FORMULA_NAME ASLink-PT-08b-UpperBounds-04
FORMULA_NAME ASLink-PT-08b-UpperBounds-05
FORMULA_NAME ASLink-PT-08b-UpperBounds-06
FORMULA_NAME ASLink-PT-08b-UpperBounds-07
FORMULA_NAME ASLink-PT-08b-UpperBounds-08
FORMULA_NAME ASLink-PT-08b-UpperBounds-09
FORMULA_NAME ASLink-PT-08b-UpperBounds-10
FORMULA_NAME ASLink-PT-08b-UpperBounds-11
FORMULA_NAME ASLink-PT-08b-UpperBounds-12
FORMULA_NAME ASLink-PT-08b-UpperBounds-13
FORMULA_NAME ASLink-PT-08b-UpperBounds-14
FORMULA_NAME ASLink-PT-08b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748540565174

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-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:42:46] [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:42:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:42:46] [INFO ] Load time of PNML (sax parser for PT used): 222 ms
[2025-05-29 17:42:46] [INFO ] Transformed 3618 places.
[2025-05-29 17:42:46] [INFO ] Transformed 4459 transitions.
[2025-05-29 17:42:46] [INFO ] Found NUPN structural information;
[2025-05-29 17:42:46] [INFO ] Parsed PT model containing 3618 places and 4459 transitions and 13543 arcs in 391 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 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 4459 rows 3618 cols
[2025-05-29 17:42:47] [INFO ] Computed 355 invariants in 173 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 (10 resets) in 78 ms. (126 steps per ms)
FORMULA ASLink-PT-08b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (18 resets) in 131 ms. (681 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-29 17:42:47] [INFO ] Invariant cache hit.
[2025-05-29 17:42:48] [INFO ] [Real]Absence check using 83 positive place invariants in 98 ms returned sat
[2025-05-29 17:42:48] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 112 ms returned sat
[2025-05-29 17:42:50] [INFO ] [Real]Absence check using state equation in 1775 ms returned sat
[2025-05-29 17:42:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:51] [INFO ] [Nat]Absence check using 83 positive place invariants in 104 ms returned sat
[2025-05-29 17:42:51] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 130 ms returned sat
[2025-05-29 17:42:53] [INFO ] [Nat]Absence check using state equation in 1991 ms returned sat
[2025-05-29 17:42:55] [INFO ] Deduced a trap composed of 50 places in 2515 ms of which 190 ms to minimize.
[2025-05-29 17:42:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 17:42:56] [INFO ] [Real]Absence check using 83 positive place invariants in 88 ms returned sat
[2025-05-29 17:42:56] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 112 ms returned sat
[2025-05-29 17:42:58] [INFO ] [Real]Absence check using state equation in 2212 ms returned sat
[2025-05-29 17:42:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:59] [INFO ] [Nat]Absence check using 83 positive place invariants in 88 ms returned sat
[2025-05-29 17:42:59] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 108 ms returned sat
[2025-05-29 17:43:02] [INFO ] [Nat]Absence check using state equation in 2736 ms returned sat
[2025-05-29 17:43:03] [INFO ] Deduced a trap composed of 53 places in 908 ms of which 12 ms to minimize.
[2025-05-29 17:43:03] [INFO ] Deduced a trap composed of 91 places in 406 ms of which 6 ms to minimize.
[2025-05-29 17:43:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:954)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 17:43:04] [INFO ] [Real]Absence check using 83 positive place invariants in 83 ms returned sat
[2025-05-29 17:43:04] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 111 ms returned sat
[2025-05-29 17:43:08] [INFO ] [Real]Absence check using state equation in 3360 ms returned sat
[2025-05-29 17:43:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:08] [INFO ] [Nat]Absence check using 83 positive place invariants in 86 ms returned sat
[2025-05-29 17:43:08] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 107 ms returned sat
[2025-05-29 17:43:11] [INFO ] [Nat]Absence check using state equation in 2381 ms returned sat
[2025-05-29 17:43:13] [INFO ] Deduced a trap composed of 26 places in 1960 ms of which 19 ms to minimize.
[2025-05-29 17:43:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 17:43:14] [INFO ] [Real]Absence check using 83 positive place invariants in 84 ms returned sat
[2025-05-29 17:43:14] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 120 ms returned sat
[2025-05-29 17:43:17] [INFO ] [Real]Absence check using state equation in 2894 ms returned sat
[2025-05-29 17:43:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:17] [INFO ] [Nat]Absence check using 83 positive place invariants in 87 ms returned sat
[2025-05-29 17:43:17] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 109 ms returned sat
[2025-05-29 17:43:19] [INFO ] [Nat]Absence check using state equation in 1831 ms returned sat
[2025-05-29 17:43:21] [INFO ] Deduced a trap composed of 36 places in 2100 ms of which 22 ms to minimize.
[2025-05-29 17:43:24] [INFO ] Deduced a trap composed of 28 places in 2093 ms of which 21 ms to minimize.
[2025-05-29 17:43:24] [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 3
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:43:24] [INFO ] [Real]Absence check using 83 positive place invariants in 90 ms returned sat
[2025-05-29 17:43:24] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 118 ms returned sat
[2025-05-29 17:43:27] [INFO ] [Real]Absence check using state equation in 2510 ms returned sat
[2025-05-29 17:43:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:28] [INFO ] [Nat]Absence check using 83 positive place invariants in 87 ms returned sat
[2025-05-29 17:43:28] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 99 ms returned sat
[2025-05-29 17:43:30] [INFO ] [Nat]Absence check using state equation in 2613 ms returned sat
[2025-05-29 17:43:32] [INFO ] Deduced a trap composed of 216 places in 1355 ms of which 15 ms to minimize.
[2025-05-29 17:43:33] [INFO ] Deduced a trap composed of 105 places in 1313 ms of which 16 ms to minimize.
[2025-05-29 17:43:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 17:43:34] [INFO ] [Real]Absence check using 83 positive place invariants in 86 ms returned sat
[2025-05-29 17:43:34] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 115 ms returned sat
[2025-05-29 17:43:37] [INFO ] [Real]Absence check using state equation in 3266 ms returned sat
[2025-05-29 17:43:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:38] [INFO ] [Nat]Absence check using 83 positive place invariants in 86 ms returned sat
[2025-05-29 17:43:38] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 108 ms returned sat
[2025-05-29 17:43:41] [INFO ] [Nat]Absence check using state equation in 2409 ms returned sat
[2025-05-29 17:43:42] [INFO ] Deduced a trap composed of 23 places in 1806 ms of which 20 ms to minimize.
[2025-05-29 17:43:42] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1925 ms
[2025-05-29 17:43:43] [INFO ] [Real]Absence check using 83 positive place invariants in 89 ms returned sat
[2025-05-29 17:43:43] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 116 ms returned sat
[2025-05-29 17:43:46] [INFO ] [Real]Absence check using state equation in 2450 ms returned sat
[2025-05-29 17:43:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:46] [INFO ] [Nat]Absence check using 83 positive place invariants in 89 ms returned sat
[2025-05-29 17:43:46] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 115 ms returned sat
[2025-05-29 17:43:50] [INFO ] [Nat]Absence check using state equation in 3218 ms returned sat
[2025-05-29 17:43:51] [INFO ] Deduced a trap composed of 90 places in 1265 ms of which 15 ms to minimize.
[2025-05-29 17:43:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.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:43:52] [INFO ] [Real]Absence check using 83 positive place invariants in 89 ms returned sat
[2025-05-29 17:43:52] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 123 ms returned sat
[2025-05-29 17:43:54] [INFO ] [Real]Absence check using state equation in 1711 ms returned sat
[2025-05-29 17:43:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:54] [INFO ] [Nat]Absence check using 83 positive place invariants in 90 ms returned sat
[2025-05-29 17:43:54] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 109 ms returned sat
[2025-05-29 17:43:56] [INFO ] [Nat]Absence check using state equation in 1691 ms returned sat
[2025-05-29 17:43:56] [INFO ] Computed and/alt/rep : 3767/8216/3767 causal constraints (skipped 691 transitions) in 266 ms.
[2025-05-29 17:43:59] [INFO ] Added : 50 causal constraints over 10 iterations in 2443 ms. Result :unknown
[2025-05-29 17:43:59] [INFO ] [Real]Absence check using 83 positive place invariants in 85 ms returned sat
[2025-05-29 17:43:59] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 118 ms returned sat
[2025-05-29 17:44:02] [INFO ] [Real]Absence check using state equation in 2908 ms returned sat
[2025-05-29 17:44:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:03] [INFO ] [Nat]Absence check using 83 positive place invariants in 93 ms returned sat
[2025-05-29 17:44:03] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 96 ms returned sat
[2025-05-29 17:44:05] [INFO ] [Nat]Absence check using state equation in 2197 ms returned sat
[2025-05-29 17:44:07] [INFO ] Deduced a trap composed of 58 places in 1166 ms of which 15 ms to minimize.
[2025-05-29 17:44:08] [INFO ] Deduced a trap composed of 58 places in 1154 ms of which 14 ms to minimize.
[2025-05-29 17:44:08] [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 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 3618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3618/3618 places, 4459/4459 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 835 transitions
Trivial Post-agglo rules discarded 835 transitions
Performed 835 trivial Post agglomeration. Transition count delta: 835
Iterating post reduction 0 with 835 rules applied. Total rules applied 835 place count 3618 transition count 3624
Reduce places removed 835 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 873 rules applied. Total rules applied 1708 place count 2783 transition count 3586
Reduce places removed 10 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 14 rules applied. Total rules applied 1722 place count 2773 transition count 3582
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1726 place count 2769 transition count 3582
Performed 842 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 842 Pre rules applied. Total rules applied 1726 place count 2769 transition count 2740
Deduced a syphon composed of 842 places in 8 ms
Ensure Unique test removed 82 places
Reduce places removed 924 places and 0 transitions.
Iterating global reduction 4 with 1766 rules applied. Total rules applied 3492 place count 1845 transition count 2740
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 59 rules applied. Total rules applied 3551 place count 1836 transition count 2690
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 5 with 50 rules applied. Total rules applied 3601 place count 1786 transition count 2690
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 3601 place count 1786 transition count 2658
Deduced a syphon composed of 32 places in 7 ms
Ensure Unique test removed 32 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 3697 place count 1722 transition count 2658
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 3697 place count 1722 transition count 2626
Deduced a syphon composed of 32 places in 6 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 3761 place count 1690 transition count 2626
Discarding 113 places :
Symmetric choice reduction at 6 with 113 rule applications. Total rules 3874 place count 1577 transition count 2513
Iterating global reduction 6 with 113 rules applied. Total rules applied 3987 place count 1577 transition count 2513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3988 place count 1577 transition count 2512
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 36 Pre rules applied. Total rules applied 3988 place count 1577 transition count 2476
Deduced a syphon composed of 36 places in 16 ms
Ensure Unique test removed 1 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 7 with 73 rules applied. Total rules applied 4061 place count 1540 transition count 2476
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4061 place count 1540 transition count 2475
Deduced a syphon composed of 1 places in 16 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 4064 place count 1538 transition count 2475
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 4072 place count 1530 transition count 2424
Iterating global reduction 7 with 8 rules applied. Total rules applied 4080 place count 1530 transition count 2424
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 4080 place count 1530 transition count 2419
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 4090 place count 1525 transition count 2419
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4091 place count 1524 transition count 2411
Iterating global reduction 7 with 1 rules applied. Total rules applied 4092 place count 1524 transition count 2411
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4093 place count 1523 transition count 2403
Iterating global reduction 7 with 1 rules applied. Total rules applied 4094 place count 1523 transition count 2403
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4095 place count 1522 transition count 2395
Iterating global reduction 7 with 1 rules applied. Total rules applied 4096 place count 1522 transition count 2395
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4097 place count 1521 transition count 2387
Iterating global reduction 7 with 1 rules applied. Total rules applied 4098 place count 1521 transition count 2387
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4099 place count 1520 transition count 2379
Iterating global reduction 7 with 1 rules applied. Total rules applied 4100 place count 1520 transition count 2379
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4101 place count 1519 transition count 2371
Iterating global reduction 7 with 1 rules applied. Total rules applied 4102 place count 1519 transition count 2371
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4103 place count 1518 transition count 2363
Iterating global reduction 7 with 1 rules applied. Total rules applied 4104 place count 1518 transition count 2363
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4105 place count 1517 transition count 2355
Iterating global reduction 7 with 1 rules applied. Total rules applied 4106 place count 1517 transition count 2355
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4107 place count 1516 transition count 2347
Iterating global reduction 7 with 1 rules applied. Total rules applied 4108 place count 1516 transition count 2347
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4109 place count 1515 transition count 2339
Iterating global reduction 7 with 1 rules applied. Total rules applied 4110 place count 1515 transition count 2339
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4111 place count 1514 transition count 2331
Iterating global reduction 7 with 1 rules applied. Total rules applied 4112 place count 1514 transition count 2331
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4113 place count 1513 transition count 2323
Iterating global reduction 7 with 1 rules applied. Total rules applied 4114 place count 1513 transition count 2323
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4115 place count 1512 transition count 2315
Iterating global reduction 7 with 1 rules applied. Total rules applied 4116 place count 1512 transition count 2315
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4117 place count 1511 transition count 2307
Iterating global reduction 7 with 1 rules applied. Total rules applied 4118 place count 1511 transition count 2307
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4119 place count 1510 transition count 2299
Iterating global reduction 7 with 1 rules applied. Total rules applied 4120 place count 1510 transition count 2299
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4121 place count 1509 transition count 2291
Iterating global reduction 7 with 1 rules applied. Total rules applied 4122 place count 1509 transition count 2291
Performed 213 Post agglomeration using F-continuation condition.Transition count delta: 213
Deduced a syphon composed of 213 places in 3 ms
Reduce places removed 213 places and 0 transitions.
Iterating global reduction 7 with 426 rules applied. Total rules applied 4548 place count 1296 transition count 2078
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4549 place count 1295 transition count 2077
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 4551 place count 1294 transition count 2077
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4552 place count 1293 transition count 2076
Iterating global reduction 7 with 1 rules applied. Total rules applied 4553 place count 1293 transition count 2076
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 7 with 2 rules applied. Total rules applied 4555 place count 1293 transition count 2074
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4556 place count 1292 transition count 2074
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4558 place count 1291 transition count 2083
Free-agglomeration rule applied 9 times.
Iterating global reduction 9 with 9 rules applied. Total rules applied 4567 place count 1291 transition count 2074
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 4576 place count 1282 transition count 2074
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 10 with 9 rules applied. Total rules applied 4585 place count 1282 transition count 2065
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4594 place count 1273 transition count 2065
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 4595 place count 1273 transition count 2065
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4596 place count 1272 transition count 2064
Reduce places removed 14 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 20 rules applied. Total rules applied 4616 place count 1258 transition count 2058
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 4622 place count 1252 transition count 2058
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 22 Pre rules applied. Total rules applied 4622 place count 1252 transition count 2036
Deduced a syphon composed of 22 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 13 with 45 rules applied. Total rules applied 4667 place count 1229 transition count 2036
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 13 with 8 rules applied. Total rules applied 4675 place count 1221 transition count 2036
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 4675 place count 1221 transition count 2035
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 4677 place count 1220 transition count 2035
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 4678 place count 1219 transition count 2034
Iterating global reduction 14 with 1 rules applied. Total rules applied 4679 place count 1219 transition count 2034
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 4680 place count 1218 transition count 2033
Iterating global reduction 14 with 1 rules applied. Total rules applied 4681 place count 1218 transition count 2033
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 4682 place count 1217 transition count 2032
Iterating global reduction 14 with 1 rules applied. Total rules applied 4683 place count 1217 transition count 2032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 4684 place count 1217 transition count 2031
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 15 with 30 rules applied. Total rules applied 4714 place count 1202 transition count 2016
Discarding 6 places :
Symmetric choice reduction at 15 with 6 rule applications. Total rules 4720 place count 1196 transition count 2010
Iterating global reduction 15 with 6 rules applied. Total rules applied 4726 place count 1196 transition count 2010
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 4727 place count 1195 transition count 2009
Iterating global reduction 15 with 1 rules applied. Total rules applied 4728 place count 1195 transition count 2009
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 4729 place count 1195 transition count 2008
Free-agglomeration rule applied 5 times.
Iterating global reduction 16 with 5 rules applied. Total rules applied 4734 place count 1195 transition count 2003
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 4739 place count 1190 transition count 2003
Applied a total of 4739 rules in 3150 ms. Remains 1190 /3618 variables (removed 2428) and now considering 2003/4459 (removed 2456) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3160 ms. Remains : 1190/3618 places, 2003/4459 transitions.
// Phase 1: matrix 2003 rows 1190 cols
[2025-05-29 17:44:13] [INFO ] Computed 206 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-08b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (10217 resets) in 3374 ms. (296 steps per ms)
BEST_FIRST walk for 7000003 steps (9050 resets) in 10264 ms. (681 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-05-29 17:44:27] [INFO ] Invariant cache hit.
[2025-05-29 17:44:27] [INFO ] [Real]Absence check using 53 positive place invariants in 25 ms returned sat
[2025-05-29 17:44:27] [INFO ] [Real]Absence check using 53 positive and 153 generalized place invariants in 34 ms returned sat
[2025-05-29 17:44:27] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2025-05-29 17:44:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:27] [INFO ] [Nat]Absence check using 53 positive place invariants in 20 ms returned sat
[2025-05-29 17:44:28] [INFO ] [Nat]Absence check using 53 positive and 153 generalized place invariants in 31 ms returned sat
[2025-05-29 17:44:28] [INFO ] [Nat]Absence check using state equation in 684 ms returned sat
[2025-05-29 17:44:28] [INFO ] Computed and/alt/rep : 819/3187/819 causal constraints (skipped 1140 transitions) in 115 ms.
[2025-05-29 17:44:40] [INFO ] Added : 570 causal constraints over 114 iterations in 11297 ms. Result :sat
Minimization took 1621 ms.
[2025-05-29 17:44:41] [INFO ] [Real]Absence check using 53 positive place invariants in 19 ms returned sat
[2025-05-29 17:44:41] [INFO ] [Real]Absence check using 53 positive and 153 generalized place invariants in 33 ms returned sat
[2025-05-29 17:44:42] [INFO ] [Real]Absence check using state equation in 712 ms returned sat
[2025-05-29 17:44:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:42] [INFO ] [Nat]Absence check using 53 positive place invariants in 19 ms returned sat
[2025-05-29 17:44:42] [INFO ] [Nat]Absence check using 53 positive and 153 generalized place invariants in 36 ms returned sat
[2025-05-29 17:44:43] [INFO ] [Nat]Absence check using state equation in 612 ms returned sat
[2025-05-29 17:44:43] [INFO ] Computed and/alt/rep : 819/3187/819 causal constraints (skipped 1140 transitions) in 113 ms.
[2025-05-29 17:44:52] [INFO ] Added : 459 causal constraints over 92 iterations in 9390 ms. Result :sat
Minimization took 1603 ms.
[2025-05-29 17:44:54] [INFO ] [Real]Absence check using 53 positive place invariants in 20 ms returned sat
[2025-05-29 17:44:54] [INFO ] [Real]Absence check using 53 positive and 153 generalized place invariants in 33 ms returned sat
[2025-05-29 17:44:55] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2025-05-29 17:44:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:55] [INFO ] [Nat]Absence check using 53 positive place invariants in 19 ms returned sat
[2025-05-29 17:44:55] [INFO ] [Nat]Absence check using 53 positive and 153 generalized place invariants in 32 ms returned sat
[2025-05-29 17:44:56] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2025-05-29 17:44:56] [INFO ] Computed and/alt/rep : 819/3187/819 causal constraints (skipped 1140 transitions) in 107 ms.
[2025-05-29 17:45:08] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 1 ms to minimize.
[2025-05-29 17:45:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2025-05-29 17:45:08] [INFO ] Added : 559 causal constraints over 112 iterations in 12106 ms. Result :sat
Minimization took 1748 ms.
[2025-05-29 17:45:10] [INFO ] [Real]Absence check using 53 positive place invariants in 17 ms returned sat
[2025-05-29 17:45:10] [INFO ] [Real]Absence check using 53 positive and 153 generalized place invariants in 31 ms returned sat
[2025-05-29 17:45:11] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2025-05-29 17:45:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:11] [INFO ] [Nat]Absence check using 53 positive place invariants in 19 ms returned sat
[2025-05-29 17:45:11] [INFO ] [Nat]Absence check using 53 positive and 153 generalized place invariants in 32 ms returned sat
[2025-05-29 17:45:12] [INFO ] [Nat]Absence check using state equation in 796 ms returned sat
[2025-05-29 17:45:12] [INFO ] Computed and/alt/rep : 819/3187/819 causal constraints (skipped 1140 transitions) in 112 ms.
[2025-05-29 17:45:24] [INFO ] Added : 587 causal constraints over 118 iterations in 12572 ms. Result :sat
Minimization took 2091 ms.
[2025-05-29 17:45:27] [INFO ] [Real]Absence check using 53 positive place invariants in 20 ms returned sat
[2025-05-29 17:45:27] [INFO ] [Real]Absence check using 53 positive and 153 generalized place invariants in 41 ms returned sat
[2025-05-29 17:45:27] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2025-05-29 17:45:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:28] [INFO ] [Nat]Absence check using 53 positive place invariants in 18 ms returned sat
[2025-05-29 17:45:28] [INFO ] [Nat]Absence check using 53 positive and 153 generalized place invariants in 39 ms returned sat
[2025-05-29 17:45:28] [INFO ] [Nat]Absence check using state equation in 611 ms returned sat
[2025-05-29 17:45:28] [INFO ] Computed and/alt/rep : 819/3187/819 causal constraints (skipped 1140 transitions) in 110 ms.
[2025-05-29 17:45:42] [INFO ] Added : 669 causal constraints over 134 iterations in 13509 ms. Result :sat
Minimization took 1999 ms.
[2025-05-29 17:45:44] [INFO ] [Real]Absence check using 53 positive place invariants in 19 ms returned sat
[2025-05-29 17:45:44] [INFO ] [Real]Absence check using 53 positive and 153 generalized place invariants in 36 ms returned sat
[2025-05-29 17:45:45] [INFO ] [Real]Absence check using state equation in 576 ms returned sat
[2025-05-29 17:45:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:45] [INFO ] [Nat]Absence check using 53 positive place invariants in 19 ms returned sat
[2025-05-29 17:45:45] [INFO ] [Nat]Absence check using 53 positive and 153 generalized place invariants in 34 ms returned sat
[2025-05-29 17:45:46] [INFO ] [Nat]Absence check using state equation in 834 ms returned sat
[2025-05-29 17:45:46] [INFO ] Computed and/alt/rep : 819/3187/819 causal constraints (skipped 1140 transitions) in 111 ms.
[2025-05-29 17:45:58] [INFO ] Added : 615 causal constraints over 123 iterations in 12058 ms. Result :sat
Minimization took 1705 ms.
[2025-05-29 17:46:00] [INFO ] [Real]Absence check using 53 positive place invariants in 19 ms returned sat
[2025-05-29 17:46:00] [INFO ] [Real]Absence check using 53 positive and 153 generalized place invariants in 44 ms returned sat
[2025-05-29 17:46:00] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2025-05-29 17:46:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:46:01] [INFO ] [Nat]Absence check using 53 positive place invariants in 18 ms returned sat
[2025-05-29 17:46:01] [INFO ] [Nat]Absence check using 53 positive and 153 generalized place invariants in 31 ms returned sat
[2025-05-29 17:46:01] [INFO ] [Nat]Absence check using state equation in 639 ms returned sat
[2025-05-29 17:46:01] [INFO ] Computed and/alt/rep : 819/3187/819 causal constraints (skipped 1140 transitions) in 98 ms.
[2025-05-29 17:46:14] [INFO ] Added : 635 causal constraints over 127 iterations in 12466 ms. Result :sat
Minimization took 1799 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 1190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1190/1190 places, 2003/2003 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 1190 transition count 2002
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1189 transition count 2002
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1188 transition count 2001
Applied a total of 4 rules in 86 ms. Remains 1188 /1190 variables (removed 2) and now considering 2001/2003 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 1188/1190 places, 2001/2003 transitions.
// Phase 1: matrix 2001 rows 1188 cols
[2025-05-29 17:46:29] [INFO ] Computed 206 invariants in 41 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (10294 resets) in 3335 ms. (299 steps per ms)
FORMULA ASLink-PT-08b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6000006 steps (7761 resets) in 8894 ms. (674 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:46:41] [INFO ] Invariant cache hit.
[2025-05-29 17:46:41] [INFO ] [Real]Absence check using 52 positive place invariants in 17 ms returned sat
[2025-05-29 17:46:41] [INFO ] [Real]Absence check using 52 positive and 154 generalized place invariants in 32 ms returned sat
[2025-05-29 17:46:42] [INFO ] [Real]Absence check using state equation in 759 ms returned sat
[2025-05-29 17:46:42] [INFO ] Deduced a trap composed of 142 places in 303 ms of which 11 ms to minimize.
[2025-05-29 17:46:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:46:43] [INFO ] [Nat]Absence check using 52 positive place invariants in 19 ms returned sat
[2025-05-29 17:46:43] [INFO ] [Nat]Absence check using 52 positive and 154 generalized place invariants in 34 ms returned sat
[2025-05-29 17:46:43] [INFO ] [Nat]Absence check using state equation in 644 ms returned sat
[2025-05-29 17:46:44] [INFO ] Computed and/alt/rep : 809/3106/809 causal constraints (skipped 1148 transitions) in 109 ms.
[2025-05-29 17:46:58] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 2 ms to minimize.
[2025-05-29 17:46:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2025-05-29 17:46:58] [INFO ] Added : 637 causal constraints over 128 iterations in 14424 ms. Result :sat
Minimization took 1512 ms.
[2025-05-29 17:47:00] [INFO ] [Real]Absence check using 52 positive place invariants in 18 ms returned sat
[2025-05-29 17:47:00] [INFO ] [Real]Absence check using 52 positive and 154 generalized place invariants in 33 ms returned sat
[2025-05-29 17:47:00] [INFO ] [Real]Absence check using state equation in 645 ms returned sat
[2025-05-29 17:47:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:47:00] [INFO ] [Nat]Absence check using 52 positive place invariants in 18 ms returned sat
[2025-05-29 17:47:01] [INFO ] [Nat]Absence check using 52 positive and 154 generalized place invariants in 32 ms returned sat
[2025-05-29 17:47:01] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2025-05-29 17:47:01] [INFO ] Computed and/alt/rep : 809/3106/809 causal constraints (skipped 1148 transitions) in 108 ms.
[2025-05-29 17:47:16] [INFO ] Added : 639 causal constraints over 128 iterations in 14452 ms. Result :sat
Minimization took 1408 ms.
[2025-05-29 17:47:17] [INFO ] [Real]Absence check using 52 positive place invariants in 18 ms returned sat
[2025-05-29 17:47:17] [INFO ] [Real]Absence check using 52 positive and 154 generalized place invariants in 34 ms returned sat
[2025-05-29 17:47:18] [INFO ] [Real]Absence check using state equation in 645 ms returned sat
[2025-05-29 17:47:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:47:18] [INFO ] [Nat]Absence check using 52 positive place invariants in 19 ms returned sat
[2025-05-29 17:47:18] [INFO ] [Nat]Absence check using 52 positive and 154 generalized place invariants in 33 ms returned sat
[2025-05-29 17:47:19] [INFO ] [Nat]Absence check using state equation in 637 ms returned sat
[2025-05-29 17:47:19] [INFO ] Computed and/alt/rep : 809/3106/809 causal constraints (skipped 1148 transitions) in 111 ms.
[2025-05-29 17:47:22] [INFO ] Added : 153 causal constraints over 31 iterations in 3338 ms. Result :sat
Minimization took 947 ms.
[2025-05-29 17:47:23] [INFO ] [Real]Absence check using 52 positive place invariants in 18 ms returned sat
[2025-05-29 17:47:23] [INFO ] [Real]Absence check using 52 positive and 154 generalized place invariants in 31 ms returned sat
[2025-05-29 17:47:24] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2025-05-29 17:47:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:47:24] [INFO ] [Nat]Absence check using 52 positive place invariants in 23 ms returned sat
[2025-05-29 17:47:24] [INFO ] [Nat]Absence check using 52 positive and 154 generalized place invariants in 32 ms returned sat
[2025-05-29 17:47:25] [INFO ] [Nat]Absence check using state equation in 641 ms returned sat
[2025-05-29 17:47:25] [INFO ] Computed and/alt/rep : 809/3106/809 causal constraints (skipped 1148 transitions) in 98 ms.
[2025-05-29 17:47:39] [INFO ] Added : 677 causal constraints over 136 iterations in 13985 ms. Result :sat
Minimization took 1485 ms.
[2025-05-29 17:47:41] [INFO ] [Real]Absence check using 52 positive place invariants in 17 ms returned sat
[2025-05-29 17:47:41] [INFO ] [Real]Absence check using 52 positive and 154 generalized place invariants in 31 ms returned sat
[2025-05-29 17:47:41] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2025-05-29 17:47:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:47:41] [INFO ] [Nat]Absence check using 52 positive place invariants in 17 ms returned sat
[2025-05-29 17:47:41] [INFO ] [Nat]Absence check using 52 positive and 154 generalized place invariants in 30 ms returned sat
[2025-05-29 17:47:42] [INFO ] [Nat]Absence check using state equation in 640 ms returned sat
[2025-05-29 17:47:42] [INFO ] Computed and/alt/rep : 809/3106/809 causal constraints (skipped 1148 transitions) in 98 ms.
[2025-05-29 17:47:55] [INFO ] Added : 635 causal constraints over 127 iterations in 13037 ms. Result :sat
Minimization took 1387 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 1188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1188/1188 places, 2001/2001 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 1188 transition count 2000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1187 transition count 2000
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 1187 transition count 1999
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1186 transition count 1999
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 1184 transition count 1998
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 1184 transition count 1997
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 1183 transition count 1997
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 1182 transition count 1997
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 1180 transition count 1995
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 1179 transition count 1994
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 1179 transition count 1994
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 1179 transition count 1993
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 1178 transition count 1993
Applied a total of 18 rules in 183 ms. Remains 1178 /1188 variables (removed 10) and now considering 1993/2001 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 1178/1188 places, 1993/2001 transitions.
// Phase 1: matrix 1993 rows 1178 cols
[2025-05-29 17:48:04] [INFO ] Computed 204 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (10384 resets) in 3293 ms. (303 steps per ms)
BEST_FIRST walk for 5000004 steps (6472 resets) in 7324 ms. (682 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:48:14] [INFO ] Invariant cache hit.
[2025-05-29 17:48:14] [INFO ] [Real]Absence check using 53 positive place invariants in 17 ms returned sat
[2025-05-29 17:48:14] [INFO ] [Real]Absence check using 53 positive and 151 generalized place invariants in 30 ms returned sat
[2025-05-29 17:48:15] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2025-05-29 17:48:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:15] [INFO ] [Nat]Absence check using 53 positive place invariants in 22 ms returned sat
[2025-05-29 17:48:15] [INFO ] [Nat]Absence check using 53 positive and 151 generalized place invariants in 29 ms returned sat
[2025-05-29 17:48:16] [INFO ] [Nat]Absence check using state equation in 546 ms returned sat
[2025-05-29 17:48:16] [INFO ] Computed and/alt/rep : 802/3089/802 causal constraints (skipped 1148 transitions) in 95 ms.
[2025-05-29 17:48:25] [INFO ] Added : 488 causal constraints over 98 iterations in 9363 ms. Result :sat
Minimization took 1946 ms.
[2025-05-29 17:48:27] [INFO ] [Real]Absence check using 53 positive place invariants in 16 ms returned sat
[2025-05-29 17:48:27] [INFO ] [Real]Absence check using 53 positive and 151 generalized place invariants in 32 ms returned sat
[2025-05-29 17:48:28] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2025-05-29 17:48:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:28] [INFO ] [Nat]Absence check using 53 positive place invariants in 22 ms returned sat
[2025-05-29 17:48:28] [INFO ] [Nat]Absence check using 53 positive and 151 generalized place invariants in 32 ms returned sat
[2025-05-29 17:48:29] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2025-05-29 17:48:29] [INFO ] Computed and/alt/rep : 802/3089/802 causal constraints (skipped 1148 transitions) in 93 ms.
[2025-05-29 17:48:39] [INFO ] Added : 525 causal constraints over 105 iterations in 10106 ms. Result :sat
Minimization took 1810 ms.
[2025-05-29 17:48:41] [INFO ] [Real]Absence check using 53 positive place invariants in 17 ms returned sat
[2025-05-29 17:48:41] [INFO ] [Real]Absence check using 53 positive and 151 generalized place invariants in 30 ms returned sat
[2025-05-29 17:48:42] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2025-05-29 17:48:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:42] [INFO ] [Nat]Absence check using 53 positive place invariants in 18 ms returned sat
[2025-05-29 17:48:42] [INFO ] [Nat]Absence check using 53 positive and 151 generalized place invariants in 28 ms returned sat
[2025-05-29 17:48:42] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2025-05-29 17:48:43] [INFO ] Deduced a trap composed of 159 places in 443 ms of which 6 ms to minimize.
[2025-05-29 17:48:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 556 ms
[2025-05-29 17:48:43] [INFO ] Computed and/alt/rep : 802/3089/802 causal constraints (skipped 1148 transitions) in 84 ms.
[2025-05-29 17:48:45] [INFO ] Added : 110 causal constraints over 22 iterations in 2248 ms. Result :sat
Minimization took 1478 ms.
[2025-05-29 17:48:47] [INFO ] [Real]Absence check using 53 positive place invariants in 20 ms returned sat
[2025-05-29 17:48:47] [INFO ] [Real]Absence check using 53 positive and 151 generalized place invariants in 30 ms returned sat
[2025-05-29 17:48:47] [INFO ] [Real]Absence check using state equation in 555 ms returned sat
[2025-05-29 17:48:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:48] [INFO ] [Nat]Absence check using 53 positive place invariants in 19 ms returned sat
[2025-05-29 17:48:48] [INFO ] [Nat]Absence check using 53 positive and 151 generalized place invariants in 29 ms returned sat
[2025-05-29 17:48:48] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2025-05-29 17:48:48] [INFO ] Computed and/alt/rep : 802/3089/802 causal constraints (skipped 1148 transitions) in 94 ms.
[2025-05-29 17:48:59] [INFO ] Added : 575 causal constraints over 115 iterations in 11201 ms. Result :sat
Minimization took 1891 ms.
[2025-05-29 17:49:02] [INFO ] [Real]Absence check using 53 positive place invariants in 18 ms returned sat
[2025-05-29 17:49:02] [INFO ] [Real]Absence check using 53 positive and 151 generalized place invariants in 30 ms returned sat
[2025-05-29 17:49:02] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2025-05-29 17:49:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:49:02] [INFO ] [Nat]Absence check using 53 positive place invariants in 18 ms returned sat
[2025-05-29 17:49:02] [INFO ] [Nat]Absence check using 53 positive and 151 generalized place invariants in 29 ms returned sat
[2025-05-29 17:49:03] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2025-05-29 17:49:03] [INFO ] Deduced a trap composed of 102 places in 159 ms of which 2 ms to minimize.
[2025-05-29 17:49:03] [INFO ] Deduced a trap composed of 91 places in 181 ms of which 2 ms to minimize.
[2025-05-29 17:49:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 516 ms
[2025-05-29 17:49:04] [INFO ] Computed and/alt/rep : 802/3089/802 causal constraints (skipped 1148 transitions) in 86 ms.
[2025-05-29 17:49:05] [INFO ] Added : 90 causal constraints over 18 iterations in 1896 ms. Result :sat
Minimization took 1709 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 1178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1178/1178 places, 1993/1993 transitions.
Applied a total of 0 rules in 36 ms. Remains 1178 /1178 variables (removed 0) and now considering 1993/1993 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 1178/1178 places, 1993/1993 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1178/1178 places, 1993/1993 transitions.
Applied a total of 0 rules in 35 ms. Remains 1178 /1178 variables (removed 0) and now considering 1993/1993 (removed 0) transitions.
[2025-05-29 17:49:14] [INFO ] Invariant cache hit.
[2025-05-29 17:49:15] [INFO ] Implicit Places using invariants in 1072 ms returned [1, 18, 19, 31, 48, 66, 137, 141, 150, 151, 153, 170, 188, 209, 259, 260, 271, 272, 293, 311, 331, 380, 385, 386, 397, 398, 400, 417, 435, 504, 508, 509, 520, 521, 523, 540, 558, 634, 638, 639, 650, 651, 652, 654, 671, 689, 758, 762, 763, 774, 775, 777, 794, 812, 881, 885, 886, 897, 898, 900, 917, 935, 1004, 1008, 1009, 1012, 1023, 1024, 1025, 1043, 1045, 1049, 1067, 1068, 1069, 1070, 1082, 1088, 1094, 1100, 1106, 1112, 1118, 1124, 1130, 1136, 1142]
[2025-05-29 17:49:15] [INFO ] Actually due to overlaps returned [1043, 1025, 48, 170, 293, 417, 523, 540, 671, 794, 917, 1049, 31, 400, 654, 777, 900, 150, 153, 271, 397, 520, 651, 774, 897, 1023, 1067, 151, 272, 398, 521, 652, 775, 898, 1024, 1045, 1068, 1, 18, 259, 260, 385, 386, 508, 509, 638, 639, 762, 763, 885, 886, 1008, 1009, 66, 435, 558, 650, 689, 812, 935, 1069, 1112, 1130, 1142, 19, 188, 209, 311, 331, 380, 1012, 1070, 1082, 1088, 1094, 1100, 1106, 1118, 1124, 1136]
Discarding 80 places :
Implicit Place search using SMT only with invariants took 1089 ms to find 80 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1098/1178 places, 1993/1993 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 157 rules applied. Total rules applied 157 place count 1092 transition count 1842
Reduce places removed 151 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 156 rules applied. Total rules applied 313 place count 941 transition count 1837
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 313 place count 941 transition count 1795
Deduced a syphon composed of 42 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 85 rules applied. Total rules applied 398 place count 898 transition count 1795
Discarding 5 places :
Implicit places reduction removed 5 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 2 with 13 rules applied. Total rules applied 411 place count 893 transition count 1787
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 419 place count 885 transition count 1787
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 434 place count 870 transition count 1772
Iterating global reduction 4 with 15 rules applied. Total rules applied 449 place count 870 transition count 1772
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 452 place count 870 transition count 1769
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 452 place count 870 transition count 1768
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 454 place count 869 transition count 1768
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 457 place count 866 transition count 1762
Iterating global reduction 5 with 3 rules applied. Total rules applied 460 place count 866 transition count 1762
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 461 place count 865 transition count 1761
Iterating global reduction 5 with 1 rules applied. Total rules applied 462 place count 865 transition count 1761
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 463 place count 864 transition count 1759
Iterating global reduction 5 with 1 rules applied. Total rules applied 464 place count 864 transition count 1759
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 5 with 120 rules applied. Total rules applied 584 place count 804 transition count 1699
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 591 place count 797 transition count 1691
Iterating global reduction 5 with 7 rules applied. Total rules applied 598 place count 797 transition count 1691
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 604 place count 797 transition count 1685
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 608 place count 795 transition count 1686
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 610 place count 795 transition count 1684
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 612 place count 793 transition count 1684
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 7 with 19 rules applied. Total rules applied 631 place count 793 transition count 1665
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 651 place count 773 transition count 1665
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 652 place count 773 transition count 1664
Partial Free-agglomeration rule applied 24 times.
Drop transitions (Partial Free agglomeration) removed 24 transitions
Iterating global reduction 8 with 24 rules applied. Total rules applied 676 place count 773 transition count 1664
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 677 place count 773 transition count 1663
Applied a total of 677 rules in 443 ms. Remains 773 /1098 variables (removed 325) and now considering 1663/1993 (removed 330) transitions.
// Phase 1: matrix 1663 rows 773 cols
[2025-05-29 17:49:15] [INFO ] Computed 111 invariants in 15 ms
[2025-05-29 17:49:16] [INFO ] Implicit Places using invariants in 662 ms returned [72, 90, 96, 99, 101, 102, 105, 106, 174, 180, 183, 185, 190, 191, 267, 273, 276, 278, 283, 284, 336, 353, 359, 362, 364, 369, 370, 423, 440, 446, 449, 451, 456, 457, 509, 526, 532, 535, 537, 542, 543, 595, 612, 618, 621, 623, 628, 629, 681, 698, 704, 707, 709]
[2025-05-29 17:49:16] [INFO ] Actually due to overlaps returned [105, 190, 283, 369, 456, 542, 628, 106, 191, 284, 370, 457, 543, 629, 96, 101, 174, 180, 185, 267, 273, 278, 353, 359, 364, 440, 446, 451, 526, 532, 537, 612, 618, 623, 698, 704, 709, 72, 90, 102, 336, 423, 509, 595, 681]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 666 ms to find 45 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 728/1178 places, 1663/1993 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 697 transition count 1632
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 697 transition count 1632
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 690 transition count 1625
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 690 transition count 1625
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 104 place count 676 transition count 1611
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 128 place count 676 transition count 1587
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 152 place count 652 transition count 1587
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 158 place count 652 transition count 1581
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 164 place count 646 transition count 1581
Applied a total of 164 rules in 115 ms. Remains 646 /728 variables (removed 82) and now considering 1581/1663 (removed 82) transitions.
// Phase 1: matrix 1581 rows 646 cols
[2025-05-29 17:49:16] [INFO ] Computed 66 invariants in 11 ms
[2025-05-29 17:49:16] [INFO ] Implicit Places using invariants in 462 ms returned []
[2025-05-29 17:49:16] [INFO ] Invariant cache hit.
[2025-05-29 17:49:18] [INFO ] Implicit Places using invariants and state equation in 1234 ms returned []
Implicit Place search using SMT with State Equation took 1716 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 646/1178 places, 1581/1993 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4068 ms. Remains : 646/1178 places, 1581/1993 transitions.
[2025-05-29 17:49:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (16952 resets) in 2370 ms. (421 steps per ms)
BEST_FIRST walk for 5000005 steps (14038 resets) in 4081 ms. (1224 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:49:24] [INFO ] Invariant cache hit.
[2025-05-29 17:49:24] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-05-29 17:49:24] [INFO ] [Real]Absence check using 13 positive and 53 generalized place invariants in 17 ms returned sat
[2025-05-29 17:49:24] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2025-05-29 17:49:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:49:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-05-29 17:49:25] [INFO ] [Nat]Absence check using 13 positive and 53 generalized place invariants in 14 ms returned sat
[2025-05-29 17:49:25] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2025-05-29 17:49:25] [INFO ] Computed and/alt/rep : 375/1665/375 causal constraints (skipped 1165 transitions) in 74 ms.
[2025-05-29 17:49:26] [INFO ] Added : 34 causal constraints over 7 iterations in 605 ms. Result :sat
Minimization took 536 ms.
[2025-05-29 17:49:26] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-05-29 17:49:26] [INFO ] [Real]Absence check using 13 positive and 53 generalized place invariants in 15 ms returned sat
[2025-05-29 17:49:27] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2025-05-29 17:49:27] [INFO ] Computed and/alt/rep : 375/1665/375 causal constraints (skipped 1165 transitions) in 78 ms.
[2025-05-29 17:49:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:49:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-05-29 17:49:27] [INFO ] [Nat]Absence check using 13 positive and 53 generalized place invariants in 15 ms returned sat
[2025-05-29 17:49:27] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2025-05-29 17:49:28] [INFO ] Computed and/alt/rep : 375/1665/375 causal constraints (skipped 1165 transitions) in 80 ms.
[2025-05-29 17:49:29] [INFO ] Added : 54 causal constraints over 11 iterations in 1016 ms. Result :sat
Minimization took 545 ms.
[2025-05-29 17:49:29] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-05-29 17:49:29] [INFO ] [Real]Absence check using 13 positive and 53 generalized place invariants in 14 ms returned sat
[2025-05-29 17:49:30] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2025-05-29 17:49:30] [INFO ] Computed and/alt/rep : 375/1665/375 causal constraints (skipped 1165 transitions) in 86 ms.
[2025-05-29 17:49:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:49:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-05-29 17:49:30] [INFO ] [Nat]Absence check using 13 positive and 53 generalized place invariants in 15 ms returned sat
[2025-05-29 17:49:31] [INFO ] [Nat]Absence check using state equation in 511 ms returned sat
[2025-05-29 17:49:31] [INFO ] Computed and/alt/rep : 375/1665/375 causal constraints (skipped 1165 transitions) in 89 ms.
[2025-05-29 17:49:31] [INFO ] Added : 12 causal constraints over 3 iterations in 435 ms. Result :sat
Minimization took 494 ms.
[2025-05-29 17:49:32] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-29 17:49:32] [INFO ] [Real]Absence check using 13 positive and 53 generalized place invariants in 14 ms returned sat
[2025-05-29 17:49:32] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2025-05-29 17:49:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:49:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-05-29 17:49:32] [INFO ] [Nat]Absence check using 13 positive and 53 generalized place invariants in 15 ms returned sat
[2025-05-29 17:49:33] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2025-05-29 17:49:33] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2025-05-29 17:49:33] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 1 ms to minimize.
[2025-05-29 17:49:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 335 ms
[2025-05-29 17:49:33] [INFO ] Computed and/alt/rep : 375/1665/375 causal constraints (skipped 1165 transitions) in 77 ms.
[2025-05-29 17:49:34] [INFO ] Added : 23 causal constraints over 5 iterations in 640 ms. Result :sat
Minimization took 514 ms.
[2025-05-29 17:49:34] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-05-29 17:49:34] [INFO ] [Real]Absence check using 13 positive and 53 generalized place invariants in 29 ms returned sat
[2025-05-29 17:49:35] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2025-05-29 17:49:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:49:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-05-29 17:49:35] [INFO ] [Nat]Absence check using 13 positive and 53 generalized place invariants in 14 ms returned sat
[2025-05-29 17:49:35] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2025-05-29 17:49:35] [INFO ] Computed and/alt/rep : 375/1665/375 causal constraints (skipped 1165 transitions) in 74 ms.
[2025-05-29 17:49:36] [INFO ] Added : 61 causal constraints over 13 iterations in 1178 ms. Result :sat
Minimization took 538 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-08b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-08b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-08b-UpperBounds-07 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 646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 646/646 places, 1581/1581 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 646 transition count 1580
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 645 transition count 1580
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 642 transition count 1577
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 641 transition count 1572
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 641 transition count 1572
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 641 transition count 1571
Applied a total of 11 rules in 64 ms. Remains 641 /646 variables (removed 5) and now considering 1571/1581 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 641/646 places, 1571/1581 transitions.
// Phase 1: matrix 1571 rows 641 cols
[2025-05-29 17:49:45] [INFO ] Computed 66 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (16669 resets) in 2652 ms. (376 steps per ms)
BEST_FIRST walk for 2000002 steps (5632 resets) in 1803 ms. (1108 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-29 17:49:49] [INFO ] Invariant cache hit.
[2025-05-29 17:49:49] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-05-29 17:49:49] [INFO ] [Real]Absence check using 13 positive and 53 generalized place invariants in 13 ms returned sat
[2025-05-29 17:49:50] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2025-05-29 17:49:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:49:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-05-29 17:49:50] [INFO ] [Nat]Absence check using 13 positive and 53 generalized place invariants in 16 ms returned sat
[2025-05-29 17:49:50] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2025-05-29 17:49:50] [INFO ] Computed and/alt/rep : 369/1659/369 causal constraints (skipped 1161 transitions) in 82 ms.
[2025-05-29 17:49:51] [INFO ] Added : 55 causal constraints over 11 iterations in 853 ms. Result :sat
Minimization took 910 ms.
[2025-05-29 17:49:52] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-05-29 17:49:52] [INFO ] [Real]Absence check using 13 positive and 53 generalized place invariants in 22 ms returned sat
[2025-05-29 17:49:53] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2025-05-29 17:49:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:49:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-05-29 17:49:53] [INFO ] [Nat]Absence check using 13 positive and 53 generalized place invariants in 14 ms returned sat
[2025-05-29 17:49:53] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2025-05-29 17:49:53] [INFO ] Computed and/alt/rep : 369/1659/369 causal constraints (skipped 1161 transitions) in 84 ms.
[2025-05-29 17:49:54] [INFO ] Added : 73 causal constraints over 15 iterations in 1068 ms. Result :sat
Minimization took 814 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 641 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 641/641 places, 1571/1571 transitions.
Applied a total of 0 rules in 22 ms. Remains 641 /641 variables (removed 0) and now considering 1571/1571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 641/641 places, 1571/1571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 641/641 places, 1571/1571 transitions.
Applied a total of 0 rules in 22 ms. Remains 641 /641 variables (removed 0) and now considering 1571/1571 (removed 0) transitions.
[2025-05-29 17:49:57] [INFO ] Invariant cache hit.
[2025-05-29 17:49:57] [INFO ] Implicit Places using invariants in 360 ms returned [160]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 362 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 640/641 places, 1571/1571 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 640 transition count 1567
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 636 transition count 1567
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 635 transition count 1566
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 635 transition count 1565
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 634 transition count 1565
Applied a total of 12 rules in 62 ms. Remains 634 /640 variables (removed 6) and now considering 1565/1571 (removed 6) transitions.
// Phase 1: matrix 1565 rows 634 cols
[2025-05-29 17:49:57] [INFO ] Computed 65 invariants in 19 ms
[2025-05-29 17:49:58] [INFO ] Implicit Places using invariants in 375 ms returned []
[2025-05-29 17:49:58] [INFO ] Invariant cache hit.
[2025-05-29 17:49:59] [INFO ] Implicit Places using invariants and state equation in 1258 ms returned []
Implicit Place search using SMT with State Equation took 1635 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 634/641 places, 1565/1571 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2081 ms. Remains : 634/641 places, 1565/1571 transitions.
[2025-05-29 17:49:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (17057 resets) in 2675 ms. (373 steps per ms)
BEST_FIRST walk for 2000002 steps (5603 resets) in 1825 ms. (1095 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-29 17:50:03] [INFO ] Invariant cache hit.
[2025-05-29 17:50:03] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:50:04] [INFO ] [Real]Absence check using 15 positive and 50 generalized place invariants in 14 ms returned sat
[2025-05-29 17:50:04] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2025-05-29 17:50:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:50:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:50:04] [INFO ] [Nat]Absence check using 15 positive and 50 generalized place invariants in 14 ms returned sat
[2025-05-29 17:50:05] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2025-05-29 17:50:05] [INFO ] Computed and/alt/rep : 357/1567/357 causal constraints (skipped 1167 transitions) in 81 ms.
[2025-05-29 17:50:05] [INFO ] Added : 35 causal constraints over 8 iterations in 784 ms. Result :sat
Minimization took 621 ms.
[2025-05-29 17:50:06] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:50:06] [INFO ] [Real]Absence check using 15 positive and 50 generalized place invariants in 14 ms returned sat
[2025-05-29 17:50:06] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2025-05-29 17:50:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:50:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-05-29 17:50:07] [INFO ] [Nat]Absence check using 15 positive and 50 generalized place invariants in 14 ms returned sat
[2025-05-29 17:50:07] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2025-05-29 17:50:07] [INFO ] Computed and/alt/rep : 357/1567/357 causal constraints (skipped 1167 transitions) in 85 ms.
[2025-05-29 17:50:08] [INFO ] Added : 62 causal constraints over 13 iterations in 1379 ms. Result :sat
Minimization took 542 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 634 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 634/634 places, 1565/1565 transitions.
Applied a total of 0 rules in 22 ms. Remains 634 /634 variables (removed 0) and now considering 1565/1565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 634/634 places, 1565/1565 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 634/634 places, 1565/1565 transitions.
Applied a total of 0 rules in 22 ms. Remains 634 /634 variables (removed 0) and now considering 1565/1565 (removed 0) transitions.
[2025-05-29 17:50:10] [INFO ] Invariant cache hit.
[2025-05-29 17:50:10] [INFO ] Implicit Places using invariants in 343 ms returned []
[2025-05-29 17:50:10] [INFO ] Invariant cache hit.
[2025-05-29 17:50:11] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned []
Implicit Place search using SMT with State Equation took 1586 ms to find 0 implicit places.
[2025-05-29 17:50:11] [INFO ] Redundant transitions in 93 ms returned []
Running 1524 sub problems to find dead transitions.
[2025-05-29 17:50:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/633 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 633/2199 variables, and 61 constraints, problems are : Problem set: 0 solved, 1524 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 49/50 constraints, State Equation: 0/634 constraints, PredecessorRefiner: 1524/1524 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/633 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/633 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
At refinement iteration 3 (OVERLAPS) 1/634 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/634 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 634/2199 variables, and 65 constraints, problems are : Problem set: 0 solved, 1524 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 0/634 constraints, PredecessorRefiner: 0/1524 constraints, Known Traps: 0/0 constraints]
After SMT, in 61151ms problems are : Problem set: 0 solved, 1524 unsolved
Search for dead transitions found 0 dead transitions in 61182ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62920 ms. Remains : 634/634 places, 1565/1565 transitions.
RANDOM walk for 40000 steps (621 resets) in 913 ms. (43 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (109 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (111 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (109 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (114 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
[2025-05-29 17:51:14] [INFO ] Flatten gal took : 367 ms
[2025-05-29 17:51:14] [INFO ] Flatten gal took : 212 ms
[2025-05-29 17:51:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15486256363969043980.gal : 80 ms
[2025-05-29 17:51:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4647474947522343656.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15486256363969043980.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4647474947522343656.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/ReachabilityCardinality4647474947522343656.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 44
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :44 after 328
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :328 after 18272
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :18272 after 3.15575e+07
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :3.15575e+07 after 6.26546e+07
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :6.26546e+07 after 6.41588e+07
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :6.41588e+07 after 6.41682e+07
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :6.41682e+07 after 2.02028e+09
Interrupted probabilistic random walk after 149135 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 4
Probabilistic random walk after 149135 steps, saw 69796 distinct states, run finished after 3007 ms. (steps per millisecond=49 ) properties seen :0
[2025-05-29 17:51:16] [INFO ] Invariant cache hit.
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :2.02028e+09 after 2.706e+10
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 187/189 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/197 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 183/380 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :2.706e+10 after 2.54648e+12
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 15/395 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/398 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 13/411 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 33/444 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 157/601 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/601 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 22/623 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 32768
At refinement iteration 18 (INCLUDED_ONLY) 0/623 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD size :2.54648e+12 after 3.12932e+14
At refinement iteration 19 (OVERLAPS) 11/634 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-05-29 17:51:22] [INFO ] Deduced a trap composed of 24 places in 897 ms of which 1 ms to minimize.
SMT process timed out in 5621ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 634 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 634/634 places, 1565/1565 transitions.
Applied a total of 0 rules in 21 ms. Remains 634 /634 variables (removed 0) and now considering 1565/1565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 634/634 places, 1565/1565 transitions.
RANDOM walk for 40000 steps (731 resets) in 664 ms. (60 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (106 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (109 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (109 resets) in 229 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (110 resets) in 231 ms. (172 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 168989 steps, run timeout after 3011 ms. (steps per millisecond=56 ) properties seen :0 out of 4
Probabilistic random walk after 168989 steps, saw 81736 distinct states, run finished after 3011 ms. (steps per millisecond=56 ) properties seen :0
[2025-05-29 17:51:26] [INFO ] Invariant cache hit.
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :3.12932e+14 after 4.21001e+15
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 187/189 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/197 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 183/380 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 15/395 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/398 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 13/411 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 33/444 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 157/601 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/601 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 22/623 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/623 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 11/634 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-05-29 17:51:29] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/634 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/634 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 1565/2199 variables, 634/700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2199 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/2199 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2199/2199 variables, and 700 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5080 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 634/634 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 187/189 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/197 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 183/380 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 15/395 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/398 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 13/411 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 33/444 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 157/601 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/601 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 22/623 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/623 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 11/634 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/634 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/634 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,2 properties remain. new max is 65536
At refinement iteration 22 (OVERLAPS) 1565/2199 variables, 634/700 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2199 variables, 2/702 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD size :4.21001e+15 after 1.32848e+17
At refinement iteration 24 (INCLUDED_ONLY) 0/2199 variables, 0/702 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/2199 variables, 0/702 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2199/2199 variables, and 702 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2485 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 634/634 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 7594ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1375 ms.
Support contains 1 out of 634 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 634/634 places, 1565/1565 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 634 transition count 1564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 633 transition count 1564
Applied a total of 2 rules in 35 ms. Remains 633 /634 variables (removed 1) and now considering 1564/1565 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 633/634 places, 1564/1565 transitions.
RANDOM walk for 40000 steps (708 resets) in 359 ms. (111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (115 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (117 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 162584 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 2
Probabilistic random walk after 162584 steps, saw 76871 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
// Phase 1: matrix 1564 rows 633 cols
[2025-05-29 17:51:38] [INFO ] Computed 65 invariants in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/96 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/102 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 139/241 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/243 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 136/379 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 15/394 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 156/550 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/550 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 48/598 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/598 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 35/633 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/633 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1564/2197 variables, 633/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2197 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/2197 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2197/2197 variables, and 698 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3562 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 633/633 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/96 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/102 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 139/241 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/243 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 136/379 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 15/394 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 156/550 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/550 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 48/598 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/598 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 35/633 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/633 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1564/2197 variables, 633/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2197 variables, 2/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2197 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/2197 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2197/2197 variables, and 700 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2161 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 633/633 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 5778ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :1.32848e+17 after 5.93966e+18
Parikh walk visited 0 properties in 658 ms.
Support contains 1 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1564/1564 transitions.
Applied a total of 0 rules in 20 ms. Remains 633 /633 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 633/633 places, 1564/1564 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1564/1564 transitions.
Applied a total of 0 rules in 32 ms. Remains 633 /633 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
[2025-05-29 17:51:45] [INFO ] Invariant cache hit.
[2025-05-29 17:51:45] [INFO ] Implicit Places using invariants in 407 ms returned []
[2025-05-29 17:51:45] [INFO ] Invariant cache hit.
[2025-05-29 17:51:46] [INFO ] Implicit Places using invariants and state equation in 1230 ms returned []
Implicit Place search using SMT with State Equation took 1637 ms to find 0 implicit places.
[2025-05-29 17:51:46] [INFO ] Redundant transitions in 29 ms returned []
Running 1523 sub problems to find dead transitions.
[2025-05-29 17:51:46] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :5.93966e+18 after 5.7801e+20
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 1523 unsolved
Detected timeout of ITS tools.
[2025-05-29 17:52:04] [INFO ] Flatten gal took : 66 ms
[2025-05-29 17:52:04] [INFO ] Applying decomposition
[2025-05-29 17:52:05] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15822121178880696624.txt' '-o' '/tmp/graph15822121178880696624.bin' '-w' '/tmp/graph15822121178880696624.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15822121178880696624.bin' '-l' '-1' '-v' '-w' '/tmp/graph15822121178880696624.weights' '-q' '0' '-e' '0.001'
[2025-05-29 17:52:05] [INFO ] Decomposing Gal with order
[2025-05-29 17:52:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 17:52:05] [INFO ] Removed a total of 3233 redundant transitions.
[2025-05-29 17:52:05] [INFO ] Flatten gal took : 161 ms
[2025-05-29 17:52:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 45 ms.
[2025-05-29 17:52:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12860638374479827515.gal : 14 ms
[2025-05-29 17:52:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3513911758045604004.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/ReachabilityCardinality12860638374479827515.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3513911758045604004.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality3513911758045604004.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 24
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :24 after 176
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :176 after 1968
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1968 after 8.61206e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :8.61206e+06 after 2.76404e+07
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.76404e+07 after 5.57091e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5.57091e+07 after 5.13177e+08
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5.13177e+08 after 5.5456e+08
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5.5456e+08 after 1.84599e+09
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.84599e+09 after 1.84979e+09
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.84979e+09 after 5.63024e+09
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/2197 variables, and 61 constraints, problems are : Problem set: 0 solved, 1523 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 51/52 constraints, State Equation: 0/633 constraints, PredecessorRefiner: 1523/1523 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 1523 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :5.63024e+09 after 7.46978e+09
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :7.46978e+09 after 1.29573e+10
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/2197 variables, and 61 constraints, problems are : Problem set: 0 solved, 1523 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 51/52 constraints, State Equation: 0/633 constraints, PredecessorRefiner: 0/1523 constraints, Known Traps: 0/0 constraints]
After SMT, in 60899ms problems are : Problem set: 0 solved, 1523 unsolved
Search for dead transitions found 0 dead transitions in 60915ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62630 ms. Remains : 633/633 places, 1564/1564 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 23 ms. Remains 633 /633 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
Running SMT prover for 2 properties.
[2025-05-29 17:52:47] [INFO ] Invariant cache hit.
[2025-05-29 17:52:47] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2025-05-29 17:52:47] [INFO ] [Real]Absence check using 13 positive and 52 generalized place invariants in 21 ms returned sat
[2025-05-29 17:52:48] [INFO ] After 631ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-29 17:52:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-05-29 17:52:48] [INFO ] [Nat]Absence check using 13 positive and 52 generalized place invariants in 22 ms returned sat
[2025-05-29 17:52:48] [INFO ] After 490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-29 17:52:49] [INFO ] After 635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-29 17:52:49] [INFO ] After 846ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-29 17:52:49] [INFO ] Flatten gal took : 59 ms
[2025-05-29 17:52:49] [INFO ] Flatten gal took : 56 ms
[2025-05-29 17:52:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8682580843881939610.gal : 11 ms
[2025-05-29 17:52:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3644780284806621213.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8682580843881939610.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3644780284806621213.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 ...328
Loading property file /tmp/ReachabilityCardinality3644780284806621213.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 44
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :44 after 328
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :328 after 18272
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :18272 after 3.05395e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.05395e+07 after 6.28873e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :6.28873e+07 after 6.44315e+07
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :6.44315e+07 after 6.4441e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6.4441e+07 after 2.03986e+09
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.03986e+09 after 2.72002e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.72002e+10 after 1.60545e+12
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.60545e+12 after 3.13345e+14
Detected timeout of ITS tools.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :3.13345e+14 after 4.17656e+15
Detected timeout of ITS tools.
[2025-05-29 17:53:04] [INFO ] Flatten gal took : 44 ms
[2025-05-29 17:53:04] [INFO ] Applying decomposition
[2025-05-29 17:53:04] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8402206411507928367.txt' '-o' '/tmp/graph8402206411507928367.bin' '-w' '/tmp/graph8402206411507928367.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8402206411507928367.bin' '-l' '-1' '-v' '-w' '/tmp/graph8402206411507928367.weights' '-q' '0' '-e' '0.001'
[2025-05-29 17:53:04] [INFO ] Decomposing Gal with order
[2025-05-29 17:53:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 17:53:04] [INFO ] Removed a total of 3195 redundant transitions.
[2025-05-29 17:53:04] [INFO ] Flatten gal took : 78 ms
[2025-05-29 17:53:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 25 ms.
[2025-05-29 17:53:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16485099187342524653.gal : 8 ms
[2025-05-29 17:53:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6916513425072758153.prop : 13 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/ReachabilityCardinality16485099187342524653.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6916513425072758153.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality6916513425072758153.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 9792
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9792 after 3.10624e+06
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :3.10624e+06 after 7.93005e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :7.93005e+06 after 3.78596e+07
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3.78596e+07 after 7.02376e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :7.02376e+07 after 2.42459e+10
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2.42459e+10 after 8.95532e+10
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :8.95532e+10 after 1.4188e+11
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.4188e+11 after 2.04492e+11
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 32189 ms.
FORMULA ASLink-PT-08b-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for ASLink-PT-08b-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 1565 rows 634 cols
[2025-05-29 17:53:19] [INFO ] Computed 65 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (182 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (28 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-29 17:53:19] [INFO ] Invariant cache hit.
[2025-05-29 17:53:20] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:53:20] [INFO ] [Real]Absence check using 15 positive and 50 generalized place invariants in 14 ms returned sat
[2025-05-29 17:53:20] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2025-05-29 17:53:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:53:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:53:20] [INFO ] [Nat]Absence check using 15 positive and 50 generalized place invariants in 15 ms returned sat
[2025-05-29 17:53:20] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2025-05-29 17:53:21] [INFO ] Computed and/alt/rep : 357/1567/357 causal constraints (skipped 1167 transitions) in 74 ms.
[2025-05-29 17:53:22] [INFO ] Added : 62 causal constraints over 13 iterations in 1418 ms. Result :sat
Minimization took 500 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 634 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p280) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 634/634 places, 1564/1564 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 634 transition count 1563
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 633 transition count 1563
Applied a total of 2 rules in 33 ms. Remains 633 /634 variables (removed 1) and now considering 1563/1564 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 633/634 places, 1563/1564 transitions.
// Phase 1: matrix 1563 rows 633 cols
[2025-05-29 17:53:22] [INFO ] Computed 65 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (16849 resets) in 2348 ms. (425 steps per ms)
BEST_FIRST walk for 1000001 steps (2802 resets) in 828 ms. (1206 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-29 17:53:26] [INFO ] Invariant cache hit.
[2025-05-29 17:53:26] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-05-29 17:53:26] [INFO ] [Real]Absence check using 13 positive and 52 generalized place invariants in 14 ms returned sat
[2025-05-29 17:53:26] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2025-05-29 17:53:26] [INFO ] Computed and/alt/rep : 355/1565/355 causal constraints (skipped 1167 transitions) in 79 ms.
[2025-05-29 17:53:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:53:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2025-05-29 17:53:26] [INFO ] [Nat]Absence check using 13 positive and 52 generalized place invariants in 14 ms returned sat
[2025-05-29 17:53:27] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2025-05-29 17:53:27] [INFO ] Computed and/alt/rep : 355/1565/355 causal constraints (skipped 1167 transitions) in 76 ms.
[2025-05-29 17:53:28] [INFO ] Added : 62 causal constraints over 13 iterations in 1000 ms. Result :sat
Minimization took 578 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 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1563/1563 transitions.
Applied a total of 0 rules in 20 ms. Remains 633 /633 variables (removed 0) and now considering 1563/1563 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 633/633 places, 1563/1563 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1563/1563 transitions.
Applied a total of 0 rules in 19 ms. Remains 633 /633 variables (removed 0) and now considering 1563/1563 (removed 0) transitions.
[2025-05-29 17:53:29] [INFO ] Invariant cache hit.
[2025-05-29 17:53:29] [INFO ] Implicit Places using invariants in 359 ms returned []
[2025-05-29 17:53:29] [INFO ] Invariant cache hit.
[2025-05-29 17:53:30] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned []
Implicit Place search using SMT with State Equation took 1742 ms to find 0 implicit places.
[2025-05-29 17:53:30] [INFO ] Redundant transitions in 20 ms returned []
Running 1522 sub problems to find dead transitions.
[2025-05-29 17:53:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/631 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/631 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 631/2196 variables, and 57 constraints, problems are : Problem set: 0 solved, 1522 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 47/52 constraints, State Equation: 0/633 constraints, PredecessorRefiner: 1522/1522 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/631 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/631 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/631 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
At refinement iteration 3 (OVERLAPS) 1/632 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/632 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/2196 variables, and 61 constraints, problems are : Problem set: 0 solved, 1522 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 48/52 constraints, State Equation: 0/633 constraints, PredecessorRefiner: 0/1522 constraints, Known Traps: 0/0 constraints]
After SMT, in 60872ms problems are : Problem set: 0 solved, 1522 unsolved
Search for dead transitions found 0 dead transitions in 60886ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62680 ms. Remains : 633/633 places, 1563/1563 transitions.
[2025-05-29 17:54:32] [INFO ] Flatten gal took : 154 ms
RANDOM walk for 40000 steps (659 resets) in 534 ms. (74 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (106 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
[2025-05-29 17:54:32] [INFO ] Flatten gal took : 62 ms
BEST_FIRST walk for 40003 steps (114 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
[2025-05-29 17:54:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6361790106404912318.gal : 8 ms
[2025-05-29 17:54:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7501405913198556064.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6361790106404912318.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7501405913198556064.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 ...328
Loading property file /tmp/ReachabilityCardinality7501405913198556064.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 44
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :44 after 328
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :328 after 18272
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :18272 after 3.15575e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.15575e+07 after 6.26546e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :6.26546e+07 after 6.41588e+07
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :6.41588e+07 after 6.41682e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6.41682e+07 after 2.02028e+09
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.02028e+09 after 2.706e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.706e+10 after 2.54648e+12
Interrupted probabilistic random walk after 151319 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 2
Probabilistic random walk after 151319 steps, saw 71364 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2025-05-29 17:54:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/96 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/102 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 139/241 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/243 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 136/379 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 15/394 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 156/550 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/550 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 48/598 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/598 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 35/633 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/633 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1563/2196 variables, 633/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2196 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/2196 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2196/2196 variables, and 698 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 633/633 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/96 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/102 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 139/241 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/243 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 136/379 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 15/394 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 156/550 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/550 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 48/598 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/598 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 35/633 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/633 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1563/2196 variables, 633/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2196 variables, 2/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2196 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/2196 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2196/2196 variables, and 700 constraints, problems are : Problem set: 0 solved, 2 unsolved in 870 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 633/633 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1897ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.54648e+12 after 3.12932e+14
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :3.12932e+14 after 4.21002e+15
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :4.21002e+15 after 1.80358e+17
Parikh walk visited 0 properties in 18943 ms.
Support contains 1 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1563/1563 transitions.
Applied a total of 0 rules in 19 ms. Remains 633 /633 variables (removed 0) and now considering 1563/1563 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 633/633 places, 1563/1563 transitions.
RANDOM walk for 40000 steps (654 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (99 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (106 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 241187 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 2
Probabilistic random walk after 241187 steps, saw 120525 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
[2025-05-29 17:54:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/96 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/102 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 139/241 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/243 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 136/379 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 15/394 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 156/550 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/550 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 48/598 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/598 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 35/633 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/633 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1563/2196 variables, 633/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2196 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/2196 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2196/2196 variables, and 698 constraints, problems are : Problem set: 0 solved, 2 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 633/633 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/96 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/102 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 139/241 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/243 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 136/379 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 15/394 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 156/550 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/550 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 48/598 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/598 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 35/633 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/633 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1563/2196 variables, 633/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2196 variables, 2/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2196 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/2196 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2196/2196 variables, and 700 constraints, problems are : Problem set: 0 solved, 2 unsolved in 846 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 633/633 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1747ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :1.80358e+17 after 1.11216e+20
Finished Parikh walk after 1127345 steps, including 23115 resets, run visited all 2 properties in 10615 ms. (steps per millisecond=106 )
Parikh walk visited 2 properties in 10621 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA ASLink-PT-08b-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for ASLink-PT-08b-UpperBounds-05 in 111781 ms.
[2025-05-29 17:55:11] [INFO ] Flatten gal took : 43 ms
Total runtime 745293 ms.

BK_STOP 1748541311718

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-08b"
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-08b, 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-174853743000051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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