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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.7K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K 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 11K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 5 14:02 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 795K 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-05b-UpperBounds-00
FORMULA_NAME ASLink-PT-05b-UpperBounds-01
FORMULA_NAME ASLink-PT-05b-UpperBounds-02
FORMULA_NAME ASLink-PT-05b-UpperBounds-03
FORMULA_NAME ASLink-PT-05b-UpperBounds-04
FORMULA_NAME ASLink-PT-05b-UpperBounds-05
FORMULA_NAME ASLink-PT-05b-UpperBounds-06
FORMULA_NAME ASLink-PT-05b-UpperBounds-07
FORMULA_NAME ASLink-PT-05b-UpperBounds-08
FORMULA_NAME ASLink-PT-05b-UpperBounds-09
FORMULA_NAME ASLink-PT-05b-UpperBounds-10
FORMULA_NAME ASLink-PT-05b-UpperBounds-11
FORMULA_NAME ASLink-PT-05b-UpperBounds-12
FORMULA_NAME ASLink-PT-05b-UpperBounds-13
FORMULA_NAME ASLink-PT-05b-UpperBounds-14
FORMULA_NAME ASLink-PT-05b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779477157556

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-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-22 19:12:38] [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:12:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 19:12:39] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2026-05-22 19:12:39] [INFO ] Transformed 2430 places.
[2026-05-22 19:12:39] [INFO ] Transformed 3040 transitions.
[2026-05-22 19:12:39] [INFO ] Found NUPN structural information;
[2026-05-22 19:12:39] [INFO ] Parsed PT model containing 2430 places and 3040 transitions and 9292 arcs in 325 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4449193639620750231.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11399377968720857029.kers'
[2026-05-22 19:12:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4449193639620750231.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11399377968720857029.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3040 rows 2430 cols 9292 entries
Finished phase 1 with 1638 SingleSign rule and 554 generalized
[2026-05-22 19:12:39] [INFO ] Computed 238 invariants in 20 ms
Computed 238 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-11399377968720857029.kers
Total runtime 25 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 (20 resets) in 75 ms. (131 steps per ms)
FORMULA ASLink-PT-05b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70005 steps (15 resets) in 130 ms. (534 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2026-05-22 19:12:39] [INFO ] Invariant cache hit.
[2026-05-22 19:12:40] [INFO ] [Real]Absence check using 51 positive place invariants in 77 ms returned sat
[2026-05-22 19:12:40] [INFO ] [Real]Absence check using 51 positive and 187 generalized place invariants in 158 ms returned sat
[2026-05-22 19:12:43] [INFO ] [Real]Absence check using state equation in 2470 ms returned sat
[2026-05-22 19:12:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:12:43] [INFO ] [Nat]Absence check using 51 positive place invariants in 54 ms returned sat
[2026-05-22 19:12:43] [INFO ] [Nat]Absence check using 51 positive and 187 generalized place invariants in 163 ms returned sat
[2026-05-22 19:12:45] [INFO ] [Nat]Absence check using state equation in 1747 ms returned sat
[2026-05-22 19:12:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1061 ms
[2026-05-22 19:12:46] [INFO ] Computed and/alt/rep : 2552/5600/2552 causal constraints (skipped 487 transitions) in 228 ms.
[2026-05-22 19:12:48] [INFO ] Added : 20 causal constraints over 4 iterations in 1460 ms. Result :sat
Minimization took 47 ms.
[2026-05-22 19:12:48] [INFO ] [Real]Absence check using 51 positive place invariants in 51 ms returned sat
[2026-05-22 19:12:48] [INFO ] [Real]Absence check using 51 positive and 187 generalized place invariants in 119 ms returned sat
[2026-05-22 19:12:50] [INFO ] [Real]Absence check using state equation in 1844 ms returned sat
[2026-05-22 19:12:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:12:51] [INFO ] [Nat]Absence check using 51 positive place invariants in 126 ms returned sat
[2026-05-22 19:12:51] [INFO ] [Nat]Absence check using 51 positive and 187 generalized place invariants in 121 ms returned sat
[2026-05-22 19:12:53] [INFO ] [Nat]Absence check using state equation in 1896 ms returned sat
[2026-05-22 19:12:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2069 ms
[2026-05-22 19:12:55] [INFO ] Computed and/alt/rep : 2552/5600/2552 causal constraints (skipped 487 transitions) in 190 ms.
[2026-05-22 19:12:55] [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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-22 19:12:56] [INFO ] [Real]Absence check using 51 positive place invariants in 51 ms returned sat
[2026-05-22 19:12:56] [INFO ] [Real]Absence check using 51 positive and 187 generalized place invariants in 133 ms returned sat
[2026-05-22 19:12:58] [INFO ] [Real]Absence check using state equation in 1776 ms returned sat
[2026-05-22 19:12:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:12:58] [INFO ] [Nat]Absence check using 51 positive place invariants in 71 ms returned sat
[2026-05-22 19:12:59] [INFO ] [Nat]Absence check using 51 positive and 187 generalized place invariants in 149 ms returned sat
[2026-05-22 19:13:01] [INFO ] [Nat]Absence check using state equation in 2176 ms returned sat
[2026-05-22 19:13:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1191 ms
[2026-05-22 19:13:02] [INFO ] Computed and/alt/rep : 2552/5600/2552 causal constraints (skipped 487 transitions) in 172 ms.
[2026-05-22 19:13:03] [INFO ] Added : 25 causal constraints over 5 iterations in 1085 ms. Result :unknown
[2026-05-22 19:13:04] [INFO ] [Real]Absence check using 51 positive place invariants in 49 ms returned sat
[2026-05-22 19:13:04] [INFO ] [Real]Absence check using 51 positive and 187 generalized place invariants in 139 ms returned sat
[2026-05-22 19:13:05] [INFO ] [Real]Absence check using state equation in 1518 ms returned sat
[2026-05-22 19:13:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:13:06] [INFO ] [Nat]Absence check using 51 positive place invariants in 52 ms returned sat
[2026-05-22 19:13:06] [INFO ] [Nat]Absence check using 51 positive and 187 generalized place invariants in 104 ms returned sat
[2026-05-22 19:13:08] [INFO ] [Nat]Absence check using state equation in 2051 ms returned sat
[2026-05-22 19:13:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:960)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-22 19:13:11] [INFO ] [Real]Absence check using 51 positive place invariants in 49 ms returned sat
[2026-05-22 19:13:11] [INFO ] [Real]Absence check using 51 positive and 187 generalized place invariants in 241 ms returned sat
[2026-05-22 19:13:13] [INFO ] [Real]Absence check using state equation in 1763 ms returned sat
[2026-05-22 19:13:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:13:14] [INFO ] [Nat]Absence check using 51 positive place invariants in 63 ms returned sat
[2026-05-22 19:13:14] [INFO ] [Nat]Absence check using 51 positive and 187 generalized place invariants in 128 ms returned sat
[2026-05-22 19:13:18] [INFO ] [Nat]Absence check using state equation in 4474 ms returned unknown
[2026-05-22 19:13:19] [INFO ] [Real]Absence check using 51 positive place invariants in 47 ms returned sat
[2026-05-22 19:13:19] [INFO ] [Real]Absence check using 51 positive and 187 generalized place invariants in 159 ms returned sat
[2026-05-22 19:13:20] [INFO ] [Real]Absence check using state equation in 1771 ms returned sat
[2026-05-22 19:13:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:13:21] [INFO ] [Nat]Absence check using 51 positive place invariants in 55 ms returned sat
[2026-05-22 19:13:21] [INFO ] [Nat]Absence check using 51 positive and 187 generalized place invariants in 138 ms returned sat
[2026-05-22 19:13:23] [INFO ] [Nat]Absence check using state equation in 2054 ms returned sat
[2026-05-22 19:13:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:960)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-22 19:13:26] [INFO ] [Real]Absence check using 51 positive place invariants in 64 ms returned sat
[2026-05-22 19:13:26] [INFO ] [Real]Absence check using 51 positive and 187 generalized place invariants in 117 ms returned sat
[2026-05-22 19:13:28] [INFO ] [Real]Absence check using state equation in 1737 ms returned sat
[2026-05-22 19:13:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:13:29] [INFO ] [Nat]Absence check using 51 positive place invariants in 51 ms returned sat
[2026-05-22 19:13:29] [INFO ] [Nat]Absence check using 51 positive and 187 generalized place invariants in 198 ms returned sat
[2026-05-22 19:13:31] [INFO ] [Nat]Absence check using state equation in 2254 ms returned sat
[2026-05-22 19:13: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 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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 2430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2430/2430 places, 3040/3040 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2430 transition count 2481
Reduce places removed 559 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 585 rules applied. Total rules applied 1144 place count 1871 transition count 2455
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 1153 place count 1864 transition count 2453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1155 place count 1862 transition count 2453
Performed 562 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 562 Pre rules applied. Total rules applied 1155 place count 1862 transition count 1891
Deduced a syphon composed of 562 places in 5 ms
Ensure Unique test removed 52 places
Reduce places removed 614 places and 0 transitions.
Iterating global reduction 4 with 1176 rules applied. Total rules applied 2331 place count 1248 transition count 1891
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 4 with 38 rules applied. Total rules applied 2369 place count 1243 transition count 1858
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 34 rules applied. Total rules applied 2403 place count 1210 transition count 1857
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2404 place count 1209 transition count 1857
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 19 Pre rules applied. Total rules applied 2404 place count 1209 transition count 1838
Deduced a syphon composed of 19 places in 9 ms
Ensure Unique test removed 18 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 2460 place count 1172 transition count 1838
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 18 Pre rules applied. Total rules applied 2460 place count 1172 transition count 1820
Deduced a syphon composed of 18 places in 8 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 2496 place count 1154 transition count 1820
Discarding 77 places :
Symmetric choice reduction at 7 with 77 rule applications. Total rules 2573 place count 1077 transition count 1743
Iterating global reduction 7 with 77 rules applied. Total rules applied 2650 place count 1077 transition count 1743
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2651 place count 1077 transition count 1742
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 26 Pre rules applied. Total rules applied 2651 place count 1077 transition count 1716
Deduced a syphon composed of 26 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 8 with 53 rules applied. Total rules applied 2704 place count 1050 transition count 1716
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2704 place count 1050 transition count 1715
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 8 with 3 rules applied. Total rules applied 2707 place count 1048 transition count 1715
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 2713 place count 1042 transition count 1676
Iterating global reduction 8 with 6 rules applied. Total rules applied 2719 place count 1042 transition count 1676
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 2719 place count 1042 transition count 1672
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2727 place count 1038 transition count 1672
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2728 place count 1037 transition count 1664
Iterating global reduction 8 with 1 rules applied. Total rules applied 2729 place count 1037 transition count 1664
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2730 place count 1036 transition count 1656
Iterating global reduction 8 with 1 rules applied. Total rules applied 2731 place count 1036 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2732 place count 1035 transition count 1648
Iterating global reduction 8 with 1 rules applied. Total rules applied 2733 place count 1035 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2734 place count 1034 transition count 1640
Iterating global reduction 8 with 1 rules applied. Total rules applied 2735 place count 1034 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2736 place count 1033 transition count 1632
Iterating global reduction 8 with 1 rules applied. Total rules applied 2737 place count 1033 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2738 place count 1032 transition count 1624
Iterating global reduction 8 with 1 rules applied. Total rules applied 2739 place count 1032 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2740 place count 1031 transition count 1616
Iterating global reduction 8 with 1 rules applied. Total rules applied 2741 place count 1031 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2742 place count 1030 transition count 1608
Iterating global reduction 8 with 1 rules applied. Total rules applied 2743 place count 1030 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2744 place count 1029 transition count 1600
Iterating global reduction 8 with 1 rules applied. Total rules applied 2745 place count 1029 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2746 place count 1028 transition count 1592
Iterating global reduction 8 with 1 rules applied. Total rules applied 2747 place count 1028 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2748 place count 1027 transition count 1584
Iterating global reduction 8 with 1 rules applied. Total rules applied 2749 place count 1027 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2750 place count 1026 transition count 1576
Iterating global reduction 8 with 1 rules applied. Total rules applied 2751 place count 1026 transition count 1576
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2752 place count 1025 transition count 1568
Iterating global reduction 8 with 1 rules applied. Total rules applied 2753 place count 1025 transition count 1568
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2754 place count 1024 transition count 1560
Iterating global reduction 8 with 1 rules applied. Total rules applied 2755 place count 1024 transition count 1560
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2756 place count 1023 transition count 1552
Iterating global reduction 8 with 1 rules applied. Total rules applied 2757 place count 1023 transition count 1552
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2758 place count 1022 transition count 1544
Iterating global reduction 8 with 1 rules applied. Total rules applied 2759 place count 1022 transition count 1544
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 3 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 8 with 280 rules applied. Total rules applied 3039 place count 882 transition count 1404
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3040 place count 881 transition count 1403
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 3042 place count 880 transition count 1403
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3043 place count 879 transition count 1402
Iterating global reduction 8 with 1 rules applied. Total rules applied 3044 place count 879 transition count 1402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 3046 place count 879 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3047 place count 878 transition count 1400
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3049 place count 877 transition count 1409
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 3055 place count 877 transition count 1403
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3061 place count 871 transition count 1403
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 3065 place count 871 transition count 1399
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 3069 place count 867 transition count 1399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 3070 place count 866 transition count 1398
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 12 with 14 rules applied. Total rules applied 3084 place count 856 transition count 1394
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 3089 place count 852 transition count 1393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 3090 place count 851 transition count 1393
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 15 Pre rules applied. Total rules applied 3090 place count 851 transition count 1378
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 15 with 31 rules applied. Total rules applied 3121 place count 835 transition count 1378
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 15 with 7 rules applied. Total rules applied 3128 place count 828 transition count 1378
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 3128 place count 828 transition count 1377
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 3130 place count 827 transition count 1377
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 16 with 20 rules applied. Total rules applied 3150 place count 817 transition count 1367
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 3155 place count 812 transition count 1362
Iterating global reduction 16 with 5 rules applied. Total rules applied 3160 place count 812 transition count 1362
Free-agglomeration rule applied 5 times.
Iterating global reduction 16 with 5 rules applied. Total rules applied 3165 place count 812 transition count 1357
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 3170 place count 807 transition count 1357
Applied a total of 3170 rules in 1474 ms. Remains 807 /2430 variables (removed 1623) and now considering 1357/3040 (removed 1683) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1482 ms. Remains : 807/2430 places, 1357/3040 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1085073164614963233.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9979497904374278923.kers'
[2026-05-22 19:13:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1085073164614963233.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9979497904374278923.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 1357 rows 794 cols 5308 entries
Finished phase 1 with 234 SingleSign rule and 431 generalized
[2026-05-22 19:13:35] [INFO ] Computed 142 invariants in 9 ms
Computed 142 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-9979497904374278923.kers
Total runtime 11 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 (12021 resets) in 2972 ms. (336 steps per ms)
FORMULA ASLink-PT-05b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6000005 steps (13835 resets) in 8164 ms. (734 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2026-05-22 19:13:47] [INFO ] Invariant cache hit.
[2026-05-22 19:13:47] [INFO ] [Real]Absence check using 50 positive place invariants in 13 ms returned sat
[2026-05-22 19:13:47] [INFO ] [Real]Absence check using 50 positive and 92 generalized place invariants in 23 ms returned sat
[2026-05-22 19:13:47] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2026-05-22 19:13:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:13:47] [INFO ] [Nat]Absence check using 50 positive place invariants in 15 ms returned sat
[2026-05-22 19:13:47] [INFO ] [Nat]Absence check using 50 positive and 92 generalized place invariants in 33 ms returned sat
[2026-05-22 19:13:48] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2026-05-22 19:13:48] [INFO ] Computed and/alt/rep : 532/2015/532 causal constraints (skipped 796 transitions) in 76 ms.
[2026-05-22 19:13:50] [INFO ] Added : 95 causal constraints over 19 iterations in 2550 ms. Result :sat
Minimization took 840 ms.
[2026-05-22 19:13:52] [INFO ] [Real]Absence check using 50 positive place invariants in 23 ms returned sat
[2026-05-22 19:13:52] [INFO ] [Real]Absence check using 50 positive and 92 generalized place invariants in 48 ms returned sat
[2026-05-22 19:13:52] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2026-05-22 19:13:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:13:52] [INFO ] [Nat]Absence check using 50 positive place invariants in 12 ms returned sat
[2026-05-22 19:13:52] [INFO ] [Nat]Absence check using 50 positive and 92 generalized place invariants in 18 ms returned sat
[2026-05-22 19:13:53] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2026-05-22 19:13:53] [INFO ] Computed and/alt/rep : 532/2015/532 causal constraints (skipped 796 transitions) in 69 ms.
[2026-05-22 19:14:00] [INFO ] Added : 410 causal constraints over 82 iterations in 7743 ms. Result :sat
Minimization took 688 ms.
[2026-05-22 19:14:01] [INFO ] [Real]Absence check using 50 positive place invariants in 25 ms returned sat
[2026-05-22 19:14:01] [INFO ] [Real]Absence check using 50 positive and 92 generalized place invariants in 22 ms returned sat
[2026-05-22 19:14:02] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2026-05-22 19:14:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:14:02] [INFO ] [Nat]Absence check using 50 positive place invariants in 13 ms returned sat
[2026-05-22 19:14:02] [INFO ] [Nat]Absence check using 50 positive and 92 generalized place invariants in 43 ms returned sat
[2026-05-22 19:14:02] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2026-05-22 19:14:03] [INFO ] Computed and/alt/rep : 532/2015/532 causal constraints (skipped 796 transitions) in 91 ms.
[2026-05-22 19:14:10] [INFO ] Added : 359 causal constraints over 72 iterations in 7604 ms. Result :sat
Minimization took 655 ms.
[2026-05-22 19:14:11] [INFO ] [Real]Absence check using 50 positive place invariants in 22 ms returned sat
[2026-05-22 19:14:11] [INFO ] [Real]Absence check using 50 positive and 92 generalized place invariants in 32 ms returned sat
[2026-05-22 19:14:12] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2026-05-22 19:14:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:14:12] [INFO ] [Nat]Absence check using 50 positive place invariants in 23 ms returned sat
[2026-05-22 19:14:12] [INFO ] [Nat]Absence check using 50 positive and 92 generalized place invariants in 36 ms returned sat
[2026-05-22 19:14:12] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2026-05-22 19:14:12] [INFO ] Computed and/alt/rep : 532/2015/532 causal constraints (skipped 796 transitions) in 91 ms.
[2026-05-22 19:14:22] [INFO ] Added : 421 causal constraints over 85 iterations in 10194 ms. Result :sat
Minimization took 634 ms.
[2026-05-22 19:14:23] [INFO ] [Real]Absence check using 50 positive place invariants in 14 ms returned sat
[2026-05-22 19:14:23] [INFO ] [Real]Absence check using 50 positive and 92 generalized place invariants in 26 ms returned sat
[2026-05-22 19:14:24] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2026-05-22 19:14:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:14:24] [INFO ] [Nat]Absence check using 50 positive place invariants in 17 ms returned sat
[2026-05-22 19:14:24] [INFO ] [Nat]Absence check using 50 positive and 92 generalized place invariants in 29 ms returned sat
[2026-05-22 19:14:25] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2026-05-22 19:14:25] [INFO ] Computed and/alt/rep : 532/2015/532 causal constraints (skipped 796 transitions) in 89 ms.
[2026-05-22 19:14:34] [INFO ] Added : 382 causal constraints over 77 iterations in 9659 ms. Result :sat
Minimization took 1198 ms.
[2026-05-22 19:14:36] [INFO ] [Real]Absence check using 50 positive place invariants in 14 ms returned sat
[2026-05-22 19:14:36] [INFO ] [Real]Absence check using 50 positive and 92 generalized place invariants in 51 ms returned sat
[2026-05-22 19:14:36] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2026-05-22 19:14:36] [INFO ] Computed and/alt/rep : 532/2015/532 causal constraints (skipped 796 transitions) in 132 ms.
[2026-05-22 19:14:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:14:37] [INFO ] [Nat]Absence check using 50 positive place invariants in 13 ms returned sat
[2026-05-22 19:14:37] [INFO ] [Nat]Absence check using 50 positive and 92 generalized place invariants in 76 ms returned sat
[2026-05-22 19:14:38] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2026-05-22 19:14:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 512 ms
[2026-05-22 19:14:38] [INFO ] Computed and/alt/rep : 532/2015/532 causal constraints (skipped 796 transitions) in 150 ms.
[2026-05-22 19:14:45] [INFO ] Added : 348 causal constraints over 70 iterations in 7270 ms. Result :sat
Minimization took 692 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1357/1357 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 806 transition count 1356
Applied a total of 2 rules in 71 ms. Remains 806 /807 variables (removed 1) and now considering 1356/1357 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 806/807 places, 1356/1357 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13077366826180895065.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7234187360106187609.kers'
[2026-05-22 19:15:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13077366826180895065.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7234187360106187609.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 3 ms.
// Phase 1: matrix 1356 rows 793 cols 5306 entries
Finished phase 1 with 233 SingleSign rule and 431 generalized
[2026-05-22 19:15:04] [INFO ] Computed 142 invariants in 32 ms
Computed 142 P flows in 33 ms.
Exported basis to /tmp/petrispot-output-7234187360106187609.kers
Total runtime 35 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (11921 resets) in 2498 ms. (400 steps per ms)
BEST_FIRST walk for 6000005 steps (13924 resets) in 7133 ms. (841 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2026-05-22 19:15:13] [INFO ] Invariant cache hit.
[2026-05-22 19:15:13] [INFO ] [Real]Absence check using 50 positive place invariants in 13 ms returned sat
[2026-05-22 19:15:13] [INFO ] [Real]Absence check using 50 positive and 92 generalized place invariants in 19 ms returned sat
[2026-05-22 19:15:14] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2026-05-22 19:15:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:15:14] [INFO ] [Nat]Absence check using 50 positive place invariants in 14 ms returned sat
[2026-05-22 19:15:14] [INFO ] [Nat]Absence check using 50 positive and 92 generalized place invariants in 29 ms returned sat
[2026-05-22 19:15:15] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2026-05-22 19:15:15] [INFO ] Computed and/alt/rep : 531/2008/531 causal constraints (skipped 796 transitions) in 105 ms.
[2026-05-22 19:15:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 419 ms
[2026-05-22 19:15:21] [INFO ] Added : 367 causal constraints over 74 iterations in 6093 ms. Result :sat
Minimization took 633 ms.
[2026-05-22 19:15:22] [INFO ] [Real]Absence check using 50 positive place invariants in 14 ms returned sat
[2026-05-22 19:15:22] [INFO ] [Real]Absence check using 50 positive and 92 generalized place invariants in 23 ms returned sat
[2026-05-22 19:15:22] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2026-05-22 19:15:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:15:22] [INFO ] [Nat]Absence check using 50 positive place invariants in 23 ms returned sat
[2026-05-22 19:15:22] [INFO ] [Nat]Absence check using 50 positive and 92 generalized place invariants in 43 ms returned sat
[2026-05-22 19:15:23] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2026-05-22 19:15:23] [INFO ] Computed and/alt/rep : 531/2008/531 causal constraints (skipped 796 transitions) in 65 ms.
[2026-05-22 19:15:30] [INFO ] Added : 360 causal constraints over 72 iterations in 6769 ms. Result :sat
Minimization took 661 ms.
[2026-05-22 19:15:31] [INFO ] [Real]Absence check using 50 positive place invariants in 12 ms returned sat
[2026-05-22 19:15:31] [INFO ] [Real]Absence check using 50 positive and 92 generalized place invariants in 19 ms returned sat
[2026-05-22 19:15:31] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2026-05-22 19:15:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:15:31] [INFO ] [Nat]Absence check using 50 positive place invariants in 16 ms returned sat
[2026-05-22 19:15:31] [INFO ] [Nat]Absence check using 50 positive and 92 generalized place invariants in 47 ms returned sat
[2026-05-22 19:15:32] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2026-05-22 19:15:32] [INFO ] Computed and/alt/rep : 531/2008/531 causal constraints (skipped 796 transitions) in 52 ms.
[2026-05-22 19:15:34] [INFO ] Added : 95 causal constraints over 19 iterations in 2222 ms. Result :sat
Minimization took 867 ms.
[2026-05-22 19:15:35] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2026-05-22 19:15:35] [INFO ] [Real]Absence check using 50 positive and 92 generalized place invariants in 31 ms returned sat
[2026-05-22 19:15:36] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2026-05-22 19:15:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:15:36] [INFO ] [Nat]Absence check using 50 positive place invariants in 13 ms returned sat
[2026-05-22 19:15:36] [INFO ] [Nat]Absence check using 50 positive and 92 generalized place invariants in 21 ms returned sat
[2026-05-22 19:15:36] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2026-05-22 19:15:36] [INFO ] Computed and/alt/rep : 531/2008/531 causal constraints (skipped 796 transitions) in 72 ms.
[2026-05-22 19:15:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 371 ms
[2026-05-22 19:15:44] [INFO ] Added : 367 causal constraints over 74 iterations in 8260 ms. Result :sat
Minimization took 655 ms.
[2026-05-22 19:15:45] [INFO ] [Real]Absence check using 50 positive place invariants in 13 ms returned sat
[2026-05-22 19:15:45] [INFO ] [Real]Absence check using 50 positive and 92 generalized place invariants in 18 ms returned sat
[2026-05-22 19:15:46] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2026-05-22 19:15:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:15:46] [INFO ] [Nat]Absence check using 50 positive place invariants in 12 ms returned sat
[2026-05-22 19:15:46] [INFO ] [Nat]Absence check using 50 positive and 92 generalized place invariants in 44 ms returned sat
[2026-05-22 19:15:47] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2026-05-22 19:15:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 521 ms
[2026-05-22 19:15:47] [INFO ] Computed and/alt/rep : 531/2008/531 causal constraints (skipped 796 transitions) in 53 ms.
[2026-05-22 19:15:54] [INFO ] Added : 344 causal constraints over 69 iterations in 7057 ms. Result :sat
Minimization took 1333 ms.
[2026-05-22 19:15:56] [INFO ] [Real]Absence check using 50 positive place invariants in 18 ms returned sat
[2026-05-22 19:15:56] [INFO ] [Real]Absence check using 50 positive and 92 generalized place invariants in 21 ms returned sat
[2026-05-22 19:15:56] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2026-05-22 19:15:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:15:56] [INFO ] [Nat]Absence check using 50 positive place invariants in 12 ms returned sat
[2026-05-22 19:15:56] [INFO ] [Nat]Absence check using 50 positive and 92 generalized place invariants in 29 ms returned sat
[2026-05-22 19:15:57] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2026-05-22 19:15:57] [INFO ] Computed and/alt/rep : 531/2008/531 causal constraints (skipped 796 transitions) in 80 ms.
[2026-05-22 19:16:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 404 ms
[2026-05-22 19:16:05] [INFO ] Added : 340 causal constraints over 68 iterations in 8276 ms. Result :sat
Minimization took 678 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 1356/1356 transitions.
Applied a total of 0 rules in 22 ms. Remains 806 /806 variables (removed 0) and now considering 1356/1356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 806/806 places, 1356/1356 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 1356/1356 transitions.
Applied a total of 0 rules in 22 ms. Remains 806 /806 variables (removed 0) and now considering 1356/1356 (removed 0) transitions.
[2026-05-22 19:16:09] [INFO ] Invariant cache hit.
[2026-05-22 19:16:09] [INFO ] Implicit Places using invariants in 795 ms returned [1, 18, 19, 31, 48, 66, 103, 143, 152, 153, 155, 172, 190, 259, 263, 264, 275, 276, 278, 295, 313, 351, 352, 386, 390, 391, 402, 403, 405, 422, 440, 509, 513, 514, 525, 526, 528, 545, 563, 632, 636, 637, 640, 651, 652, 653, 671, 673, 677, 695, 696, 697, 698, 710, 716, 722, 728, 734, 740, 746, 752, 758, 764, 770]
[2026-05-22 19:16:09] [INFO ] Actually due to overlaps returned [671, 653, 48, 172, 295, 422, 545, 677, 155, 278, 405, 528, 31, 152, 275, 402, 525, 651, 695, 153, 276, 403, 526, 652, 673, 696, 1, 18, 263, 264, 390, 391, 513, 514, 636, 637, 66, 190, 313, 440, 563, 697, 740, 758, 770, 19, 640, 698, 710, 716, 722, 728, 734, 746, 752, 764]
Discarding 56 places :
Implicit Place search using SMT only with invariants took 803 ms to find 56 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 750/806 places, 1356/1356 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 745 transition count 1251
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 113 rules applied. Total rules applied 223 place count 640 transition count 1243
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 227 place count 636 transition count 1243
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 227 place count 636 transition count 1216
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 282 place count 608 transition count 1216
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 294 place count 604 transition count 1208
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 302 place count 596 transition count 1208
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 317 place count 581 transition count 1193
Iterating global reduction 5 with 15 rules applied. Total rules applied 332 place count 581 transition count 1193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 335 place count 581 transition count 1190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 335 place count 581 transition count 1189
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 337 place count 580 transition count 1189
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 340 place count 577 transition count 1183
Iterating global reduction 6 with 3 rules applied. Total rules applied 343 place count 577 transition count 1183
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 344 place count 576 transition count 1182
Iterating global reduction 6 with 1 rules applied. Total rules applied 345 place count 576 transition count 1182
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 346 place count 575 transition count 1180
Iterating global reduction 6 with 1 rules applied. Total rules applied 347 place count 575 transition count 1180
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 427 place count 535 transition count 1140
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 431 place count 531 transition count 1136
Iterating global reduction 6 with 4 rules applied. Total rules applied 435 place count 531 transition count 1136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 439 place count 531 transition count 1132
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 443 place count 529 transition count 1133
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 444 place count 529 transition count 1132
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 7 with 12 rules applied. Total rules applied 456 place count 529 transition count 1120
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 469 place count 516 transition count 1120
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 484 place count 516 transition count 1120
Applied a total of 484 rules in 228 ms. Remains 516 /750 variables (removed 234) and now considering 1120/1356 (removed 236) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17487038654473261254.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5353145137687401641.kers'
[2026-05-22 19:16:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17487038654473261254.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5353145137687401641.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 1120 rows 515 cols 4571 entries
Finished phase 1 with 183 SingleSign rule and 258 generalized
[2026-05-22 19:16:10] [INFO ] Computed 75 invariants in 22 ms
Computed 75 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-5353145137687401641.kers
Total runtime 24 ms.
[2026-05-22 19:16:10] [INFO ] Implicit Places using invariants in 511 ms returned [93, 99, 102, 104, 106, 109, 110, 162, 179, 185, 188, 190, 195, 196, 248, 260, 261, 269, 275, 278, 280, 285, 286, 338, 355, 361, 364, 366, 371, 372, 424, 441, 447, 450, 452]
[2026-05-22 19:16:10] [INFO ] Actually due to overlaps returned [109, 195, 285, 371, 110, 196, 286, 372, 93, 99, 104, 179, 185, 190, 269, 275, 280, 355, 361, 366, 441, 447, 452, 106, 162, 248, 260, 338, 424]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 518 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 487/806 places, 1120/1356 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 467 transition count 1100
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 467 transition count 1100
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 462 transition count 1095
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 462 transition count 1095
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 68 place count 453 transition count 1086
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 83 place count 453 transition count 1071
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 98 place count 438 transition count 1071
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 438 transition count 1067
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 106 place count 434 transition count 1067
Applied a total of 106 rules in 78 ms. Remains 434 /487 variables (removed 53) and now considering 1067/1120 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2583279952392705162.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10474139838900179621.kers'
[2026-05-22 19:16:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2583279952392705162.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10474139838900179621.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1067 rows 434 cols 4338 entries
Finished phase 1 with 123 SingleSign rule and 265 generalized
[2026-05-22 19:16:10] [INFO ] Computed 46 invariants in 7 ms
Computed 46 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-10474139838900179621.kers
Total runtime 8 ms.
[2026-05-22 19:16:11] [INFO ] Implicit Places using invariants in 407 ms returned [225]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 409 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 433/806 places, 1067/1356 transitions.
Applied a total of 0 rules in 16 ms. Remains 433 /433 variables (removed 0) and now considering 1067/1067 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 2083 ms. Remains : 433/806 places, 1067/1356 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15564316682265210700.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15663943960890207005.kers'
[2026-05-22 19:16:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15564316682265210700.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15663943960890207005.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1067 rows 433 cols 4336 entries
Finished phase 1 with 123 SingleSign rule and 265 generalized
[2026-05-22 19:16:11] [INFO ] Computed 45 invariants in 8 ms
Computed 45 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-15663943960890207005.kers
Total runtime 9 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (18533 resets) in 2385 ms. (419 steps per ms)
BEST_FIRST walk for 6000004 steps (26832 resets) in 5129 ms. (1169 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2026-05-22 19:16:18] [INFO ] Invariant cache hit.
[2026-05-22 19:16:18] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2026-05-22 19:16:18] [INFO ] [Real]Absence check using 15 positive and 30 generalized place invariants in 20 ms returned sat
[2026-05-22 19:16:19] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2026-05-22 19:16:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:16:19] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2026-05-22 19:16:19] [INFO ] [Nat]Absence check using 15 positive and 30 generalized place invariants in 20 ms returned sat
[2026-05-22 19:16:19] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2026-05-22 19:16:20] [INFO ] Computed and/alt/rep : 234/1083/234 causal constraints (skipped 804 transitions) in 133 ms.
[2026-05-22 19:16:20] [INFO ] Added : 12 causal constraints over 3 iterations in 410 ms. Result :sat
Minimization took 366 ms.
[2026-05-22 19:16:20] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2026-05-22 19:16:20] [INFO ] [Real]Absence check using 15 positive and 30 generalized place invariants in 8 ms returned sat
[2026-05-22 19:16:21] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2026-05-22 19:16:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:16:21] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2026-05-22 19:16:21] [INFO ] [Nat]Absence check using 15 positive and 30 generalized place invariants in 8 ms returned sat
[2026-05-22 19:16:21] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2026-05-22 19:16:21] [INFO ] Computed and/alt/rep : 234/1083/234 causal constraints (skipped 804 transitions) in 69 ms.
[2026-05-22 19:16:21] [INFO ] Added : 23 causal constraints over 5 iterations in 391 ms. Result :sat
Minimization took 395 ms.
[2026-05-22 19:16:22] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2026-05-22 19:16:22] [INFO ] [Real]Absence check using 15 positive and 30 generalized place invariants in 7 ms returned sat
[2026-05-22 19:16:22] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2026-05-22 19:16:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:16:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2026-05-22 19:16:22] [INFO ] [Nat]Absence check using 15 positive and 30 generalized place invariants in 7 ms returned sat
[2026-05-22 19:16:23] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2026-05-22 19:16:23] [INFO ] Computed and/alt/rep : 234/1083/234 causal constraints (skipped 804 transitions) in 69 ms.
[2026-05-22 19:16:23] [INFO ] Added : 47 causal constraints over 10 iterations in 771 ms. Result :sat
Minimization took 309 ms.
[2026-05-22 19:16:24] [INFO ] [Real]Absence check using 15 positive place invariants in 18 ms returned sat
[2026-05-22 19:16:24] [INFO ] [Real]Absence check using 15 positive and 30 generalized place invariants in 18 ms returned sat
[2026-05-22 19:16:24] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2026-05-22 19:16:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:16:24] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2026-05-22 19:16:24] [INFO ] [Nat]Absence check using 15 positive and 30 generalized place invariants in 19 ms returned sat
[2026-05-22 19:16:25] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2026-05-22 19:16:25] [INFO ] Computed and/alt/rep : 234/1083/234 causal constraints (skipped 804 transitions) in 43 ms.
[2026-05-22 19:16:25] [INFO ] Added : 15 causal constraints over 3 iterations in 287 ms. Result :sat
Minimization took 293 ms.
[2026-05-22 19:16:25] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2026-05-22 19:16:25] [INFO ] [Real]Absence check using 15 positive and 30 generalized place invariants in 21 ms returned sat
[2026-05-22 19:16:26] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2026-05-22 19:16:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:16:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2026-05-22 19:16:26] [INFO ] [Nat]Absence check using 15 positive and 30 generalized place invariants in 23 ms returned sat
[2026-05-22 19:16:26] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2026-05-22 19:16:26] [INFO ] Computed and/alt/rep : 234/1083/234 causal constraints (skipped 804 transitions) in 52 ms.
[2026-05-22 19:16:27] [INFO ] Added : 24 causal constraints over 5 iterations in 832 ms. Result :sat
Minimization took 473 ms.
[2026-05-22 19:16:28] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2026-05-22 19:16:28] [INFO ] [Real]Absence check using 15 positive and 30 generalized place invariants in 21 ms returned sat
[2026-05-22 19:16:28] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2026-05-22 19:16:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:16:28] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2026-05-22 19:16:28] [INFO ] [Nat]Absence check using 15 positive and 30 generalized place invariants in 7 ms returned sat
[2026-05-22 19:16:28] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2026-05-22 19:16:28] [INFO ] Computed and/alt/rep : 234/1083/234 causal constraints (skipped 804 transitions) in 50 ms.
[2026-05-22 19:16:29] [INFO ] Added : 21 causal constraints over 5 iterations in 441 ms. Result :sat
Minimization took 326 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-05b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1067/1067 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 432 transition count 1066
Applied a total of 2 rules in 23 ms. Remains 432 /433 variables (removed 1) and now considering 1066/1067 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 432/433 places, 1066/1067 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3967382341041734805.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1140884587105884862.kers'
[2026-05-22 19:16:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3967382341041734805.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1140884587105884862.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1066 rows 432 cols 4334 entries
Finished phase 1 with 125 SingleSign rule and 262 generalized
[2026-05-22 19:16:30] [INFO ] Computed 45 invariants in 7 ms
Computed 45 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-1140884587105884862.kers
Total runtime 9 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (18767 resets) in 1995 ms. (501 steps per ms)
BEST_FIRST walk for 5000004 steps (22302 resets) in 4198 ms. (1190 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-22 19:16:36] [INFO ] Invariant cache hit.
[2026-05-22 19:16:37] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2026-05-22 19:16:37] [INFO ] [Real]Absence check using 17 positive and 28 generalized place invariants in 16 ms returned sat
[2026-05-22 19:16:37] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2026-05-22 19:16:37] [INFO ] Computed and/alt/rep : 233/1096/233 causal constraints (skipped 804 transitions) in 76 ms.
[2026-05-22 19:16:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:16:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2026-05-22 19:16:37] [INFO ] [Nat]Absence check using 17 positive and 28 generalized place invariants in 18 ms returned sat
[2026-05-22 19:16:38] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2026-05-22 19:16:38] [INFO ] Computed and/alt/rep : 233/1096/233 causal constraints (skipped 804 transitions) in 97 ms.
[2026-05-22 19:16:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2026-05-22 19:16:40] [INFO ] Added : 84 causal constraints over 17 iterations in 1894 ms. Result :sat
Minimization took 476 ms.
[2026-05-22 19:16:40] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2026-05-22 19:16:40] [INFO ] [Real]Absence check using 17 positive and 28 generalized place invariants in 8 ms returned sat
[2026-05-22 19:16:41] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2026-05-22 19:16:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:16:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2026-05-22 19:16:41] [INFO ] [Nat]Absence check using 17 positive and 28 generalized place invariants in 8 ms returned sat
[2026-05-22 19:16:41] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2026-05-22 19:16:41] [INFO ] Computed and/alt/rep : 233/1096/233 causal constraints (skipped 804 transitions) in 113 ms.
[2026-05-22 19:16:42] [INFO ] Added : 36 causal constraints over 8 iterations in 920 ms. Result :sat
Minimization took 446 ms.
[2026-05-22 19:16:43] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2026-05-22 19:16:43] [INFO ] [Real]Absence check using 17 positive and 28 generalized place invariants in 13 ms returned sat
[2026-05-22 19:16:43] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2026-05-22 19:16:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:16:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2026-05-22 19:16:43] [INFO ] [Nat]Absence check using 17 positive and 28 generalized place invariants in 6 ms returned sat
[2026-05-22 19:16:43] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2026-05-22 19:16:44] [INFO ] Computed and/alt/rep : 233/1096/233 causal constraints (skipped 804 transitions) in 63 ms.
[2026-05-22 19:16:44] [INFO ] Added : 21 causal constraints over 5 iterations in 511 ms. Result :sat
Minimization took 347 ms.
[2026-05-22 19:16:45] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2026-05-22 19:16:45] [INFO ] [Real]Absence check using 17 positive and 28 generalized place invariants in 11 ms returned sat
[2026-05-22 19:16:45] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2026-05-22 19:16:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:16:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2026-05-22 19:16:45] [INFO ] [Nat]Absence check using 17 positive and 28 generalized place invariants in 25 ms returned sat
[2026-05-22 19:16:45] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2026-05-22 19:16:46] [INFO ] Computed and/alt/rep : 233/1096/233 causal constraints (skipped 804 transitions) in 92 ms.
[2026-05-22 19:16:47] [INFO ] Added : 51 causal constraints over 11 iterations in 1861 ms. Result :sat
Minimization took 587 ms.
[2026-05-22 19:16:48] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2026-05-22 19:16:48] [INFO ] [Real]Absence check using 17 positive and 28 generalized place invariants in 8 ms returned sat
[2026-05-22 19:16:48] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2026-05-22 19:16:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:16:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 21 ms returned sat
[2026-05-22 19:16:49] [INFO ] [Nat]Absence check using 17 positive and 28 generalized place invariants in 20 ms returned sat
[2026-05-22 19:16:49] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2026-05-22 19:16:49] [INFO ] Computed and/alt/rep : 233/1096/233 causal constraints (skipped 804 transitions) in 80 ms.
[2026-05-22 19:16:50] [INFO ] Added : 49 causal constraints over 11 iterations in 1193 ms. Result :sat
Minimization took 356 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1066/1066 transitions.
Applied a total of 0 rules in 13 ms. Remains 432 /432 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 432/432 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1066/1066 transitions.
Applied a total of 0 rules in 12 ms. Remains 432 /432 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2026-05-22 19:16:51] [INFO ] Invariant cache hit.
[2026-05-22 19:16:52] [INFO ] Implicit Places using invariants in 363 ms returned []
[2026-05-22 19:16:52] [INFO ] Invariant cache hit.
[2026-05-22 19:16:53] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 1410 ms to find 0 implicit places.
[2026-05-22 19:16:53] [INFO ] Redundant transitions in 95 ms returned []
Running 1037 sub problems to find dead transitions.
[2026-05-22 19:16:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 28/43 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 431/1498 variables, and 43 constraints, problems are : Problem set: 0 solved, 1037 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/432 constraints, PredecessorRefiner: 1037/1037 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1037 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 28/43 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/1498 variables, and 43 constraints, problems are : Problem set: 0 solved, 1037 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/432 constraints, PredecessorRefiner: 0/1037 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60448ms problems are : Problem set: 0 solved, 1037 unsolved
Search for dead transitions found 0 dead transitions in 60475ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62033 ms. Remains : 432/432 places, 1066/1066 transitions.
RANDOM walk for 40000 steps (770 resets) in 1335 ms. (29 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (178 resets) in 171 ms. (232 steps per ms) remains 10/10 properties
[2026-05-22 19:17:54] [INFO ] Flatten gal took : 175 ms
BEST_FIRST walk for 40002 steps (173 resets) in 410 ms. (97 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (177 resets) in 178 ms. (223 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (171 resets) in 207 ms. (192 steps per ms) remains 10/10 properties
[2026-05-22 19:17:54] [INFO ] Flatten gal took : 148 ms
BEST_FIRST walk for 40004 steps (174 resets) in 162 ms. (245 steps per ms) remains 10/10 properties
[2026-05-22 19:17:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17744645900796637766.gal : 52 ms
[2026-05-22 19:17:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17791976427605803573.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17744645900796637766.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17791976427605803573.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40002 steps (177 resets) in 163 ms. (243 steps per ms) remains 10/10 properties
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 ...330
BEST_FIRST walk for 40004 steps (178 resets) in 169 ms. (235 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (181 resets) in 165 ms. (240 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality17791976427605803573.prop.
BEST_FIRST walk for 40003 steps (173 resets) in 186 ms. (213 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (177 resets) in 128 ms. (310 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :6 after 44
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :44 after 328
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :328 after 2448
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :2448 after 97920
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :97920 after 149316
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :149316 after 153774
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :153774 after 154484
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :154484 after 230696
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :230696 after 3.5478e+06
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :3.5478e+06 after 2.97679e+07
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :2.97679e+07 after 1.52282e+08
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
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,1.15808e+09,1.85989,51208,2,30734,23,105625,6,0,2798,108790,0
Total reachable state count : 1158076541

Verifying 10 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,1.8647,51304,2,433,23,105625,7,0,2801,108790,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,1.86692,51304,2,433,23,105625,8,0,2802,108790,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,44,1.86916,51304,2,738,23,105625,9,0,2804,108790,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,44,1.871,51304,2,738,23,105625,10,0,2805,108790,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,1,1.87601,51304,2,433,23,105625,11,0,2807,108790,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,1,1.88096,51304,2,433,23,105625,12,0,2808,108790,0
Reachability property MAX3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,1,1.88219,51304,2,433,23,105625,13,0,2810,108790,0
Invariant property MIN3 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,1,1.88304,51304,2,433,23,105625,14,0,2811,108790,0
Reachability property MAX4 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
MAX4,1,1.88612,51304,2,433,23,105625,15,0,2813,108790,0
Invariant property MIN4 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
MIN4,1,1.88881,51304,2,433,23,105625,16,0,2814,108790,0
ITS tools runner thread asked to quit. Dying gracefully.
Interrupted probabilistic random walk after 185122 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 10
Probabilistic random walk after 185122 steps, saw 92703 distinct states, run finished after 3009 ms. (steps per millisecond=61 ) properties seen :0
FORMULA ASLink-PT-05b-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-05b-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-05b-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-05b-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-05b-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-22 19:17:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (18415 resets) in 1990 ms. (502 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 321123 ms.

BK_STOP 1779477480105

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

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