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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 9.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K 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 921K 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-06b-UpperBounds-00
FORMULA_NAME ASLink-PT-06b-UpperBounds-01
FORMULA_NAME ASLink-PT-06b-UpperBounds-02
FORMULA_NAME ASLink-PT-06b-UpperBounds-03
FORMULA_NAME ASLink-PT-06b-UpperBounds-04
FORMULA_NAME ASLink-PT-06b-UpperBounds-05
FORMULA_NAME ASLink-PT-06b-UpperBounds-06
FORMULA_NAME ASLink-PT-06b-UpperBounds-07
FORMULA_NAME ASLink-PT-06b-UpperBounds-08
FORMULA_NAME ASLink-PT-06b-UpperBounds-09
FORMULA_NAME ASLink-PT-06b-UpperBounds-10
FORMULA_NAME ASLink-PT-06b-UpperBounds-11
FORMULA_NAME ASLink-PT-06b-UpperBounds-12
FORMULA_NAME ASLink-PT-06b-UpperBounds-13
FORMULA_NAME ASLink-PT-06b-UpperBounds-14
FORMULA_NAME ASLink-PT-06b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748540313157

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-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:38:34] [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:38:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:38:34] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2025-05-29 17:38:34] [INFO ] Transformed 2826 places.
[2025-05-29 17:38:34] [INFO ] Transformed 3513 transitions.
[2025-05-29 17:38:34] [INFO ] Found NUPN structural information;
[2025-05-29 17:38:34] [INFO ] Parsed PT model containing 2826 places and 3513 transitions and 10709 arcs in 350 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 3513 rows 2826 cols
[2025-05-29 17:38:35] [INFO ] Computed 277 invariants in 138 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 (16 resets) in 107 ms. (92 steps per ms)
FORMULA ASLink-PT-06b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (20 resets) in 145 ms. (685 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-29 17:38:35] [INFO ] Invariant cache hit.
[2025-05-29 17:38:36] [INFO ] [Real]Absence check using 65 positive place invariants in 92 ms returned sat
[2025-05-29 17:38:36] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 93 ms returned sat
[2025-05-29 17:38:38] [INFO ] [Real]Absence check using state equation in 2019 ms returned sat
[2025-05-29 17:38:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:39] [INFO ] [Nat]Absence check using 65 positive place invariants in 74 ms returned sat
[2025-05-29 17:38:39] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 84 ms returned sat
[2025-05-29 17:38:41] [INFO ] [Nat]Absence check using state equation in 2739 ms returned sat
[2025-05-29 17:38:43] [INFO ] Deduced a trap composed of 24 places in 975 ms of which 93 ms to minimize.
[2025-05-29 17:38:44] [INFO ] Deduced a trap composed of 186 places in 922 ms of which 21 ms to minimize.
[2025-05-29 17:38:44] [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:38:44] [INFO ] [Real]Absence check using 65 positive place invariants in 61 ms returned sat
[2025-05-29 17:38:44] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 88 ms returned sat
[2025-05-29 17:38:46] [INFO ] [Real]Absence check using state equation in 1342 ms returned sat
[2025-05-29 17:38:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:46] [INFO ] [Nat]Absence check using 65 positive place invariants in 78 ms returned sat
[2025-05-29 17:38:46] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 83 ms returned sat
[2025-05-29 17:38:48] [INFO ] [Nat]Absence check using state equation in 1657 ms returned sat
[2025-05-29 17:38:49] [INFO ] Deduced a trap composed of 30 places in 1204 ms of which 16 ms to minimize.
[2025-05-29 17:38:51] [INFO ] Deduced a trap composed of 48 places in 1184 ms of which 14 ms to minimize.
[2025-05-29 17:38:52] [INFO ] Deduced a trap composed of 22 places in 1146 ms of which 14 ms to minimize.
[2025-05-29 17:38:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 17:38:52] [INFO ] [Real]Absence check using 65 positive place invariants in 64 ms returned sat
[2025-05-29 17:38:52] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 90 ms returned sat
[2025-05-29 17:38:54] [INFO ] [Real]Absence check using state equation in 1886 ms returned sat
[2025-05-29 17:38:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:55] [INFO ] [Nat]Absence check using 65 positive place invariants in 65 ms returned sat
[2025-05-29 17:38:55] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 85 ms returned sat
[2025-05-29 17:38:56] [INFO ] [Nat]Absence check using state equation in 1442 ms returned sat
[2025-05-29 17:38:57] [INFO ] Computed and/alt/rep : 2957/6472/2957 causal constraints (skipped 555 transitions) in 198 ms.
[2025-05-29 17:38:59] [INFO ] Added : 85 causal constraints over 17 iterations in 2857 ms. Result :unknown
[2025-05-29 17:39:00] [INFO ] [Real]Absence check using 65 positive place invariants in 67 ms returned sat
[2025-05-29 17:39:00] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 84 ms returned sat
[2025-05-29 17:39:02] [INFO ] [Real]Absence check using state equation in 1853 ms returned sat
[2025-05-29 17:39:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:02] [INFO ] [Nat]Absence check using 65 positive place invariants in 65 ms returned sat
[2025-05-29 17:39:03] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 83 ms returned sat
[2025-05-29 17:39:05] [INFO ] [Nat]Absence check using state equation in 1971 ms returned sat
[2025-05-29 17:39:06] [INFO ] Deduced a trap composed of 61 places in 1227 ms of which 15 ms to minimize.
[2025-05-29 17:39:07] [INFO ] Deduced a trap composed of 20 places in 1102 ms of which 13 ms to minimize.
[2025-05-29 17:39:07] [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:39:08] [INFO ] [Real]Absence check using 65 positive place invariants in 70 ms returned sat
[2025-05-29 17:39:08] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 83 ms returned sat
[2025-05-29 17:39:09] [INFO ] [Real]Absence check using state equation in 1582 ms returned sat
[2025-05-29 17:39:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:10] [INFO ] [Nat]Absence check using 65 positive place invariants in 63 ms returned sat
[2025-05-29 17:39:10] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 81 ms returned sat
[2025-05-29 17:39:11] [INFO ] [Nat]Absence check using state equation in 1340 ms returned sat
[2025-05-29 17:39:13] [INFO ] Deduced a trap composed of 23 places in 1235 ms of which 15 ms to minimize.
[2025-05-29 17:39:14] [INFO ] Deduced a trap composed of 24 places in 1225 ms of which 15 ms to minimize.
[2025-05-29 17:39:15] [INFO ] Deduced a trap composed of 142 places in 1242 ms of which 15 ms to minimize.
[2025-05-29 17:39:15] [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:39:16] [INFO ] [Real]Absence check using 65 positive place invariants in 60 ms returned sat
[2025-05-29 17:39:16] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 82 ms returned sat
[2025-05-29 17:39:18] [INFO ] [Real]Absence check using state equation in 2451 ms returned sat
[2025-05-29 17:39:20] [INFO ] Deduced a trap composed of 28 places in 1114 ms of which 14 ms to minimize.
[2025-05-29 17:39:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:20] [INFO ] [Nat]Absence check using 65 positive place invariants in 64 ms returned sat
[2025-05-29 17:39:20] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 83 ms returned sat
[2025-05-29 17:39:23] [INFO ] [Nat]Absence check using state equation in 3166 ms returned sat
[2025-05-29 17:39:24] [INFO ] Deduced a trap composed of 28 places in 659 ms of which 9 ms to minimize.
[2025-05-29 17:39:25] [INFO ] Deduced a trap composed of 198 places in 668 ms of which 9 ms to minimize.
[2025-05-29 17:39:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 17:39:26] [INFO ] [Real]Absence check using 65 positive place invariants in 72 ms returned sat
[2025-05-29 17:39:26] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 90 ms returned sat
[2025-05-29 17:39:29] [INFO ] [Real]Absence check using state equation in 3177 ms returned sat
[2025-05-29 17:39:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:29] [INFO ] [Nat]Absence check using 65 positive place invariants in 63 ms returned sat
[2025-05-29 17:39:30] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 87 ms returned sat
[2025-05-29 17:39:31] [INFO ] [Nat]Absence check using state equation in 1806 ms returned sat
[2025-05-29 17:39:32] [INFO ] Deduced a trap composed of 137 places in 926 ms of which 13 ms to minimize.
[2025-05-29 17:39:33] [INFO ] Deduced a trap composed of 138 places in 893 ms of which 12 ms to minimize.
[2025-05-29 17:39:34] [INFO ] Deduced a trap composed of 95 places in 697 ms of which 10 ms to minimize.
[2025-05-29 17:39:34] [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:39:35] [INFO ] [Real]Absence check using 65 positive place invariants in 62 ms returned sat
[2025-05-29 17:39:35] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 84 ms returned sat
[2025-05-29 17:39:37] [INFO ] [Real]Absence check using state equation in 2212 ms returned sat
[2025-05-29 17:39:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:37] [INFO ] [Nat]Absence check using 65 positive place invariants in 63 ms returned sat
[2025-05-29 17:39:38] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 92 ms returned sat
[2025-05-29 17:39:40] [INFO ] [Nat]Absence check using state equation in 2309 ms returned sat
[2025-05-29 17:39:40] [INFO ] Computed and/alt/rep : 2957/6472/2957 causal constraints (skipped 555 transitions) in 182 ms.
[2025-05-29 17:39:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 17:39:43] [INFO ] [Real]Absence check using 65 positive place invariants in 62 ms returned sat
[2025-05-29 17:39:43] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 83 ms returned sat
[2025-05-29 17:39:44] [INFO ] [Real]Absence check using state equation in 1651 ms returned sat
[2025-05-29 17:39:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:45] [INFO ] [Nat]Absence check using 65 positive place invariants in 62 ms returned sat
[2025-05-29 17:39:45] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 81 ms returned sat
[2025-05-29 17:39:46] [INFO ] [Nat]Absence check using state equation in 1503 ms returned sat
[2025-05-29 17:39:48] [INFO ] Deduced a trap composed of 25 places in 947 ms of which 13 ms to minimize.
[2025-05-29 17:39:49] [INFO ] Deduced a trap composed of 42 places in 945 ms of which 15 ms to minimize.
[2025-05-29 17:39:49] [INFO ] Deduced a trap composed of 279 places in 651 ms of which 10 ms to minimize.
[2025-05-29 17:39:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3042 ms
[2025-05-29 17:39:50] [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 8
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:39:50] [INFO ] [Real]Absence check using 65 positive place invariants in 60 ms returned sat
[2025-05-29 17:39:50] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 81 ms returned sat
[2025-05-29 17:39:52] [INFO ] [Real]Absence check using state equation in 1532 ms returned sat
[2025-05-29 17:39:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:52] [INFO ] [Nat]Absence check using 65 positive place invariants in 72 ms returned sat
[2025-05-29 17:39:52] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 77 ms returned sat
[2025-05-29 17:39:54] [INFO ] [Nat]Absence check using state equation in 1545 ms returned sat
[2025-05-29 17:39:55] [INFO ] Deduced a trap composed of 25 places in 889 ms of which 11 ms to minimize.
[2025-05-29 17:39:56] [INFO ] Deduced a trap composed of 85 places in 898 ms of which 12 ms to minimize.
[2025-05-29 17:39:57] [INFO ] Deduced a trap composed of 109 places in 914 ms of which 14 ms to minimize.
[2025-05-29 17:39:57] [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 9
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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 2826 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2826/2826 places, 3513/3513 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 655 transitions
Trivial Post-agglo rules discarded 655 transitions
Performed 655 trivial Post agglomeration. Transition count delta: 655
Iterating post reduction 0 with 655 rules applied. Total rules applied 655 place count 2826 transition count 2858
Reduce places removed 655 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
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 1 with 685 rules applied. Total rules applied 1340 place count 2171 transition count 2828
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 1349 place count 2163 transition count 2827
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1350 place count 2162 transition count 2827
Performed 654 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 654 Pre rules applied. Total rules applied 1350 place count 2162 transition count 2173
Deduced a syphon composed of 654 places in 7 ms
Ensure Unique test removed 62 places
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 4 with 1370 rules applied. Total rules applied 2720 place count 1446 transition count 2173
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 4 with 45 rules applied. Total rules applied 2765 place count 1439 transition count 2135
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 5 with 38 rules applied. Total rules applied 2803 place count 1401 transition count 2135
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2803 place count 1401 transition count 2111
Deduced a syphon composed of 24 places in 11 ms
Ensure Unique test removed 24 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 2875 place count 1353 transition count 2111
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2875 place count 1353 transition count 2087
Deduced a syphon composed of 24 places in 11 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2923 place count 1329 transition count 2087
Discarding 89 places :
Symmetric choice reduction at 6 with 89 rule applications. Total rules 3012 place count 1240 transition count 1998
Iterating global reduction 6 with 89 rules applied. Total rules applied 3101 place count 1240 transition count 1998
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3102 place count 1240 transition count 1997
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 29 Pre rules applied. Total rules applied 3102 place count 1240 transition count 1968
Deduced a syphon composed of 29 places in 11 ms
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 59 rules applied. Total rules applied 3161 place count 1210 transition count 1968
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3161 place count 1210 transition count 1967
Deduced a syphon composed of 1 places in 10 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 3164 place count 1208 transition count 1967
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 3171 place count 1201 transition count 1922
Iterating global reduction 7 with 7 rules applied. Total rules applied 3178 place count 1201 transition count 1922
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 3178 place count 1201 transition count 1916
Deduced a syphon composed of 6 places in 12 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 3190 place count 1195 transition count 1916
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3191 place count 1194 transition count 1908
Iterating global reduction 7 with 1 rules applied. Total rules applied 3192 place count 1194 transition count 1908
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3193 place count 1193 transition count 1900
Iterating global reduction 7 with 1 rules applied. Total rules applied 3194 place count 1193 transition count 1900
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3195 place count 1192 transition count 1892
Iterating global reduction 7 with 1 rules applied. Total rules applied 3196 place count 1192 transition count 1892
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3197 place count 1191 transition count 1884
Iterating global reduction 7 with 1 rules applied. Total rules applied 3198 place count 1191 transition count 1884
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3199 place count 1190 transition count 1876
Iterating global reduction 7 with 1 rules applied. Total rules applied 3200 place count 1190 transition count 1876
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3201 place count 1189 transition count 1868
Iterating global reduction 7 with 1 rules applied. Total rules applied 3202 place count 1189 transition count 1868
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3203 place count 1188 transition count 1860
Iterating global reduction 7 with 1 rules applied. Total rules applied 3204 place count 1188 transition count 1860
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3205 place count 1187 transition count 1852
Iterating global reduction 7 with 1 rules applied. Total rules applied 3206 place count 1187 transition count 1852
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3207 place count 1186 transition count 1844
Iterating global reduction 7 with 1 rules applied. Total rules applied 3208 place count 1186 transition count 1844
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3209 place count 1185 transition count 1836
Iterating global reduction 7 with 1 rules applied. Total rules applied 3210 place count 1185 transition count 1836
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3211 place count 1184 transition count 1828
Iterating global reduction 7 with 1 rules applied. Total rules applied 3212 place count 1184 transition count 1828
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3213 place count 1183 transition count 1820
Iterating global reduction 7 with 1 rules applied. Total rules applied 3214 place count 1183 transition count 1820
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3215 place count 1182 transition count 1812
Iterating global reduction 7 with 1 rules applied. Total rules applied 3216 place count 1182 transition count 1812
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3217 place count 1181 transition count 1804
Iterating global reduction 7 with 1 rules applied. Total rules applied 3218 place count 1181 transition count 1804
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3219 place count 1180 transition count 1796
Iterating global reduction 7 with 1 rules applied. Total rules applied 3220 place count 1180 transition count 1796
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3221 place count 1179 transition count 1788
Iterating global reduction 7 with 1 rules applied. Total rules applied 3222 place count 1179 transition count 1788
Performed 162 Post agglomeration using F-continuation condition.Transition count delta: 162
Deduced a syphon composed of 162 places in 3 ms
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 7 with 324 rules applied. Total rules applied 3546 place count 1017 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3547 place count 1016 transition count 1625
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 3549 place count 1015 transition count 1625
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3550 place count 1014 transition count 1624
Iterating global reduction 7 with 1 rules applied. Total rules applied 3551 place count 1014 transition count 1624
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 3553 place count 1014 transition count 1622
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3554 place count 1013 transition count 1622
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3556 place count 1012 transition count 1631
Free-agglomeration rule applied 7 times.
Iterating global reduction 9 with 7 rules applied. Total rules applied 3563 place count 1012 transition count 1624
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 3570 place count 1005 transition count 1624
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 10 with 7 rules applied. Total rules applied 3577 place count 1005 transition count 1617
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 3584 place count 998 transition count 1617
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 3585 place count 997 transition count 1616
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 11 with 16 rules applied. Total rules applied 3601 place count 986 transition count 1611
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 3606 place count 981 transition count 1611
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 16 Pre rules applied. Total rules applied 3606 place count 981 transition count 1595
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 13 with 32 rules applied. Total rules applied 3638 place count 965 transition count 1595
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 13 with 6 rules applied. Total rules applied 3644 place count 959 transition count 1595
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 14 with 24 rules applied. Total rules applied 3668 place count 947 transition count 1583
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 3674 place count 941 transition count 1577
Iterating global reduction 14 with 6 rules applied. Total rules applied 3680 place count 941 transition count 1577
Free-agglomeration rule applied 6 times.
Iterating global reduction 14 with 6 rules applied. Total rules applied 3686 place count 941 transition count 1571
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3692 place count 935 transition count 1571
Applied a total of 3692 rules in 1788 ms. Remains 935 /2826 variables (removed 1891) and now considering 1571/3513 (removed 1942) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1798 ms. Remains : 935/2826 places, 1571/3513 transitions.
// Phase 1: matrix 1571 rows 935 cols
[2025-05-29 17:39:59] [INFO ] Computed 164 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (11403 resets) in 2687 ms. (372 steps per ms)
FORMULA ASLink-PT-06b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6000006 steps (11174 resets) in 7108 ms. (844 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-29 17:40:09] [INFO ] Invariant cache hit.
[2025-05-29 17:40:09] [INFO ] [Real]Absence check using 42 positive place invariants in 13 ms returned sat
[2025-05-29 17:40:09] [INFO ] [Real]Absence check using 42 positive and 122 generalized place invariants in 24 ms returned sat
[2025-05-29 17:40:09] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2025-05-29 17:40:09] [INFO ] Computed and/alt/rep : 621/2351/621 causal constraints (skipped 917 transitions) in 80 ms.
[2025-05-29 17:40:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:10] [INFO ] [Nat]Absence check using 42 positive place invariants in 14 ms returned sat
[2025-05-29 17:40:10] [INFO ] [Nat]Absence check using 42 positive and 122 generalized place invariants in 23 ms returned sat
[2025-05-29 17:40:10] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2025-05-29 17:40:11] [INFO ] Deduced a trap composed of 107 places in 355 ms of which 5 ms to minimize.
[2025-05-29 17:40:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 461 ms
[2025-05-29 17:40:11] [INFO ] Computed and/alt/rep : 621/2351/621 causal constraints (skipped 917 transitions) in 76 ms.
[2025-05-29 17:40:13] [INFO ] Added : 89 causal constraints over 18 iterations in 1809 ms. Result :sat
Minimization took 806 ms.
[2025-05-29 17:40:14] [INFO ] [Real]Absence check using 42 positive place invariants in 22 ms returned sat
[2025-05-29 17:40:14] [INFO ] [Real]Absence check using 42 positive and 122 generalized place invariants in 24 ms returned sat
[2025-05-29 17:40:14] [INFO ] [Real]Absence check using state equation in 555 ms returned sat
[2025-05-29 17:40:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:14] [INFO ] [Nat]Absence check using 42 positive place invariants in 14 ms returned sat
[2025-05-29 17:40:14] [INFO ] [Nat]Absence check using 42 positive and 122 generalized place invariants in 24 ms returned sat
[2025-05-29 17:40:15] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2025-05-29 17:40:15] [INFO ] Computed and/alt/rep : 621/2351/621 causal constraints (skipped 917 transitions) in 76 ms.
[2025-05-29 17:40:21] [INFO ] Added : 425 causal constraints over 85 iterations in 6563 ms. Result :sat
Minimization took 785 ms.
[2025-05-29 17:40:22] [INFO ] [Real]Absence check using 42 positive place invariants in 16 ms returned sat
[2025-05-29 17:40:22] [INFO ] [Real]Absence check using 42 positive and 122 generalized place invariants in 30 ms returned sat
[2025-05-29 17:40:23] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2025-05-29 17:40:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:23] [INFO ] [Nat]Absence check using 42 positive place invariants in 16 ms returned sat
[2025-05-29 17:40:23] [INFO ] [Nat]Absence check using 42 positive and 122 generalized place invariants in 24 ms returned sat
[2025-05-29 17:40:24] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2025-05-29 17:40:24] [INFO ] Deduced a trap composed of 111 places in 125 ms of which 2 ms to minimize.
[2025-05-29 17:40:24] [INFO ] Deduced a trap composed of 123 places in 128 ms of which 2 ms to minimize.
[2025-05-29 17:40:24] [INFO ] Deduced a trap composed of 110 places in 128 ms of which 2 ms to minimize.
[2025-05-29 17:40:24] [INFO ] Deduced a trap composed of 122 places in 126 ms of which 2 ms to minimize.
[2025-05-29 17:40:24] [INFO ] Deduced a trap composed of 142 places in 123 ms of which 2 ms to minimize.
[2025-05-29 17:40:25] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 2 ms to minimize.
[2025-05-29 17:40:25] [INFO ] Deduced a trap composed of 98 places in 142 ms of which 2 ms to minimize.
[2025-05-29 17:40:25] [INFO ] Deduced a trap composed of 90 places in 162 ms of which 2 ms to minimize.
[2025-05-29 17:40:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1450 ms
[2025-05-29 17:40:25] [INFO ] Computed and/alt/rep : 621/2351/621 causal constraints (skipped 917 transitions) in 93 ms.
[2025-05-29 17:40:32] [INFO ] Added : 427 causal constraints over 86 iterations in 6870 ms. Result :sat
Minimization took 935 ms.
[2025-05-29 17:40:33] [INFO ] [Real]Absence check using 42 positive place invariants in 13 ms returned sat
[2025-05-29 17:40:33] [INFO ] [Real]Absence check using 42 positive and 122 generalized place invariants in 27 ms returned sat
[2025-05-29 17:40:33] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2025-05-29 17:40:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:34] [INFO ] [Nat]Absence check using 42 positive place invariants in 14 ms returned sat
[2025-05-29 17:40:34] [INFO ] [Nat]Absence check using 42 positive and 122 generalized place invariants in 29 ms returned sat
[2025-05-29 17:40:34] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2025-05-29 17:40:34] [INFO ] Deduced a trap composed of 60 places in 190 ms of which 3 ms to minimize.
[2025-05-29 17:40:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2025-05-29 17:40:34] [INFO ] Computed and/alt/rep : 621/2351/621 causal constraints (skipped 917 transitions) in 74 ms.
[2025-05-29 17:40:36] [INFO ] Added : 111 causal constraints over 23 iterations in 1926 ms. Result :sat
Minimization took 719 ms.
[2025-05-29 17:40:37] [INFO ] [Real]Absence check using 42 positive place invariants in 13 ms returned sat
[2025-05-29 17:40:37] [INFO ] [Real]Absence check using 42 positive and 122 generalized place invariants in 24 ms returned sat
[2025-05-29 17:40:38] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2025-05-29 17:40:38] [INFO ] Computed and/alt/rep : 621/2351/621 causal constraints (skipped 917 transitions) in 76 ms.
[2025-05-29 17:40:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:38] [INFO ] [Nat]Absence check using 42 positive place invariants in 14 ms returned sat
[2025-05-29 17:40:38] [INFO ] [Nat]Absence check using 42 positive and 122 generalized place invariants in 24 ms returned sat
[2025-05-29 17:40:39] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2025-05-29 17:40:39] [INFO ] Computed and/alt/rep : 621/2351/621 causal constraints (skipped 917 transitions) in 72 ms.
[2025-05-29 17:40:41] [INFO ] Added : 101 causal constraints over 21 iterations in 1900 ms. Result :sat
Minimization took 699 ms.
[2025-05-29 17:40:41] [INFO ] [Real]Absence check using 42 positive place invariants in 13 ms returned sat
[2025-05-29 17:40:41] [INFO ] [Real]Absence check using 42 positive and 122 generalized place invariants in 30 ms returned sat
[2025-05-29 17:40:42] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2025-05-29 17:40:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:40:42] [INFO ] [Nat]Absence check using 42 positive place invariants in 14 ms returned sat
[2025-05-29 17:40:42] [INFO ] [Nat]Absence check using 42 positive and 122 generalized place invariants in 23 ms returned sat
[2025-05-29 17:40:43] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2025-05-29 17:40:43] [INFO ] Computed and/alt/rep : 621/2351/621 causal constraints (skipped 917 transitions) in 78 ms.
[2025-05-29 17:40:50] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2025-05-29 17:40:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2025-05-29 17:40:51] [INFO ] Added : 480 causal constraints over 97 iterations in 7930 ms. Result :sat
Minimization took 894 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 935 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 935/935 places, 1571/1571 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 935 transition count 1570
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 934 transition count 1570
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 932 transition count 1568
Applied a total of 6 rules in 61 ms. Remains 932 /935 variables (removed 3) and now considering 1568/1571 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 932/935 places, 1568/1571 transitions.
// Phase 1: matrix 1568 rows 932 cols
[2025-05-29 17:40:56] [INFO ] Computed 164 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (11429 resets) in 2608 ms. (383 steps per ms)
BEST_FIRST walk for 6000005 steps (11191 resets) in 7165 ms. (837 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-29 17:41:06] [INFO ] Invariant cache hit.
[2025-05-29 17:41:06] [INFO ] [Real]Absence check using 42 positive place invariants in 25 ms returned sat
[2025-05-29 17:41:06] [INFO ] [Real]Absence check using 42 positive and 122 generalized place invariants in 27 ms returned sat
[2025-05-29 17:41:06] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2025-05-29 17:41:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:07] [INFO ] [Nat]Absence check using 42 positive place invariants in 13 ms returned sat
[2025-05-29 17:41:07] [INFO ] [Nat]Absence check using 42 positive and 122 generalized place invariants in 36 ms returned sat
[2025-05-29 17:41:07] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2025-05-29 17:41:07] [INFO ] Computed and/alt/rep : 618/2342/618 causal constraints (skipped 917 transitions) in 74 ms.
[2025-05-29 17:41:14] [INFO ] Added : 433 causal constraints over 87 iterations in 6941 ms. Result :sat
Minimization took 985 ms.
[2025-05-29 17:41:15] [INFO ] [Real]Absence check using 42 positive place invariants in 13 ms returned sat
[2025-05-29 17:41:15] [INFO ] [Real]Absence check using 42 positive and 122 generalized place invariants in 24 ms returned sat
[2025-05-29 17:41:16] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2025-05-29 17:41:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:16] [INFO ] [Nat]Absence check using 42 positive place invariants in 13 ms returned sat
[2025-05-29 17:41:16] [INFO ] [Nat]Absence check using 42 positive and 122 generalized place invariants in 23 ms returned sat
[2025-05-29 17:41:16] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2025-05-29 17:41:17] [INFO ] Computed and/alt/rep : 618/2342/618 causal constraints (skipped 917 transitions) in 78 ms.
[2025-05-29 17:41:23] [INFO ] Deduced a trap composed of 118 places in 301 ms of which 7 ms to minimize.
[2025-05-29 17:41:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 434 ms
[2025-05-29 17:41:24] [INFO ] Added : 448 causal constraints over 90 iterations in 7277 ms. Result :sat
Minimization took 1061 ms.
[2025-05-29 17:41:25] [INFO ] [Real]Absence check using 42 positive place invariants in 12 ms returned sat
[2025-05-29 17:41:25] [INFO ] [Real]Absence check using 42 positive and 122 generalized place invariants in 25 ms returned sat
[2025-05-29 17:41:25] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2025-05-29 17:41:26] [INFO ] Computed and/alt/rep : 618/2342/618 causal constraints (skipped 917 transitions) in 78 ms.
[2025-05-29 17:41:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:26] [INFO ] [Nat]Absence check using 42 positive place invariants in 13 ms returned sat
[2025-05-29 17:41:26] [INFO ] [Nat]Absence check using 42 positive and 122 generalized place invariants in 24 ms returned sat
[2025-05-29 17:41:26] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2025-05-29 17:41:26] [INFO ] Computed and/alt/rep : 618/2342/618 causal constraints (skipped 917 transitions) in 77 ms.
[2025-05-29 17:41:32] [INFO ] Added : 394 causal constraints over 79 iterations in 5856 ms. Result :sat
Minimization took 988 ms.
[2025-05-29 17:41:33] [INFO ] [Real]Absence check using 42 positive place invariants in 12 ms returned sat
[2025-05-29 17:41:33] [INFO ] [Real]Absence check using 42 positive and 122 generalized place invariants in 25 ms returned sat
[2025-05-29 17:41:34] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2025-05-29 17:41:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:34] [INFO ] [Nat]Absence check using 42 positive place invariants in 12 ms returned sat
[2025-05-29 17:41:34] [INFO ] [Nat]Absence check using 42 positive and 122 generalized place invariants in 24 ms returned sat
[2025-05-29 17:41:34] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2025-05-29 17:41:34] [INFO ] Computed and/alt/rep : 618/2342/618 causal constraints (skipped 917 transitions) in 73 ms.
[2025-05-29 17:41:41] [INFO ] Added : 410 causal constraints over 82 iterations in 6231 ms. Result :sat
Minimization took 1033 ms.
[2025-05-29 17:41:42] [INFO ] [Real]Absence check using 42 positive place invariants in 12 ms returned sat
[2025-05-29 17:41:42] [INFO ] [Real]Absence check using 42 positive and 122 generalized place invariants in 23 ms returned sat
[2025-05-29 17:41:42] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2025-05-29 17:41:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:42] [INFO ] [Nat]Absence check using 42 positive place invariants in 13 ms returned sat
[2025-05-29 17:41:42] [INFO ] [Nat]Absence check using 42 positive and 122 generalized place invariants in 24 ms returned sat
[2025-05-29 17:41:43] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2025-05-29 17:41:43] [INFO ] Computed and/alt/rep : 618/2342/618 causal constraints (skipped 917 transitions) in 76 ms.
[2025-05-29 17:41:52] [INFO ] Added : 486 causal constraints over 98 iterations in 9584 ms. Result :sat
Minimization took 1051 ms.
[2025-05-29 17:41:54] [INFO ] [Real]Absence check using 42 positive place invariants in 13 ms returned sat
[2025-05-29 17:41:54] [INFO ] [Real]Absence check using 42 positive and 122 generalized place invariants in 25 ms returned sat
[2025-05-29 17:41:54] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2025-05-29 17:41:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:54] [INFO ] [Nat]Absence check using 42 positive place invariants in 13 ms returned sat
[2025-05-29 17:41:54] [INFO ] [Nat]Absence check using 42 positive and 122 generalized place invariants in 26 ms returned sat
[2025-05-29 17:41:55] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2025-05-29 17:41:55] [INFO ] Computed and/alt/rep : 618/2342/618 causal constraints (skipped 917 transitions) in 73 ms.
[2025-05-29 17:42:02] [INFO ] Added : 490 causal constraints over 98 iterations in 7687 ms. Result :sat
Minimization took 1003 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 932 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 932/932 places, 1568/1568 transitions.
Applied a total of 0 rules in 28 ms. Remains 932 /932 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 932/932 places, 1568/1568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 932/932 places, 1568/1568 transitions.
Applied a total of 0 rules in 27 ms. Remains 932 /932 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
[2025-05-29 17:42:08] [INFO ] Invariant cache hit.
[2025-05-29 17:42:09] [INFO ] Implicit Places using invariants in 716 ms returned [1, 18, 19, 22, 32, 49, 67, 142, 157, 158, 160, 177, 195, 265, 269, 270, 281, 282, 284, 301, 319, 389, 393, 394, 405, 406, 408, 425, 443, 512, 516, 517, 528, 529, 531, 548, 566, 635, 639, 640, 651, 652, 654, 671, 689, 758, 762, 763, 766, 777, 778, 779, 797, 799, 803, 821, 822, 823, 824, 836, 842, 848, 854, 860, 866, 872, 878, 884, 890, 896]
[2025-05-29 17:42:09] [INFO ] Actually due to overlaps returned [797, 779, 49, 177, 301, 425, 548, 671, 803, 32, 160, 284, 408, 531, 654, 157, 281, 405, 528, 652, 777, 821, 158, 282, 406, 529, 651, 778, 799, 822, 1, 18, 269, 270, 393, 394, 516, 517, 639, 640, 762, 763, 67, 195, 319, 443, 566, 689, 823, 866, 884, 896, 19, 22, 142, 766, 824, 836, 842, 848, 854, 860, 872, 878, 890]
Discarding 65 places :
Implicit Place search using SMT only with invariants took 720 ms to find 65 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 867/932 places, 1568/1568 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 862 transition count 1449
Reduce places removed 119 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 127 rules applied. Total rules applied 251 place count 743 transition count 1441
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 254 place count 740 transition count 1441
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 254 place count 740 transition count 1412
Deduced a syphon composed of 29 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 59 rules applied. Total rules applied 313 place count 710 transition count 1412
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 325 place count 706 transition count 1404
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 333 place count 698 transition count 1404
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 348 place count 683 transition count 1389
Iterating global reduction 5 with 15 rules applied. Total rules applied 363 place count 683 transition count 1389
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 366 place count 683 transition count 1386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 366 place count 683 transition count 1385
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 682 transition count 1385
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 371 place count 679 transition count 1379
Iterating global reduction 6 with 3 rules applied. Total rules applied 374 place count 679 transition count 1379
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 375 place count 678 transition count 1378
Iterating global reduction 6 with 1 rules applied. Total rules applied 376 place count 678 transition count 1378
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 377 place count 677 transition count 1376
Iterating global reduction 6 with 1 rules applied. Total rules applied 378 place count 677 transition count 1376
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 474 place count 629 transition count 1328
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 479 place count 624 transition count 1323
Iterating global reduction 6 with 5 rules applied. Total rules applied 484 place count 624 transition count 1323
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 489 place count 624 transition count 1318
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 7 with 4 rules applied. Total rules applied 493 place count 622 transition count 1319
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 7 with 17 rules applied. Total rules applied 510 place count 622 transition count 1302
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 528 place count 604 transition count 1302
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 529 place count 604 transition count 1301
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 8 with 18 rules applied. Total rules applied 547 place count 604 transition count 1301
Applied a total of 547 rules in 231 ms. Remains 604 /867 variables (removed 263) and now considering 1301/1568 (removed 267) transitions.
// Phase 1: matrix 1301 rows 604 cols
[2025-05-29 17:42:09] [INFO ] Computed 88 invariants in 10 ms
[2025-05-29 17:42:10] [INFO ] Implicit Places using invariants in 376 ms returned [90, 96, 99, 101, 104, 111, 112, 166, 184, 190, 193, 195, 200, 201, 253, 271, 277, 280, 282, 287, 288, 340, 357, 363, 366, 368, 373, 374, 426, 443, 449, 452, 454, 459, 460, 512, 529, 535, 538, 540]
[2025-05-29 17:42:10] [INFO ] Actually due to overlaps returned [111, 200, 287, 373, 459, 112, 201, 288, 374, 460, 90, 96, 101, 184, 190, 195, 271, 277, 282, 357, 363, 368, 443, 449, 454, 529, 535, 540, 104, 166, 253, 340, 426, 512]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 379 ms to find 34 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 570/932 places, 1301/1568 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 545 transition count 1276
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 545 transition count 1276
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 539 transition count 1270
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 539 transition count 1270
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 84 place count 528 transition count 1259
Free-agglomeration rule applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 102 place count 528 transition count 1241
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 120 place count 510 transition count 1241
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 125 place count 510 transition count 1236
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 130 place count 505 transition count 1236
Applied a total of 130 rules in 80 ms. Remains 505 /570 variables (removed 65) and now considering 1236/1301 (removed 65) transitions.
// Phase 1: matrix 1236 rows 505 cols
[2025-05-29 17:42:10] [INFO ] Computed 54 invariants in 13 ms
[2025-05-29 17:42:10] [INFO ] Implicit Places using invariants in 283 ms returned []
[2025-05-29 17:42:10] [INFO ] Invariant cache hit.
[2025-05-29 17:42:11] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1321 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 505/932 places, 1236/1568 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2764 ms. Remains : 505/932 places, 1236/1568 transitions.
[2025-05-29 17:42:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (17956 resets) in 1950 ms. (512 steps per ms)
FORMULA ASLink-PT-06b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000005 steps (19009 resets) in 3712 ms. (1346 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:42:17] [INFO ] Invariant cache hit.
[2025-05-29 17:42:17] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:17] [INFO ] [Real]Absence check using 14 positive and 40 generalized place invariants in 10 ms returned sat
[2025-05-29 17:42:17] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2025-05-29 17:42:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:17] [INFO ] [Nat]Absence check using 14 positive and 40 generalized place invariants in 11 ms returned sat
[2025-05-29 17:42:17] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2025-05-29 17:42:18] [INFO ] Computed and/alt/rep : 277/1249/277 causal constraints (skipped 926 transitions) in 57 ms.
[2025-05-29 17:42:18] [INFO ] Added : 37 causal constraints over 8 iterations in 554 ms. Result :sat
Minimization took 598 ms.
[2025-05-29 17:42:19] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-05-29 17:42:19] [INFO ] [Real]Absence check using 14 positive and 40 generalized place invariants in 10 ms returned sat
[2025-05-29 17:42:19] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2025-05-29 17:42:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-05-29 17:42:19] [INFO ] [Nat]Absence check using 14 positive and 40 generalized place invariants in 11 ms returned sat
[2025-05-29 17:42:19] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2025-05-29 17:42:20] [INFO ] Computed and/alt/rep : 277/1249/277 causal constraints (skipped 926 transitions) in 62 ms.
[2025-05-29 17:42:20] [INFO ] Added : 11 causal constraints over 3 iterations in 326 ms. Result :sat
Minimization took 661 ms.
[2025-05-29 17:42:21] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:21] [INFO ] [Real]Absence check using 14 positive and 40 generalized place invariants in 10 ms returned sat
[2025-05-29 17:42:21] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2025-05-29 17:42:21] [INFO ] Computed and/alt/rep : 277/1249/277 causal constraints (skipped 926 transitions) in 59 ms.
[2025-05-29 17:42:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-05-29 17:42:21] [INFO ] [Nat]Absence check using 14 positive and 40 generalized place invariants in 11 ms returned sat
[2025-05-29 17:42:21] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2025-05-29 17:42:22] [INFO ] Computed and/alt/rep : 277/1249/277 causal constraints (skipped 926 transitions) in 63 ms.
[2025-05-29 17:42:22] [INFO ] Added : 9 causal constraints over 2 iterations in 268 ms. Result :sat
Minimization took 431 ms.
[2025-05-29 17:42:22] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2025-05-29 17:42:22] [INFO ] [Real]Absence check using 14 positive and 40 generalized place invariants in 11 ms returned sat
[2025-05-29 17:42:23] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2025-05-29 17:42:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:23] [INFO ] [Nat]Absence check using 14 positive and 40 generalized place invariants in 10 ms returned sat
[2025-05-29 17:42:23] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2025-05-29 17:42:23] [INFO ] Computed and/alt/rep : 277/1249/277 causal constraints (skipped 926 transitions) in 62 ms.
[2025-05-29 17:42:23] [INFO ] Added : 12 causal constraints over 3 iterations in 379 ms. Result :sat
Minimization took 481 ms.
[2025-05-29 17:42:24] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:24] [INFO ] [Real]Absence check using 14 positive and 40 generalized place invariants in 10 ms returned sat
[2025-05-29 17:42:24] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2025-05-29 17:42:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:24] [INFO ] [Nat]Absence check using 14 positive and 40 generalized place invariants in 10 ms returned sat
[2025-05-29 17:42:25] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2025-05-29 17:42:25] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2025-05-29 17:42:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2025-05-29 17:42:25] [INFO ] Computed and/alt/rep : 277/1249/277 causal constraints (skipped 926 transitions) in 62 ms.
[2025-05-29 17:42:25] [INFO ] Added : 34 causal constraints over 7 iterations in 527 ms. Result :sat
Minimization took 456 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-06b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-06b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1236/1236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 505 transition count 1234
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 502 transition count 1234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 502 transition count 1233
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 501 transition count 1233
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 500 transition count 1232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 500 transition count 1231
Applied a total of 10 rules in 32 ms. Remains 500 /505 variables (removed 5) and now considering 1231/1236 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 500/505 places, 1231/1236 transitions.
// Phase 1: matrix 1231 rows 500 cols
[2025-05-29 17:42:27] [INFO ] Computed 53 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (17854 resets) in 1894 ms. (527 steps per ms)
BEST_FIRST walk for 3000003 steps (11405 resets) in 2173 ms. (1379 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 17:42:31] [INFO ] Invariant cache hit.
[2025-05-29 17:42:31] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:31] [INFO ] [Real]Absence check using 10 positive and 43 generalized place invariants in 10 ms returned sat
[2025-05-29 17:42:31] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2025-05-29 17:42:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:31] [INFO ] [Nat]Absence check using 10 positive and 43 generalized place invariants in 11 ms returned sat
[2025-05-29 17:42:32] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2025-05-29 17:42:32] [INFO ] Computed and/alt/rep : 280/1308/280 causal constraints (skipped 918 transitions) in 60 ms.
[2025-05-29 17:42:32] [INFO ] Added : 14 causal constraints over 3 iterations in 309 ms. Result :sat
Minimization took 475 ms.
[2025-05-29 17:42:33] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:33] [INFO ] [Real]Absence check using 10 positive and 43 generalized place invariants in 16 ms returned sat
[2025-05-29 17:42:33] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2025-05-29 17:42:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:33] [INFO ] [Nat]Absence check using 10 positive and 43 generalized place invariants in 10 ms returned sat
[2025-05-29 17:42:33] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2025-05-29 17:42:33] [INFO ] Computed and/alt/rep : 280/1308/280 causal constraints (skipped 918 transitions) in 58 ms.
[2025-05-29 17:42:34] [INFO ] Added : 46 causal constraints over 10 iterations in 713 ms. Result :sat
Minimization took 471 ms.
[2025-05-29 17:42:35] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:35] [INFO ] [Real]Absence check using 10 positive and 43 generalized place invariants in 13 ms returned sat
[2025-05-29 17:42:35] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2025-05-29 17:42:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:35] [INFO ] [Nat]Absence check using 10 positive and 43 generalized place invariants in 10 ms returned sat
[2025-05-29 17:42:35] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2025-05-29 17:42:35] [INFO ] Computed and/alt/rep : 280/1308/280 causal constraints (skipped 918 transitions) in 65 ms.
[2025-05-29 17:42:36] [INFO ] Added : 37 causal constraints over 8 iterations in 596 ms. Result :sat
Minimization took 475 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 1231/1231 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 1231/1231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 500/500 places, 1231/1231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 1231/1231 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 1231/1231 (removed 0) transitions.
[2025-05-29 17:42:37] [INFO ] Invariant cache hit.
[2025-05-29 17:42:37] [INFO ] Implicit Places using invariants in 290 ms returned [71, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 292 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 498/500 places, 1231/1231 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 496 transition count 1229
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 496 transition count 1228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 495 transition count 1228
Applied a total of 6 rules in 54 ms. Remains 495 /498 variables (removed 3) and now considering 1228/1231 (removed 3) transitions.
// Phase 1: matrix 1228 rows 495 cols
[2025-05-29 17:42:37] [INFO ] Computed 51 invariants in 16 ms
[2025-05-29 17:42:38] [INFO ] Implicit Places using invariants in 278 ms returned []
[2025-05-29 17:42:38] [INFO ] Invariant cache hit.
[2025-05-29 17:42:38] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 495/500 places, 1228/1231 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1562 ms. Remains : 495/500 places, 1228/1231 transitions.
[2025-05-29 17:42:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (17850 resets) in 1922 ms. (520 steps per ms)
BEST_FIRST walk for 3000003 steps (11424 resets) in 2169 ms. (1382 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 17:42:43] [INFO ] Invariant cache hit.
[2025-05-29 17:42:43] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:43] [INFO ] [Real]Absence check using 13 positive and 38 generalized place invariants in 10 ms returned sat
[2025-05-29 17:42:43] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2025-05-29 17:42:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:43] [INFO ] [Nat]Absence check using 13 positive and 38 generalized place invariants in 10 ms returned sat
[2025-05-29 17:42:43] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2025-05-29 17:42:43] [INFO ] Computed and/alt/rep : 270/1232/270 causal constraints (skipped 925 transitions) in 66 ms.
[2025-05-29 17:42:44] [INFO ] Added : 18 causal constraints over 4 iterations in 326 ms. Result :sat
Minimization took 447 ms.
[2025-05-29 17:42:44] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:44] [INFO ] [Real]Absence check using 13 positive and 38 generalized place invariants in 10 ms returned sat
[2025-05-29 17:42:45] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2025-05-29 17:42:45] [INFO ] Computed and/alt/rep : 270/1232/270 causal constraints (skipped 925 transitions) in 61 ms.
[2025-05-29 17:42:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2025-05-29 17:42:45] [INFO ] [Nat]Absence check using 13 positive and 38 generalized place invariants in 11 ms returned sat
[2025-05-29 17:42:45] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2025-05-29 17:42:45] [INFO ] Computed and/alt/rep : 270/1232/270 causal constraints (skipped 925 transitions) in 60 ms.
[2025-05-29 17:42:46] [INFO ] Added : 26 causal constraints over 6 iterations in 442 ms. Result :sat
Minimization took 499 ms.
[2025-05-29 17:42:46] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-29 17:42:46] [INFO ] [Real]Absence check using 13 positive and 38 generalized place invariants in 10 ms returned sat
[2025-05-29 17:42:47] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2025-05-29 17:42:47] [INFO ] Computed and/alt/rep : 270/1232/270 causal constraints (skipped 925 transitions) in 59 ms.
[2025-05-29 17:42:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-05-29 17:42:47] [INFO ] [Nat]Absence check using 13 positive and 38 generalized place invariants in 16 ms returned sat
[2025-05-29 17:42:47] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2025-05-29 17:42:47] [INFO ] Computed and/alt/rep : 270/1232/270 causal constraints (skipped 925 transitions) in 62 ms.
[2025-05-29 17:42:48] [INFO ] Added : 17 causal constraints over 4 iterations in 385 ms. Result :sat
Minimization took 814 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 1228/1228 transitions.
Applied a total of 0 rules in 15 ms. Remains 495 /495 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 495/495 places, 1228/1228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 1228/1228 transitions.
Applied a total of 0 rules in 14 ms. Remains 495 /495 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2025-05-29 17:42:49] [INFO ] Invariant cache hit.
[2025-05-29 17:42:49] [INFO ] Implicit Places using invariants in 263 ms returned []
[2025-05-29 17:42:49] [INFO ] Invariant cache hit.
[2025-05-29 17:42:50] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
[2025-05-29 17:42:50] [INFO ] Redundant transitions in 83 ms returned []
Running 1195 sub problems to find dead transitions.
[2025-05-29 17:42:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 1195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1195 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/495 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1195 unsolved
SMT process timed out in 30778ms, After SMT, problems are : Problem set: 0 solved, 1195 unsolved
Search for dead transitions found 0 dead transitions in 30806ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32082 ms. Remains : 495/495 places, 1228/1228 transitions.
RANDOM walk for 40000 steps (698 resets) in 1204 ms. (33 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (144 resets) in 254 ms. (156 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (150 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (156 resets) in 153 ms. (259 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (150 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (161 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (150 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
[2025-05-29 17:43:22] [INFO ] Flatten gal took : 329 ms
[2025-05-29 17:43:22] [INFO ] Flatten gal took : 161 ms
[2025-05-29 17:43:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7704006733995345875.gal : 59 ms
[2025-05-29 17:43:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10085628347975563637.prop : 2 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/ReachabilityCardinality7704006733995345875.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10085628347975563637.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/ReachabilityCardinality10085628347975563637.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :12 after 44
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :44 after 328
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :328 after 18272
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :18272 after 1.0624e+06
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1.0624e+06 after 1.14666e+06
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1.14666e+06 after 1.15169e+06
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :1.15169e+06 after 2.52819e+06
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2.52819e+06 after 6.69756e+07
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :6.69756e+07 after 2.97692e+08
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.5174e+09,1.6713,45872,2,32168,20,93451,6,0,3211,68546,0
Total reachable state count : 1517396724

Verifying 6 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,1.68067,46132,2,496,20,93451,7,0,3214,68546,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,1.68946,46132,2,496,20,93451,8,0,3215,68546,0
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,6,1.69313,46132,2,605,20,93451,9,0,3217,68546,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,6,1.69617,46132,2,605,20,93451,10,0,3218,68546,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,44,1.70134,46132,2,817,20,93451,11,0,3220,68546,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,44,1.70605,46132,2,817,20,93451,12,0,3221,68546,0
Interrupted probabilistic random walk after 222811 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 6
Probabilistic random walk after 222811 steps, saw 115539 distinct states, run finished after 3004 ms. (steps per millisecond=74 ) properties seen :0
FORMULA ASLink-PT-06b-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-06b-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-06b-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 290929 ms.

BK_STOP 1748540605425

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-06b"
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-06b, 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-174853743000047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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