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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K 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.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.3M 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-09b-UpperBounds-00
FORMULA_NAME ASLink-PT-09b-UpperBounds-01
FORMULA_NAME ASLink-PT-09b-UpperBounds-02
FORMULA_NAME ASLink-PT-09b-UpperBounds-03
FORMULA_NAME ASLink-PT-09b-UpperBounds-04
FORMULA_NAME ASLink-PT-09b-UpperBounds-05
FORMULA_NAME ASLink-PT-09b-UpperBounds-06
FORMULA_NAME ASLink-PT-09b-UpperBounds-07
FORMULA_NAME ASLink-PT-09b-UpperBounds-08
FORMULA_NAME ASLink-PT-09b-UpperBounds-09
FORMULA_NAME ASLink-PT-09b-UpperBounds-10
FORMULA_NAME ASLink-PT-09b-UpperBounds-11
FORMULA_NAME ASLink-PT-09b-UpperBounds-12
FORMULA_NAME ASLink-PT-09b-UpperBounds-13
FORMULA_NAME ASLink-PT-09b-UpperBounds-14
FORMULA_NAME ASLink-PT-09b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748540689193

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-09b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:44:50] [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:44:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:44:50] [INFO ] Load time of PNML (sax parser for PT used): 236 ms
[2025-05-29 17:44:50] [INFO ] Transformed 4014 places.
[2025-05-29 17:44:50] [INFO ] Transformed 4932 transitions.
[2025-05-29 17:44:50] [INFO ] Found NUPN structural information;
[2025-05-29 17:44:50] [INFO ] Parsed PT model containing 4014 places and 4932 transitions and 14960 arcs in 407 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 4932 rows 4014 cols
[2025-05-29 17:44:51] [INFO ] Computed 394 invariants in 194 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 (12 resets) in 90 ms. (109 steps per ms)
FORMULA ASLink-PT-09b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-09b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-09b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-09b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-09b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110010 steps (22 resets) in 182 ms. (601 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-29 17:44:51] [INFO ] Invariant cache hit.
[2025-05-29 17:44:52] [INFO ] [Real]Absence check using 93 positive place invariants in 111 ms returned sat
[2025-05-29 17:44:52] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 123 ms returned sat
[2025-05-29 17:44:54] [INFO ] [Real]Absence check using state equation in 2342 ms returned sat
[2025-05-29 17:44:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:55] [INFO ] [Nat]Absence check using 93 positive place invariants in 109 ms returned sat
[2025-05-29 17:44:55] [INFO ] [Nat]Absence check using 93 positive and 301 generalized place invariants in 117 ms returned sat
[2025-05-29 17:44:58] [INFO ] [Nat]Absence check using state equation in 2944 ms returned sat
[2025-05-29 17:45:01] [INFO ] Deduced a trap composed of 37 places in 2807 ms of which 178 ms to minimize.
[2025-05-29 17:45:01] [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:45:02] [INFO ] [Real]Absence check using 93 positive place invariants in 105 ms returned sat
[2025-05-29 17:45:02] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 124 ms returned sat
[2025-05-29 17:45:05] [INFO ] [Real]Absence check using state equation in 3037 ms returned sat
[2025-05-29 17:45:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:06] [INFO ] [Nat]Absence check using 93 positive place invariants in 108 ms returned sat
[2025-05-29 17:45:06] [INFO ] [Nat]Absence check using 93 positive and 301 generalized place invariants in 135 ms returned sat
[2025-05-29 17:45:09] [INFO ] [Nat]Absence check using state equation in 2728 ms returned sat
[2025-05-29 17:45:11] [INFO ] Deduced a trap composed of 211 places in 2079 ms of which 24 ms to minimize.
[2025-05-29 17:45:11] [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:45:12] [INFO ] [Real]Absence check using 93 positive place invariants in 101 ms returned sat
[2025-05-29 17:45:12] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 130 ms returned sat
[2025-05-29 17:45:15] [INFO ] [Real]Absence check using state equation in 2733 ms returned sat
[2025-05-29 17:45:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:16] [INFO ] [Nat]Absence check using 93 positive place invariants in 107 ms returned sat
[2025-05-29 17:45:16] [INFO ] [Nat]Absence check using 93 positive and 301 generalized place invariants in 132 ms returned sat
[2025-05-29 17:45:19] [INFO ] [Nat]Absence check using state equation in 2871 ms returned sat
[2025-05-29 17:45:21] [INFO ] Deduced a trap composed of 149 places in 1694 ms of which 20 ms to minimize.
[2025-05-29 17:45:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 17:45:21] [INFO ] [Real]Absence check using 93 positive place invariants in 98 ms returned sat
[2025-05-29 17:45:21] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 125 ms returned sat
[2025-05-29 17:45:24] [INFO ] [Real]Absence check using state equation in 2925 ms returned sat
[2025-05-29 17:45:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:25] [INFO ] [Nat]Absence check using 93 positive place invariants in 101 ms returned sat
[2025-05-29 17:45:25] [INFO ] [Nat]Absence check using 93 positive and 301 generalized place invariants in 123 ms returned sat
[2025-05-29 17:45:28] [INFO ] [Nat]Absence check using state equation in 2846 ms returned sat
[2025-05-29 17:45:31] [INFO ] Deduced a trap composed of 26 places in 2207 ms of which 22 ms to minimize.
[2025-05-29 17:45:31] [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:45:31] [INFO ] [Real]Absence check using 93 positive place invariants in 110 ms returned sat
[2025-05-29 17:45:31] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 121 ms returned sat
[2025-05-29 17:45:35] [INFO ] [Real]Absence check using state equation in 3317 ms returned sat
[2025-05-29 17:45:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:36] [INFO ] [Nat]Absence check using 93 positive place invariants in 104 ms returned sat
[2025-05-29 17:45:36] [INFO ] [Nat]Absence check using 93 positive and 301 generalized place invariants in 128 ms returned sat
[2025-05-29 17:45:38] [INFO ] [Nat]Absence check using state equation in 2372 ms returned sat
[2025-05-29 17:45:40] [INFO ] Deduced a trap composed of 25 places in 2011 ms of which 21 ms to minimize.
[2025-05-29 17:45:40] [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:45:41] [INFO ] [Real]Absence check using 93 positive place invariants in 102 ms returned sat
[2025-05-29 17:45:41] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 133 ms returned sat
[2025-05-29 17:45:44] [INFO ] [Real]Absence check using state equation in 2504 ms returned sat
[2025-05-29 17:45:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:44] [INFO ] [Nat]Absence check using 93 positive place invariants in 104 ms returned sat
[2025-05-29 17:45:45] [INFO ] [Nat]Absence check using 93 positive and 301 generalized place invariants in 125 ms returned sat
[2025-05-29 17:45:48] [INFO ] [Nat]Absence check using state equation in 3144 ms returned sat
[2025-05-29 17:45:50] [INFO ] Deduced a trap composed of 35 places in 2290 ms of which 23 ms to minimize.
[2025-05-29 17:45:50] [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:45:51] [INFO ] [Real]Absence check using 93 positive place invariants in 100 ms returned sat
[2025-05-29 17:45:51] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 129 ms returned sat
[2025-05-29 17:45:53] [INFO ] [Real]Absence check using state equation in 2487 ms returned sat
[2025-05-29 17:45:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:54] [INFO ] [Nat]Absence check using 93 positive place invariants in 101 ms returned sat
[2025-05-29 17:45:54] [INFO ] [Nat]Absence check using 93 positive and 301 generalized place invariants in 126 ms returned sat
[2025-05-29 17:45:58] [INFO ] [Nat]Absence check using state equation in 3388 ms returned sat
[2025-05-29 17:46:00] [INFO ] Deduced a trap composed of 29 places in 2253 ms of which 23 ms to minimize.
[2025-05-29 17:46:00] [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:46:01] [INFO ] [Real]Absence check using 93 positive place invariants in 103 ms returned sat
[2025-05-29 17:46:01] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 125 ms returned sat
[2025-05-29 17:46:03] [INFO ] [Real]Absence check using state equation in 2130 ms returned sat
[2025-05-29 17:46:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:46:04] [INFO ] [Nat]Absence check using 93 positive place invariants in 109 ms returned sat
[2025-05-29 17:46:04] [INFO ] [Nat]Absence check using 93 positive and 301 generalized place invariants in 114 ms returned sat
[2025-05-29 17:46:08] [INFO ] [Nat]Absence check using state equation in 4247 ms returned unknown
[2025-05-29 17:46:09] [INFO ] [Real]Absence check using 93 positive place invariants in 95 ms returned sat
[2025-05-29 17:46:09] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 123 ms returned sat
[2025-05-29 17:46:12] [INFO ] [Real]Absence check using state equation in 3376 ms returned sat
[2025-05-29 17:46:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:46:13] [INFO ] [Nat]Absence check using 93 positive place invariants in 98 ms returned sat
[2025-05-29 17:46:13] [INFO ] [Nat]Absence check using 93 positive and 301 generalized place invariants in 121 ms returned sat
[2025-05-29 17:46:17] [INFO ] [Nat]Absence check using state equation in 3724 ms returned sat
[2025-05-29 17:46:18] [INFO ] Deduced a trap composed of 28 places in 965 ms of which 14 ms to minimize.
[2025-05-29 17:46:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 17:46:19] [INFO ] [Real]Absence check using 93 positive place invariants in 96 ms returned sat
[2025-05-29 17:46:19] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 120 ms returned sat
[2025-05-29 17:46:22] [INFO ] [Real]Absence check using state equation in 3400 ms returned sat
[2025-05-29 17:46:25] [INFO ] Deduced a trap composed of 160 places in 2875 ms of which 25 ms to minimize.
[2025-05-29 17:46: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 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:2249)
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:46:26] [INFO ] [Real]Absence check using 93 positive place invariants in 93 ms returned sat
[2025-05-29 17:46:26] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 119 ms returned sat
[2025-05-29 17:46:29] [INFO ] [Real]Absence check using state equation in 2499 ms returned sat
[2025-05-29 17:46:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:46:30] [INFO ] [Nat]Absence check using 93 positive place invariants in 100 ms returned sat
[2025-05-29 17:46:30] [INFO ] [Nat]Absence check using 93 positive and 301 generalized place invariants in 115 ms returned sat
[2025-05-29 17:46:32] [INFO ] [Nat]Absence check using state equation in 2730 ms returned sat
[2025-05-29 17:46:34] [INFO ] Deduced a trap composed of 27 places in 1838 ms of which 17 ms to minimize.
[2025-05-29 17:46: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 10
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, 0] Max Struct:[1, 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 11 out of 4014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4014/4014 places, 4932/4932 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 935 transitions
Trivial Post-agglo rules discarded 935 transitions
Performed 935 trivial Post agglomeration. Transition count delta: 935
Iterating post reduction 0 with 935 rules applied. Total rules applied 935 place count 4014 transition count 3997
Reduce places removed 935 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 977 rules applied. Total rules applied 1912 place count 3079 transition count 3955
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 1924 place count 3068 transition count 3954
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1925 place count 3067 transition count 3954
Performed 928 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 928 Pre rules applied. Total rules applied 1925 place count 3067 transition count 3026
Deduced a syphon composed of 928 places in 7 ms
Ensure Unique test removed 92 places
Reduce places removed 1020 places and 0 transitions.
Iterating global reduction 4 with 1948 rules applied. Total rules applied 3873 place count 2047 transition count 3026
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 4 with 67 rules applied. Total rules applied 3940 place count 2037 transition count 2969
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 58 rules applied. Total rules applied 3998 place count 1980 transition count 2968
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3999 place count 1979 transition count 2968
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 36 Pre rules applied. Total rules applied 3999 place count 1979 transition count 2932
Deduced a syphon composed of 36 places in 19 ms
Ensure Unique test removed 36 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 7 with 108 rules applied. Total rules applied 4107 place count 1907 transition count 2932
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 36 Pre rules applied. Total rules applied 4107 place count 1907 transition count 2896
Deduced a syphon composed of 36 places in 19 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 7 with 72 rules applied. Total rules applied 4179 place count 1871 transition count 2896
Discarding 129 places :
Symmetric choice reduction at 7 with 129 rule applications. Total rules 4308 place count 1742 transition count 2767
Iterating global reduction 7 with 129 rules applied. Total rules applied 4437 place count 1742 transition count 2767
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4438 place count 1742 transition count 2766
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 42 Pre rules applied. Total rules applied 4438 place count 1742 transition count 2724
Deduced a syphon composed of 42 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 8 with 85 rules applied. Total rules applied 4523 place count 1699 transition count 2724
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4523 place count 1699 transition count 2723
Deduced a syphon composed of 1 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 4526 place count 1697 transition count 2723
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 4536 place count 1687 transition count 2660
Iterating global reduction 8 with 10 rules applied. Total rules applied 4546 place count 1687 transition count 2660
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 4546 place count 1687 transition count 2651
Deduced a syphon composed of 9 places in 5 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 4564 place count 1678 transition count 2651
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4565 place count 1677 transition count 2643
Iterating global reduction 8 with 1 rules applied. Total rules applied 4566 place count 1677 transition count 2643
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4567 place count 1676 transition count 2635
Iterating global reduction 8 with 1 rules applied. Total rules applied 4568 place count 1676 transition count 2635
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4569 place count 1675 transition count 2627
Iterating global reduction 8 with 1 rules applied. Total rules applied 4570 place count 1675 transition count 2627
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4571 place count 1674 transition count 2619
Iterating global reduction 8 with 1 rules applied. Total rules applied 4572 place count 1674 transition count 2619
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4573 place count 1673 transition count 2611
Iterating global reduction 8 with 1 rules applied. Total rules applied 4574 place count 1673 transition count 2611
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4575 place count 1672 transition count 2603
Iterating global reduction 8 with 1 rules applied. Total rules applied 4576 place count 1672 transition count 2603
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4577 place count 1671 transition count 2595
Iterating global reduction 8 with 1 rules applied. Total rules applied 4578 place count 1671 transition count 2595
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4579 place count 1670 transition count 2587
Iterating global reduction 8 with 1 rules applied. Total rules applied 4580 place count 1670 transition count 2587
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4581 place count 1669 transition count 2579
Iterating global reduction 8 with 1 rules applied. Total rules applied 4582 place count 1669 transition count 2579
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4583 place count 1668 transition count 2571
Iterating global reduction 8 with 1 rules applied. Total rules applied 4584 place count 1668 transition count 2571
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4585 place count 1667 transition count 2563
Iterating global reduction 8 with 1 rules applied. Total rules applied 4586 place count 1667 transition count 2563
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4587 place count 1666 transition count 2555
Iterating global reduction 8 with 1 rules applied. Total rules applied 4588 place count 1666 transition count 2555
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4589 place count 1665 transition count 2547
Iterating global reduction 8 with 1 rules applied. Total rules applied 4590 place count 1665 transition count 2547
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4591 place count 1664 transition count 2539
Iterating global reduction 8 with 1 rules applied. Total rules applied 4592 place count 1664 transition count 2539
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4593 place count 1663 transition count 2531
Iterating global reduction 8 with 1 rules applied. Total rules applied 4594 place count 1663 transition count 2531
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4595 place count 1662 transition count 2523
Iterating global reduction 8 with 1 rules applied. Total rules applied 4596 place count 1662 transition count 2523
Performed 233 Post agglomeration using F-continuation condition.Transition count delta: 233
Deduced a syphon composed of 233 places in 4 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 8 with 466 rules applied. Total rules applied 5062 place count 1429 transition count 2290
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5063 place count 1428 transition count 2289
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 5065 place count 1427 transition count 2289
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5066 place count 1426 transition count 2288
Iterating global reduction 8 with 1 rules applied. Total rules applied 5067 place count 1426 transition count 2288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 5069 place count 1426 transition count 2286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 5070 place count 1425 transition count 2286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 5072 place count 1424 transition count 2295
Free-agglomeration rule applied 10 times.
Iterating global reduction 10 with 10 rules applied. Total rules applied 5082 place count 1424 transition count 2285
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 5092 place count 1414 transition count 2285
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 11 with 8 rules applied. Total rules applied 5100 place count 1414 transition count 2277
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 5108 place count 1406 transition count 2277
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 5109 place count 1405 transition count 2276
Reduce places removed 17 places and 0 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 12 with 25 rules applied. Total rules applied 5134 place count 1388 transition count 2268
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 5142 place count 1380 transition count 2268
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 25 Pre rules applied. Total rules applied 5142 place count 1380 transition count 2243
Deduced a syphon composed of 25 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 14 with 51 rules applied. Total rules applied 5193 place count 1354 transition count 2243
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 14 with 10 rules applied. Total rules applied 5203 place count 1344 transition count 2243
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 5203 place count 1344 transition count 2242
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 5205 place count 1343 transition count 2242
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 5 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 15 with 38 rules applied. Total rules applied 5243 place count 1324 transition count 2223
Discarding 9 places :
Symmetric choice reduction at 15 with 9 rule applications. Total rules 5252 place count 1315 transition count 2214
Iterating global reduction 15 with 9 rules applied. Total rules applied 5261 place count 1315 transition count 2214
Free-agglomeration rule applied 9 times.
Iterating global reduction 15 with 9 rules applied. Total rules applied 5270 place count 1315 transition count 2205
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 15 with 9 rules applied. Total rules applied 5279 place count 1306 transition count 2205
Applied a total of 5279 rules in 3131 ms. Remains 1306 /4014 variables (removed 2708) and now considering 2205/4932 (removed 2727) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3146 ms. Remains : 1306/4014 places, 2205/4932 transitions.
// Phase 1: matrix 2205 rows 1306 cols
[2025-05-29 17:46:38] [INFO ] Computed 225 invariants in 50 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (9837 resets) in 3595 ms. (278 steps per ms)
FORMULA ASLink-PT-09b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-09b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-09b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-09b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-09b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-09b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000004 steps (5298 resets) in 7329 ms. (682 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-05-29 17:46:48] [INFO ] Invariant cache hit.
[2025-05-29 17:46:49] [INFO ] [Real]Absence check using 62 positive place invariants in 23 ms returned sat
[2025-05-29 17:46:49] [INFO ] [Real]Absence check using 62 positive and 163 generalized place invariants in 37 ms returned sat
[2025-05-29 17:46:49] [INFO ] [Real]Absence check using state equation in 645 ms returned sat
[2025-05-29 17:46:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:46:50] [INFO ] [Nat]Absence check using 62 positive place invariants in 32 ms returned sat
[2025-05-29 17:46:50] [INFO ] [Nat]Absence check using 62 positive and 163 generalized place invariants in 32 ms returned sat
[2025-05-29 17:46:50] [INFO ] [Nat]Absence check using state equation in 713 ms returned sat
[2025-05-29 17:46:51] [INFO ] Computed and/alt/rep : 885/3373/885 causal constraints (skipped 1275 transitions) in 135 ms.
[2025-05-29 17:46:56] [INFO ] Added : 190 causal constraints over 38 iterations in 5786 ms. Result :sat
Minimization took 1070 ms.
[2025-05-29 17:46:57] [INFO ] [Real]Absence check using 62 positive place invariants in 21 ms returned sat
[2025-05-29 17:46:58] [INFO ] [Real]Absence check using 62 positive and 163 generalized place invariants in 32 ms returned sat
[2025-05-29 17:46:58] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2025-05-29 17:46:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:46:58] [INFO ] [Nat]Absence check using 62 positive place invariants in 20 ms returned sat
[2025-05-29 17:46:58] [INFO ] [Nat]Absence check using 62 positive and 163 generalized place invariants in 31 ms returned sat
[2025-05-29 17:46:59] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2025-05-29 17:46:59] [INFO ] Computed and/alt/rep : 885/3373/885 causal constraints (skipped 1275 transitions) in 117 ms.
[2025-05-29 17:47:03] [INFO ] Added : 144 causal constraints over 29 iterations in 3700 ms. Result :sat
Minimization took 1197 ms.
[2025-05-29 17:47:04] [INFO ] [Real]Absence check using 62 positive place invariants in 22 ms returned sat
[2025-05-29 17:47:04] [INFO ] [Real]Absence check using 62 positive and 163 generalized place invariants in 35 ms returned sat
[2025-05-29 17:47:05] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2025-05-29 17:47:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:47:05] [INFO ] [Nat]Absence check using 62 positive place invariants in 21 ms returned sat
[2025-05-29 17:47:05] [INFO ] [Nat]Absence check using 62 positive and 163 generalized place invariants in 33 ms returned sat
[2025-05-29 17:47:06] [INFO ] [Nat]Absence check using state equation in 617 ms returned sat
[2025-05-29 17:47:06] [INFO ] Computed and/alt/rep : 885/3373/885 causal constraints (skipped 1275 transitions) in 122 ms.
[2025-05-29 17:47:20] [INFO ] Added : 641 causal constraints over 129 iterations in 14076 ms. Result :sat
Minimization took 1357 ms.
[2025-05-29 17:47:21] [INFO ] [Real]Absence check using 62 positive place invariants in 21 ms returned sat
[2025-05-29 17:47:21] [INFO ] [Real]Absence check using 62 positive and 163 generalized place invariants in 32 ms returned sat
[2025-05-29 17:47:22] [INFO ] [Real]Absence check using state equation in 703 ms returned sat
[2025-05-29 17:47:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:47:22] [INFO ] [Nat]Absence check using 62 positive place invariants in 26 ms returned sat
[2025-05-29 17:47:22] [INFO ] [Nat]Absence check using 62 positive and 163 generalized place invariants in 32 ms returned sat
[2025-05-29 17:47:23] [INFO ] [Nat]Absence check using state equation in 766 ms returned sat
[2025-05-29 17:47:23] [INFO ] Computed and/alt/rep : 885/3373/885 causal constraints (skipped 1275 transitions) in 112 ms.
[2025-05-29 17:47:38] [INFO ] Deduced a trap composed of 150 places in 279 ms of which 4 ms to minimize.
[2025-05-29 17:47:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 482 ms
[2025-05-29 17:47:38] [INFO ] Added : 644 causal constraints over 129 iterations in 14751 ms. Result :sat
Minimization took 2020 ms.
[2025-05-29 17:47:40] [INFO ] [Real]Absence check using 62 positive place invariants in 21 ms returned sat
[2025-05-29 17:47:40] [INFO ] [Real]Absence check using 62 positive and 163 generalized place invariants in 32 ms returned sat
[2025-05-29 17:47:41] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2025-05-29 17:47:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:47:41] [INFO ] [Nat]Absence check using 62 positive place invariants in 19 ms returned sat
[2025-05-29 17:47:41] [INFO ] [Nat]Absence check using 62 positive and 163 generalized place invariants in 32 ms returned sat
[2025-05-29 17:47:42] [INFO ] [Nat]Absence check using state equation in 720 ms returned sat
[2025-05-29 17:47:42] [INFO ] Computed and/alt/rep : 885/3373/885 causal constraints (skipped 1275 transitions) in 109 ms.
[2025-05-29 17:47:56] [INFO ] Added : 670 causal constraints over 134 iterations in 14328 ms. Result :sat
Minimization took 1285 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 1306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1306/1306 places, 2205/2205 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 1306 transition count 2200
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 1301 transition count 2200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1300 transition count 2199
Applied a total of 12 rules in 105 ms. Remains 1300 /1306 variables (removed 6) and now considering 2199/2205 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 1300/1306 places, 2199/2205 transitions.
// Phase 1: matrix 2199 rows 1300 cols
[2025-05-29 17:48:05] [INFO ] Computed 225 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (9709 resets) in 3344 ms. (298 steps per ms)
BEST_FIRST walk for 5000005 steps (5329 resets) in 7296 ms. (685 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-05-29 17:48:16] [INFO ] Invariant cache hit.
[2025-05-29 17:48:16] [INFO ] [Real]Absence check using 62 positive place invariants in 20 ms returned sat
[2025-05-29 17:48:16] [INFO ] [Real]Absence check using 62 positive and 163 generalized place invariants in 34 ms returned sat
[2025-05-29 17:48:17] [INFO ] [Real]Absence check using state equation in 650 ms returned sat
[2025-05-29 17:48:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:17] [INFO ] [Nat]Absence check using 62 positive place invariants in 22 ms returned sat
[2025-05-29 17:48:17] [INFO ] [Nat]Absence check using 62 positive and 163 generalized place invariants in 31 ms returned sat
[2025-05-29 17:48:18] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2025-05-29 17:48:18] [INFO ] Computed and/alt/rep : 879/3367/879 causal constraints (skipped 1275 transitions) in 113 ms.
[2025-05-29 17:48:33] [INFO ] Added : 688 causal constraints over 138 iterations in 15015 ms. Result :sat
Minimization took 1371 ms.
[2025-05-29 17:48:34] [INFO ] [Real]Absence check using 62 positive place invariants in 20 ms returned sat
[2025-05-29 17:48:35] [INFO ] [Real]Absence check using 62 positive and 163 generalized place invariants in 34 ms returned sat
[2025-05-29 17:48:35] [INFO ] [Real]Absence check using state equation in 666 ms returned sat
[2025-05-29 17:48:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:35] [INFO ] [Nat]Absence check using 62 positive place invariants in 20 ms returned sat
[2025-05-29 17:48:35] [INFO ] [Nat]Absence check using 62 positive and 163 generalized place invariants in 33 ms returned sat
[2025-05-29 17:48:36] [INFO ] [Nat]Absence check using state equation in 701 ms returned sat
[2025-05-29 17:48:36] [INFO ] Computed and/alt/rep : 879/3367/879 causal constraints (skipped 1275 transitions) in 110 ms.
[2025-05-29 17:48:40] [INFO ] Added : 164 causal constraints over 33 iterations in 3888 ms. Result :sat
Minimization took 1317 ms.
[2025-05-29 17:48:42] [INFO ] [Real]Absence check using 62 positive place invariants in 19 ms returned sat
[2025-05-29 17:48:42] [INFO ] [Real]Absence check using 62 positive and 163 generalized place invariants in 32 ms returned sat
[2025-05-29 17:48:42] [INFO ] [Real]Absence check using state equation in 613 ms returned sat
[2025-05-29 17:48:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:42] [INFO ] [Nat]Absence check using 62 positive place invariants in 20 ms returned sat
[2025-05-29 17:48:42] [INFO ] [Nat]Absence check using 62 positive and 163 generalized place invariants in 30 ms returned sat
[2025-05-29 17:48:43] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2025-05-29 17:48:43] [INFO ] Computed and/alt/rep : 879/3367/879 causal constraints (skipped 1275 transitions) in 100 ms.
[2025-05-29 17:48:57] [INFO ] Added : 633 causal constraints over 127 iterations in 13543 ms. Result :sat
Minimization took 1495 ms.
[2025-05-29 17:48:58] [INFO ] [Real]Absence check using 62 positive place invariants in 21 ms returned sat
[2025-05-29 17:48:58] [INFO ] [Real]Absence check using 62 positive and 163 generalized place invariants in 34 ms returned sat
[2025-05-29 17:48:59] [INFO ] [Real]Absence check using state equation in 636 ms returned sat
[2025-05-29 17:48:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:59] [INFO ] [Nat]Absence check using 62 positive place invariants in 20 ms returned sat
[2025-05-29 17:48:59] [INFO ] [Nat]Absence check using 62 positive and 163 generalized place invariants in 31 ms returned sat
[2025-05-29 17:49:00] [INFO ] [Nat]Absence check using state equation in 564 ms returned sat
[2025-05-29 17:49:00] [INFO ] Computed and/alt/rep : 879/3367/879 causal constraints (skipped 1275 transitions) in 102 ms.
[2025-05-29 17:49:13] [INFO ] Added : 596 causal constraints over 120 iterations in 13149 ms. Result :sat
Minimization took 1755 ms.
[2025-05-29 17:49:15] [INFO ] [Real]Absence check using 62 positive place invariants in 19 ms returned sat
[2025-05-29 17:49:15] [INFO ] [Real]Absence check using 62 positive and 163 generalized place invariants in 33 ms returned sat
[2025-05-29 17:49:16] [INFO ] [Real]Absence check using state equation in 652 ms returned sat
[2025-05-29 17:49:16] [INFO ] Deduced a trap composed of 165 places in 237 ms of which 3 ms to minimize.
[2025-05-29 17:49:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:49:16] [INFO ] [Nat]Absence check using 62 positive place invariants in 20 ms returned sat
[2025-05-29 17:49:16] [INFO ] [Nat]Absence check using 62 positive and 163 generalized place invariants in 31 ms returned sat
[2025-05-29 17:49:17] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2025-05-29 17:49:17] [INFO ] Computed and/alt/rep : 879/3367/879 causal constraints (skipped 1275 transitions) in 108 ms.
[2025-05-29 17:49:32] [INFO ] Added : 646 causal constraints over 130 iterations in 14526 ms. Result :sat
Minimization took 1420 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 2199/2199 transitions.
Applied a total of 0 rules in 51 ms. Remains 1300 /1300 variables (removed 0) and now considering 2199/2199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1300/1300 places, 2199/2199 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 2199/2199 transitions.
Applied a total of 0 rules in 49 ms. Remains 1300 /1300 variables (removed 0) and now considering 2199/2199 (removed 0) transitions.
[2025-05-29 17:49:41] [INFO ] Invariant cache hit.
[2025-05-29 17:49:42] [INFO ] Implicit Places using invariants in 993 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 255, 259, 260, 271, 272, 274, 291, 309, 378, 382, 383, 394, 395, 397, 414, 432, 510, 525, 526, 528, 547, 565, 634, 638, 639, 650, 651, 653, 670, 688, 757, 761, 762, 773, 774, 776, 793, 811, 880, 884, 885, 896, 897, 899, 916, 934, 1003, 1007, 1008, 1019, 1020, 1022, 1039, 1057, 1126, 1130, 1131, 1134, 1145, 1146, 1147, 1165, 1167, 1171, 1189, 1190, 1191, 1192, 1204, 1210, 1216, 1222, 1228, 1234, 1240, 1246, 1252, 1258, 1264]
[2025-05-29 17:49:42] [INFO ] Actually due to overlaps returned [1165, 1147, 48, 168, 291, 414, 547, 670, 793, 916, 1039, 1171, 31, 151, 274, 397, 528, 653, 776, 899, 1022, 148, 271, 394, 525, 650, 773, 896, 1019, 1145, 1189, 149, 272, 395, 526, 651, 774, 897, 1020, 1146, 1167, 1190, 1, 18, 259, 260, 382, 383, 510, 638, 639, 761, 762, 884, 885, 1007, 1008, 1130, 1131, 66, 186, 309, 432, 565, 688, 811, 934, 1057, 1191, 1234, 1252, 1264, 19, 1134, 1192, 1204, 1210, 1216, 1222, 1228, 1240, 1246, 1258]
Discarding 83 places :
Implicit Place search using SMT only with invariants took 996 ms to find 83 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1217/1300 places, 2199/2199 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 172 transitions
Trivial Post-agglo rules discarded 172 transitions
Performed 172 trivial Post agglomeration. Transition count delta: 172
Iterating post reduction 0 with 180 rules applied. Total rules applied 180 place count 1209 transition count 2027
Reduce places removed 172 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 180 rules applied. Total rules applied 360 place count 1037 transition count 2019
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 360 place count 1037 transition count 1976
Deduced a syphon composed of 43 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 87 rules applied. Total rules applied 447 place count 993 transition count 1976
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 2 with 12 rules applied. Total rules applied 459 place count 989 transition count 1968
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 467 place count 981 transition count 1968
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 482 place count 966 transition count 1953
Iterating global reduction 4 with 15 rules applied. Total rules applied 497 place count 966 transition count 1953
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 500 place count 966 transition count 1950
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 500 place count 966 transition count 1949
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 502 place count 965 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 505 place count 962 transition count 1943
Iterating global reduction 5 with 3 rules applied. Total rules applied 508 place count 962 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 509 place count 961 transition count 1942
Iterating global reduction 5 with 1 rules applied. Total rules applied 510 place count 961 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 511 place count 960 transition count 1940
Iterating global reduction 5 with 1 rules applied. Total rules applied 512 place count 960 transition count 1940
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 5 with 130 rules applied. Total rules applied 642 place count 895 transition count 1875
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 650 place count 887 transition count 1867
Iterating global reduction 5 with 8 rules applied. Total rules applied 658 place count 887 transition count 1867
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 666 place count 887 transition count 1859
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 670 place count 885 transition count 1860
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 6 with 21 rules applied. Total rules applied 691 place count 885 transition count 1839
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 713 place count 863 transition count 1839
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 7 with 26 rules applied. Total rules applied 739 place count 863 transition count 1839
Applied a total of 739 rules in 373 ms. Remains 863 /1217 variables (removed 354) and now considering 1839/2199 (removed 360) transitions.
// Phase 1: matrix 1839 rows 863 cols
[2025-05-29 17:49:43] [INFO ] Computed 128 invariants in 22 ms
[2025-05-29 17:49:43] [INFO ] Implicit Places using invariants in 603 ms returned [72, 89, 95, 98, 100, 101, 104, 105, 157, 174, 180, 183, 185, 190, 191, 243, 260, 266, 269, 271, 276, 277, 348, 355, 358, 360, 363, 370, 371, 427, 444, 450, 453, 455, 460, 461, 513, 530, 536, 539, 541, 546, 547, 599, 616, 622, 625, 627, 632, 633, 685, 702, 708, 711, 713, 718, 719, 771, 788, 794, 797, 799]
[2025-05-29 17:49:43] [INFO ] Actually due to overlaps returned [104, 190, 276, 370, 460, 546, 632, 718, 105, 191, 277, 371, 461, 547, 633, 719, 89, 95, 100, 174, 180, 185, 260, 266, 271, 348, 360, 444, 450, 455, 530, 536, 541, 616, 622, 627, 702, 708, 713, 788, 794, 799, 72, 101, 157, 243, 355, 363, 427, 513, 599, 685, 771]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 609 ms to find 53 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 810/1300 places, 1839/2199 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 774 transition count 1803
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 774 transition count 1803
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 80 place count 766 transition count 1795
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 766 transition count 1795
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 122 place count 749 transition count 1778
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 123 place count 749 transition count 1777
Free-agglomeration rule applied 27 times.
Iterating global reduction 0 with 27 rules applied. Total rules applied 150 place count 749 transition count 1750
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 177 place count 722 transition count 1750
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 185 place count 722 transition count 1742
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 193 place count 714 transition count 1742
Applied a total of 193 rules in 189 ms. Remains 714 /810 variables (removed 96) and now considering 1742/1839 (removed 97) transitions.
// Phase 1: matrix 1742 rows 714 cols
[2025-05-29 17:49:43] [INFO ] Computed 75 invariants in 23 ms
[2025-05-29 17:49:44] [INFO ] Implicit Places using invariants in 442 ms returned []
[2025-05-29 17:49:44] [INFO ] Invariant cache hit.
[2025-05-29 17:49:45] [INFO ] Implicit Places using invariants and state equation in 1486 ms returned []
Implicit Place search using SMT with State Equation took 1929 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 714/1300 places, 1742/2199 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4147 ms. Remains : 714/1300 places, 1742/2199 transitions.
[2025-05-29 17:49:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (16067 resets) in 2900 ms. (344 steps per ms)
FORMULA ASLink-PT-09b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000003 steps (9476 resets) in 3812 ms. (1049 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-29 17:49:52] [INFO ] Invariant cache hit.
[2025-05-29 17:49:52] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-05-29 17:49:52] [INFO ] [Real]Absence check using 16 positive and 59 generalized place invariants in 16 ms returned sat
[2025-05-29 17:49:53] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2025-05-29 17:49:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:49:53] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-05-29 17:49:53] [INFO ] [Nat]Absence check using 16 positive and 59 generalized place invariants in 15 ms returned sat
[2025-05-29 17:49:53] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2025-05-29 17:49:53] [INFO ] Computed and/alt/rep : 423/1907/423 causal constraints (skipped 1274 transitions) in 101 ms.
[2025-05-29 17:49:55] [INFO ] Added : 75 causal constraints over 16 iterations in 1453 ms. Result :sat
Minimization took 951 ms.
[2025-05-29 17:49:56] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-05-29 17:49:56] [INFO ] [Real]Absence check using 16 positive and 59 generalized place invariants in 18 ms returned sat
[2025-05-29 17:49:56] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2025-05-29 17:49:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:49:56] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-05-29 17:49:57] [INFO ] [Nat]Absence check using 16 positive and 59 generalized place invariants in 16 ms returned sat
[2025-05-29 17:49:57] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2025-05-29 17:49:57] [INFO ] Computed and/alt/rep : 423/1907/423 causal constraints (skipped 1274 transitions) in 89 ms.
[2025-05-29 17:49:59] [INFO ] Added : 84 causal constraints over 17 iterations in 1604 ms. Result :sat
Minimization took 991 ms.
[2025-05-29 17:50:00] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-05-29 17:50:00] [INFO ] [Real]Absence check using 16 positive and 59 generalized place invariants in 16 ms returned sat
[2025-05-29 17:50:00] [INFO ] [Real]Absence check using state equation in 520 ms returned sat
[2025-05-29 17:50:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:50:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-05-29 17:50:01] [INFO ] [Nat]Absence check using 16 positive and 59 generalized place invariants in 15 ms returned sat
[2025-05-29 17:50:01] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2025-05-29 17:50:01] [INFO ] Computed and/alt/rep : 423/1907/423 causal constraints (skipped 1274 transitions) in 83 ms.
[2025-05-29 17:50:03] [INFO ] Added : 96 causal constraints over 20 iterations in 1590 ms. Result :sat
Minimization took 879 ms.
[2025-05-29 17:50:04] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-05-29 17:50:04] [INFO ] [Real]Absence check using 16 positive and 59 generalized place invariants in 16 ms returned sat
[2025-05-29 17:50:04] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2025-05-29 17:50:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:50:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-05-29 17:50:04] [INFO ] [Nat]Absence check using 16 positive and 59 generalized place invariants in 16 ms returned sat
[2025-05-29 17:50:05] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2025-05-29 17:50:05] [INFO ] Computed and/alt/rep : 423/1907/423 causal constraints (skipped 1274 transitions) in 81 ms.
[2025-05-29 17:50:06] [INFO ] Added : 69 causal constraints over 14 iterations in 1197 ms. Result :sat
Minimization took 857 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA ASLink-PT-09b-UpperBounds-15 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 714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 1742/1742 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 714 transition count 1741
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 713 transition count 1741
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 713 transition count 1739
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 711 transition count 1739
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 710 transition count 1738
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 710 transition count 1738
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 709 transition count 1737
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 709 transition count 1737
Applied a total of 10 rules in 72 ms. Remains 709 /714 variables (removed 5) and now considering 1737/1742 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 709/714 places, 1737/1742 transitions.
// Phase 1: matrix 1737 rows 709 cols
[2025-05-29 17:50:08] [INFO ] Computed 75 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (16218 resets) in 2439 ms. (409 steps per ms)
BEST_FIRST walk for 3000003 steps (7130 resets) in 2871 ms. (1044 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-29 17:50:14] [INFO ] Invariant cache hit.
[2025-05-29 17:50:14] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:50:14] [INFO ] [Real]Absence check using 15 positive and 60 generalized place invariants in 15 ms returned sat
[2025-05-29 17:50:14] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2025-05-29 17:50:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:50:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:50:14] [INFO ] [Nat]Absence check using 15 positive and 60 generalized place invariants in 15 ms returned sat
[2025-05-29 17:50:15] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2025-05-29 17:50:15] [INFO ] Computed and/alt/rep : 410/1821/410 causal constraints (skipped 1282 transitions) in 94 ms.
[2025-05-29 17:50:15] [INFO ] Added : 15 causal constraints over 3 iterations in 411 ms. Result :sat
Minimization took 1406 ms.
[2025-05-29 17:50:17] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:50:17] [INFO ] [Real]Absence check using 15 positive and 60 generalized place invariants in 17 ms returned sat
[2025-05-29 17:50:17] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2025-05-29 17:50:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:50:17] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:50:17] [INFO ] [Nat]Absence check using 15 positive and 60 generalized place invariants in 24 ms returned sat
[2025-05-29 17:50:18] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2025-05-29 17:50:18] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2025-05-29 17:50:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2025-05-29 17:50:18] [INFO ] Computed and/alt/rep : 410/1821/410 causal constraints (skipped 1282 transitions) in 92 ms.
[2025-05-29 17:50:18] [INFO ] Added : 20 causal constraints over 4 iterations in 522 ms. Result :sat
Minimization took 1270 ms.
[2025-05-29 17:50:20] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:50:20] [INFO ] [Real]Absence check using 15 positive and 60 generalized place invariants in 16 ms returned sat
[2025-05-29 17:50:20] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2025-05-29 17:50:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:50:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:50:20] [INFO ] [Nat]Absence check using 15 positive and 60 generalized place invariants in 15 ms returned sat
[2025-05-29 17:50:21] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2025-05-29 17:50:21] [INFO ] Computed and/alt/rep : 410/1821/410 causal constraints (skipped 1282 transitions) in 95 ms.
[2025-05-29 17:50:22] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2025-05-29 17:50:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2025-05-29 17:50:22] [INFO ] Added : 60 causal constraints over 12 iterations in 1287 ms. Result :sat
Minimization took 1462 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA ASLink-PT-09b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 709/709 places, 1737/1737 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 707 transition count 1736
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 707 transition count 1735
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 4 place count 707 transition count 1733
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 705 transition count 1733
Applied a total of 8 rules in 63 ms. Remains 705 /709 variables (removed 4) and now considering 1733/1737 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 705/709 places, 1733/1737 transitions.
// Phase 1: matrix 1733 rows 705 cols
[2025-05-29 17:50:25] [INFO ] Computed 74 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (16575 resets) in 2394 ms. (417 steps per ms)
BEST_FIRST walk for 2000002 steps (4894 resets) in 1644 ms. (1215 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-29 17:50:29] [INFO ] Invariant cache hit.
[2025-05-29 17:50:29] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2025-05-29 17:50:29] [INFO ] [Real]Absence check using 13 positive and 61 generalized place invariants in 16 ms returned sat
[2025-05-29 17:50:29] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2025-05-29 17:50:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:50:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2025-05-29 17:50:29] [INFO ] [Nat]Absence check using 13 positive and 61 generalized place invariants in 17 ms returned sat
[2025-05-29 17:50:30] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2025-05-29 17:50:30] [INFO ] Computed and/alt/rep : 391/1770/391 causal constraints (skipped 1297 transitions) in 99 ms.
[2025-05-29 17:50:30] [INFO ] Added : 16 causal constraints over 4 iterations in 541 ms. Result :sat
Minimization took 879 ms.
[2025-05-29 17:50:31] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2025-05-29 17:50:31] [INFO ] [Real]Absence check using 13 positive and 61 generalized place invariants in 17 ms returned sat
[2025-05-29 17:50:32] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2025-05-29 17:50:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:50:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-05-29 17:50:32] [INFO ] [Nat]Absence check using 13 positive and 61 generalized place invariants in 16 ms returned sat
[2025-05-29 17:50:32] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2025-05-29 17:50:33] [INFO ] Computed and/alt/rep : 391/1770/391 causal constraints (skipped 1297 transitions) in 98 ms.
[2025-05-29 17:50:33] [INFO ] Added : 47 causal constraints over 10 iterations in 893 ms. Result :sat
Minimization took 863 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 705 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 1733/1733 transitions.
Applied a total of 0 rules in 29 ms. Remains 705 /705 variables (removed 0) and now considering 1733/1733 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 705/705 places, 1733/1733 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 1733/1733 transitions.
Applied a total of 0 rules in 39 ms. Remains 705 /705 variables (removed 0) and now considering 1733/1733 (removed 0) transitions.
[2025-05-29 17:50:35] [INFO ] Invariant cache hit.
[2025-05-29 17:50:35] [INFO ] Implicit Places using invariants in 391 ms returned [295, 296]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 394 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 703/705 places, 1733/1733 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 1732
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 702 transition count 1731
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 701 transition count 1731
Applied a total of 4 rules in 75 ms. Remains 701 /703 variables (removed 2) and now considering 1731/1733 (removed 2) transitions.
// Phase 1: matrix 1731 rows 701 cols
[2025-05-29 17:50:35] [INFO ] Computed 72 invariants in 20 ms
[2025-05-29 17:50:36] [INFO ] Implicit Places using invariants in 397 ms returned []
[2025-05-29 17:50:36] [INFO ] Invariant cache hit.
[2025-05-29 17:50:37] [INFO ] Implicit Places using invariants and state equation in 1487 ms returned []
Implicit Place search using SMT with State Equation took 1886 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 701/705 places, 1731/1733 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2394 ms. Remains : 701/705 places, 1731/1733 transitions.
[2025-05-29 17:50:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (16395 resets) in 2351 ms. (425 steps per ms)
BEST_FIRST walk for 2000002 steps (4874 resets) in 1603 ms. (1246 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-29 17:50:41] [INFO ] Invariant cache hit.
[2025-05-29 17:50:41] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2025-05-29 17:50:41] [INFO ] [Real]Absence check using 14 positive and 58 generalized place invariants in 16 ms returned sat
[2025-05-29 17:50:42] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2025-05-29 17:50:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:50:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2025-05-29 17:50:42] [INFO ] [Nat]Absence check using 14 positive and 58 generalized place invariants in 16 ms returned sat
[2025-05-29 17:50:42] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2025-05-29 17:50:43] [INFO ] Computed and/alt/rep : 398/1729/398 causal constraints (skipped 1288 transitions) in 91 ms.
[2025-05-29 17:50:43] [INFO ] Added : 17 causal constraints over 4 iterations in 510 ms. Result :sat
Minimization took 921 ms.
[2025-05-29 17:50:44] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2025-05-29 17:50:44] [INFO ] [Real]Absence check using 14 positive and 58 generalized place invariants in 16 ms returned sat
[2025-05-29 17:50:45] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2025-05-29 17:50:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:50:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2025-05-29 17:50:45] [INFO ] [Nat]Absence check using 14 positive and 58 generalized place invariants in 15 ms returned sat
[2025-05-29 17:50:45] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2025-05-29 17:50:45] [INFO ] Computed and/alt/rep : 398/1729/398 causal constraints (skipped 1288 transitions) in 79 ms.
[2025-05-29 17:50:46] [INFO ] Added : 27 causal constraints over 6 iterations in 554 ms. Result :sat
Minimization took 789 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 701 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 701/701 places, 1731/1731 transitions.
Applied a total of 0 rules in 26 ms. Remains 701 /701 variables (removed 0) and now considering 1731/1731 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 701/701 places, 1731/1731 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 701/701 places, 1731/1731 transitions.
Applied a total of 0 rules in 25 ms. Remains 701 /701 variables (removed 0) and now considering 1731/1731 (removed 0) transitions.
[2025-05-29 17:50:47] [INFO ] Invariant cache hit.
[2025-05-29 17:50:48] [INFO ] Implicit Places using invariants in 390 ms returned []
[2025-05-29 17:50:48] [INFO ] Invariant cache hit.
[2025-05-29 17:50:49] [INFO ] Implicit Places using invariants and state equation in 1571 ms returned []
Implicit Place search using SMT with State Equation took 1962 ms to find 0 implicit places.
[2025-05-29 17:50:49] [INFO ] Redundant transitions in 108 ms returned []
Running 1686 sub problems to find dead transitions.
[2025-05-29 17:50:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/700 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1686 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/700 variables, 57/68 constraints. Problems are: Problem set: 0 solved, 1686 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 700/2432 variables, and 68 constraints, problems are : Problem set: 0 solved, 1686 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 57/58 constraints, State Equation: 0/701 constraints, PredecessorRefiner: 1686/1686 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1686 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/700 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1686 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/700 variables, 57/68 constraints. Problems are: Problem set: 0 solved, 1686 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 700/2432 variables, and 68 constraints, problems are : Problem set: 0 solved, 1686 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 57/58 constraints, State Equation: 0/701 constraints, PredecessorRefiner: 0/1686 constraints, Known Traps: 0/0 constraints]
After SMT, in 61081ms problems are : Problem set: 0 solved, 1686 unsolved
Search for dead transitions found 0 dead transitions in 61110ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63233 ms. Remains : 701/701 places, 1731/1731 transitions.
RANDOM walk for 40000 steps (681 resets) in 1219 ms. (32 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (95 resets) in 228 ms. (174 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (94 resets) in 288 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (92 resets) in 303 ms. (131 steps per ms) remains 4/4 properties
[2025-05-29 17:51:51] [INFO ] Flatten gal took : 360 ms
BEST_FIRST walk for 40003 steps (95 resets) in 203 ms. (196 steps per ms) remains 4/4 properties
[2025-05-29 17:51:51] [INFO ] Flatten gal took : 190 ms
[2025-05-29 17:51:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15323106177163115113.gal : 49 ms
[2025-05-29 17:51:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3319135984320647005.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15323106177163115113.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3319135984320647005.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/ReachabilityCardinality3319135984320647005.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :6 after 44
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :44 after 328
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :328 after 18272
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :18272 after 7.59834e+06
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :7.59834e+06 after 4.64955e+08
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :4.64955e+08 after 4.78828e+08
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :4.78828e+08 after 4.78926e+08
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :4.78926e+08 after 1.68295e+10
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.68295e+10 after 2.60009e+11
Interrupted probabilistic random walk after 178829 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 4
Probabilistic random walk after 178829 steps, saw 88896 distinct states, run finished after 3005 ms. (steps per millisecond=59 ) properties seen :0
[2025-05-29 17:51:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 117/119 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/125 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 260/385 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 20/405 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 213/618 variables, 22/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.60009e+11 after 1.22781e+13
At refinement iteration 10 (INCLUDED_ONLY) 0/618 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 48/666 variables, 5/63 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 0/63 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 35/701 variables, 9/72 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/701 variables, 0/72 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1731/2432 variables, 701/773 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2025-05-29 17:51:55] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2432 variables, 1/774 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2432 variables, 0/774 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2432 variables, 0/774 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2432/2432 variables, and 774 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1663 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 701/701 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 116/117 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/123 variables, 4/8 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD size :1.22781e+13 after 1.27268e+13
At refinement iteration 5 (OVERLAPS) 262/385 variables, 23/31 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 20/405 variables, 5/36 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 213/618 variables, 22/58 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/618 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 48/666 variables, 5/63 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 0/63 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 35/701 variables, 9/72 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/701 variables, 1/73 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/701 variables, 0/73 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1731/2432 variables, 701/774 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2432 variables, 2/776 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2432 variables, 0/776 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2432 variables, 0/776 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2432/2432 variables, and 776 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1010 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 701/701 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 2699ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 516 ms.
Support contains 1 out of 701 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 701/701 places, 1731/1731 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 701 transition count 1730
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 700 transition count 1730
Applied a total of 2 rules in 31 ms. Remains 700 /701 variables (removed 1) and now considering 1730/1731 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 700/701 places, 1730/1731 transitions.
RANDOM walk for 40000 steps (692 resets) in 627 ms. (63 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (97 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (98 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 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,4.82494e+13,7.5236,173568,2,130301,21,452340,6,0,4538,387226,0
Total reachable state count : 48249429997506

Verifying 4 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,328,7.54719,173568,2,1283,21,452340,7,0,4541,387226,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,328,7.57154,173568,2,1283,21,452340,8,0,4542,387226,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,328,7.60341,173568,2,1283,21,452340,9,0,4544,387226,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,328,7.63697,173568,2,1283,21,452340,10,0,4545,387226,0
Interrupted probabilistic random walk after 250200 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 2
Probabilistic random walk after 250200 steps, saw 122942 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
FORMULA ASLink-PT-09b-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-09b-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 430829 ms.

BK_STOP 1748541121276

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

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