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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.0K Mar 5 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 5 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 5 14:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 5 14:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 5 14:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Mar 5 14:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 5 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 5 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:09 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 921K 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-06b-UpperBounds-00
FORMULA_NAME ASLink-PT-06b-UpperBounds-01
FORMULA_NAME ASLink-PT-06b-UpperBounds-02
FORMULA_NAME ASLink-PT-06b-UpperBounds-03
FORMULA_NAME ASLink-PT-06b-UpperBounds-04
FORMULA_NAME ASLink-PT-06b-UpperBounds-05
FORMULA_NAME ASLink-PT-06b-UpperBounds-06
FORMULA_NAME ASLink-PT-06b-UpperBounds-07
FORMULA_NAME ASLink-PT-06b-UpperBounds-08
FORMULA_NAME ASLink-PT-06b-UpperBounds-09
FORMULA_NAME ASLink-PT-06b-UpperBounds-10
FORMULA_NAME ASLink-PT-06b-UpperBounds-11
FORMULA_NAME ASLink-PT-06b-UpperBounds-12
FORMULA_NAME ASLink-PT-06b-UpperBounds-13
FORMULA_NAME ASLink-PT-06b-UpperBounds-14
FORMULA_NAME ASLink-PT-06b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779479592010

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-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-22 19:53:13] [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 19:53:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 19:53:13] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2026-05-22 19:53:13] [INFO ] Transformed 2826 places.
[2026-05-22 19:53:13] [INFO ] Transformed 3513 transitions.
[2026-05-22 19:53:13] [INFO ] Found NUPN structural information;
[2026-05-22 19:53:13] [INFO ] Parsed PT model containing 2826 places and 3513 transitions and 10709 arcs in 336 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-2047890098404501968.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15228524709955377119.kers'
[2026-05-22 19:53:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2047890098404501968.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15228524709955377119.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3513 rows 2826 cols 10709 entries
Finished phase 1 with 1910 SingleSign rule and 639 generalized
[2026-05-22 19:53:14] [INFO ] Computed 277 invariants in 29 ms
Computed 277 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-15228524709955377119.kers
Total runtime 33 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 (17 resets) in 86 ms. (114 steps per ms)
FORMULA ASLink-PT-06b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80006 steps (16 resets) in 140 ms. (567 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 19:53:14] [INFO ] Invariant cache hit.
[2026-05-22 19:53:15] [INFO ] [Real]Absence check using 61 positive place invariants in 91 ms returned sat
[2026-05-22 19:53:15] [INFO ] [Real]Absence check using 61 positive and 216 generalized place invariants in 181 ms returned sat
[2026-05-22 19:53:17] [INFO ] [Real]Absence check using state equation in 2416 ms returned sat
[2026-05-22 19:53:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:53:18] [INFO ] [Nat]Absence check using 61 positive place invariants in 68 ms returned sat
[2026-05-22 19:53:18] [INFO ] [Nat]Absence check using 61 positive and 216 generalized place invariants in 179 ms returned sat
[2026-05-22 19:53:21] [INFO ] [Nat]Absence check using state equation in 2613 ms returned sat
[2026-05-22 19:53:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-22 19:53:24] [INFO ] [Real]Absence check using 61 positive place invariants in 65 ms returned sat
[2026-05-22 19:53:24] [INFO ] [Real]Absence check using 61 positive and 216 generalized place invariants in 143 ms returned sat
[2026-05-22 19:53:26] [INFO ] [Real]Absence check using state equation in 2031 ms returned sat
[2026-05-22 19:53:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:53:27] [INFO ] [Nat]Absence check using 61 positive place invariants in 129 ms returned sat
[2026-05-22 19:53:27] [INFO ] [Nat]Absence check using 61 positive and 216 generalized place invariants in 141 ms returned sat
[2026-05-22 19:53:29] [INFO ] [Nat]Absence check using state equation in 1956 ms returned sat
[2026-05-22 19:53: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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 19:53:33] [INFO ] [Real]Absence check using 61 positive place invariants in 68 ms returned sat
[2026-05-22 19:53:33] [INFO ] [Real]Absence check using 61 positive and 216 generalized place invariants in 245 ms returned sat
[2026-05-22 19:53:35] [INFO ] [Real]Absence check using state equation in 1574 ms returned sat
[2026-05-22 19:53:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:53:38] [INFO ] [Nat]Absence check using 61 positive place invariants in 72 ms returned sat
[2026-05-22 19:53:38] [INFO ] [Nat]Absence check using 61 positive and 216 generalized place invariants in 304 ms returned sat
[2026-05-22 19:53:40] [INFO ] [Nat]Absence check using state equation in 1771 ms returned sat
[2026-05-22 19:53:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1598 ms
[2026-05-22 19:53:42] [INFO ] Computed and/alt/rep : 2957/6472/2957 causal constraints (skipped 555 transitions) in 194 ms.
[2026-05-22 19:53:42] [INFO ] Added : 10 causal constraints over 2 iterations in 653 ms. Result :unknown
[2026-05-22 19:53:43] [INFO ] [Real]Absence check using 61 positive place invariants in 64 ms returned sat
[2026-05-22 19:53:43] [INFO ] [Real]Absence check using 61 positive and 216 generalized place invariants in 158 ms returned sat
[2026-05-22 19:53:45] [INFO ] [Real]Absence check using state equation in 1961 ms returned sat
[2026-05-22 19:53:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:53:45] [INFO ] [Nat]Absence check using 61 positive place invariants in 90 ms returned sat
[2026-05-22 19:53:46] [INFO ] [Nat]Absence check using 61 positive and 216 generalized place invariants in 159 ms returned sat
[2026-05-22 19:53:47] [INFO ] [Nat]Absence check using state equation in 1523 ms returned sat
[2026-05-22 19:53:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 19:53:51] [INFO ] [Real]Absence check using 61 positive place invariants in 79 ms returned sat
[2026-05-22 19:53:51] [INFO ] [Real]Absence check using 61 positive and 216 generalized place invariants in 155 ms returned sat
[2026-05-22 19:53:53] [INFO ] [Real]Absence check using state equation in 1672 ms returned sat
[2026-05-22 19:53:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:53:54] [INFO ] [Nat]Absence check using 61 positive place invariants in 72 ms returned sat
[2026-05-22 19:53:54] [INFO ] [Nat]Absence check using 61 positive and 216 generalized place invariants in 160 ms returned sat
[2026-05-22 19:53:56] [INFO ] [Nat]Absence check using state equation in 2255 ms returned sat
[2026-05-22 19:53: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 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 19:54:00] [INFO ] [Real]Absence check using 61 positive place invariants in 66 ms returned sat
[2026-05-22 19:54:00] [INFO ] [Real]Absence check using 61 positive and 216 generalized place invariants in 247 ms returned sat
[2026-05-22 19:54:01] [INFO ] [Real]Absence check using state equation in 1666 ms returned sat
[2026-05-22 19:54:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:54:02] [INFO ] [Nat]Absence check using 61 positive place invariants in 66 ms returned sat
[2026-05-22 19:54:02] [INFO ] [Nat]Absence check using 61 positive and 216 generalized place invariants in 168 ms returned sat
[2026-05-22 19:54:04] [INFO ] [Nat]Absence check using state equation in 1198 ms returned sat
[2026-05-22 19:54:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 19:54:08] [INFO ] [Real]Absence check using 61 positive place invariants in 70 ms returned sat
[2026-05-22 19:54:08] [INFO ] [Real]Absence check using 61 positive and 216 generalized place invariants in 136 ms returned sat
[2026-05-22 19:54:10] [INFO ] [Real]Absence check using state equation in 2512 ms returned sat
[2026-05-22 19:54:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:54:11] [INFO ] [Nat]Absence check using 61 positive place invariants in 80 ms returned sat
[2026-05-22 19:54:11] [INFO ] [Nat]Absence check using 61 positive and 216 generalized place invariants in 188 ms returned sat
[2026-05-22 19:54:14] [INFO ] [Nat]Absence check using state equation in 3225 ms returned sat
[2026-05-22 19:54:16] [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 19:54:16] [INFO ] [Real]Absence check using 61 positive place invariants in 67 ms returned sat
[2026-05-22 19:54:16] [INFO ] [Real]Absence check using 61 positive and 216 generalized place invariants in 130 ms returned sat
[2026-05-22 19:54:18] [INFO ] [Real]Absence check using state equation in 1587 ms returned sat
[2026-05-22 19:54:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:54:18] [INFO ] [Nat]Absence check using 61 positive place invariants in 70 ms returned sat
[2026-05-22 19:54:19] [INFO ] [Nat]Absence check using 61 positive and 216 generalized place invariants in 151 ms returned sat
[2026-05-22 19:54:21] [INFO ] [Nat]Absence check using state equation in 2082 ms returned sat
[2026-05-22 19:54:23] [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)
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]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-06b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
Support contains 7 out of 2826 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2826/2826 places, 3513/3513 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 651 transitions
Trivial Post-agglo rules discarded 651 transitions
Performed 651 trivial Post agglomeration. Transition count delta: 651
Iterating post reduction 0 with 651 rules applied. Total rules applied 651 place count 2826 transition count 2862
Reduce places removed 651 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 681 rules applied. Total rules applied 1332 place count 2175 transition count 2832
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 11 rules applied. Total rules applied 1343 place count 2167 transition count 2829
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1346 place count 2164 transition count 2829
Performed 653 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 653 Pre rules applied. Total rules applied 1346 place count 2164 transition count 2176
Deduced a syphon composed of 653 places in 6 ms
Ensure Unique test removed 63 places
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 4 with 1369 rules applied. Total rules applied 2715 place count 1448 transition count 2176
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 4 with 45 rules applied. Total rules applied 2760 place count 1442 transition count 2137
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 5 with 39 rules applied. Total rules applied 2799 place count 1403 transition count 2137
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2799 place count 1403 transition count 2113
Deduced a syphon composed of 24 places in 12 ms
Ensure Unique test removed 24 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 2871 place count 1355 transition count 2113
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2871 place count 1355 transition count 2089
Deduced a syphon composed of 24 places in 11 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2919 place count 1331 transition count 2089
Discarding 89 places :
Symmetric choice reduction at 6 with 89 rule applications. Total rules 3008 place count 1242 transition count 2000
Iterating global reduction 6 with 89 rules applied. Total rules applied 3097 place count 1242 transition count 2000
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3098 place count 1242 transition count 1999
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 29 Pre rules applied. Total rules applied 3098 place count 1242 transition count 1970
Deduced a syphon composed of 29 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 59 rules applied. Total rules applied 3157 place count 1212 transition count 1970
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3157 place count 1212 transition count 1969
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 3160 place count 1210 transition count 1969
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 3167 place count 1203 transition count 1924
Iterating global reduction 7 with 7 rules applied. Total rules applied 3174 place count 1203 transition count 1924
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 3174 place count 1203 transition count 1918
Deduced a syphon composed of 6 places in 9 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 3186 place count 1197 transition count 1918
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3187 place count 1196 transition count 1910
Iterating global reduction 7 with 1 rules applied. Total rules applied 3188 place count 1196 transition count 1910
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3189 place count 1195 transition count 1902
Iterating global reduction 7 with 1 rules applied. Total rules applied 3190 place count 1195 transition count 1902
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3191 place count 1194 transition count 1894
Iterating global reduction 7 with 1 rules applied. Total rules applied 3192 place count 1194 transition count 1894
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3193 place count 1193 transition count 1886
Iterating global reduction 7 with 1 rules applied. Total rules applied 3194 place count 1193 transition count 1886
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3195 place count 1192 transition count 1878
Iterating global reduction 7 with 1 rules applied. Total rules applied 3196 place count 1192 transition count 1878
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3197 place count 1191 transition count 1870
Iterating global reduction 7 with 1 rules applied. Total rules applied 3198 place count 1191 transition count 1870
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3199 place count 1190 transition count 1862
Iterating global reduction 7 with 1 rules applied. Total rules applied 3200 place count 1190 transition count 1862
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3201 place count 1189 transition count 1854
Iterating global reduction 7 with 1 rules applied. Total rules applied 3202 place count 1189 transition count 1854
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3203 place count 1188 transition count 1846
Iterating global reduction 7 with 1 rules applied. Total rules applied 3204 place count 1188 transition count 1846
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3205 place count 1187 transition count 1838
Iterating global reduction 7 with 1 rules applied. Total rules applied 3206 place count 1187 transition count 1838
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3207 place count 1186 transition count 1830
Iterating global reduction 7 with 1 rules applied. Total rules applied 3208 place count 1186 transition count 1830
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3209 place count 1185 transition count 1822
Iterating global reduction 7 with 1 rules applied. Total rules applied 3210 place count 1185 transition count 1822
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3211 place count 1184 transition count 1814
Iterating global reduction 7 with 1 rules applied. Total rules applied 3212 place count 1184 transition count 1814
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3213 place count 1183 transition count 1806
Iterating global reduction 7 with 1 rules applied. Total rules applied 3214 place count 1183 transition count 1806
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3215 place count 1182 transition count 1798
Iterating global reduction 7 with 1 rules applied. Total rules applied 3216 place count 1182 transition count 1798
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3217 place count 1181 transition count 1790
Iterating global reduction 7 with 1 rules applied. Total rules applied 3218 place count 1181 transition count 1790
Performed 163 Post agglomeration using F-continuation condition.Transition count delta: 163
Deduced a syphon composed of 163 places in 3 ms
Reduce places removed 163 places and 0 transitions.
Iterating global reduction 7 with 326 rules applied. Total rules applied 3544 place count 1018 transition count 1627
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3545 place count 1017 transition count 1626
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 3547 place count 1016 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3548 place count 1015 transition count 1625
Iterating global reduction 7 with 1 rules applied. Total rules applied 3549 place count 1015 transition count 1625
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 3551 place count 1015 transition count 1623
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3552 place count 1014 transition count 1623
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3554 place count 1013 transition count 1632
Free-agglomeration rule applied 7 times.
Iterating global reduction 9 with 7 rules applied. Total rules applied 3561 place count 1013 transition count 1625
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 3568 place count 1006 transition count 1625
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 3574 place count 1006 transition count 1619
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3580 place count 1000 transition count 1619
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 3581 place count 999 transition count 1618
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 11 with 16 rules applied. Total rules applied 3597 place count 988 transition count 1613
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 3602 place count 983 transition count 1613
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 16 Pre rules applied. Total rules applied 3602 place count 983 transition count 1597
Deduced a syphon composed of 16 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 13 with 33 rules applied. Total rules applied 3635 place count 966 transition count 1597
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 13 with 7 rules applied. Total rules applied 3642 place count 959 transition count 1597
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 3642 place count 959 transition count 1596
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 3644 place count 958 transition count 1596
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 14 with 26 rules applied. Total rules applied 3670 place count 945 transition count 1583
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 3676 place count 939 transition count 1577
Iterating global reduction 14 with 6 rules applied. Total rules applied 3682 place count 939 transition count 1577
Free-agglomeration rule applied 6 times.
Iterating global reduction 14 with 6 rules applied. Total rules applied 3688 place count 939 transition count 1571
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3694 place count 933 transition count 1571
Applied a total of 3694 rules in 1950 ms. Remains 933 /2826 variables (removed 1893) and now considering 1571/3513 (removed 1942) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1958 ms. Remains : 933/2826 places, 1571/3513 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5666503667590779404.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9186265462994162594.kers'
[2026-05-22 19:54:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5666503667590779404.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9186265462994162594.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 1 ms.
// Phase 1: matrix 1571 rows 918 cols 6148 entries
Finished phase 1 with 271 SingleSign rule and 500 generalized
[2026-05-22 19:54:26] [INFO ] Computed 162 invariants in 12 ms
Computed 162 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-9186265462994162594.kers
Total runtime 14 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 (11111 resets) in 3111 ms. (321 steps per ms)
FORMULA ASLink-PT-06b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000004 steps (7282 resets) in 5436 ms. (735 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 19:54:34] [INFO ] Invariant cache hit.
[2026-05-22 19:54:34] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2026-05-22 19:54:34] [INFO ] [Real]Absence check using 63 positive and 99 generalized place invariants in 25 ms returned sat
[2026-05-22 19:54:35] [INFO ] [Real]Absence check using state equation in 522 ms returned sat
[2026-05-22 19:54:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:54:35] [INFO ] [Nat]Absence check using 63 positive place invariants in 42 ms returned sat
[2026-05-22 19:54:35] [INFO ] [Nat]Absence check using 63 positive and 99 generalized place invariants in 46 ms returned sat
[2026-05-22 19:54:36] [INFO ] [Nat]Absence check using state equation in 661 ms returned sat
[2026-05-22 19:54:36] [INFO ] Computed and/alt/rep : 637/2499/637 causal constraints (skipped 901 transitions) in 107 ms.
[2026-05-22 19:54:46] [INFO ] Added : 274 causal constraints over 55 iterations in 9980 ms. Result :sat
Minimization took 795 ms.
[2026-05-22 19:54:47] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2026-05-22 19:54:47] [INFO ] [Real]Absence check using 63 positive and 99 generalized place invariants in 21 ms returned sat
[2026-05-22 19:54:47] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2026-05-22 19:54:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:54:48] [INFO ] [Nat]Absence check using 63 positive place invariants in 30 ms returned sat
[2026-05-22 19:54:48] [INFO ] [Nat]Absence check using 63 positive and 99 generalized place invariants in 35 ms returned sat
[2026-05-22 19:54:48] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2026-05-22 19:54:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 437 ms
[2026-05-22 19:54:49] [INFO ] Computed and/alt/rep : 637/2499/637 causal constraints (skipped 901 transitions) in 106 ms.
[2026-05-22 19:54:59] [INFO ] Added : 485 causal constraints over 97 iterations in 10416 ms. Result :sat
Minimization took 981 ms.
[2026-05-22 19:55:00] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2026-05-22 19:55:00] [INFO ] [Real]Absence check using 63 positive and 99 generalized place invariants in 27 ms returned sat
[2026-05-22 19:55:01] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2026-05-22 19:55:01] [INFO ] Computed and/alt/rep : 637/2499/637 causal constraints (skipped 901 transitions) in 104 ms.
[2026-05-22 19:55:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:55:01] [INFO ] [Nat]Absence check using 63 positive place invariants in 15 ms returned sat
[2026-05-22 19:55:01] [INFO ] [Nat]Absence check using 63 positive and 99 generalized place invariants in 21 ms returned sat
[2026-05-22 19:55:02] [INFO ] [Nat]Absence check using state equation in 471 ms returned sat
[2026-05-22 19:55:02] [INFO ] Computed and/alt/rep : 637/2499/637 causal constraints (skipped 901 transitions) in 86 ms.
[2026-05-22 19:55:15] [INFO ] Added : 540 causal constraints over 108 iterations in 13298 ms. Result :sat
Minimization took 1312 ms.
[2026-05-22 19:55:17] [INFO ] [Real]Absence check using 63 positive place invariants in 46 ms returned sat
[2026-05-22 19:55:17] [INFO ] [Real]Absence check using 63 positive and 99 generalized place invariants in 47 ms returned sat
[2026-05-22 19:55:18] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2026-05-22 19:55:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:55:18] [INFO ] [Nat]Absence check using 63 positive place invariants in 74 ms returned sat
[2026-05-22 19:55:18] [INFO ] [Nat]Absence check using 63 positive and 99 generalized place invariants in 23 ms returned sat
[2026-05-22 19:55:19] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2026-05-22 19:55:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 647 ms
[2026-05-22 19:55:19] [INFO ] Computed and/alt/rep : 637/2499/637 causal constraints (skipped 901 transitions) in 102 ms.
[2026-05-22 19:55:29] [INFO ] Added : 449 causal constraints over 90 iterations in 10322 ms. Result :sat
Minimization took 975 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 933 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 933/933 places, 1571/1571 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 933 transition count 1570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 932 transition count 1570
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 932 transition count 1569
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 931 transition count 1569
Applied a total of 4 rules in 42 ms. Remains 931 /933 variables (removed 2) and now considering 1569/1571 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 931/933 places, 1569/1571 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-773455439286781530.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3165122411100725125.kers'
[2026-05-22 19:55:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-773455439286781530.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3165122411100725125.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 1 ms.
// Phase 1: matrix 1569 rows 916 cols 6144 entries
Finished phase 1 with 269 SingleSign rule and 500 generalized
[2026-05-22 19:55:34] [INFO ] Computed 162 invariants in 12 ms
Computed 162 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-3165122411100725125.kers
Total runtime 16 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 (11203 resets) in 2995 ms. (333 steps per ms)
BEST_FIRST walk for 4000004 steps (7293 resets) in 5416 ms. (738 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 19:55:42] [INFO ] Invariant cache hit.
[2026-05-22 19:55:42] [INFO ] [Real]Absence check using 63 positive place invariants in 35 ms returned sat
[2026-05-22 19:55:42] [INFO ] [Real]Absence check using 63 positive and 99 generalized place invariants in 34 ms returned sat
[2026-05-22 19:55:43] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2026-05-22 19:55:43] [INFO ] Computed and/alt/rep : 627/2418/627 causal constraints (skipped 909 transitions) in 86 ms.
[2026-05-22 19:55:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:55:44] [INFO ] [Nat]Absence check using 63 positive place invariants in 45 ms returned sat
[2026-05-22 19:55:44] [INFO ] [Nat]Absence check using 63 positive and 99 generalized place invariants in 48 ms returned sat
[2026-05-22 19:55:44] [INFO ] [Nat]Absence check using state equation in 611 ms returned sat
[2026-05-22 19:55:44] [INFO ] Computed and/alt/rep : 627/2418/627 causal constraints (skipped 909 transitions) in 83 ms.
[2026-05-22 19:55:57] [INFO ] Added : 536 causal constraints over 108 iterations in 12746 ms. Result :sat
Minimization took 949 ms.
[2026-05-22 19:55:58] [INFO ] [Real]Absence check using 63 positive place invariants in 23 ms returned sat
[2026-05-22 19:55:58] [INFO ] [Real]Absence check using 63 positive and 99 generalized place invariants in 46 ms returned sat
[2026-05-22 19:55:59] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2026-05-22 19:56:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:56:00] [INFO ] [Nat]Absence check using 63 positive place invariants in 18 ms returned sat
[2026-05-22 19:56:00] [INFO ] [Nat]Absence check using 63 positive and 99 generalized place invariants in 29 ms returned sat
[2026-05-22 19:56:00] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2026-05-22 19:56:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 406 ms
[2026-05-22 19:56:01] [INFO ] Computed and/alt/rep : 627/2418/627 causal constraints (skipped 909 transitions) in 79 ms.
[2026-05-22 19:56:12] [INFO ] Added : 418 causal constraints over 84 iterations in 10841 ms. Result :sat
Minimization took 807 ms.
[2026-05-22 19:56:13] [INFO ] [Real]Absence check using 63 positive place invariants in 27 ms returned sat
[2026-05-22 19:56:13] [INFO ] [Real]Absence check using 63 positive and 99 generalized place invariants in 19 ms returned sat
[2026-05-22 19:56:13] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2026-05-22 19:56:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:56:13] [INFO ] [Nat]Absence check using 63 positive place invariants in 16 ms returned sat
[2026-05-22 19:56:13] [INFO ] [Nat]Absence check using 63 positive and 99 generalized place invariants in 35 ms returned sat
[2026-05-22 19:56:14] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2026-05-22 19:56:14] [INFO ] Computed and/alt/rep : 627/2418/627 causal constraints (skipped 909 transitions) in 93 ms.
[2026-05-22 19:56:19] [INFO ] Added : 153 causal constraints over 31 iterations in 4692 ms. Result :sat
Minimization took 900 ms.
[2026-05-22 19:56:20] [INFO ] [Real]Absence check using 63 positive place invariants in 34 ms returned sat
[2026-05-22 19:56:20] [INFO ] [Real]Absence check using 63 positive and 99 generalized place invariants in 43 ms returned sat
[2026-05-22 19:56:21] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2026-05-22 19:56:21] [INFO ] Computed and/alt/rep : 627/2418/627 causal constraints (skipped 909 transitions) in 67 ms.
[2026-05-22 19:56:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:56:21] [INFO ] [Nat]Absence check using 63 positive place invariants in 14 ms returned sat
[2026-05-22 19:56:21] [INFO ] [Nat]Absence check using 63 positive and 99 generalized place invariants in 48 ms returned sat
[2026-05-22 19:56:22] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2026-05-22 19:56:22] [INFO ] Computed and/alt/rep : 627/2418/627 causal constraints (skipped 909 transitions) in 63 ms.
[2026-05-22 19:56:32] [INFO ] Added : 408 causal constraints over 82 iterations in 10059 ms. Result :sat
Minimization took 1092 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 931 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 931/931 places, 1569/1569 transitions.
Applied a total of 0 rules in 28 ms. Remains 931 /931 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 931/931 places, 1569/1569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 931/931 places, 1569/1569 transitions.
Applied a total of 0 rules in 26 ms. Remains 931 /931 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2026-05-22 19:56:35] [INFO ] Invariant cache hit.
[2026-05-22 19:56:36] [INFO ] Implicit Places using invariants in 883 ms returned [1, 18, 19, 31, 50, 68, 138, 142, 151, 152, 154, 171, 189, 258, 262, 263, 274, 275, 277, 294, 312, 381, 385, 386, 397, 398, 400, 417, 435, 510, 525, 526, 528, 545, 563, 634, 638, 639, 650, 651, 653, 670, 688, 757, 761, 762, 765, 776, 777, 778, 796, 798, 802, 820, 821, 822, 823, 835, 841, 847, 853, 859, 865, 871, 877, 883, 889, 895]
[2026-05-22 19:56:36] [INFO ] Actually due to overlaps returned [796, 778, 50, 171, 294, 417, 545, 670, 802, 31, 154, 277, 400, 528, 653, 151, 274, 397, 525, 650, 776, 820, 152, 275, 398, 526, 651, 777, 798, 821, 1, 18, 262, 263, 385, 386, 510, 638, 639, 761, 762, 68, 189, 312, 435, 563, 688, 822, 865, 883, 895, 19, 765, 823, 835, 841, 847, 853, 859, 871, 877, 889]
Discarding 62 places :
Implicit Place search using SMT only with invariants took 890 ms to find 62 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 869/931 places, 1569/1569 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 864 transition count 1446
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 130 rules applied. Total rules applied 258 place count 741 transition count 1439
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 260 place count 739 transition count 1439
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 260 place count 739 transition count 1408
Deduced a syphon composed of 31 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 323 place count 707 transition count 1408
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 335 place count 703 transition count 1400
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 343 place count 695 transition count 1400
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 358 place count 680 transition count 1385
Iterating global reduction 5 with 15 rules applied. Total rules applied 373 place count 680 transition count 1385
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 376 place count 680 transition count 1382
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 376 place count 680 transition count 1381
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 378 place count 679 transition count 1381
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 381 place count 676 transition count 1375
Iterating global reduction 6 with 3 rules applied. Total rules applied 384 place count 676 transition count 1375
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 385 place count 675 transition count 1374
Iterating global reduction 6 with 1 rules applied. Total rules applied 386 place count 675 transition count 1374
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 387 place count 674 transition count 1372
Iterating global reduction 6 with 1 rules applied. Total rules applied 388 place count 674 transition count 1372
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 6 with 94 rules applied. Total rules applied 482 place count 627 transition count 1325
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 487 place count 622 transition count 1320
Iterating global reduction 6 with 5 rules applied. Total rules applied 492 place count 622 transition count 1320
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 497 place count 622 transition count 1315
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 501 place count 620 transition count 1316
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 7 with 15 rules applied. Total rules applied 516 place count 620 transition count 1301
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 532 place count 604 transition count 1301
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 8 with 18 rules applied. Total rules applied 550 place count 604 transition count 1301
Applied a total of 550 rules in 407 ms. Remains 604 /869 variables (removed 265) and now considering 1301/1569 (removed 268) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1897794829462969330.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6481318483621588728.kers'
[2026-05-22 19:56:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1897794829462969330.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6481318483621588728.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 10 ms.
// Phase 1: matrix 1301 rows 602 cols 5340 entries
Finished phase 1 with 209 SingleSign rule and 306 generalized
[2026-05-22 19:56:37] [INFO ] Computed 89 invariants in 37 ms
Computed 89 P flows in 38 ms.
Exported basis to /tmp/petrispot-output-6481318483621588728.kers
Total runtime 39 ms.
[2026-05-22 19:56:37] [INFO ] Implicit Places using invariants in 616 ms returned [74, 92, 98, 101, 103, 104, 107, 108, 160, 177, 183, 186, 188, 193, 194, 246, 263, 269, 272, 274, 279, 280, 349, 355, 358, 360, 363, 370, 371, 425, 443, 449, 452, 454, 459, 460, 512, 529, 535, 538, 540]
[2026-05-22 19:56:37] [INFO ] Actually due to overlaps returned [107, 193, 279, 370, 459, 108, 194, 280, 371, 460, 92, 98, 103, 177, 183, 188, 263, 269, 274, 349, 355, 360, 443, 449, 454, 529, 535, 540, 74, 104, 160, 246, 363, 425, 512]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 631 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 569/931 places, 1301/1569 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 544 transition count 1276
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 544 transition count 1276
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 538 transition count 1270
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 538 transition count 1270
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 84 place count 527 transition count 1259
Free-agglomeration rule applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 102 place count 527 transition count 1241
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 120 place count 509 transition count 1241
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 125 place count 509 transition count 1236
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 130 place count 504 transition count 1236
Applied a total of 130 rules in 148 ms. Remains 504 /569 variables (removed 65) and now considering 1236/1301 (removed 65) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17880472438449467759.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9691972043032814436.kers'
[2026-05-22 19:56:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17880472438449467759.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9691972043032814436.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 1236 rows 503 cols 5053 entries
Finished phase 1 with 126 SingleSign rule and 324 generalized
[2026-05-22 19:56:37] [INFO ] Computed 54 invariants in 27 ms
Computed 54 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-9691972043032814436.kers
Total runtime 29 ms.
[2026-05-22 19:56:38] [INFO ] Implicit Places using invariants in 554 ms returned []
[2026-05-22 19:56:38] [INFO ] Invariant cache hit.
[2026-05-22 19:56:39] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned []
Implicit Place search using SMT with State Equation took 1771 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 504/931 places, 1236/1569 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3879 ms. Remains : 504/931 places, 1236/1569 transitions.
[2026-05-22 19:56:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (17260 resets) in 2167 ms. (461 steps per ms)
BEST_FIRST walk for 4000003 steps (14337 resets) in 3244 ms. (1232 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 19:56:45] [INFO ] Invariant cache hit.
[2026-05-22 19:56:45] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2026-05-22 19:56:45] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 11 ms returned sat
[2026-05-22 19:56:45] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2026-05-22 19:56:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:56:45] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2026-05-22 19:56:45] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 8 ms returned sat
[2026-05-22 19:56:45] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2026-05-22 19:56:46] [INFO ] Computed and/alt/rep : 284/1350/284 causal constraints (skipped 919 transitions) in 50 ms.
[2026-05-22 19:56:46] [INFO ] Added : 16 causal constraints over 4 iterations in 353 ms. Result :sat
Minimization took 476 ms.
[2026-05-22 19:56:46] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2026-05-22 19:56:47] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 20 ms returned sat
[2026-05-22 19:56:47] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2026-05-22 19:56:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:56:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2026-05-22 19:56:47] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 8 ms returned sat
[2026-05-22 19:56:47] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2026-05-22 19:56:47] [INFO ] Computed and/alt/rep : 284/1350/284 causal constraints (skipped 919 transitions) in 67 ms.
[2026-05-22 19:56:48] [INFO ] Added : 5 causal constraints over 2 iterations in 243 ms. Result :sat
Minimization took 547 ms.
[2026-05-22 19:56:48] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2026-05-22 19:56:48] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 37 ms returned sat
[2026-05-22 19:56:49] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2026-05-22 19:56:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:56:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2026-05-22 19:56:49] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 9 ms returned sat
[2026-05-22 19:56:49] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2026-05-22 19:56:49] [INFO ] Computed and/alt/rep : 284/1350/284 causal constraints (skipped 919 transitions) in 128 ms.
[2026-05-22 19:56:50] [INFO ] Added : 40 causal constraints over 8 iterations in 950 ms. Result :sat
Minimization took 592 ms.
[2026-05-22 19:56:51] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2026-05-22 19:56:51] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 9 ms returned sat
[2026-05-22 19:56:51] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2026-05-22 19:56:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:56:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2026-05-22 19:56:52] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 10 ms returned sat
[2026-05-22 19:56:52] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2026-05-22 19:56:52] [INFO ] Computed and/alt/rep : 284/1350/284 causal constraints (skipped 919 transitions) in 141 ms.
[2026-05-22 19:56:53] [INFO ] Added : 28 causal constraints over 6 iterations in 709 ms. Result :sat
Minimization took 540 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA ASLink-PT-06b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-06b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1236/1236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 504 transition count 1235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 503 transition count 1235
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 503 transition count 1234
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 502 transition count 1234
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 500 transition count 1233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 500 transition count 1232
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 500 transition count 1231
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 499 transition count 1231
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 498 transition count 1230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 13 place count 498 transition count 1229
Applied a total of 13 rules in 55 ms. Remains 498 /504 variables (removed 6) and now considering 1229/1236 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 498/504 places, 1229/1236 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-65248445221979636.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9322505182292240430.kers'
[2026-05-22 19:56:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-65248445221979636.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9322505182292240430.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 1229 rows 497 cols 5006 entries
Finished phase 1 with 124 SingleSign rule and 321 generalized
[2026-05-22 19:56:54] [INFO ] Computed 53 invariants in 28 ms
Computed 53 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-9322505182292240430.kers
Total runtime 30 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (17811 resets) in 1931 ms. (517 steps per ms)
BEST_FIRST walk for 2000002 steps (7542 resets) in 1804 ms. (1108 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-22 19:56:58] [INFO ] Invariant cache hit.
[2026-05-22 19:56:58] [INFO ] [Real]Absence check using 17 positive place invariants in 19 ms returned sat
[2026-05-22 19:56:58] [INFO ] [Real]Absence check using 17 positive and 36 generalized place invariants in 10 ms returned sat
[2026-05-22 19:56:59] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2026-05-22 19:56:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:56:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2026-05-22 19:56:59] [INFO ] [Nat]Absence check using 17 positive and 36 generalized place invariants in 11 ms returned sat
[2026-05-22 19:56:59] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2026-05-22 19:56:59] [INFO ] Computed and/alt/rep : 262/1272/262 causal constraints (skipped 934 transitions) in 61 ms.
[2026-05-22 19:57:00] [INFO ] Added : 34 causal constraints over 7 iterations in 882 ms. Result :sat
Minimization took 563 ms.
[2026-05-22 19:57:01] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2026-05-22 19:57:01] [INFO ] [Real]Absence check using 17 positive and 36 generalized place invariants in 9 ms returned sat
[2026-05-22 19:57:01] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2026-05-22 19:57:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:57:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2026-05-22 19:57:01] [INFO ] [Nat]Absence check using 17 positive and 36 generalized place invariants in 20 ms returned sat
[2026-05-22 19:57:02] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2026-05-22 19:57:02] [INFO ] Computed and/alt/rep : 262/1272/262 causal constraints (skipped 934 transitions) in 89 ms.
[2026-05-22 19:57:03] [INFO ] Added : 42 causal constraints over 9 iterations in 1006 ms. Result :sat
Minimization took 483 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 1229/1229 transitions.
Applied a total of 0 rules in 22 ms. Remains 498 /498 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 498/498 places, 1229/1229 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 1229/1229 transitions.
Applied a total of 0 rules in 16 ms. Remains 498 /498 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
[2026-05-22 19:57:04] [INFO ] Invariant cache hit.
[2026-05-22 19:57:04] [INFO ] Implicit Places using invariants in 447 ms returned [278, 295]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 448 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 496/498 places, 1229/1229 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 495 transition count 1228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 495 transition count 1227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 494 transition count 1227
Applied a total of 4 rules in 76 ms. Remains 494 /496 variables (removed 2) and now considering 1227/1229 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7752240107159536275.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16076438766842792978.kers'
[2026-05-22 19:57:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7752240107159536275.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16076438766842792978.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1227 rows 494 cols 5014 entries
Finished phase 1 with 124 SingleSign rule and 319 generalized
[2026-05-22 19:57:04] [INFO ] Computed 51 invariants in 9 ms
Computed 51 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-16076438766842792978.kers
Total runtime 13 ms.
[2026-05-22 19:57:05] [INFO ] Implicit Places using invariants in 388 ms returned []
[2026-05-22 19:57:05] [INFO ] Invariant cache hit.
[2026-05-22 19:57:06] [INFO ] Implicit Places using invariants and state equation in 1050 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 494/498 places, 1227/1229 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1984 ms. Remains : 494/498 places, 1227/1229 transitions.
[2026-05-22 19:57:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (17593 resets) in 2029 ms. (492 steps per ms)
BEST_FIRST walk for 2000002 steps (7558 resets) in 1749 ms. (1142 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-22 19:57:10] [INFO ] Invariant cache hit.
[2026-05-22 19:57:10] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2026-05-22 19:57:10] [INFO ] [Real]Absence check using 16 positive and 35 generalized place invariants in 15 ms returned sat
[2026-05-22 19:57:10] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2026-05-22 19:57:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:57:10] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2026-05-22 19:57:10] [INFO ] [Nat]Absence check using 16 positive and 35 generalized place invariants in 22 ms returned sat
[2026-05-22 19:57:11] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2026-05-22 19:57:11] [INFO ] Computed and/alt/rep : 269/1231/269 causal constraints (skipped 925 transitions) in 95 ms.
[2026-05-22 19:57:12] [INFO ] Added : 38 causal constraints over 8 iterations in 1270 ms. Result :sat
Minimization took 531 ms.
[2026-05-22 19:57:13] [INFO ] [Real]Absence check using 16 positive place invariants in 17 ms returned sat
[2026-05-22 19:57:13] [INFO ] [Real]Absence check using 16 positive and 35 generalized place invariants in 28 ms returned sat
[2026-05-22 19:57:13] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2026-05-22 19:57:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:57:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-22 19:57:13] [INFO ] [Nat]Absence check using 16 positive and 35 generalized place invariants in 9 ms returned sat
[2026-05-22 19:57:14] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2026-05-22 19:57:14] [INFO ] Computed and/alt/rep : 269/1231/269 causal constraints (skipped 925 transitions) in 62 ms.
[2026-05-22 19:57:15] [INFO ] Added : 64 causal constraints over 13 iterations in 1581 ms. Result :sat
Minimization took 483 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 1227/1227 transitions.
Applied a total of 0 rules in 16 ms. Remains 494 /494 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 494/494 places, 1227/1227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 1227/1227 transitions.
Applied a total of 0 rules in 15 ms. Remains 494 /494 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
[2026-05-22 19:57:17] [INFO ] Invariant cache hit.
[2026-05-22 19:57:18] [INFO ] Implicit Places using invariants in 578 ms returned []
[2026-05-22 19:57:18] [INFO ] Invariant cache hit.
[2026-05-22 19:57:19] [INFO ] Implicit Places using invariants and state equation in 1213 ms returned []
Implicit Place search using SMT with State Equation took 1808 ms to find 0 implicit places.
[2026-05-22 19:57:19] [INFO ] Redundant transitions in 112 ms returned []
Running 1194 sub problems to find dead transitions.
[2026-05-22 19:57:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/493 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/493 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 493/1721 variables, and 49 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/494 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/493 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/493 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/1721 variables, and 49 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/494 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60584ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 60607ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62605 ms. Remains : 494/494 places, 1227/1227 transitions.
RANDOM walk for 40000 steps (720 resets) in 1101 ms. (36 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (154 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (143 resets) in 218 ms. (182 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (153 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (143 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
[2026-05-22 19:58:20] [INFO ] Flatten gal took : 239 ms
[2026-05-22 19:58:20] [INFO ] Flatten gal took : 76 ms
[2026-05-22 19:58:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4188248093586184000.gal : 34 ms
[2026-05-22 19:58:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13221633325630555320.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4188248093586184000.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13221633325630555320.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13221633325630555320.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 44
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :44 after 328
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :328 after 2448
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :2448 after 109632
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :109632 after 1.09422e+06
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.09422e+06 after 1.14715e+06
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.14715e+06 after 1.15169e+06
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.15169e+06 after 1.76658e+06
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.76658e+06 after 4.136e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4.136e+07 after 2.95589e+08
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8.6381e+09,1.88742,49136,2,32860,19,106000,6,0,3207,108843,0
Total reachable state count : 8638101191

Verifying 4 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,49344,1.89184,49136,2,5277,19,106000,7,0,3210,108843,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,49344,1.89481,49136,2,5277,19,106000,8,0,3211,108843,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.90027,49136,2,495,19,106000,9,0,3213,108843,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.90701,49136,2,495,19,106000,10,0,3214,108843,0
Interrupted probabilistic random walk after 215951 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 4
Probabilistic random walk after 215951 steps, saw 108042 distinct states, run finished after 3006 ms. (steps per millisecond=71 ) properties seen :0
FORMULA ASLink-PT-06b-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-06b-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-22 19:58:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (17967 resets) in 1891 ms. (528 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 312111 ms.

BK_STOP 1779479905682

--------------------
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-06b"
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-06b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-oct2-177944366200373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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