Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366200341.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is ASLink-PT-04b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200341
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 5 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 5 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Mar 5 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 5 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Mar 5 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 669K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ASLink-PT-04b-UpperBounds-00
FORMULA_NAME ASLink-PT-04b-UpperBounds-01
FORMULA_NAME ASLink-PT-04b-UpperBounds-02
FORMULA_NAME ASLink-PT-04b-UpperBounds-03
FORMULA_NAME ASLink-PT-04b-UpperBounds-04
FORMULA_NAME ASLink-PT-04b-UpperBounds-05
FORMULA_NAME ASLink-PT-04b-UpperBounds-06
FORMULA_NAME ASLink-PT-04b-UpperBounds-07
FORMULA_NAME ASLink-PT-04b-UpperBounds-08
FORMULA_NAME ASLink-PT-04b-UpperBounds-09
FORMULA_NAME ASLink-PT-04b-UpperBounds-10
FORMULA_NAME ASLink-PT-04b-UpperBounds-11
FORMULA_NAME ASLink-PT-04b-UpperBounds-12
FORMULA_NAME ASLink-PT-04b-UpperBounds-13
FORMULA_NAME ASLink-PT-04b-UpperBounds-14
FORMULA_NAME ASLink-PT-04b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779475058398

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-22 18:37:40] [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]
[2026-05-22 18:37:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 18:37:40] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2026-05-22 18:37:40] [INFO ] Transformed 2034 places.
[2026-05-22 18:37:40] [INFO ] Transformed 2567 transitions.
[2026-05-22 18:37:40] [INFO ] Found NUPN structural information;
[2026-05-22 18:37:40] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 353 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 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]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10146353495810480494.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13731210696250566639.kers'
[2026-05-22 18:37:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10146353495810480494.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13731210696250566639.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2567 rows 2034 cols 7875 entries
Finished phase 1 with 1365 SingleSign rule and 470 generalized
[2026-05-22 18:37:40] [INFO ] Computed 199 invariants in 16 ms
Computed 199 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-13731210696250566639.kers
Total runtime 18 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 (24 resets) in 96 ms. (103 steps per ms)
FORMULA ASLink-PT-04b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (22 resets) in 103 ms. (576 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2026-05-22 18:37:40] [INFO ] Invariant cache hit.
[2026-05-22 18:37:41] [INFO ] [Real]Absence check using 42 positive place invariants in 62 ms returned sat
[2026-05-22 18:37:41] [INFO ] [Real]Absence check using 42 positive and 157 generalized place invariants in 156 ms returned sat
[2026-05-22 18:37:43] [INFO ] [Real]Absence check using state equation in 1551 ms returned sat
[2026-05-22 18:37:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:37:43] [INFO ] [Nat]Absence check using 42 positive place invariants in 47 ms returned sat
[2026-05-22 18:37:44] [INFO ] [Nat]Absence check using 42 positive and 157 generalized place invariants in 99 ms returned sat
[2026-05-22 18:37:45] [INFO ] [Nat]Absence check using state equation in 1535 ms returned sat
[2026-05-22 18:37:49] [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:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-22 18:37:49] [INFO ] [Real]Absence check using 42 positive place invariants in 55 ms returned sat
[2026-05-22 18:37:49] [INFO ] [Real]Absence check using 42 positive and 157 generalized place invariants in 109 ms returned sat
[2026-05-22 18:37:50] [INFO ] [Real]Absence check using state equation in 1206 ms returned sat
[2026-05-22 18:37:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:37:52] [INFO ] [Nat]Absence check using 42 positive place invariants in 40 ms returned sat
[2026-05-22 18:37:52] [INFO ] [Nat]Absence check using 42 positive and 157 generalized place invariants in 117 ms returned sat
[2026-05-22 18:37:53] [INFO ] [Nat]Absence check using state equation in 1480 ms returned sat
[2026-05-22 18:37:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2039 ms
[2026-05-22 18:37:55] [INFO ] Computed and/alt/rep : 2147/4728/2147 causal constraints (skipped 419 transitions) in 156 ms.
[2026-05-22 18:37:56] [INFO ] Added : 10 causal constraints over 2 iterations in 1015 ms. Result :unknown
[2026-05-22 18:37:57] [INFO ] [Real]Absence check using 42 positive place invariants in 57 ms returned sat
[2026-05-22 18:37:57] [INFO ] [Real]Absence check using 42 positive and 157 generalized place invariants in 95 ms returned sat
[2026-05-22 18:37:58] [INFO ] [Real]Absence check using state equation in 1035 ms returned sat
[2026-05-22 18:37:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:37:58] [INFO ] [Nat]Absence check using 42 positive place invariants in 45 ms returned sat
[2026-05-22 18:37:59] [INFO ] [Nat]Absence check using 42 positive and 157 generalized place invariants in 155 ms returned sat
[2026-05-22 18:38:00] [INFO ] [Nat]Absence check using state equation in 1494 ms returned sat
[2026-05-22 18:38:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2805 ms
[2026-05-22 18:38:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:960)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-22 18:38:03] [INFO ] [Real]Absence check using 42 positive place invariants in 37 ms returned sat
[2026-05-22 18:38:03] [INFO ] [Real]Absence check using 42 positive and 157 generalized place invariants in 89 ms returned sat
[2026-05-22 18:38:05] [INFO ] [Real]Absence check using state equation in 1187 ms returned sat
[2026-05-22 18:38:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:38:05] [INFO ] [Nat]Absence check using 42 positive place invariants in 55 ms returned sat
[2026-05-22 18:38:05] [INFO ] [Nat]Absence check using 42 positive and 157 generalized place invariants in 131 ms returned sat
[2026-05-22 18:38:06] [INFO ] [Nat]Absence check using state equation in 1158 ms returned sat
[2026-05-22 18:38:10] [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:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-22 18:38:10] [INFO ] [Real]Absence check using 42 positive place invariants in 55 ms returned sat
[2026-05-22 18:38:10] [INFO ] [Real]Absence check using 42 positive and 157 generalized place invariants in 109 ms returned sat
[2026-05-22 18:38:12] [INFO ] [Real]Absence check using state equation in 1492 ms returned sat
[2026-05-22 18:38:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:38:12] [INFO ] [Nat]Absence check using 42 positive place invariants in 43 ms returned sat
[2026-05-22 18:38:12] [INFO ] [Nat]Absence check using 42 positive and 157 generalized place invariants in 94 ms returned sat
[2026-05-22 18:38:14] [INFO ] [Nat]Absence check using state equation in 1159 ms returned sat
[2026-05-22 18:38:17] [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:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-22 18:38:18] [INFO ] [Real]Absence check using 42 positive place invariants in 38 ms returned sat
[2026-05-22 18:38:18] [INFO ] [Real]Absence check using 42 positive and 157 generalized place invariants in 88 ms returned sat
[2026-05-22 18:38:19] [INFO ] [Real]Absence check using state equation in 1440 ms returned sat
[2026-05-22 18:38:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:38:19] [INFO ] [Nat]Absence check using 42 positive place invariants in 44 ms returned sat
[2026-05-22 18:38:20] [INFO ] [Nat]Absence check using 42 positive and 157 generalized place invariants in 94 ms returned sat
[2026-05-22 18:38:21] [INFO ] [Nat]Absence check using state equation in 1190 ms returned sat
[2026-05-22 18:38:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:960)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-04b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
Support contains 5 out of 2034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 465 transitions
Trivial Post-agglo rules discarded 465 transitions
Performed 465 trivial Post agglomeration. Transition count delta: 465
Iterating post reduction 0 with 465 rules applied. Total rules applied 465 place count 2034 transition count 2102
Reduce places removed 465 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 487 rules applied. Total rules applied 952 place count 1569 transition count 2080
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 959 place count 1563 transition count 2079
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 960 place count 1562 transition count 2079
Performed 468 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 468 Pre rules applied. Total rules applied 960 place count 1562 transition count 1611
Deduced a syphon composed of 468 places in 4 ms
Ensure Unique test removed 42 places
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 4 with 978 rules applied. Total rules applied 1938 place count 1052 transition count 1611
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 4 with 32 rules applied. Total rules applied 1970 place count 1048 transition count 1583
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 1998 place count 1020 transition count 1583
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 15 Pre rules applied. Total rules applied 1998 place count 1020 transition count 1568
Deduced a syphon composed of 15 places in 6 ms
Ensure Unique test removed 15 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 45 rules applied. Total rules applied 2043 place count 990 transition count 1568
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 15 Pre rules applied. Total rules applied 2043 place count 990 transition count 1553
Deduced a syphon composed of 15 places in 6 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 2073 place count 975 transition count 1553
Discarding 64 places :
Symmetric choice reduction at 6 with 64 rule applications. Total rules 2137 place count 911 transition count 1489
Iterating global reduction 6 with 64 rules applied. Total rules applied 2201 place count 911 transition count 1489
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2202 place count 911 transition count 1488
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 2202 place count 911 transition count 1466
Deduced a syphon composed of 22 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 45 rules applied. Total rules applied 2247 place count 888 transition count 1466
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2247 place count 888 transition count 1465
Deduced a syphon composed of 1 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 2250 place count 886 transition count 1465
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2255 place count 881 transition count 1432
Iterating global reduction 7 with 5 rules applied. Total rules applied 2260 place count 881 transition count 1432
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 2260 place count 881 transition count 1428
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 2268 place count 877 transition count 1428
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2269 place count 876 transition count 1420
Iterating global reduction 7 with 1 rules applied. Total rules applied 2270 place count 876 transition count 1420
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2271 place count 875 transition count 1412
Iterating global reduction 7 with 1 rules applied. Total rules applied 2272 place count 875 transition count 1412
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2273 place count 874 transition count 1404
Iterating global reduction 7 with 1 rules applied. Total rules applied 2274 place count 874 transition count 1404
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2275 place count 873 transition count 1396
Iterating global reduction 7 with 1 rules applied. Total rules applied 2276 place count 873 transition count 1396
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2277 place count 872 transition count 1388
Iterating global reduction 7 with 1 rules applied. Total rules applied 2278 place count 872 transition count 1388
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2279 place count 871 transition count 1380
Iterating global reduction 7 with 1 rules applied. Total rules applied 2280 place count 871 transition count 1380
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2281 place count 870 transition count 1372
Iterating global reduction 7 with 1 rules applied. Total rules applied 2282 place count 870 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2283 place count 869 transition count 1364
Iterating global reduction 7 with 1 rules applied. Total rules applied 2284 place count 869 transition count 1364
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2285 place count 868 transition count 1356
Iterating global reduction 7 with 1 rules applied. Total rules applied 2286 place count 868 transition count 1356
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2287 place count 867 transition count 1348
Iterating global reduction 7 with 1 rules applied. Total rules applied 2288 place count 867 transition count 1348
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2289 place count 866 transition count 1340
Iterating global reduction 7 with 1 rules applied. Total rules applied 2290 place count 866 transition count 1340
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2291 place count 865 transition count 1332
Iterating global reduction 7 with 1 rules applied. Total rules applied 2292 place count 865 transition count 1332
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2293 place count 864 transition count 1324
Iterating global reduction 7 with 1 rules applied. Total rules applied 2294 place count 864 transition count 1324
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2295 place count 863 transition count 1316
Iterating global reduction 7 with 1 rules applied. Total rules applied 2296 place count 863 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2297 place count 862 transition count 1308
Iterating global reduction 7 with 1 rules applied. Total rules applied 2298 place count 862 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2299 place count 861 transition count 1300
Iterating global reduction 7 with 1 rules applied. Total rules applied 2300 place count 861 transition count 1300
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 7 with 233 rules applied. Total rules applied 2533 place count 744 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2534 place count 743 transition count 1183
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 2536 place count 742 transition count 1183
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2537 place count 741 transition count 1182
Iterating global reduction 7 with 1 rules applied. Total rules applied 2538 place count 741 transition count 1182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2540 place count 741 transition count 1180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2541 place count 740 transition count 1180
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2543 place count 739 transition count 1189
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 2548 place count 739 transition count 1184
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2553 place count 734 transition count 1184
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 2556 place count 734 transition count 1181
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2559 place count 731 transition count 1181
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2560 place count 730 transition count 1180
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 11 with 12 rules applied. Total rules applied 2572 place count 722 transition count 1176
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2576 place count 718 transition count 1176
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 12 Pre rules applied. Total rules applied 2576 place count 718 transition count 1164
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 13 with 25 rules applied. Total rules applied 2601 place count 705 transition count 1164
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 13 with 5 rules applied. Total rules applied 2606 place count 700 transition count 1164
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 2606 place count 700 transition count 1163
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2608 place count 699 transition count 1163
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 14 with 18 rules applied. Total rules applied 2626 place count 690 transition count 1154
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 2630 place count 686 transition count 1150
Iterating global reduction 14 with 4 rules applied. Total rules applied 2634 place count 686 transition count 1150
Free-agglomeration rule applied 4 times.
Iterating global reduction 14 with 4 rules applied. Total rules applied 2638 place count 686 transition count 1146
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 2642 place count 682 transition count 1146
Applied a total of 2642 rules in 1212 ms. Remains 682 /2034 variables (removed 1352) and now considering 1146/2567 (removed 1421) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1232 ms. Remains : 682/2034 places, 1146/2567 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8133036927850566499.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16788162657173158285.kers'
[2026-05-22 18:38:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8133036927850566499.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16788162657173158285.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 1 ms.
// Phase 1: matrix 1146 rows 671 cols 4484 entries
Finished phase 1 with 202 SingleSign rule and 360 generalized
[2026-05-22 18:38:26] [INFO ] Computed 120 invariants in 10 ms
Computed 120 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-16788162657173158285.kers
Total runtime 12 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 (12840 resets) in 2227 ms. (448 steps per ms)
FORMULA ASLink-PT-04b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000003 steps (11656 resets) in 4395 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-22 18:38:32] [INFO ] Invariant cache hit.
[2026-05-22 18:38:33] [INFO ] [Real]Absence check using 40 positive place invariants in 15 ms returned sat
[2026-05-22 18:38:33] [INFO ] [Real]Absence check using 40 positive and 80 generalized place invariants in 17 ms returned sat
[2026-05-22 18:38:33] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2026-05-22 18:38:33] [INFO ] Computed and/alt/rep : 446/1710/446 causal constraints (skipped 675 transitions) in 99 ms.
[2026-05-22 18:38:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:38:33] [INFO ] [Nat]Absence check using 40 positive place invariants in 14 ms returned sat
[2026-05-22 18:38:34] [INFO ] [Nat]Absence check using 40 positive and 80 generalized place invariants in 30 ms returned sat
[2026-05-22 18:38:34] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2026-05-22 18:38:34] [INFO ] Computed and/alt/rep : 446/1710/446 causal constraints (skipped 675 transitions) in 79 ms.
[2026-05-22 18:38:40] [INFO ] Added : 335 causal constraints over 67 iterations in 6075 ms. Result :sat
Minimization took 611 ms.
[2026-05-22 18:38:41] [INFO ] [Real]Absence check using 40 positive place invariants in 10 ms returned sat
[2026-05-22 18:38:41] [INFO ] [Real]Absence check using 40 positive and 80 generalized place invariants in 31 ms returned sat
[2026-05-22 18:38:41] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2026-05-22 18:38:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:38:41] [INFO ] [Nat]Absence check using 40 positive place invariants in 10 ms returned sat
[2026-05-22 18:38:41] [INFO ] [Nat]Absence check using 40 positive and 80 generalized place invariants in 19 ms returned sat
[2026-05-22 18:38:42] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2026-05-22 18:38:42] [INFO ] Computed and/alt/rep : 446/1710/446 causal constraints (skipped 675 transitions) in 87 ms.
[2026-05-22 18:38:47] [INFO ] Added : 306 causal constraints over 62 iterations in 5554 ms. Result :sat
Minimization took 897 ms.
[2026-05-22 18:38:48] [INFO ] [Real]Absence check using 40 positive place invariants in 9 ms returned sat
[2026-05-22 18:38:48] [INFO ] [Real]Absence check using 40 positive and 80 generalized place invariants in 16 ms returned sat
[2026-05-22 18:38:49] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2026-05-22 18:38:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:38:49] [INFO ] [Nat]Absence check using 40 positive place invariants in 10 ms returned sat
[2026-05-22 18:38:49] [INFO ] [Nat]Absence check using 40 positive and 80 generalized place invariants in 22 ms returned sat
[2026-05-22 18:38:49] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2026-05-22 18:38:49] [INFO ] Computed and/alt/rep : 446/1710/446 causal constraints (skipped 675 transitions) in 113 ms.
[2026-05-22 18:38:50] [INFO ] Added : 44 causal constraints over 9 iterations in 1176 ms. Result :sat
Minimization took 449 ms.
[2026-05-22 18:38:51] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2026-05-22 18:38:51] [INFO ] [Real]Absence check using 40 positive and 80 generalized place invariants in 18 ms returned sat
[2026-05-22 18:38:51] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2026-05-22 18:38:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:38:51] [INFO ] [Nat]Absence check using 40 positive place invariants in 13 ms returned sat
[2026-05-22 18:38:51] [INFO ] [Nat]Absence check using 40 positive and 80 generalized place invariants in 17 ms returned sat
[2026-05-22 18:38:52] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2026-05-22 18:38:52] [INFO ] Computed and/alt/rep : 446/1710/446 causal constraints (skipped 675 transitions) in 61 ms.
[2026-05-22 18:38:57] [INFO ] Added : 290 causal constraints over 58 iterations in 5473 ms. Result :sat
Minimization took 547 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 682/682 places, 1146/1146 transitions.
Applied a total of 0 rules in 21 ms. Remains 682 /682 variables (removed 0) and now considering 1146/1146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 682/682 places, 1146/1146 transitions.
[2026-05-22 18:38:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (12832 resets) in 2171 ms. (460 steps per ms)
BEST_FIRST walk for 4000004 steps (11698 resets) in 4482 ms. (892 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-22 18:39:06] [INFO ] Invariant cache hit.
[2026-05-22 18:39:06] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2026-05-22 18:39:06] [INFO ] [Real]Absence check using 40 positive and 80 generalized place invariants in 28 ms returned sat
[2026-05-22 18:39:06] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2026-05-22 18:39:06] [INFO ] Computed and/alt/rep : 446/1710/446 causal constraints (skipped 675 transitions) in 74 ms.
[2026-05-22 18:39:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:39:07] [INFO ] [Nat]Absence check using 40 positive place invariants in 20 ms returned sat
[2026-05-22 18:39:07] [INFO ] [Nat]Absence check using 40 positive and 80 generalized place invariants in 235 ms returned sat
[2026-05-22 18:39:07] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2026-05-22 18:39:08] [INFO ] Computed and/alt/rep : 446/1710/446 causal constraints (skipped 675 transitions) in 88 ms.
[2026-05-22 18:39:14] [INFO ] Added : 335 causal constraints over 67 iterations in 6031 ms. Result :sat
Minimization took 667 ms.
[2026-05-22 18:39:14] [INFO ] [Real]Absence check using 40 positive place invariants in 11 ms returned sat
[2026-05-22 18:39:14] [INFO ] [Real]Absence check using 40 positive and 80 generalized place invariants in 23 ms returned sat
[2026-05-22 18:39:15] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2026-05-22 18:39:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:39:15] [INFO ] [Nat]Absence check using 40 positive place invariants in 10 ms returned sat
[2026-05-22 18:39:15] [INFO ] [Nat]Absence check using 40 positive and 80 generalized place invariants in 16 ms returned sat
[2026-05-22 18:39:15] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2026-05-22 18:39:15] [INFO ] Computed and/alt/rep : 446/1710/446 causal constraints (skipped 675 transitions) in 46 ms.
[2026-05-22 18:39:21] [INFO ] Added : 306 causal constraints over 62 iterations in 5378 ms. Result :sat
Minimization took 909 ms.
[2026-05-22 18:39:22] [INFO ] [Real]Absence check using 40 positive place invariants in 11 ms returned sat
[2026-05-22 18:39:22] [INFO ] [Real]Absence check using 40 positive and 80 generalized place invariants in 18 ms returned sat
[2026-05-22 18:39:22] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2026-05-22 18:39:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:39:22] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2026-05-22 18:39:22] [INFO ] [Nat]Absence check using 40 positive and 80 generalized place invariants in 23 ms returned sat
[2026-05-22 18:39:23] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2026-05-22 18:39:23] [INFO ] Computed and/alt/rep : 446/1710/446 causal constraints (skipped 675 transitions) in 60 ms.
[2026-05-22 18:39:24] [INFO ] Added : 44 causal constraints over 9 iterations in 1184 ms. Result :sat
Minimization took 500 ms.
[2026-05-22 18:39:25] [INFO ] [Real]Absence check using 40 positive place invariants in 10 ms returned sat
[2026-05-22 18:39:25] [INFO ] [Real]Absence check using 40 positive and 80 generalized place invariants in 53 ms returned sat
[2026-05-22 18:39:25] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2026-05-22 18:39:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:39:25] [INFO ] [Nat]Absence check using 40 positive place invariants in 10 ms returned sat
[2026-05-22 18:39:25] [INFO ] [Nat]Absence check using 40 positive and 80 generalized place invariants in 32 ms returned sat
[2026-05-22 18:39:26] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2026-05-22 18:39:26] [INFO ] Computed and/alt/rep : 446/1710/446 causal constraints (skipped 675 transitions) in 47 ms.
[2026-05-22 18:39:30] [INFO ] Added : 290 causal constraints over 58 iterations in 4534 ms. Result :sat
Minimization took 559 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 682/682 places, 1146/1146 transitions.
Applied a total of 0 rules in 20 ms. Remains 682 /682 variables (removed 0) and now considering 1146/1146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 682/682 places, 1146/1146 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 682/682 places, 1146/1146 transitions.
Applied a total of 0 rules in 18 ms. Remains 682 /682 variables (removed 0) and now considering 1146/1146 (removed 0) transitions.
[2026-05-22 18:39:32] [INFO ] Invariant cache hit.
[2026-05-22 18:39:33] [INFO ] Implicit Places using invariants in 771 ms returned [1, 18, 19, 31, 48, 66, 137, 141, 150, 151, 153, 170, 188, 227, 261, 266, 267, 278, 279, 281, 298, 316, 385, 389, 390, 401, 402, 404, 421, 439, 508, 512, 513, 516, 527, 528, 529, 547, 549, 553, 571, 572, 573, 574, 586, 592, 598, 604, 610, 616, 622, 628, 634, 640, 646]
[2026-05-22 18:39:33] [INFO ] Actually due to overlaps returned [547, 529, 48, 170, 298, 421, 553, 31, 153, 281, 404, 150, 278, 401, 527, 571, 151, 279, 402, 528, 549, 572, 1, 18, 266, 267, 389, 390, 512, 513, 66, 188, 316, 439, 573, 616, 634, 646, 19, 516, 574, 586, 592, 598, 604, 610, 622, 628, 640]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 792 ms to find 49 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 633/682 places, 1146/1146 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 628 transition count 1053
Reduce places removed 93 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 100 rules applied. Total rules applied 198 place count 535 transition count 1046
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 201 place count 532 transition count 1046
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 201 place count 532 transition count 1023
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 248 place count 508 transition count 1023
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 260 place count 504 transition count 1015
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 268 place count 496 transition count 1015
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 283 place count 481 transition count 1000
Iterating global reduction 5 with 15 rules applied. Total rules applied 298 place count 481 transition count 1000
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 301 place count 481 transition count 997
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 301 place count 481 transition count 996
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 303 place count 480 transition count 996
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 306 place count 477 transition count 990
Iterating global reduction 6 with 3 rules applied. Total rules applied 309 place count 477 transition count 990
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 310 place count 476 transition count 989
Iterating global reduction 6 with 1 rules applied. Total rules applied 311 place count 476 transition count 989
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 312 place count 475 transition count 987
Iterating global reduction 6 with 1 rules applied. Total rules applied 313 place count 475 transition count 987
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 379 place count 442 transition count 954
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 383 place count 438 transition count 950
Iterating global reduction 6 with 4 rules applied. Total rules applied 387 place count 438 transition count 950
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 390 place count 438 transition count 947
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 394 place count 436 transition count 948
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 404 place count 436 transition count 938
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 415 place count 425 transition count 938
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 416 place count 425 transition count 937
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 428 place count 425 transition count 937
Applied a total of 428 rules in 161 ms. Remains 425 /633 variables (removed 208) and now considering 937/1146 (removed 209) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14742673003194398345.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14103609349571366457.kers'
[2026-05-22 18:39:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14742673003194398345.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14103609349571366457.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 937 rows 424 cols 3819 entries
Finished phase 1 with 156 SingleSign rule and 209 generalized
[2026-05-22 18:39:33] [INFO ] Computed 60 invariants in 6 ms
Computed 60 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14103609349571366457.kers
Total runtime 7 ms.
[2026-05-22 18:39:33] [INFO ] Implicit Places using invariants in 412 ms returned [72, 90, 96, 99, 101, 102, 105, 106, 158, 177, 183, 186, 188, 194, 195, 247, 264, 270, 273, 275, 280, 281, 333, 350, 356, 359, 361]
[2026-05-22 18:39:33] [INFO ] Actually due to overlaps returned [105, 194, 280, 106, 195, 281, 90, 96, 101, 177, 183, 188, 264, 270, 275, 350, 356, 361, 72, 102, 158, 247, 333]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 413 ms to find 23 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 402/682 places, 937/1146 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 386 transition count 921
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 386 transition count 921
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 382 transition count 917
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 382 transition count 917
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 56 place count 374 transition count 909
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 374 transition count 897
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 80 place count 362 transition count 897
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 362 transition count 894
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 86 place count 359 transition count 894
Applied a total of 86 rules in 72 ms. Remains 359 /402 variables (removed 43) and now considering 894/937 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5311188937999173503.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15732152921529412274.kers'
[2026-05-22 18:39:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5311188937999173503.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15732152921529412274.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 894 rows 359 cols 3641 entries
Finished phase 1 with 98 SingleSign rule and 224 generalized
[2026-05-22 18:39:33] [INFO ] Computed 37 invariants in 5 ms
Computed 37 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-15732152921529412274.kers
Total runtime 9 ms.
[2026-05-22 18:39:34] [INFO ] Implicit Places using invariants in 348 ms returned []
[2026-05-22 18:39:34] [INFO ] Invariant cache hit.
[2026-05-22 18:39:35] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 359/682 places, 894/1146 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2578 ms. Remains : 359/682 places, 894/1146 transitions.
[2026-05-22 18:39:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (19584 resets) in 1715 ms. (582 steps per ms)
BEST_FIRST walk for 4000003 steps (21715 resets) in 3083 ms. (1297 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-22 18:39:39] [INFO ] Invariant cache hit.
[2026-05-22 18:39:40] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2026-05-22 18:39:40] [INFO ] [Real]Absence check using 12 positive and 25 generalized place invariants in 18 ms returned sat
[2026-05-22 18:39:40] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2026-05-22 18:39:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:39:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2026-05-22 18:39:40] [INFO ] [Nat]Absence check using 12 positive and 25 generalized place invariants in 9 ms returned sat
[2026-05-22 18:39:40] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2026-05-22 18:39:41] [INFO ] Computed and/alt/rep : 193/965/193 causal constraints (skipped 676 transitions) in 66 ms.
[2026-05-22 18:39:41] [INFO ] Added : 48 causal constraints over 10 iterations in 721 ms. Result :sat
Minimization took 338 ms.
[2026-05-22 18:39:42] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2026-05-22 18:39:42] [INFO ] [Real]Absence check using 12 positive and 25 generalized place invariants in 8 ms returned sat
[2026-05-22 18:39:42] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2026-05-22 18:39:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:39:42] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2026-05-22 18:39:42] [INFO ] [Nat]Absence check using 12 positive and 25 generalized place invariants in 16 ms returned sat
[2026-05-22 18:39:42] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2026-05-22 18:39:42] [INFO ] Computed and/alt/rep : 193/965/193 causal constraints (skipped 676 transitions) in 73 ms.
[2026-05-22 18:39:44] [INFO ] Added : 66 causal constraints over 14 iterations in 1669 ms. Result :sat
Minimization took 329 ms.
[2026-05-22 18:39:45] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2026-05-22 18:39:45] [INFO ] [Real]Absence check using 12 positive and 25 generalized place invariants in 6 ms returned sat
[2026-05-22 18:39:45] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2026-05-22 18:39:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:39:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2026-05-22 18:39:45] [INFO ] [Nat]Absence check using 12 positive and 25 generalized place invariants in 15 ms returned sat
[2026-05-22 18:39:45] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2026-05-22 18:39:45] [INFO ] Computed and/alt/rep : 193/965/193 causal constraints (skipped 676 transitions) in 95 ms.
[2026-05-22 18:39:46] [INFO ] Added : 17 causal constraints over 4 iterations in 521 ms. Result :sat
Minimization took 285 ms.
[2026-05-22 18:39:46] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2026-05-22 18:39:46] [INFO ] [Real]Absence check using 12 positive and 25 generalized place invariants in 8 ms returned sat
[2026-05-22 18:39:46] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2026-05-22 18:39:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:39:47] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2026-05-22 18:39:47] [INFO ] [Nat]Absence check using 12 positive and 25 generalized place invariants in 10 ms returned sat
[2026-05-22 18:39:47] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2026-05-22 18:39:47] [INFO ] Computed and/alt/rep : 193/965/193 causal constraints (skipped 676 transitions) in 82 ms.
[2026-05-22 18:39:48] [INFO ] Added : 33 causal constraints over 12 iterations in 911 ms. Result :sat
Minimization took 291 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA ASLink-PT-04b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-04b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 894/894 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 359 transition count 893
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 358 transition count 893
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 358 transition count 892
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 357 transition count 892
Applied a total of 4 rules in 38 ms. Remains 357 /359 variables (removed 2) and now considering 892/894 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 357/359 places, 892/894 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17846875030542068671.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17864408284300347330.kers'
[2026-05-22 18:39:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17846875030542068671.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17864408284300347330.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 892 rows 357 cols 3644 entries
Finished phase 1 with 96 SingleSign rule and 224 generalized
[2026-05-22 18:39:49] [INFO ] Computed 37 invariants in 18 ms
Computed 37 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-17864408284300347330.kers
Total runtime 19 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (19691 resets) in 1968 ms. (507 steps per ms)
BEST_FIRST walk for 2000002 steps (10837 resets) in 1677 ms. (1191 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-22 18:39:52] [INFO ] Invariant cache hit.
[2026-05-22 18:39:53] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2026-05-22 18:39:53] [INFO ] [Real]Absence check using 12 positive and 25 generalized place invariants in 16 ms returned sat
[2026-05-22 18:39:53] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2026-05-22 18:39:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:39:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2026-05-22 18:39:53] [INFO ] [Nat]Absence check using 12 positive and 25 generalized place invariants in 15 ms returned sat
[2026-05-22 18:39:53] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2026-05-22 18:39:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2026-05-22 18:39:54] [INFO ] Computed and/alt/rep : 184/900/184 causal constraints (skipped 683 transitions) in 53 ms.
[2026-05-22 18:39:54] [INFO ] Added : 30 causal constraints over 6 iterations in 821 ms. Result :sat
Minimization took 248 ms.
[2026-05-22 18:39:55] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2026-05-22 18:39:55] [INFO ] [Real]Absence check using 12 positive and 25 generalized place invariants in 26 ms returned sat
[2026-05-22 18:39:55] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2026-05-22 18:39:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:39:55] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2026-05-22 18:39:55] [INFO ] [Nat]Absence check using 12 positive and 25 generalized place invariants in 32 ms returned sat
[2026-05-22 18:39:55] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2026-05-22 18:39:55] [INFO ] Computed and/alt/rep : 184/900/184 causal constraints (skipped 683 transitions) in 61 ms.
[2026-05-22 18:39:56] [INFO ] Added : 37 causal constraints over 8 iterations in 727 ms. Result :sat
Minimization took 275 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 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 892/892 transitions.
Applied a total of 0 rules in 12 ms. Remains 357 /357 variables (removed 0) and now considering 892/892 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 357/357 places, 892/892 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 892/892 transitions.
Applied a total of 0 rules in 11 ms. Remains 357 /357 variables (removed 0) and now considering 892/892 (removed 0) transitions.
[2026-05-22 18:39:57] [INFO ] Invariant cache hit.
[2026-05-22 18:39:57] [INFO ] Implicit Places using invariants in 350 ms returned []
[2026-05-22 18:39:57] [INFO ] Invariant cache hit.
[2026-05-22 18:39:58] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1168 ms to find 0 implicit places.
[2026-05-22 18:39:58] [INFO ] Redundant transitions in 71 ms returned []
Running 867 sub problems to find dead transitions.
[2026-05-22 18:39:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 3 (OVERLAPS) 1/357 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 867 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 357/1249 variables, and 37 constraints, problems are : Problem set: 0 solved, 867 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/357 constraints, PredecessorRefiner: 867/867 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 867 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 867 unsolved
At refinement iteration 3 (OVERLAPS) 1/357 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 867 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/1249 variables, and 40 constraints, problems are : Problem set: 0 solved, 867 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/357 constraints, PredecessorRefiner: 0/867 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60467ms problems are : Problem set: 0 solved, 867 unsolved
Search for dead transitions found 0 dead transitions in 60488ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61782 ms. Remains : 357/357 places, 892/892 transitions.
RANDOM walk for 40000 steps (782 resets) in 1093 ms. (36 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (216 resets) in 312 ms. (127 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (214 resets) in 225 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (224 resets) in 198 ms. (201 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (240 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
[2026-05-22 18:40:59] [INFO ] Flatten gal took : 231 ms
[2026-05-22 18:40:59] [INFO ] Flatten gal took : 62 ms
[2026-05-22 18:40:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13758663603795628476.gal : 39 ms
[2026-05-22 18:40:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1832752526819195159.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13758663603795628476.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1832752526819195159.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.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1832752526819195159.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 44
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :44 after 328
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :328 after 13120
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :13120 after 20010
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :20010 after 20615
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :20615 after 22816
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :22816 after 348637
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :348637 after 4.22504e+06
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 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,3.93184e+07,1.01343,38224,2,23550,18,79372,6,0,2324,76209,0
Total reachable state count : 39318377

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,1,1.0189,38224,2,358,18,79372,7,0,2327,76209,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,1.02294,38224,2,358,18,79372,8,0,2328,76209,0
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,6,1.02527,38224,2,466,18,79372,9,0,2330,76209,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,6,1.02744,38224,2,466,18,79372,10,0,2331,76209,0
ITS tools runner thread asked to quit. Dying gracefully.
Interrupted probabilistic random walk after 250700 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 4
Probabilistic random walk after 250700 steps, saw 132320 distinct states, run finished after 3006 ms. (steps per millisecond=83 ) properties seen :0
FORMULA ASLink-PT-04b-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-04b-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-22 18:41:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (19671 resets) in 1659 ms. (602 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 204183 ms.

BK_STOP 1779475264373

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-04b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-5973"
echo " Executing tool itstools"
echo " Input is ASLink-PT-04b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-oct2-177944366200341"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-04b.tgz
mv ASLink-PT-04b execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;