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-177944366300437.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-10b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366300437
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.1K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 5 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Mar 5 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 5 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 5 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:11 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 1.4M 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-10b-UpperBounds-00
FORMULA_NAME ASLink-PT-10b-UpperBounds-01
FORMULA_NAME ASLink-PT-10b-UpperBounds-02
FORMULA_NAME ASLink-PT-10b-UpperBounds-03
FORMULA_NAME ASLink-PT-10b-UpperBounds-04
FORMULA_NAME ASLink-PT-10b-UpperBounds-05
FORMULA_NAME ASLink-PT-10b-UpperBounds-06
FORMULA_NAME ASLink-PT-10b-UpperBounds-07
FORMULA_NAME ASLink-PT-10b-UpperBounds-08
FORMULA_NAME ASLink-PT-10b-UpperBounds-09
FORMULA_NAME ASLink-PT-10b-UpperBounds-10
FORMULA_NAME ASLink-PT-10b-UpperBounds-11
FORMULA_NAME ASLink-PT-10b-UpperBounds-12
FORMULA_NAME ASLink-PT-10b-UpperBounds-13
FORMULA_NAME ASLink-PT-10b-UpperBounds-14
FORMULA_NAME ASLink-PT-10b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779489690682

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-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-22 22:41:32] [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 22:41:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 22:41:32] [INFO ] Load time of PNML (sax parser for PT used): 244 ms
[2026-05-22 22:41:32] [INFO ] Transformed 4410 places.
[2026-05-22 22:41:32] [INFO ] Transformed 5405 transitions.
[2026-05-22 22:41:32] [INFO ] Found NUPN structural information;
[2026-05-22 22:41:32] [INFO ] Parsed PT model containing 4410 places and 5405 transitions and 16377 arcs in 437 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14978064005728043852.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1355941297961633811.kers'
[2026-05-22 22:41:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14978064005728043852.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1355941297961633811.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 5405 rows 4410 cols 16377 entries
Finished phase 1 with 3000 SingleSign rule and 977 generalized
[2026-05-22 22:41:32] [INFO ] Computed 433 invariants in 64 ms
Computed 433 P flows in 65 ms.
Exported basis to /tmp/petrispot-output-1355941297961633811.kers
Total runtime 70 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 (13 resets) in 121 ms. (81 steps per ms)
FORMULA ASLink-PT-10b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-10b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-10b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-10b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-10b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-10b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-10b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (18 resets) in 135 ms. (661 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-22 22:41:33] [INFO ] Invariant cache hit.
[2026-05-22 22:41:34] [INFO ] [Real]Absence check using 99 positive place invariants in 178 ms returned sat
[2026-05-22 22:41:34] [INFO ] [Real]Absence check using 99 positive and 334 generalized place invariants in 248 ms returned sat
[2026-05-22 22:41:38] [INFO ] [Real]Absence check using state equation in 3749 ms returned unknown
[2026-05-22 22:41:39] [INFO ] [Real]Absence check using 99 positive place invariants in 116 ms returned sat
[2026-05-22 22:41:39] [INFO ] [Real]Absence check using 99 positive and 334 generalized place invariants in 232 ms returned sat
[2026-05-22 22:41:42] [INFO ] [Real]Absence check using state equation in 3689 ms returned sat
[2026-05-22 22:41:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:41:44] [INFO ] [Nat]Absence check using 99 positive place invariants in 144 ms returned sat
[2026-05-22 22:41:44] [INFO ] [Nat]Absence check using 99 positive and 334 generalized place invariants in 226 ms returned sat
[2026-05-22 22:41:48] [INFO ] [Nat]Absence check using state equation in 3814 ms returned unknown
[2026-05-22 22:41:49] [INFO ] [Real]Absence check using 99 positive place invariants in 157 ms returned sat
[2026-05-22 22:41:49] [INFO ] [Real]Absence check using 99 positive and 334 generalized place invariants in 294 ms returned sat
[2026-05-22 22:41:52] [INFO ] [Real]Absence check using state equation in 2624 ms returned sat
[2026-05-22 22:41:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:41:53] [INFO ] [Nat]Absence check using 99 positive place invariants in 166 ms returned sat
[2026-05-22 22:41:53] [INFO ] [Nat]Absence check using 99 positive and 334 generalized place invariants in 347 ms returned sat
[2026-05-22 22:41:55] [INFO ] [Nat]Absence check using state equation in 2500 ms returned sat
[2026-05-22 22:41:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 22:41:59] [INFO ] [Real]Absence check using 99 positive place invariants in 106 ms returned sat
[2026-05-22 22:42:00] [INFO ] [Real]Absence check using 99 positive and 334 generalized place invariants in 211 ms returned sat
[2026-05-22 22:42:03] [INFO ] [Real]Absence check using state equation in 3629 ms returned sat
[2026-05-22 22:42:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:42:04] [INFO ] [Nat]Absence check using 99 positive place invariants in 110 ms returned sat
[2026-05-22 22:42:04] [INFO ] [Nat]Absence check using 99 positive and 334 generalized place invariants in 222 ms returned sat
[2026-05-22 22:42:08] [INFO ] [Nat]Absence check using state equation in 3666 ms returned sat
[2026-05-22 22:42: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 22:42:11] [INFO ] [Real]Absence check using 99 positive place invariants in 128 ms returned sat
[2026-05-22 22:42:11] [INFO ] [Real]Absence check using 99 positive and 334 generalized place invariants in 199 ms returned sat
[2026-05-22 22:42:15] [INFO ] [Real]Absence check using state equation in 3565 ms returned sat
[2026-05-22 22:42:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:42:16] [INFO ] [Nat]Absence check using 99 positive place invariants in 116 ms returned sat
[2026-05-22 22:42:16] [INFO ] [Nat]Absence check using 99 positive and 334 generalized place invariants in 205 ms returned sat
[2026-05-22 22:42:19] [INFO ] [Nat]Absence check using state equation in 2480 ms returned sat
[2026-05-22 22:42:22] [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 22:42:23] [INFO ] [Real]Absence check using 99 positive place invariants in 121 ms returned sat
[2026-05-22 22:42:23] [INFO ] [Real]Absence check using 99 positive and 334 generalized place invariants in 213 ms returned sat
[2026-05-22 22:42:26] [INFO ] [Real]Absence check using state equation in 3200 ms returned sat
[2026-05-22 22:42:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:42:27] [INFO ] [Nat]Absence check using 99 positive place invariants in 113 ms returned sat
[2026-05-22 22:42:27] [INFO ] [Nat]Absence check using 99 positive and 334 generalized place invariants in 263 ms returned sat
[2026-05-22 22:42:31] [INFO ] [Nat]Absence check using state equation in 3179 ms returned sat
[2026-05-22 22:42:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 22:42:34] [INFO ] [Real]Absence check using 99 positive place invariants in 113 ms returned sat
[2026-05-22 22:42:34] [INFO ] [Real]Absence check using 99 positive and 334 generalized place invariants in 327 ms returned sat
[2026-05-22 22:42:37] [INFO ] [Real]Absence check using state equation in 3348 ms returned sat
[2026-05-22 22:42:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:42:38] [INFO ] [Nat]Absence check using 99 positive place invariants in 113 ms returned sat
[2026-05-22 22:42:38] [INFO ] [Nat]Absence check using 99 positive and 334 generalized place invariants in 263 ms returned sat
[2026-05-22 22:42:42] [INFO ] [Nat]Absence check using state equation in 3680 ms returned sat
[2026-05-22 22:42:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 22:42:46] [INFO ] [Real]Absence check using 99 positive place invariants in 117 ms returned sat
[2026-05-22 22:42:46] [INFO ] [Real]Absence check using 99 positive and 334 generalized place invariants in 182 ms returned sat
[2026-05-22 22:42:49] [INFO ] [Real]Absence check using state equation in 2865 ms returned sat
[2026-05-22 22:42:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:42:50] [INFO ] [Nat]Absence check using 99 positive place invariants in 123 ms returned sat
[2026-05-22 22:42:50] [INFO ] [Nat]Absence check using 99 positive and 334 generalized place invariants in 286 ms returned sat
[2026-05-22 22:42:53] [INFO ] [Nat]Absence check using state equation in 3016 ms returned sat
[2026-05-22 22:42:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 22:42:56] [INFO ] [Real]Absence check using 99 positive place invariants in 153 ms returned sat
[2026-05-22 22:42:57] [INFO ] [Real]Absence check using 99 positive and 334 generalized place invariants in 271 ms returned sat
[2026-05-22 22:43:00] [INFO ] [Real]Absence check using state equation in 3199 ms returned sat
[2026-05-22 22:43:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:43:01] [INFO ] [Nat]Absence check using 99 positive place invariants in 111 ms returned sat
[2026-05-22 22:43:01] [INFO ] [Nat]Absence check using 99 positive and 334 generalized place invariants in 297 ms returned sat
[2026-05-22 22:43:05] [INFO ] [Nat]Absence check using state equation in 3932 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 4410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4410/4410 places, 5405/5405 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1031 transitions
Trivial Post-agglo rules discarded 1031 transitions
Performed 1031 trivial Post agglomeration. Transition count delta: 1031
Iterating post reduction 0 with 1031 rules applied. Total rules applied 1031 place count 4410 transition count 4374
Reduce places removed 1031 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 1077 rules applied. Total rules applied 2108 place count 3379 transition count 4328
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 2121 place count 3367 transition count 4327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2122 place count 3366 transition count 4327
Performed 1025 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1025 Pre rules applied. Total rules applied 2122 place count 3366 transition count 3302
Deduced a syphon composed of 1025 places in 9 ms
Ensure Unique test removed 103 places
Reduce places removed 1128 places and 0 transitions.
Iterating global reduction 4 with 2153 rules applied. Total rules applied 4275 place count 2238 transition count 3302
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 4 with 73 rules applied. Total rules applied 4348 place count 2228 transition count 3239
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 5 with 63 rules applied. Total rules applied 4411 place count 2165 transition count 3239
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 4411 place count 2165 transition count 3199
Deduced a syphon composed of 40 places in 8 ms
Ensure Unique test removed 40 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 4531 place count 2085 transition count 3199
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 4531 place count 2085 transition count 3159
Deduced a syphon composed of 40 places in 13 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 4611 place count 2045 transition count 3159
Discarding 141 places :
Symmetric choice reduction at 6 with 141 rule applications. Total rules 4752 place count 1904 transition count 3018
Iterating global reduction 6 with 141 rules applied. Total rules applied 4893 place count 1904 transition count 3018
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4894 place count 1904 transition count 3017
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 45 Pre rules applied. Total rules applied 4894 place count 1904 transition count 2972
Deduced a syphon composed of 45 places in 23 ms
Ensure Unique test removed 1 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 7 with 91 rules applied. Total rules applied 4985 place count 1858 transition count 2972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4985 place count 1858 transition count 2971
Deduced a syphon composed of 1 places in 8 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 4988 place count 1856 transition count 2971
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 4999 place count 1845 transition count 2902
Iterating global reduction 7 with 11 rules applied. Total rules applied 5010 place count 1845 transition count 2902
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 10 Pre rules applied. Total rules applied 5010 place count 1845 transition count 2892
Deduced a syphon composed of 10 places in 7 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 5030 place count 1835 transition count 2892
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5031 place count 1834 transition count 2884
Iterating global reduction 7 with 1 rules applied. Total rules applied 5032 place count 1834 transition count 2884
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5033 place count 1833 transition count 2876
Iterating global reduction 7 with 1 rules applied. Total rules applied 5034 place count 1833 transition count 2876
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5035 place count 1832 transition count 2868
Iterating global reduction 7 with 1 rules applied. Total rules applied 5036 place count 1832 transition count 2868
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5037 place count 1831 transition count 2860
Iterating global reduction 7 with 1 rules applied. Total rules applied 5038 place count 1831 transition count 2860
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5039 place count 1830 transition count 2852
Iterating global reduction 7 with 1 rules applied. Total rules applied 5040 place count 1830 transition count 2852
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5041 place count 1829 transition count 2844
Iterating global reduction 7 with 1 rules applied. Total rules applied 5042 place count 1829 transition count 2844
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5043 place count 1828 transition count 2836
Iterating global reduction 7 with 1 rules applied. Total rules applied 5044 place count 1828 transition count 2836
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5045 place count 1827 transition count 2828
Iterating global reduction 7 with 1 rules applied. Total rules applied 5046 place count 1827 transition count 2828
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5047 place count 1826 transition count 2820
Iterating global reduction 7 with 1 rules applied. Total rules applied 5048 place count 1826 transition count 2820
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5049 place count 1825 transition count 2812
Iterating global reduction 7 with 1 rules applied. Total rules applied 5050 place count 1825 transition count 2812
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5051 place count 1824 transition count 2804
Iterating global reduction 7 with 1 rules applied. Total rules applied 5052 place count 1824 transition count 2804
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5053 place count 1823 transition count 2796
Iterating global reduction 7 with 1 rules applied. Total rules applied 5054 place count 1823 transition count 2796
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5055 place count 1822 transition count 2788
Iterating global reduction 7 with 1 rules applied. Total rules applied 5056 place count 1822 transition count 2788
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5057 place count 1821 transition count 2780
Iterating global reduction 7 with 1 rules applied. Total rules applied 5058 place count 1821 transition count 2780
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5059 place count 1820 transition count 2772
Iterating global reduction 7 with 1 rules applied. Total rules applied 5060 place count 1820 transition count 2772
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5061 place count 1819 transition count 2764
Iterating global reduction 7 with 1 rules applied. Total rules applied 5062 place count 1819 transition count 2764
Performed 257 Post agglomeration using F-continuation condition.Transition count delta: 257
Deduced a syphon composed of 257 places in 5 ms
Reduce places removed 257 places and 0 transitions.
Iterating global reduction 7 with 514 rules applied. Total rules applied 5576 place count 1562 transition count 2507
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5577 place count 1561 transition count 2506
Iterating global reduction 7 with 1 rules applied. Total rules applied 5578 place count 1561 transition count 2506
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5579 place count 1560 transition count 2505
Iterating global reduction 7 with 1 rules applied. Total rules applied 5580 place count 1560 transition count 2505
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 5583 place count 1559 transition count 2503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 5584 place count 1558 transition count 2503
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 5586 place count 1557 transition count 2512
Free-agglomeration rule applied 13 times.
Iterating global reduction 9 with 13 rules applied. Total rules applied 5599 place count 1557 transition count 2499
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 5612 place count 1544 transition count 2499
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 10 with 10 rules applied. Total rules applied 5622 place count 1544 transition count 2489
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 5632 place count 1534 transition count 2489
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 5633 place count 1533 transition count 2488
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 11 with 28 rules applied. Total rules applied 5661 place count 1513 transition count 2480
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 9 rules applied. Total rules applied 5670 place count 1505 transition count 2479
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 5671 place count 1504 transition count 2479
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 32 Pre rules applied. Total rules applied 5671 place count 1504 transition count 2447
Deduced a syphon composed of 32 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 14 with 65 rules applied. Total rules applied 5736 place count 1471 transition count 2447
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 14 with 11 rules applied. Total rules applied 5747 place count 1460 transition count 2447
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 5747 place count 1460 transition count 2446
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 5749 place count 1459 transition count 2446
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 5 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 15 with 38 rules applied. Total rules applied 5787 place count 1440 transition count 2427
Discarding 10 places :
Symmetric choice reduction at 15 with 10 rule applications. Total rules 5797 place count 1430 transition count 2417
Iterating global reduction 15 with 10 rules applied. Total rules applied 5807 place count 1430 transition count 2417
Free-agglomeration rule applied 10 times.
Iterating global reduction 15 with 10 rules applied. Total rules applied 5817 place count 1430 transition count 2407
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 5827 place count 1420 transition count 2407
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 5828 place count 1420 transition count 2407
Applied a total of 5828 rules in 3421 ms. Remains 1420 /4410 variables (removed 2990) and now considering 2407/5405 (removed 2998) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3442 ms. Remains : 1420/4410 places, 2407/5405 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6320426897314050473.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3641772658419304877.kers'
[2026-05-22 22:43:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6320426897314050473.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3641772658419304877.kers]
Culling duplicate invariants (modulo rational): removing 21 columns.
Culled 21 columns in 1 ms.
// Phase 1: matrix 2407 rows 1399 cols 9449 entries
Finished phase 1 with 377 SingleSign rule and 798 generalized
[2026-05-22 22:43:09] [INFO ] Computed 245 invariants in 24 ms
Computed 245 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-3641772658419304877.kers
Total runtime 29 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (9455 resets) in 4214 ms. (237 steps per ms)
FORMULA ASLink-PT-10b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 8000007 steps (7372 resets) in 12989 ms. (615 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-22 22:43:26] [INFO ] Invariant cache hit.
[2026-05-22 22:43:26] [INFO ] [Real]Absence check using 104 positive place invariants in 46 ms returned sat
[2026-05-22 22:43:26] [INFO ] [Real]Absence check using 104 positive and 141 generalized place invariants in 32 ms returned sat
[2026-05-22 22:43:27] [INFO ] [Real]Absence check using state equation in 890 ms returned sat
[2026-05-22 22:43:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:43:27] [INFO ] [Nat]Absence check using 104 positive place invariants in 28 ms returned sat
[2026-05-22 22:43:27] [INFO ] [Nat]Absence check using 104 positive and 141 generalized place invariants in 34 ms returned sat
[2026-05-22 22:43:28] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2026-05-22 22:43:28] [INFO ] Computed and/alt/rep : 971/3765/971 causal constraints (skipped 1387 transitions) in 142 ms.
[2026-05-22 22:43:38] [INFO ] Added : 243 causal constraints over 49 iterations in 10019 ms. Result :sat
Minimization took 1912 ms.
[2026-05-22 22:43:40] [INFO ] [Real]Absence check using 104 positive place invariants in 44 ms returned sat
[2026-05-22 22:43:41] [INFO ] [Real]Absence check using 104 positive and 141 generalized place invariants in 68 ms returned sat
[2026-05-22 22:43:42] [INFO ] [Real]Absence check using state equation in 1012 ms returned sat
[2026-05-22 22:43:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:43:42] [INFO ] [Nat]Absence check using 104 positive place invariants in 25 ms returned sat
[2026-05-22 22:43:42] [INFO ] [Nat]Absence check using 104 positive and 141 generalized place invariants in 31 ms returned sat
[2026-05-22 22:43:43] [INFO ] [Nat]Absence check using state equation in 711 ms returned sat
[2026-05-22 22:43:43] [INFO ] Computed and/alt/rep : 971/3765/971 causal constraints (skipped 1387 transitions) in 184 ms.
[2026-05-22 22:44:03] [INFO ] Added : 620 causal constraints over 124 iterations in 20143 ms.(timeout) Result :sat
Minimization took 3927 ms.
[2026-05-22 22:44:07] [INFO ] [Real]Absence check using 104 positive place invariants in 27 ms returned sat
[2026-05-22 22:44:07] [INFO ] [Real]Absence check using 104 positive and 141 generalized place invariants in 38 ms returned sat
[2026-05-22 22:44:08] [INFO ] [Real]Absence check using state equation in 850 ms returned sat
[2026-05-22 22:44:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:44:08] [INFO ] [Nat]Absence check using 104 positive place invariants in 48 ms returned sat
[2026-05-22 22:44:08] [INFO ] [Nat]Absence check using 104 positive and 141 generalized place invariants in 39 ms returned sat
[2026-05-22 22:44:09] [INFO ] [Nat]Absence check using state equation in 872 ms returned sat
[2026-05-22 22:44:10] [INFO ] Computed and/alt/rep : 971/3765/971 causal constraints (skipped 1387 transitions) in 162 ms.
[2026-05-22 22:44:29] [INFO ] Added : 623 causal constraints over 125 iterations in 19971 ms. Result :sat
Minimization took 2372 ms.
[2026-05-22 22:44:32] [INFO ] [Real]Absence check using 104 positive place invariants in 36 ms returned sat
[2026-05-22 22:44:32] [INFO ] [Real]Absence check using 104 positive and 141 generalized place invariants in 42 ms returned sat
[2026-05-22 22:44:33] [INFO ] [Real]Absence check using state equation in 867 ms returned sat
[2026-05-22 22:44:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:44:34] [INFO ] [Nat]Absence check using 104 positive place invariants in 43 ms returned sat
[2026-05-22 22:44:34] [INFO ] [Nat]Absence check using 104 positive and 141 generalized place invariants in 45 ms returned sat
[2026-05-22 22:44:35] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2026-05-22 22:44:35] [INFO ] Computed and/alt/rep : 971/3765/971 causal constraints (skipped 1387 transitions) in 98 ms.
[2026-05-22 22:44:42] [INFO ] Added : 184 causal constraints over 37 iterations in 7240 ms. Result :sat
Minimization took 2218 ms.
[2026-05-22 22:44:45] [INFO ] [Real]Absence check using 104 positive place invariants in 28 ms returned sat
[2026-05-22 22:44:45] [INFO ] [Real]Absence check using 104 positive and 141 generalized place invariants in 30 ms returned sat
[2026-05-22 22:44:46] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2026-05-22 22:44:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:44:46] [INFO ] [Nat]Absence check using 104 positive place invariants in 50 ms returned sat
[2026-05-22 22:44:46] [INFO ] [Nat]Absence check using 104 positive and 141 generalized place invariants in 27 ms returned sat
[2026-05-22 22:44:47] [INFO ] [Nat]Absence check using state equation in 827 ms returned sat
[2026-05-22 22:44:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2026-05-22 22:44:47] [INFO ] Computed and/alt/rep : 971/3765/971 causal constraints (skipped 1387 transitions) in 90 ms.
[2026-05-22 22:45:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 334 ms
[2026-05-22 22:45:06] [INFO ] Added : 687 causal constraints over 138 iterations in 18999 ms. Result :sat
Minimization took 2660 ms.
[2026-05-22 22:45:09] [INFO ] [Real]Absence check using 104 positive place invariants in 24 ms returned sat
[2026-05-22 22:45:09] [INFO ] [Real]Absence check using 104 positive and 141 generalized place invariants in 62 ms returned sat
[2026-05-22 22:45:10] [INFO ] [Real]Absence check using state equation in 729 ms returned sat
[2026-05-22 22:45:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:45:10] [INFO ] [Nat]Absence check using 104 positive place invariants in 29 ms returned sat
[2026-05-22 22:45:10] [INFO ] [Nat]Absence check using 104 positive and 141 generalized place invariants in 31 ms returned sat
[2026-05-22 22:45:11] [INFO ] [Nat]Absence check using state equation in 680 ms returned sat
[2026-05-22 22:45:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 432 ms
[2026-05-22 22:45:12] [INFO ] Computed and/alt/rep : 971/3765/971 causal constraints (skipped 1387 transitions) in 102 ms.
[2026-05-22 22:45:32] [INFO ] Added : 615 causal constraints over 123 iterations in 20090 ms.(timeout) Result :sat
Minimization took 2692 ms.
[2026-05-22 22:45:35] [INFO ] [Real]Absence check using 104 positive place invariants in 26 ms returned sat
[2026-05-22 22:45:35] [INFO ] [Real]Absence check using 104 positive and 141 generalized place invariants in 56 ms returned sat
[2026-05-22 22:45:36] [INFO ] [Real]Absence check using state equation in 854 ms returned sat
[2026-05-22 22:45:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:45:36] [INFO ] [Nat]Absence check using 104 positive place invariants in 30 ms returned sat
[2026-05-22 22:45:36] [INFO ] [Nat]Absence check using 104 positive and 141 generalized place invariants in 61 ms returned sat
[2026-05-22 22:45:38] [INFO ] [Nat]Absence check using state equation in 1474 ms returned sat
[2026-05-22 22:45:38] [INFO ] Computed and/alt/rep : 971/3765/971 causal constraints (skipped 1387 transitions) in 289 ms.
[2026-05-22 22:45:45] [INFO ] Added : 144 causal constraints over 29 iterations in 7535 ms. Result :sat
Minimization took 1450 ms.
[2026-05-22 22:45:47] [INFO ] [Real]Absence check using 104 positive place invariants in 28 ms returned sat
[2026-05-22 22:45:47] [INFO ] [Real]Absence check using 104 positive and 141 generalized place invariants in 36 ms returned sat
[2026-05-22 22:45:48] [INFO ] [Real]Absence check using state equation in 777 ms returned sat
[2026-05-22 22:45:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:45:48] [INFO ] [Nat]Absence check using 104 positive place invariants in 35 ms returned sat
[2026-05-22 22:45:48] [INFO ] [Nat]Absence check using 104 positive and 141 generalized place invariants in 54 ms returned sat
[2026-05-22 22:45:49] [INFO ] [Nat]Absence check using state equation in 1150 ms returned sat
[2026-05-22 22:45:50] [INFO ] Computed and/alt/rep : 971/3765/971 causal constraints (skipped 1387 transitions) in 150 ms.
[2026-05-22 22:45:57] [INFO ] Added : 174 causal constraints over 35 iterations in 7445 ms. Result :sat
Minimization took 1609 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-10b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 1420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1420/1420 places, 2407/2407 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1420 transition count 2406
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1419 transition count 2406
Applied a total of 2 rules in 71 ms. Remains 1419 /1420 variables (removed 1) and now considering 2406/2407 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 1419/1420 places, 2406/2407 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9774245911145447761.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4830088059795788652.kers'
[2026-05-22 22:46:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9774245911145447761.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4830088059795788652.kers]
Culling duplicate invariants (modulo rational): removing 21 columns.
Culled 21 columns in 1 ms.
// Phase 1: matrix 2406 rows 1398 cols 9447 entries
Finished phase 1 with 376 SingleSign rule and 798 generalized
[2026-05-22 22:46:35] [INFO ] Computed 245 invariants in 25 ms
Computed 245 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-4830088059795788652.kers
Total runtime 31 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (9446 resets) in 4085 ms. (244 steps per ms)
BEST_FIRST walk for 7000007 steps (6447 resets) in 12460 ms. (561 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2026-05-22 22:46:52] [INFO ] Invariant cache hit.
[2026-05-22 22:46:52] [INFO ] [Real]Absence check using 104 positive place invariants in 53 ms returned sat
[2026-05-22 22:46:52] [INFO ] [Real]Absence check using 104 positive and 141 generalized place invariants in 99 ms returned sat
[2026-05-22 22:46:53] [INFO ] [Real]Absence check using state equation in 1036 ms returned sat
[2026-05-22 22:46:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:46:53] [INFO ] [Nat]Absence check using 104 positive place invariants in 48 ms returned sat
[2026-05-22 22:46:53] [INFO ] [Nat]Absence check using 104 positive and 141 generalized place invariants in 47 ms returned sat
[2026-05-22 22:46:55] [INFO ] [Nat]Absence check using state equation in 1451 ms returned sat
[2026-05-22 22:46:55] [INFO ] Computed and/alt/rep : 970/3764/970 causal constraints (skipped 1387 transitions) in 147 ms.
[2026-05-22 22:47:15] [INFO ] Added : 550 causal constraints over 110 iterations in 20049 ms.(timeout) Result :sat
Minimization took 3982 ms.
[2026-05-22 22:47:19] [INFO ] [Real]Absence check using 104 positive place invariants in 32 ms returned sat
[2026-05-22 22:47:19] [INFO ] [Real]Absence check using 104 positive and 141 generalized place invariants in 39 ms returned sat
[2026-05-22 22:47:20] [INFO ] [Real]Absence check using state equation in 787 ms returned sat
[2026-05-22 22:47:20] [INFO ] Computed and/alt/rep : 970/3764/970 causal constraints (skipped 1387 transitions) in 108 ms.
[2026-05-22 22:47:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:47:21] [INFO ] [Nat]Absence check using 104 positive place invariants in 52 ms returned sat
[2026-05-22 22:47:21] [INFO ] [Nat]Absence check using 104 positive and 141 generalized place invariants in 48 ms returned sat
[2026-05-22 22:47:22] [INFO ] [Nat]Absence check using state equation in 886 ms returned sat
[2026-05-22 22:47:23] [INFO ] Computed and/alt/rep : 970/3764/970 causal constraints (skipped 1387 transitions) in 194 ms.
[2026-05-22 22:47:33] [INFO ] Added : 227 causal constraints over 46 iterations in 10332 ms. Result :sat
Minimization took 2237 ms.
[2026-05-22 22:47:35] [INFO ] [Real]Absence check using 104 positive place invariants in 29 ms returned sat
[2026-05-22 22:47:35] [INFO ] [Real]Absence check using 104 positive and 141 generalized place invariants in 51 ms returned sat
[2026-05-22 22:47:36] [INFO ] [Real]Absence check using state equation in 852 ms returned sat
[2026-05-22 22:47:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:47:37] [INFO ] [Nat]Absence check using 104 positive place invariants in 61 ms returned sat
[2026-05-22 22:47:37] [INFO ] [Nat]Absence check using 104 positive and 141 generalized place invariants in 56 ms returned sat
[2026-05-22 22:47:37] [INFO ] [Nat]Absence check using state equation in 863 ms returned sat
[2026-05-22 22:47:38] [INFO ] Computed and/alt/rep : 970/3764/970 causal constraints (skipped 1387 transitions) in 139 ms.
[2026-05-22 22:47:43] [INFO ] Added : 141 causal constraints over 29 iterations in 5667 ms. Result :sat
Minimization took 1732 ms.
[2026-05-22 22:47:45] [INFO ] [Real]Absence check using 104 positive place invariants in 60 ms returned sat
[2026-05-22 22:47:45] [INFO ] [Real]Absence check using 104 positive and 141 generalized place invariants in 74 ms returned sat
[2026-05-22 22:47:47] [INFO ] [Real]Absence check using state equation in 1197 ms returned sat
[2026-05-22 22:47:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:47:47] [INFO ] [Nat]Absence check using 104 positive place invariants in 44 ms returned sat
[2026-05-22 22:47:47] [INFO ] [Nat]Absence check using 104 positive and 141 generalized place invariants in 49 ms returned sat
[2026-05-22 22:47:48] [INFO ] [Nat]Absence check using state equation in 1307 ms returned sat
[2026-05-22 22:47:49] [INFO ] Computed and/alt/rep : 970/3764/970 causal constraints (skipped 1387 transitions) in 145 ms.
[2026-05-22 22:48:09] [INFO ] Added : 595 causal constraints over 119 iterations in 20100 ms.(timeout) Result :sat
Minimization took 2252 ms.
[2026-05-22 22:48:11] [INFO ] [Real]Absence check using 104 positive place invariants in 40 ms returned sat
[2026-05-22 22:48:11] [INFO ] [Real]Absence check using 104 positive and 141 generalized place invariants in 70 ms returned sat
[2026-05-22 22:48:12] [INFO ] [Real]Absence check using state equation in 880 ms returned sat
[2026-05-22 22:48:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:48:12] [INFO ] [Nat]Absence check using 104 positive place invariants in 26 ms returned sat
[2026-05-22 22:48:13] [INFO ] [Nat]Absence check using 104 positive and 141 generalized place invariants in 56 ms returned sat
[2026-05-22 22:48:13] [INFO ] [Nat]Absence check using state equation in 906 ms returned sat
[2026-05-22 22:48:14] [INFO ] Computed and/alt/rep : 970/3764/970 causal constraints (skipped 1387 transitions) in 126 ms.
[2026-05-22 22:48:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 455 ms
[2026-05-22 22:48:23] [INFO ] Added : 206 causal constraints over 42 iterations in 9402 ms. Result :sat
Minimization took 1878 ms.
[2026-05-22 22:48:25] [INFO ] [Real]Absence check using 104 positive place invariants in 25 ms returned sat
[2026-05-22 22:48:25] [INFO ] [Real]Absence check using 104 positive and 141 generalized place invariants in 34 ms returned sat
[2026-05-22 22:48:26] [INFO ] [Real]Absence check using state equation in 777 ms returned sat
[2026-05-22 22:48:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:48:26] [INFO ] [Nat]Absence check using 104 positive place invariants in 29 ms returned sat
[2026-05-22 22:48:26] [INFO ] [Nat]Absence check using 104 positive and 141 generalized place invariants in 37 ms returned sat
[2026-05-22 22:48:28] [INFO ] [Nat]Absence check using state equation in 1286 ms returned sat
[2026-05-22 22:48:28] [INFO ] Computed and/alt/rep : 970/3764/970 causal constraints (skipped 1387 transitions) in 252 ms.
[2026-05-22 22:48:34] [INFO ] Added : 135 causal constraints over 27 iterations in 6688 ms. Result :sat
Minimization took 2329 ms.
[2026-05-22 22:48:37] [INFO ] [Real]Absence check using 104 positive place invariants in 26 ms returned sat
[2026-05-22 22:48:37] [INFO ] [Real]Absence check using 104 positive and 141 generalized place invariants in 31 ms returned sat
[2026-05-22 22:48:38] [INFO ] [Real]Absence check using state equation in 917 ms returned sat
[2026-05-22 22:48:38] [INFO ] Computed and/alt/rep : 970/3764/970 causal constraints (skipped 1387 transitions) in 139 ms.
[2026-05-22 22:48:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:48:39] [INFO ] [Nat]Absence check using 104 positive place invariants in 43 ms returned sat
[2026-05-22 22:48:39] [INFO ] [Nat]Absence check using 104 positive and 141 generalized place invariants in 28 ms returned sat
[2026-05-22 22:48:40] [INFO ] [Nat]Absence check using state equation in 1040 ms returned sat
[2026-05-22 22:48:40] [INFO ] Computed and/alt/rep : 970/3764/970 causal constraints (skipped 1387 transitions) in 107 ms.
[2026-05-22 22:49:00] [INFO ] Added : 600 causal constraints over 120 iterations in 20156 ms.(timeout) Result :sat
Minimization took 3268 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-10b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 1419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1419/1419 places, 2406/2406 transitions.
Applied a total of 0 rules in 53 ms. Remains 1419 /1419 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1419/1419 places, 2406/2406 transitions.
[2026-05-22 22:49:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (9404 resets) in 3949 ms. (253 steps per ms)
BEST_FIRST walk for 6000005 steps (5522 resets) in 9704 ms. (618 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 22:49:37] [INFO ] Invariant cache hit.
[2026-05-22 22:49:37] [INFO ] [Real]Absence check using 104 positive place invariants in 27 ms returned sat
[2026-05-22 22:49:37] [INFO ] [Real]Absence check using 104 positive and 141 generalized place invariants in 41 ms returned sat
[2026-05-22 22:49:38] [INFO ] [Real]Absence check using state equation in 816 ms returned sat
[2026-05-22 22:49:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:49:38] [INFO ] [Nat]Absence check using 104 positive place invariants in 57 ms returned sat
[2026-05-22 22:49:38] [INFO ] [Nat]Absence check using 104 positive and 141 generalized place invariants in 42 ms returned sat
[2026-05-22 22:49:39] [INFO ] [Nat]Absence check using state equation in 1108 ms returned sat
[2026-05-22 22:49:40] [INFO ] Computed and/alt/rep : 970/3764/970 causal constraints (skipped 1387 transitions) in 144 ms.
[2026-05-22 22:50:00] [INFO ] Added : 590 causal constraints over 118 iterations in 20243 ms.(timeout) Result :sat
Minimization took 3043 ms.
[2026-05-22 22:50:03] [INFO ] [Real]Absence check using 104 positive place invariants in 24 ms returned sat
[2026-05-22 22:50:03] [INFO ] [Real]Absence check using 104 positive and 141 generalized place invariants in 32 ms returned sat
[2026-05-22 22:50:04] [INFO ] [Real]Absence check using state equation in 702 ms returned sat
[2026-05-22 22:50:04] [INFO ] Computed and/alt/rep : 970/3764/970 causal constraints (skipped 1387 transitions) in 121 ms.
[2026-05-22 22:50:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:50:05] [INFO ] [Nat]Absence check using 104 positive place invariants in 36 ms returned sat
[2026-05-22 22:50:05] [INFO ] [Nat]Absence check using 104 positive and 141 generalized place invariants in 32 ms returned sat
[2026-05-22 22:50:05] [INFO ] [Nat]Absence check using state equation in 770 ms returned sat
[2026-05-22 22:50:06] [INFO ] Computed and/alt/rep : 970/3764/970 causal constraints (skipped 1387 transitions) in 138 ms.
[2026-05-22 22:50:15] [INFO ] Added : 227 causal constraints over 46 iterations in 9230 ms. Result :sat
Minimization took 2226 ms.
[2026-05-22 22:50:17] [INFO ] [Real]Absence check using 104 positive place invariants in 22 ms returned sat
[2026-05-22 22:50:17] [INFO ] [Real]Absence check using 104 positive and 141 generalized place invariants in 39 ms returned sat
[2026-05-22 22:50:18] [INFO ] [Real]Absence check using state equation in 699 ms returned sat
[2026-05-22 22:50:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:50:18] [INFO ] [Nat]Absence check using 104 positive place invariants in 30 ms returned sat
[2026-05-22 22:50:19] [INFO ] [Nat]Absence check using 104 positive and 141 generalized place invariants in 75 ms returned sat
[2026-05-22 22:50:19] [INFO ] [Nat]Absence check using state equation in 814 ms returned sat
[2026-05-22 22:50:20] [INFO ] Computed and/alt/rep : 970/3764/970 causal constraints (skipped 1387 transitions) in 150 ms.
[2026-05-22 22:50:24] [INFO ] Added : 141 causal constraints over 29 iterations in 5005 ms. Result :sat
Minimization took 1607 ms.
[2026-05-22 22:50:26] [INFO ] [Real]Absence check using 104 positive place invariants in 25 ms returned sat
[2026-05-22 22:50:26] [INFO ] [Real]Absence check using 104 positive and 141 generalized place invariants in 41 ms returned sat
[2026-05-22 22:50:27] [INFO ] [Real]Absence check using state equation in 926 ms returned sat
[2026-05-22 22:50:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:50:28] [INFO ] [Nat]Absence check using 104 positive place invariants in 26 ms returned sat
[2026-05-22 22:50:28] [INFO ] [Nat]Absence check using 104 positive and 141 generalized place invariants in 40 ms returned sat
[2026-05-22 22:50:29] [INFO ] [Nat]Absence check using state equation in 1121 ms returned sat
[2026-05-22 22:50:29] [INFO ] Computed and/alt/rep : 970/3764/970 causal constraints (skipped 1387 transitions) in 266 ms.
[2026-05-22 22:50:49] [INFO ] Added : 600 causal constraints over 120 iterations in 20172 ms.(timeout) Result :sat
Minimization took 2035 ms.
[2026-05-22 22:50:51] [INFO ] [Real]Absence check using 104 positive place invariants in 31 ms returned sat
[2026-05-22 22:50:52] [INFO ] [Real]Absence check using 104 positive and 141 generalized place invariants in 49 ms returned sat
[2026-05-22 22:50:52] [INFO ] [Real]Absence check using state equation in 835 ms returned sat
[2026-05-22 22:50:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:50:53] [INFO ] [Nat]Absence check using 104 positive place invariants in 51 ms returned sat
[2026-05-22 22:50:53] [INFO ] [Nat]Absence check using 104 positive and 141 generalized place invariants in 37 ms returned sat
[2026-05-22 22:50:54] [INFO ] [Nat]Absence check using state equation in 948 ms returned sat
[2026-05-22 22:50:54] [INFO ] Computed and/alt/rep : 970/3764/970 causal constraints (skipped 1387 transitions) in 113 ms.
[2026-05-22 22:51:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 412 ms
[2026-05-22 22:51:02] [INFO ] Added : 206 causal constraints over 42 iterations in 8659 ms. Result :sat
Minimization took 1821 ms.
[2026-05-22 22:51:05] [INFO ] [Real]Absence check using 104 positive place invariants in 32 ms returned sat
[2026-05-22 22:51:05] [INFO ] [Real]Absence check using 104 positive and 141 generalized place invariants in 37 ms returned sat
[2026-05-22 22:51:06] [INFO ] [Real]Absence check using state equation in 964 ms returned sat
[2026-05-22 22:51:06] [INFO ] Computed and/alt/rep : 970/3764/970 causal constraints (skipped 1387 transitions) in 114 ms.
[2026-05-22 22:51:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:51:06] [INFO ] [Nat]Absence check using 104 positive place invariants in 29 ms returned sat
[2026-05-22 22:51:06] [INFO ] [Nat]Absence check using 104 positive and 141 generalized place invariants in 34 ms returned sat
[2026-05-22 22:51:07] [INFO ] [Nat]Absence check using state equation in 1049 ms returned sat
[2026-05-22 22:51:08] [INFO ] Computed and/alt/rep : 970/3764/970 causal constraints (skipped 1387 transitions) in 115 ms.
[2026-05-22 22:51:28] [INFO ] Added : 705 causal constraints over 141 iterations in 20095 ms.(timeout) Result :sat
Minimization took 2181 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 1419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1419/1419 places, 2406/2406 transitions.
Applied a total of 0 rules in 52 ms. Remains 1419 /1419 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1419/1419 places, 2406/2406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1419/1419 places, 2406/2406 transitions.
Applied a total of 0 rules in 50 ms. Remains 1419 /1419 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
[2026-05-22 22:51:49] [INFO ] Invariant cache hit.
[2026-05-22 22:51:51] [INFO ] Implicit Places using invariants in 1361 ms returned [1, 19, 21, 33, 50, 68, 137, 141, 150, 151, 153, 170, 188, 257, 261, 262, 274, 277, 294, 312, 382, 386, 387, 398, 399, 401, 418, 436, 505, 509, 510, 521, 522, 524, 542, 560, 629, 633, 634, 645, 646, 648, 665, 683, 752, 756, 757, 768, 769, 771, 788, 806, 876, 880, 881, 892, 893, 895, 912, 930, 999, 1003, 1004, 1015, 1016, 1018, 1035, 1053, 1122, 1126, 1127, 1138, 1139, 1141, 1158, 1176, 1245, 1249, 1250, 1253, 1264, 1265, 1266, 1284, 1286, 1290, 1308, 1309, 1310, 1311, 1323, 1329, 1335, 1341, 1347, 1353, 1359, 1365, 1371, 1377, 1383]
[2026-05-22 22:51:51] [INFO ] Actually due to overlaps returned [1284, 1266, 50, 170, 277, 294, 418, 542, 665, 788, 912, 1035, 1158, 1290, 33, 153, 401, 524, 648, 771, 895, 1018, 1141, 150, 398, 521, 645, 768, 892, 1015, 1138, 1264, 1308, 151, 274, 399, 522, 646, 769, 893, 1016, 1139, 1265, 1286, 1309, 1, 19, 261, 262, 386, 387, 509, 510, 633, 634, 756, 757, 880, 881, 1003, 1004, 1126, 1127, 1249, 1250, 68, 188, 312, 436, 560, 683, 806, 930, 1053, 1176, 1310, 1353, 1371, 1383, 21, 1253, 1311, 1323, 1329, 1335, 1341, 1347, 1359, 1365, 1377]
Discarding 90 places :
Implicit Place search using SMT only with invariants took 1378 ms to find 90 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1329/1419 places, 2406/2406 transitions.
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 186 transitions
Trivial Post-agglo rules discarded 186 transitions
Performed 186 trivial Post agglomeration. Transition count delta: 186
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 1319 transition count 2220
Reduce places removed 186 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 195 rules applied. Total rules applied 391 place count 1133 transition count 2211
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 393 place count 1131 transition count 2211
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 393 place count 1131 transition count 2168
Deduced a syphon composed of 43 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 87 rules applied. Total rules applied 480 place count 1087 transition count 2168
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 492 place count 1083 transition count 2160
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 500 place count 1075 transition count 2160
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 515 place count 1060 transition count 2145
Iterating global reduction 5 with 15 rules applied. Total rules applied 530 place count 1060 transition count 2145
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 533 place count 1060 transition count 2142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 533 place count 1060 transition count 2141
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 535 place count 1059 transition count 2141
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 538 place count 1056 transition count 2135
Iterating global reduction 6 with 3 rules applied. Total rules applied 541 place count 1056 transition count 2135
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 542 place count 1055 transition count 2134
Iterating global reduction 6 with 1 rules applied. Total rules applied 543 place count 1055 transition count 2134
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 544 place count 1054 transition count 2132
Iterating global reduction 6 with 1 rules applied. Total rules applied 545 place count 1054 transition count 2132
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 4 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 6 with 138 rules applied. Total rules applied 683 place count 985 transition count 2063
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 693 place count 975 transition count 2053
Iterating global reduction 6 with 10 rules applied. Total rules applied 703 place count 975 transition count 2053
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 711 place count 975 transition count 2045
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 715 place count 973 transition count 2046
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 718 place count 973 transition count 2043
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 7 with 24 rules applied. Total rules applied 742 place count 973 transition count 2019
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 767 place count 948 transition count 2019
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 768 place count 948 transition count 2018
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 8 with 30 rules applied. Total rules applied 798 place count 948 transition count 2018
Applied a total of 798 rules in 512 ms. Remains 948 /1329 variables (removed 381) and now considering 2018/2406 (removed 388) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7908776430351059538.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13921083705970469418.kers'
[2026-05-22 22:51:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7908776430351059538.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13921083705970469418.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 2018 rows 946 cols 8250 entries
Finished phase 1 with 312 SingleSign rule and 497 generalized
[2026-05-22 22:51:51] [INFO ] Computed 139 invariants in 20 ms
Computed 139 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-13921083705970469418.kers
Total runtime 22 ms.
[2026-05-22 22:51:52] [INFO ] Implicit Places using invariants in 930 ms returned [74, 91, 97, 100, 102, 103, 106, 107, 159, 188, 196, 197, 251, 269, 275, 278, 280, 285, 286, 338, 355, 361, 364, 366, 371, 372, 425, 442, 448, 451, 453, 458, 459, 511, 528, 534, 537, 539, 544, 545, 598, 615, 621, 624, 626, 631, 632, 684, 701, 707, 710, 712, 717, 718, 770, 787, 793, 796, 798, 803, 804, 856, 873, 879, 882, 884]
[2026-05-22 22:51:52] [INFO ] Actually due to overlaps returned [106, 196, 285, 371, 458, 544, 631, 717, 803, 107, 197, 286, 372, 459, 545, 632, 718, 804, 91, 97, 102, 269, 275, 280, 355, 361, 366, 442, 448, 453, 528, 534, 539, 615, 621, 626, 701, 707, 712, 787, 793, 798, 873, 879, 884, 74, 103, 159, 188, 251, 338, 425, 511, 598, 684, 770, 856]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 934 ms to find 57 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 891/1419 places, 2018/2406 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 855 transition count 1982
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 855 transition count 1982
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 81 place count 846 transition count 1973
Iterating global reduction 0 with 9 rules applied. Total rules applied 90 place count 846 transition count 1973
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 128 place count 827 transition count 1954
Free-agglomeration rule applied 27 times.
Iterating global reduction 0 with 27 rules applied. Total rules applied 155 place count 827 transition count 1927
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 182 place count 800 transition count 1927
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 190 place count 800 transition count 1919
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 198 place count 792 transition count 1919
Applied a total of 198 rules in 207 ms. Remains 792 /891 variables (removed 99) and now considering 1919/2018 (removed 99) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5007896058732689283.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17355309287940767432.kers'
[2026-05-22 22:51:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5007896058732689283.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17355309287940767432.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 1919 rows 791 cols 7796 entries
Finished phase 1 with 194 SingleSign rule and 516 generalized
[2026-05-22 22:51:52] [INFO ] Computed 82 invariants in 56 ms
Computed 82 P flows in 56 ms.
Exported basis to /tmp/petrispot-output-17355309287940767432.kers
Total runtime 59 ms.
[2026-05-22 22:51:53] [INFO ] Implicit Places using invariants in 660 ms returned []
[2026-05-22 22:51:53] [INFO ] Invariant cache hit.
[2026-05-22 22:51:55] [INFO ] Implicit Places using invariants and state equation in 2019 ms returned []
Implicit Place search using SMT with State Equation took 2683 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 792/1419 places, 1919/2406 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5768 ms. Remains : 792/1419 places, 1919/2406 transitions.
[2026-05-22 22:51:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (15772 resets) in 2727 ms. (366 steps per ms)
BEST_FIRST walk for 6000006 steps (12228 resets) in 5299 ms. (1132 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 22:52:03] [INFO ] Invariant cache hit.
[2026-05-22 22:52:03] [INFO ] [Real]Absence check using 27 positive place invariants in 13 ms returned sat
[2026-05-22 22:52:03] [INFO ] [Real]Absence check using 27 positive and 55 generalized place invariants in 15 ms returned sat
[2026-05-22 22:52:04] [INFO ] [Real]Absence check using state equation in 684 ms returned sat
[2026-05-22 22:52:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:52:04] [INFO ] [Nat]Absence check using 27 positive place invariants in 12 ms returned sat
[2026-05-22 22:52:04] [INFO ] [Nat]Absence check using 27 positive and 55 generalized place invariants in 27 ms returned sat
[2026-05-22 22:52:05] [INFO ] [Nat]Absence check using state equation in 681 ms returned sat
[2026-05-22 22:52:05] [INFO ] Computed and/alt/rep : 491/2206/491 causal constraints (skipped 1379 transitions) in 121 ms.
[2026-05-22 22:52:07] [INFO ] Added : 61 causal constraints over 14 iterations in 2199 ms. Result :sat
Minimization took 1008 ms.
[2026-05-22 22:52:08] [INFO ] [Real]Absence check using 27 positive place invariants in 27 ms returned sat
[2026-05-22 22:52:08] [INFO ] [Real]Absence check using 27 positive and 55 generalized place invariants in 11 ms returned sat
[2026-05-22 22:52:09] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2026-05-22 22:52:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:52:09] [INFO ] [Nat]Absence check using 27 positive place invariants in 11 ms returned sat
[2026-05-22 22:52:09] [INFO ] [Nat]Absence check using 27 positive and 55 generalized place invariants in 11 ms returned sat
[2026-05-22 22:52:10] [INFO ] [Nat]Absence check using state equation in 801 ms returned sat
[2026-05-22 22:52:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2026-05-22 22:52:10] [INFO ] Computed and/alt/rep : 491/2206/491 causal constraints (skipped 1379 transitions) in 154 ms.
[2026-05-22 22:52:14] [INFO ] Added : 134 causal constraints over 27 iterations in 3475 ms. Result :sat
Minimization took 1571 ms.
[2026-05-22 22:52:15] [INFO ] [Real]Absence check using 27 positive place invariants in 13 ms returned sat
[2026-05-22 22:52:15] [INFO ] [Real]Absence check using 27 positive and 55 generalized place invariants in 21 ms returned sat
[2026-05-22 22:52:16] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2026-05-22 22:52:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:52:16] [INFO ] [Nat]Absence check using 27 positive place invariants in 11 ms returned sat
[2026-05-22 22:52:16] [INFO ] [Nat]Absence check using 27 positive and 55 generalized place invariants in 13 ms returned sat
[2026-05-22 22:52:17] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2026-05-22 22:52:17] [INFO ] Computed and/alt/rep : 491/2206/491 causal constraints (skipped 1379 transitions) in 124 ms.
[2026-05-22 22:52:18] [INFO ] Added : 11 causal constraints over 3 iterations in 508 ms. Result :sat
Minimization took 741 ms.
[2026-05-22 22:52:19] [INFO ] [Real]Absence check using 27 positive place invariants in 11 ms returned sat
[2026-05-22 22:52:19] [INFO ] [Real]Absence check using 27 positive and 55 generalized place invariants in 14 ms returned sat
[2026-05-22 22:52:19] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2026-05-22 22:52:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:52:19] [INFO ] [Nat]Absence check using 27 positive place invariants in 26 ms returned sat
[2026-05-22 22:52:19] [INFO ] [Nat]Absence check using 27 positive and 55 generalized place invariants in 17 ms returned sat
[2026-05-22 22:52:20] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2026-05-22 22:52:20] [INFO ] Computed and/alt/rep : 491/2206/491 causal constraints (skipped 1379 transitions) in 103 ms.
[2026-05-22 22:52:21] [INFO ] Added : 58 causal constraints over 12 iterations in 1508 ms. Result :sat
Minimization took 845 ms.
[2026-05-22 22:52:22] [INFO ] [Real]Absence check using 27 positive place invariants in 10 ms returned sat
[2026-05-22 22:52:22] [INFO ] [Real]Absence check using 27 positive and 55 generalized place invariants in 27 ms returned sat
[2026-05-22 22:52:23] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2026-05-22 22:52:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:52:23] [INFO ] [Nat]Absence check using 27 positive place invariants in 13 ms returned sat
[2026-05-22 22:52:23] [INFO ] [Nat]Absence check using 27 positive and 55 generalized place invariants in 16 ms returned sat
[2026-05-22 22:52:24] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2026-05-22 22:52:24] [INFO ] Computed and/alt/rep : 491/2206/491 causal constraints (skipped 1379 transitions) in 99 ms.
[2026-05-22 22:52:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 341 ms
[2026-05-22 22:52:28] [INFO ] Added : 129 causal constraints over 26 iterations in 3958 ms. Result :sat
Minimization took 1580 ms.
[2026-05-22 22:52:30] [INFO ] [Real]Absence check using 27 positive place invariants in 35 ms returned sat
[2026-05-22 22:52:30] [INFO ] [Real]Absence check using 27 positive and 55 generalized place invariants in 12 ms returned sat
[2026-05-22 22:52:30] [INFO ] [Real]Absence check using state equation in 601 ms returned sat
[2026-05-22 22:52:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:52:30] [INFO ] [Nat]Absence check using 27 positive place invariants in 28 ms returned sat
[2026-05-22 22:52:30] [INFO ] [Nat]Absence check using 27 positive and 55 generalized place invariants in 35 ms returned sat
[2026-05-22 22:52:31] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2026-05-22 22:52:31] [INFO ] Computed and/alt/rep : 491/2206/491 causal constraints (skipped 1379 transitions) in 98 ms.
[2026-05-22 22:52:32] [INFO ] Added : 34 causal constraints over 8 iterations in 1002 ms. Result :sat
Minimization took 960 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-10b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 792 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 792/792 places, 1919/1919 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 791 transition count 1918
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 791 transition count 1917
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 790 transition count 1917
Applied a total of 4 rules in 90 ms. Remains 790 /792 variables (removed 2) and now considering 1917/1919 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 790/792 places, 1917/1919 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12369480303871143697.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7681045754939776208.kers'
[2026-05-22 22:52:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12369480303871143697.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7681045754939776208.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1917 rows 789 cols 7798 entries
Finished phase 1 with 195 SingleSign rule and 513 generalized
[2026-05-22 22:52:37] [INFO ] Computed 82 invariants in 26 ms
Computed 82 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-7681045754939776208.kers
Total runtime 28 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 (15762 resets) in 2669 ms. (374 steps per ms)
BEST_FIRST walk for 5000005 steps (10182 resets) in 4463 ms. (1120 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-22 22:52:44] [INFO ] Invariant cache hit.
[2026-05-22 22:52:44] [INFO ] [Real]Absence check using 27 positive place invariants in 14 ms returned sat
[2026-05-22 22:52:44] [INFO ] [Real]Absence check using 27 positive and 55 generalized place invariants in 18 ms returned sat
[2026-05-22 22:52:45] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2026-05-22 22:52:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:52:45] [INFO ] [Nat]Absence check using 27 positive place invariants in 11 ms returned sat
[2026-05-22 22:52:45] [INFO ] [Nat]Absence check using 27 positive and 55 generalized place invariants in 15 ms returned sat
[2026-05-22 22:52:46] [INFO ] [Nat]Absence check using state equation in 749 ms returned sat
[2026-05-22 22:52:46] [INFO ] Computed and/alt/rep : 482/2148/482 causal constraints (skipped 1386 transitions) in 103 ms.
[2026-05-22 22:52:50] [INFO ] Added : 144 causal constraints over 29 iterations in 3919 ms. Result :sat
Minimization took 1117 ms.
[2026-05-22 22:52:51] [INFO ] [Real]Absence check using 27 positive place invariants in 11 ms returned sat
[2026-05-22 22:52:51] [INFO ] [Real]Absence check using 27 positive and 55 generalized place invariants in 14 ms returned sat
[2026-05-22 22:52:52] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2026-05-22 22:52:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:52:52] [INFO ] [Nat]Absence check using 27 positive place invariants in 12 ms returned sat
[2026-05-22 22:52:52] [INFO ] [Nat]Absence check using 27 positive and 55 generalized place invariants in 14 ms returned sat
[2026-05-22 22:52:53] [INFO ] [Nat]Absence check using state equation in 681 ms returned sat
[2026-05-22 22:52:53] [INFO ] Computed and/alt/rep : 482/2148/482 causal constraints (skipped 1386 transitions) in 94 ms.
[2026-05-22 22:52:58] [INFO ] Added : 156 causal constraints over 32 iterations in 4665 ms. Result :sat
Minimization took 1378 ms.
[2026-05-22 22:52:59] [INFO ] [Real]Absence check using 27 positive place invariants in 11 ms returned sat
[2026-05-22 22:52:59] [INFO ] [Real]Absence check using 27 positive and 55 generalized place invariants in 18 ms returned sat
[2026-05-22 22:53:00] [INFO ] [Real]Absence check using state equation in 639 ms returned sat
[2026-05-22 22:53:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:53:00] [INFO ] [Nat]Absence check using 27 positive place invariants in 13 ms returned sat
[2026-05-22 22:53:00] [INFO ] [Nat]Absence check using 27 positive and 55 generalized place invariants in 15 ms returned sat
[2026-05-22 22:53:01] [INFO ] [Nat]Absence check using state equation in 733 ms returned sat
[2026-05-22 22:53:01] [INFO ] Computed and/alt/rep : 482/2148/482 causal constraints (skipped 1386 transitions) in 115 ms.
[2026-05-22 22:53:02] [INFO ] Added : 21 causal constraints over 5 iterations in 827 ms. Result :sat
Minimization took 812 ms.
[2026-05-22 22:53:03] [INFO ] [Real]Absence check using 27 positive place invariants in 15 ms returned sat
[2026-05-22 22:53:03] [INFO ] [Real]Absence check using 27 positive and 55 generalized place invariants in 21 ms returned sat
[2026-05-22 22:53:04] [INFO ] [Real]Absence check using state equation in 849 ms returned sat
[2026-05-22 22:53:04] [INFO ] Computed and/alt/rep : 482/2148/482 causal constraints (skipped 1386 transitions) in 126 ms.
[2026-05-22 22:53:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:53:04] [INFO ] [Nat]Absence check using 27 positive place invariants in 25 ms returned sat
[2026-05-22 22:53:04] [INFO ] [Nat]Absence check using 27 positive and 55 generalized place invariants in 34 ms returned sat
[2026-05-22 22:53:05] [INFO ] [Nat]Absence check using state equation in 672 ms returned sat
[2026-05-22 22:53:05] [INFO ] Computed and/alt/rep : 482/2148/482 causal constraints (skipped 1386 transitions) in 125 ms.
[2026-05-22 22:53:06] [INFO ] Added : 33 causal constraints over 7 iterations in 1086 ms. Result :sat
Minimization took 833 ms.
[2026-05-22 22:53:07] [INFO ] [Real]Absence check using 27 positive place invariants in 13 ms returned sat
[2026-05-22 22:53:07] [INFO ] [Real]Absence check using 27 positive and 55 generalized place invariants in 33 ms returned sat
[2026-05-22 22:53:08] [INFO ] [Real]Absence check using state equation in 677 ms returned sat
[2026-05-22 22:53:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:53:08] [INFO ] [Nat]Absence check using 27 positive place invariants in 11 ms returned sat
[2026-05-22 22:53:08] [INFO ] [Nat]Absence check using 27 positive and 55 generalized place invariants in 15 ms returned sat
[2026-05-22 22:53:09] [INFO ] [Nat]Absence check using state equation in 629 ms returned sat
[2026-05-22 22:53:09] [INFO ] Computed and/alt/rep : 482/2148/482 causal constraints (skipped 1386 transitions) in 124 ms.
[2026-05-22 22:53:13] [INFO ] Added : 168 causal constraints over 34 iterations in 4392 ms. Result :sat
Minimization took 978 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA ASLink-PT-10b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1917/1917 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 790 transition count 1916
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 789 transition count 1916
Applied a total of 2 rules in 36 ms. Remains 789 /790 variables (removed 1) and now considering 1916/1917 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 789/790 places, 1916/1917 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17374477630898836972.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3668606917385913291.kers'
[2026-05-22 22:53:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17374477630898836972.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3668606917385913291.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1916 rows 788 cols 7796 entries
Finished phase 1 with 194 SingleSign rule and 513 generalized
[2026-05-22 22:53:18] [INFO ] Computed 82 invariants in 18 ms
Computed 82 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-3668606917385913291.kers
Total runtime 22 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (15738 resets) in 2662 ms. (375 steps per ms)
BEST_FIRST walk for 4000003 steps (8147 resets) in 3410 ms. (1172 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 22:53:24] [INFO ] Invariant cache hit.
[2026-05-22 22:53:24] [INFO ] [Real]Absence check using 27 positive place invariants in 20 ms returned sat
[2026-05-22 22:53:24] [INFO ] [Real]Absence check using 27 positive and 55 generalized place invariants in 22 ms returned sat
[2026-05-22 22:53:24] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2026-05-22 22:53:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:53:25] [INFO ] [Nat]Absence check using 27 positive place invariants in 17 ms returned sat
[2026-05-22 22:53:25] [INFO ] [Nat]Absence check using 27 positive and 55 generalized place invariants in 21 ms returned sat
[2026-05-22 22:53:25] [INFO ] [Nat]Absence check using state equation in 727 ms returned sat
[2026-05-22 22:53:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 335 ms
[2026-05-22 22:53:26] [INFO ] Computed and/alt/rep : 473/2068/473 causal constraints (skipped 1394 transitions) in 110 ms.
[2026-05-22 22:53:30] [INFO ] Added : 143 causal constraints over 29 iterations in 4141 ms. Result :sat
Minimization took 1059 ms.
[2026-05-22 22:53:31] [INFO ] [Real]Absence check using 27 positive place invariants in 15 ms returned sat
[2026-05-22 22:53:31] [INFO ] [Real]Absence check using 27 positive and 55 generalized place invariants in 19 ms returned sat
[2026-05-22 22:53:32] [INFO ] [Real]Absence check using state equation in 715 ms returned sat
[2026-05-22 22:53:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:53:32] [INFO ] [Nat]Absence check using 27 positive place invariants in 11 ms returned sat
[2026-05-22 22:53:32] [INFO ] [Nat]Absence check using 27 positive and 55 generalized place invariants in 30 ms returned sat
[2026-05-22 22:53:35] [INFO ] [Nat]Absence check using state equation in 2778 ms returned sat
[2026-05-22 22:53:35] [INFO ] Computed and/alt/rep : 473/2068/473 causal constraints (skipped 1394 transitions) in 150 ms.
[2026-05-22 22:53:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
[2026-05-22 22:53:38] [INFO ] Added : 81 causal constraints over 17 iterations in 2996 ms. Result :sat
Minimization took 1349 ms.
[2026-05-22 22:53:40] [INFO ] [Real]Absence check using 27 positive place invariants in 12 ms returned sat
[2026-05-22 22:53:40] [INFO ] [Real]Absence check using 27 positive and 55 generalized place invariants in 12 ms returned sat
[2026-05-22 22:53:40] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2026-05-22 22:53:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:53:41] [INFO ] [Nat]Absence check using 27 positive place invariants in 11 ms returned sat
[2026-05-22 22:53:41] [INFO ] [Nat]Absence check using 27 positive and 55 generalized place invariants in 12 ms returned sat
[2026-05-22 22:53:41] [INFO ] [Nat]Absence check using state equation in 682 ms returned sat
[2026-05-22 22:53:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2026-05-22 22:53:42] [INFO ] Computed and/alt/rep : 473/2068/473 causal constraints (skipped 1394 transitions) in 133 ms.
[2026-05-22 22:53:43] [INFO ] Added : 31 causal constraints over 7 iterations in 1131 ms. Result :sat
Minimization took 908 ms.
[2026-05-22 22:53:44] [INFO ] [Real]Absence check using 27 positive place invariants in 10 ms returned sat
[2026-05-22 22:53:44] [INFO ] [Real]Absence check using 27 positive and 55 generalized place invariants in 12 ms returned sat
[2026-05-22 22:53:44] [INFO ] [Real]Absence check using state equation in 613 ms returned sat
[2026-05-22 22:53:45] [INFO ] Computed and/alt/rep : 473/2068/473 causal constraints (skipped 1394 transitions) in 85 ms.
[2026-05-22 22:53:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:53:45] [INFO ] [Nat]Absence check using 27 positive place invariants in 12 ms returned sat
[2026-05-22 22:53:45] [INFO ] [Nat]Absence check using 27 positive and 55 generalized place invariants in 15 ms returned sat
[2026-05-22 22:53:45] [INFO ] [Nat]Absence check using state equation in 607 ms returned sat
[2026-05-22 22:53:46] [INFO ] Computed and/alt/rep : 473/2068/473 causal constraints (skipped 1394 transitions) in 134 ms.
[2026-05-22 22:53:46] [INFO ] Added : 30 causal constraints over 6 iterations in 879 ms. Result :sat
Minimization took 964 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 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 1916/1916 transitions.
Applied a total of 0 rules in 27 ms. Remains 789 /789 variables (removed 0) and now considering 1916/1916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 789/789 places, 1916/1916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 1916/1916 transitions.
Applied a total of 0 rules in 67 ms. Remains 789 /789 variables (removed 0) and now considering 1916/1916 (removed 0) transitions.
[2026-05-22 22:53:53] [INFO ] Invariant cache hit.
[2026-05-22 22:53:54] [INFO ] Implicit Places using invariants in 867 ms returned []
[2026-05-22 22:53:54] [INFO ] Invariant cache hit.
[2026-05-22 22:53:56] [INFO ] Implicit Places using invariants and state equation in 2041 ms returned []
Implicit Place search using SMT with State Equation took 2934 ms to find 0 implicit places.
[2026-05-22 22:53:56] [INFO ] Redundant transitions in 151 ms returned []
Running 1867 sub problems to find dead transitions.
[2026-05-22 22:53:56] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/788 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1867 unsolved
SMT process timed out in 30882ms, After SMT, problems are : Problem set: 0 solved, 1867 unsolved
Search for dead transitions found 0 dead transitions in 30906ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34102 ms. Remains : 789/789 places, 1916/1916 transitions.
RANDOM walk for 40000 steps (611 resets) in 994 ms. (40 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (76 resets) in 177 ms. (224 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (79 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (79 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (78 resets) in 178 ms. (223 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (77 resets) in 154 ms. (258 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (79 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (80 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (80 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
[2026-05-22 22:54:27] [INFO ] Flatten gal took : 289 ms
[2026-05-22 22:54:28] [INFO ] Flatten gal took : 88 ms
[2026-05-22 22:54:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2052620958651234048.gal : 59 ms
[2026-05-22 22:54:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality637700793141201610.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2052620958651234048.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality637700793141201610.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 ...327
Loading property file /tmp/ReachabilityCardinality637700793141201610.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :12 after 24
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :24 after 36
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :36 after 122
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :122 after 48896
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :48896 after 6.07068e+09
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :6.07068e+09 after 9.55919e+09
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :9.55919e+09 after 9.56593e+09
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
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 1025 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,9.56593e+09,1.30541,31376,2,17182,19,47079,6,0,5076,16491,0
Total reachable state count : 9565932608

Verifying 8 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.31083,31376,2,790,19,47079,7,0,5079,16491,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.31445,31376,2,790,19,47079,8,0,5080,16491,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,1,1.31834,31376,2,790,19,47079,9,0,5082,16491,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,1,1.3219,31376,2,790,19,47079,10,0,5083,16491,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,6,1.32587,31376,2,900,19,47079,11,0,5085,16491,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,6,1.32954,31376,2,900,19,47079,12,0,5086,16491,0
Reachability property MAX3 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
MAX3,122,1.33296,31376,2,1455,19,47079,13,0,5088,16491,0
Invariant property MIN3 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
MIN3,122,1.33615,31376,2,1455,19,47079,14,0,5089,16491,0
Interrupted probabilistic random walk after 147880 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 8
Probabilistic random walk after 147880 steps, saw 69511 distinct states, run finished after 3005 ms. (steps per millisecond=49 ) properties seen :0
FORMULA ASLink-PT-10b-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-10b-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-10b-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-10b-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-22 22:54:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (15764 resets) in 2707 ms. (369 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 781589 ms.

BK_STOP 1779490473782

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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-10b"
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-10b, 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-177944366300437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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