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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 892K
-rw-r--r-- 1 mcc users 9.6K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Mar 5 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 5 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 5 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 5 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 436K 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-04a-UpperBounds-00
FORMULA_NAME ASLink-PT-04a-UpperBounds-01
FORMULA_NAME ASLink-PT-04a-UpperBounds-02
FORMULA_NAME ASLink-PT-04a-UpperBounds-03
FORMULA_NAME ASLink-PT-04a-UpperBounds-04
FORMULA_NAME ASLink-PT-04a-UpperBounds-05
FORMULA_NAME ASLink-PT-04a-UpperBounds-06
FORMULA_NAME ASLink-PT-04a-UpperBounds-07
FORMULA_NAME ASLink-PT-04a-UpperBounds-08
FORMULA_NAME ASLink-PT-04a-UpperBounds-09
FORMULA_NAME ASLink-PT-04a-UpperBounds-10
FORMULA_NAME ASLink-PT-04a-UpperBounds-11
FORMULA_NAME ASLink-PT-04a-UpperBounds-12
FORMULA_NAME ASLink-PT-04a-UpperBounds-13
FORMULA_NAME ASLink-PT-04a-UpperBounds-14
FORMULA_NAME ASLink-PT-04a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779474428506

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-04a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-22 18:27:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 18:27:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 18:27:10] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2026-05-22 18:27:10] [INFO ] Transformed 1016 places.
[2026-05-22 18:27:10] [INFO ] Transformed 1554 transitions.
[2026-05-22 18:27:10] [INFO ] Found NUPN structural information;
[2026-05-22 18:27:10] [INFO ] Parsed PT model containing 1016 places and 1554 transitions and 5858 arcs in 283 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
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-13451442353272667900.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3132683749401362189.kers'
[2026-05-22 18:27:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13451442353272667900.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3132683749401362189.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 1 ms.
// Phase 1: matrix 1538 rows 1000 cols 5794 entries
Finished phase 1 with 374 SingleSign rule and 448 generalized
[2026-05-22 18:27:10] [INFO ] Computed 194 invariants in 10 ms
Computed 194 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-3132683749401362189.kers
Total runtime 12 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 (73 resets) in 83 ms. (119 steps per ms)
FORMULA ASLink-PT-04a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60003 steps (75 resets) in 124 ms. (480 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2026-05-22 18:27:10] [INFO ] Invariant cache hit.
[2026-05-22 18:27:11] [INFO ] [Real]Absence check using 43 positive place invariants in 43 ms returned sat
[2026-05-22 18:27:11] [INFO ] [Real]Absence check using 43 positive and 151 generalized place invariants in 77 ms returned sat
[2026-05-22 18:27:12] [INFO ] [Real]Absence check using state equation in 910 ms returned sat
[2026-05-22 18:27:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:27:12] [INFO ] [Nat]Absence check using 43 positive place invariants in 23 ms returned sat
[2026-05-22 18:27:12] [INFO ] [Nat]Absence check using 43 positive and 151 generalized place invariants in 40 ms returned sat
[2026-05-22 18:27:13] [INFO ] [Nat]Absence check using state equation in 848 ms returned sat
[2026-05-22 18:27:14] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 122 ms.
[2026-05-22 18:27:15] [INFO ] Added : 40 causal constraints over 8 iterations in 1481 ms. Result :sat
Minimization took 590 ms.
[2026-05-22 18:27:16] [INFO ] [Real]Absence check using 43 positive place invariants in 33 ms returned sat
[2026-05-22 18:27:16] [INFO ] [Real]Absence check using 43 positive and 151 generalized place invariants in 95 ms returned sat
[2026-05-22 18:27:17] [INFO ] [Real]Absence check using state equation in 833 ms returned sat
[2026-05-22 18:27:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:27:17] [INFO ] [Nat]Absence check using 43 positive place invariants in 26 ms returned sat
[2026-05-22 18:27:17] [INFO ] [Nat]Absence check using 43 positive and 151 generalized place invariants in 44 ms returned sat
[2026-05-22 18:27:18] [INFO ] [Nat]Absence check using state equation in 1104 ms returned sat
[2026-05-22 18:27:18] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 137 ms.
[2026-05-22 18:27:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java: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 18:27:22] [INFO ] [Real]Absence check using 43 positive place invariants in 20 ms returned sat
[2026-05-22 18:27:22] [INFO ] [Real]Absence check using 43 positive and 151 generalized place invariants in 54 ms returned sat
[2026-05-22 18:27:23] [INFO ] [Real]Absence check using state equation in 740 ms returned sat
[2026-05-22 18:27:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:27:23] [INFO ] [Nat]Absence check using 43 positive place invariants in 57 ms returned sat
[2026-05-22 18:27:23] [INFO ] [Nat]Absence check using 43 positive and 151 generalized place invariants in 79 ms returned sat
[2026-05-22 18:27:24] [INFO ] [Nat]Absence check using state equation in 863 ms returned sat
[2026-05-22 18:27:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 509 ms
[2026-05-22 18:27:25] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 105 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2026-05-22 18:27:28] [INFO ] [Real]Absence check using 43 positive place invariants in 24 ms returned sat
[2026-05-22 18:27:28] [INFO ] [Real]Absence check using 43 positive and 151 generalized place invariants in 70 ms returned sat
[2026-05-22 18:27:29] [INFO ] [Real]Absence check using state equation in 746 ms returned sat
[2026-05-22 18:27:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:27:30] [INFO ] [Nat]Absence check using 43 positive place invariants in 54 ms returned sat
[2026-05-22 18:27:30] [INFO ] [Nat]Absence check using 43 positive and 151 generalized place invariants in 76 ms returned sat
[2026-05-22 18:27:31] [INFO ] [Nat]Absence check using state equation in 835 ms returned sat
[2026-05-22 18:27:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 614 ms
[2026-05-22 18:27:31] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 114 ms.
[2026-05-22 18:27:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.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 18:27:35] [INFO ] [Real]Absence check using 43 positive place invariants in 20 ms returned sat
[2026-05-22 18:27:35] [INFO ] [Real]Absence check using 43 positive and 151 generalized place invariants in 43 ms returned sat
[2026-05-22 18:27:35] [INFO ] [Real]Absence check using state equation in 644 ms returned sat
[2026-05-22 18:27:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:27:36] [INFO ] [Nat]Absence check using 43 positive place invariants in 33 ms returned sat
[2026-05-22 18:27:36] [INFO ] [Nat]Absence check using 43 positive and 151 generalized place invariants in 74 ms returned sat
[2026-05-22 18:27:36] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2026-05-22 18:27:37] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 108 ms.
[2026-05-22 18:27:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java: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 18:27:41] [INFO ] [Real]Absence check using 43 positive place invariants in 28 ms returned sat
[2026-05-22 18:27:41] [INFO ] [Real]Absence check using 43 positive and 151 generalized place invariants in 48 ms returned sat
[2026-05-22 18:27:41] [INFO ] [Real]Absence check using state equation in 655 ms returned sat
[2026-05-22 18:27:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:27:42] [INFO ] [Nat]Absence check using 43 positive place invariants in 26 ms returned sat
[2026-05-22 18:27:42] [INFO ] [Nat]Absence check using 43 positive and 151 generalized place invariants in 69 ms returned sat
[2026-05-22 18:27:43] [INFO ] [Nat]Absence check using state equation in 814 ms returned sat
[2026-05-22 18:27:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 663 ms
[2026-05-22 18:27:43] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 142 ms.
Maximisation of solution failed !
Minimization took 1 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 1016 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 16 places
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 992 transition count 1453
Reduce places removed 85 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 86 rules applied. Total rules applied 195 place count 907 transition count 1452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 196 place count 906 transition count 1452
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 196 place count 906 transition count 1363
Deduced a syphon composed of 89 places in 2 ms
Ensure Unique test removed 35 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 409 place count 782 transition count 1363
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 3 with 1 rules applied. Total rules applied 410 place count 782 transition count 1362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 411 place count 781 transition count 1362
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 418 place count 774 transition count 1327
Ensure Unique test removed 1 places
Iterating global reduction 5 with 8 rules applied. Total rules applied 426 place count 773 transition count 1327
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 432 place count 772 transition count 1322
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 435 place count 769 transition count 1322
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 436 place count 768 transition count 1314
Iterating global reduction 7 with 1 rules applied. Total rules applied 437 place count 768 transition count 1314
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 438 place count 767 transition count 1306
Iterating global reduction 7 with 1 rules applied. Total rules applied 439 place count 767 transition count 1306
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 440 place count 766 transition count 1298
Iterating global reduction 7 with 1 rules applied. Total rules applied 441 place count 766 transition count 1298
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 442 place count 765 transition count 1290
Iterating global reduction 7 with 1 rules applied. Total rules applied 443 place count 765 transition count 1290
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 444 place count 764 transition count 1282
Iterating global reduction 7 with 1 rules applied. Total rules applied 445 place count 764 transition count 1282
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 446 place count 763 transition count 1274
Iterating global reduction 7 with 1 rules applied. Total rules applied 447 place count 763 transition count 1274
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 448 place count 762 transition count 1266
Iterating global reduction 7 with 1 rules applied. Total rules applied 449 place count 762 transition count 1266
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 450 place count 761 transition count 1258
Iterating global reduction 7 with 1 rules applied. Total rules applied 451 place count 761 transition count 1258
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 452 place count 760 transition count 1250
Iterating global reduction 7 with 1 rules applied. Total rules applied 453 place count 760 transition count 1250
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 454 place count 759 transition count 1242
Iterating global reduction 7 with 1 rules applied. Total rules applied 455 place count 759 transition count 1242
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 456 place count 758 transition count 1234
Iterating global reduction 7 with 1 rules applied. Total rules applied 457 place count 758 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 458 place count 757 transition count 1226
Iterating global reduction 7 with 1 rules applied. Total rules applied 459 place count 757 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 460 place count 756 transition count 1218
Iterating global reduction 7 with 1 rules applied. Total rules applied 461 place count 756 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 462 place count 755 transition count 1210
Iterating global reduction 7 with 1 rules applied. Total rules applied 463 place count 755 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 464 place count 754 transition count 1202
Iterating global reduction 7 with 1 rules applied. Total rules applied 465 place count 754 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 466 place count 753 transition count 1194
Iterating global reduction 7 with 1 rules applied. Total rules applied 467 place count 753 transition count 1194
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 523 place count 725 transition count 1166
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 528 place count 725 transition count 1161
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 533 place count 720 transition count 1161
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 538 place count 720 transition count 1161
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 539 place count 719 transition count 1160
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 546 place count 712 transition count 1160
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 546 place count 712 transition count 1149
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 568 place count 701 transition count 1149
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 9 with 4 rules applied. Total rules applied 572 place count 697 transition count 1149
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 580 place count 693 transition count 1145
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 584 place count 689 transition count 1141
Iterating global reduction 10 with 4 rules applied. Total rules applied 588 place count 689 transition count 1141
Free-agglomeration rule applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 592 place count 689 transition count 1137
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 596 place count 685 transition count 1137
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 599 place count 685 transition count 1137
Applied a total of 599 rules in 1060 ms. Remains 685 /1016 variables (removed 331) and now considering 1137/1538 (removed 401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1076 ms. Remains : 685/1016 places, 1137/1538 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2874893557310150651.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6706640609062407296.kers'
[2026-05-22 18:27:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2874893557310150651.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6706640609062407296.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 1137 rows 674 cols 4442 entries
Finished phase 1 with 174 SingleSign rule and 389 generalized
[2026-05-22 18:27:48] [INFO ] Computed 122 invariants in 8 ms
Computed 122 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-6706640609062407296.kers
Total runtime 24 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 (12680 resets) in 2537 ms. (394 steps per ms)
FORMULA ASLink-PT-04a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000004 steps (14201 resets) in 6089 ms. (821 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 18:27:56] [INFO ] Invariant cache hit.
[2026-05-22 18:27:56] [INFO ] [Real]Absence check using 38 positive place invariants in 16 ms returned sat
[2026-05-22 18:27:56] [INFO ] [Real]Absence check using 38 positive and 84 generalized place invariants in 22 ms returned sat
[2026-05-22 18:27:57] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2026-05-22 18:27:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:27:57] [INFO ] [Nat]Absence check using 38 positive place invariants in 27 ms returned sat
[2026-05-22 18:27:57] [INFO ] [Nat]Absence check using 38 positive and 84 generalized place invariants in 45 ms returned sat
[2026-05-22 18:27:58] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2026-05-22 18:27:58] [INFO ] Computed and/alt/rep : 445/1693/445 causal constraints (skipped 667 transitions) in 119 ms.
[2026-05-22 18:28:01] [INFO ] Added : 172 causal constraints over 35 iterations in 3585 ms. Result :sat
Minimization took 544 ms.
[2026-05-22 18:28:02] [INFO ] [Real]Absence check using 38 positive place invariants in 11 ms returned sat
[2026-05-22 18:28:02] [INFO ] [Real]Absence check using 38 positive and 84 generalized place invariants in 19 ms returned sat
[2026-05-22 18:28:03] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2026-05-22 18:28:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:28:03] [INFO ] [Nat]Absence check using 38 positive place invariants in 12 ms returned sat
[2026-05-22 18:28:03] [INFO ] [Nat]Absence check using 38 positive and 84 generalized place invariants in 26 ms returned sat
[2026-05-22 18:28:03] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2026-05-22 18:28:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 487 ms
[2026-05-22 18:28:04] [INFO ] Computed and/alt/rep : 445/1693/445 causal constraints (skipped 667 transitions) in 64 ms.
[2026-05-22 18:28:09] [INFO ] Added : 320 causal constraints over 64 iterations in 5506 ms. Result :sat
Minimization took 754 ms.
[2026-05-22 18:28:10] [INFO ] [Real]Absence check using 38 positive place invariants in 14 ms returned sat
[2026-05-22 18:28:10] [INFO ] [Real]Absence check using 38 positive and 84 generalized place invariants in 50 ms returned sat
[2026-05-22 18:28:11] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2026-05-22 18:28:11] [INFO ] Computed and/alt/rep : 445/1693/445 causal constraints (skipped 667 transitions) in 60 ms.
[2026-05-22 18:28:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:28:11] [INFO ] [Nat]Absence check using 38 positive place invariants in 26 ms returned sat
[2026-05-22 18:28:11] [INFO ] [Nat]Absence check using 38 positive and 84 generalized place invariants in 38 ms returned sat
[2026-05-22 18:28:11] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2026-05-22 18:28:12] [INFO ] Computed and/alt/rep : 445/1693/445 causal constraints (skipped 667 transitions) in 61 ms.
[2026-05-22 18:28:16] [INFO ] Added : 297 causal constraints over 60 iterations in 4472 ms. Result :sat
Minimization took 554 ms.
[2026-05-22 18:28:17] [INFO ] [Real]Absence check using 38 positive place invariants in 12 ms returned sat
[2026-05-22 18:28:17] [INFO ] [Real]Absence check using 38 positive and 84 generalized place invariants in 36 ms returned sat
[2026-05-22 18:28:17] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2026-05-22 18:28:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:28:17] [INFO ] [Nat]Absence check using 38 positive place invariants in 12 ms returned sat
[2026-05-22 18:28:17] [INFO ] [Nat]Absence check using 38 positive and 84 generalized place invariants in 91 ms returned sat
[2026-05-22 18:28:18] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2026-05-22 18:28:18] [INFO ] Computed and/alt/rep : 445/1693/445 causal constraints (skipped 667 transitions) in 141 ms.
[2026-05-22 18:28:21] [INFO ] Added : 125 causal constraints over 25 iterations in 2761 ms. Result :sat
Minimization took 628 ms.
[2026-05-22 18:28:22] [INFO ] [Real]Absence check using 38 positive place invariants in 22 ms returned sat
[2026-05-22 18:28:22] [INFO ] [Real]Absence check using 38 positive and 84 generalized place invariants in 28 ms returned sat
[2026-05-22 18:28:22] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2026-05-22 18:28:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:28:22] [INFO ] [Nat]Absence check using 38 positive place invariants in 11 ms returned sat
[2026-05-22 18:28:22] [INFO ] [Nat]Absence check using 38 positive and 84 generalized place invariants in 46 ms returned sat
[2026-05-22 18:28:23] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2026-05-22 18:28:23] [INFO ] Computed and/alt/rep : 445/1693/445 causal constraints (skipped 667 transitions) in 86 ms.
[2026-05-22 18:28:29] [INFO ] Added : 323 causal constraints over 65 iterations in 6556 ms. Result :sat
Minimization took 588 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA ASLink-PT-04a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 685 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 685/685 places, 1137/1137 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 685 transition count 1136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 683 transition count 1136
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 3 place count 683 transition count 1132
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 11 place count 679 transition count 1132
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 679 transition count 1132
Applied a total of 12 rules in 59 ms. Remains 679 /685 variables (removed 6) and now considering 1132/1137 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 679/685 places, 1132/1137 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10070299434863238693.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11131924677437438434.kers'
[2026-05-22 18:28:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10070299434863238693.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11131924677437438434.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 1132 rows 668 cols 4428 entries
Finished phase 1 with 168 SingleSign rule and 390 generalized
[2026-05-22 18:28:31] [INFO ] Computed 121 invariants in 8 ms
Computed 121 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-11131924677437438434.kers
Total runtime 12 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (12791 resets) in 2644 ms. (378 steps per ms)
BEST_FIRST walk for 4000004 steps (11737 resets) in 4924 ms. (812 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-22 18:28:39] [INFO ] Invariant cache hit.
[2026-05-22 18:28:39] [INFO ] [Real]Absence check using 37 positive place invariants in 14 ms returned sat
[2026-05-22 18:28:39] [INFO ] [Real]Absence check using 37 positive and 84 generalized place invariants in 27 ms returned sat
[2026-05-22 18:28:39] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2026-05-22 18:28:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:28:40] [INFO ] [Nat]Absence check using 37 positive place invariants in 15 ms returned sat
[2026-05-22 18:28:40] [INFO ] [Nat]Absence check using 37 positive and 84 generalized place invariants in 39 ms returned sat
[2026-05-22 18:28:40] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2026-05-22 18:28:40] [INFO ] Computed and/alt/rep : 440/1697/440 causal constraints (skipped 667 transitions) in 94 ms.
[2026-05-22 18:28:49] [INFO ] Added : 334 causal constraints over 67 iterations in 8537 ms. Result :sat
Minimization took 700 ms.
[2026-05-22 18:28:50] [INFO ] [Real]Absence check using 37 positive place invariants in 12 ms returned sat
[2026-05-22 18:28:50] [INFO ] [Real]Absence check using 37 positive and 84 generalized place invariants in 68 ms returned sat
[2026-05-22 18:28:50] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2026-05-22 18:28:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:28:50] [INFO ] [Nat]Absence check using 37 positive place invariants in 12 ms returned sat
[2026-05-22 18:28:50] [INFO ] [Nat]Absence check using 37 positive and 84 generalized place invariants in 31 ms returned sat
[2026-05-22 18:28:51] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2026-05-22 18:28:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2026-05-22 18:28:51] [INFO ] Computed and/alt/rep : 440/1697/440 causal constraints (skipped 667 transitions) in 72 ms.
[2026-05-22 18:28:55] [INFO ] Added : 143 causal constraints over 29 iterations in 3503 ms. Result :sat
Minimization took 574 ms.
[2026-05-22 18:28:56] [INFO ] [Real]Absence check using 37 positive place invariants in 23 ms returned sat
[2026-05-22 18:28:56] [INFO ] [Real]Absence check using 37 positive and 84 generalized place invariants in 34 ms returned sat
[2026-05-22 18:28:56] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2026-05-22 18:28:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:28:56] [INFO ] [Nat]Absence check using 37 positive place invariants in 12 ms returned sat
[2026-05-22 18:28:56] [INFO ] [Nat]Absence check using 37 positive and 84 generalized place invariants in 26 ms returned sat
[2026-05-22 18:28:57] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2026-05-22 18:28:57] [INFO ] Computed and/alt/rep : 440/1697/440 causal constraints (skipped 667 transitions) in 63 ms.
[2026-05-22 18:29:02] [INFO ] Added : 253 causal constraints over 51 iterations in 5180 ms. Result :sat
Minimization took 608 ms.
[2026-05-22 18:29:03] [INFO ] [Real]Absence check using 37 positive place invariants in 17 ms returned sat
[2026-05-22 18:29:03] [INFO ] [Real]Absence check using 37 positive and 84 generalized place invariants in 33 ms returned sat
[2026-05-22 18:29:03] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2026-05-22 18:29:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:29:04] [INFO ] [Nat]Absence check using 37 positive place invariants in 14 ms returned sat
[2026-05-22 18:29:04] [INFO ] [Nat]Absence check using 37 positive and 84 generalized place invariants in 49 ms returned sat
[2026-05-22 18:29:04] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2026-05-22 18:29:04] [INFO ] Computed and/alt/rep : 440/1697/440 causal constraints (skipped 667 transitions) in 122 ms.
[2026-05-22 18:29:11] [INFO ] Added : 328 causal constraints over 66 iterations in 6724 ms. Result :sat
Minimization took 644 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 679 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 679/679 places, 1132/1132 transitions.
Applied a total of 0 rules in 22 ms. Remains 679 /679 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 679/679 places, 1132/1132 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 679/679 places, 1132/1132 transitions.
Applied a total of 0 rules in 19 ms. Remains 679 /679 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
[2026-05-22 18:29:13] [INFO ] Invariant cache hit.
[2026-05-22 18:29:14] [INFO ] Implicit Places using invariants in 757 ms returned [0, 18, 19, 21, 31, 49, 67, 136, 140, 153, 154, 155, 173, 191, 260, 264, 265, 276, 277, 278, 296, 314, 383, 387, 388, 399, 400, 401, 419, 437, 506, 510, 511, 514, 525, 526, 527, 545, 547, 550, 568, 569, 570, 571, 583, 589, 595, 601, 607, 613, 619, 625, 631, 637, 643]
[2026-05-22 18:29:14] [INFO ] Actually due to overlaps returned [545, 527, 31, 49, 155, 173, 278, 296, 401, 419, 550, 154, 277, 400, 526, 569, 153, 276, 399, 525, 547, 568, 0, 264, 265, 387, 388, 510, 511, 18, 19, 67, 191, 314, 437, 571, 613, 631, 643, 21, 140, 514, 570, 583, 589, 595, 601, 607, 619, 625, 637]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 763 ms to find 51 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 628/679 places, 1132/1132 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 624 transition count 1041
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 186 place count 533 transition count 1041
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 186 place count 533 transition count 1018
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 233 place count 509 transition count 1018
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 245 place count 505 transition count 1010
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 253 place count 497 transition count 1010
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 268 place count 482 transition count 995
Iterating global reduction 4 with 15 rules applied. Total rules applied 283 place count 482 transition count 995
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 286 place count 482 transition count 992
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 286 place count 482 transition count 991
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 288 place count 481 transition count 991
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 291 place count 478 transition count 988
Iterating global reduction 5 with 3 rules applied. Total rules applied 294 place count 478 transition count 988
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 295 place count 477 transition count 987
Iterating global reduction 5 with 1 rules applied. Total rules applied 296 place count 477 transition count 987
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 297 place count 476 transition count 986
Iterating global reduction 5 with 1 rules applied. Total rules applied 298 place count 476 transition count 986
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 378 place count 436 transition count 946
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 382 place count 436 transition count 942
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 386 place count 432 transition count 938
Iterating global reduction 6 with 4 rules applied. Total rules applied 390 place count 432 transition count 938
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 394 place count 432 transition count 934
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 402 place count 432 transition count 926
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 411 place count 423 transition count 926
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 423 place count 423 transition count 926
Applied a total of 423 rules in 141 ms. Remains 423 /628 variables (removed 205) and now considering 926/1132 (removed 206) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16219273715337644874.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16519130515420858031.kers'
[2026-05-22 18:29:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16219273715337644874.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16519130515420858031.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 926 rows 423 cols 3771 entries
Finished phase 1 with 160 SingleSign rule and 203 generalized
[2026-05-22 18:29:14] [INFO ] Computed 60 invariants in 9 ms
Computed 60 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-16519130515420858031.kers
Total runtime 10 ms.
[2026-05-22 18:29:14] [INFO ] Implicit Places using invariants in 365 ms returned [71, 89, 95, 98, 100, 107, 108, 160, 177, 183, 186, 188, 193, 194, 246, 263, 269, 272, 274, 279, 280, 332, 349, 355, 358, 360]
[2026-05-22 18:29:14] [INFO ] Actually due to overlaps returned [107, 193, 279, 108, 194, 280, 89, 95, 100, 177, 183, 188, 263, 269, 274, 349, 355, 360, 71, 160, 246, 332]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 367 ms to find 22 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 401/679 places, 926/1132 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 385 transition count 910
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 385 transition count 910
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 381 transition count 906
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 381 transition count 906
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 56 place count 373 transition count 898
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 373 transition count 886
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 80 place count 361 transition count 886
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 361 transition count 882
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 88 place count 357 transition count 882
Applied a total of 88 rules in 65 ms. Remains 357 /401 variables (removed 44) and now considering 882/926 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10202304882521772957.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4685716941853697111.kers'
[2026-05-22 18:29:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10202304882521772957.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4685716941853697111.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 882 rows 357 cols 3598 entries
Finished phase 1 with 130 SingleSign rule and 189 generalized
[2026-05-22 18:29:14] [INFO ] Computed 38 invariants in 15 ms
Computed 38 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-4685716941853697111.kers
Total runtime 16 ms.
[2026-05-22 18:29:15] [INFO ] Implicit Places using invariants in 394 ms returned []
[2026-05-22 18:29:15] [INFO ] Invariant cache hit.
[2026-05-22 18:29:16] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 357/679 places, 882/1132 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2582 ms. Remains : 357/679 places, 882/1132 transitions.
[2026-05-22 18:29:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (19534 resets) in 1987 ms. (503 steps per ms)
BEST_FIRST walk for 4000003 steps (22950 resets) in 3472 ms. (1151 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-22 18:29:21] [INFO ] Invariant cache hit.
[2026-05-22 18:29:21] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2026-05-22 18:29:21] [INFO ] [Real]Absence check using 19 positive and 19 generalized place invariants in 56 ms returned sat
[2026-05-22 18:29:22] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2026-05-22 18:29:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:29:22] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2026-05-22 18:29:22] [INFO ] [Nat]Absence check using 19 positive and 19 generalized place invariants in 13 ms returned sat
[2026-05-22 18:29:22] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2026-05-22 18:29:22] [INFO ] Computed and/alt/rep : 179/853/179 causal constraints (skipped 681 transitions) in 70 ms.
[2026-05-22 18:29:23] [INFO ] Added : 24 causal constraints over 5 iterations in 685 ms. Result :sat
Minimization took 525 ms.
[2026-05-22 18:29:23] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2026-05-22 18:29:24] [INFO ] [Real]Absence check using 19 positive and 19 generalized place invariants in 3 ms returned sat
[2026-05-22 18:29:24] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2026-05-22 18:29:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:29:24] [INFO ] [Nat]Absence check using 19 positive place invariants in 23 ms returned sat
[2026-05-22 18:29:24] [INFO ] [Nat]Absence check using 19 positive and 19 generalized place invariants in 6 ms returned sat
[2026-05-22 18:29:24] [INFO ] [Nat]Absence check using state equation in 486 ms returned sat
[2026-05-22 18:29:24] [INFO ] Computed and/alt/rep : 179/853/179 causal constraints (skipped 681 transitions) in 50 ms.
[2026-05-22 18:29:25] [INFO ] Added : 21 causal constraints over 5 iterations in 427 ms. Result :sat
Minimization took 512 ms.
[2026-05-22 18:29:26] [INFO ] [Real]Absence check using 19 positive place invariants in 75 ms returned sat
[2026-05-22 18:29:26] [INFO ] [Real]Absence check using 19 positive and 19 generalized place invariants in 140 ms returned sat
[2026-05-22 18:29:26] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2026-05-22 18:29:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:29:26] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2026-05-22 18:29:26] [INFO ] [Nat]Absence check using 19 positive and 19 generalized place invariants in 5 ms returned sat
[2026-05-22 18:29:27] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2026-05-22 18:29:27] [INFO ] Computed and/alt/rep : 179/853/179 causal constraints (skipped 681 transitions) in 71 ms.
[2026-05-22 18:29:28] [INFO ] Added : 71 causal constraints over 15 iterations in 1117 ms. Result :sat
Minimization took 528 ms.
[2026-05-22 18:29:28] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2026-05-22 18:29:28] [INFO ] [Real]Absence check using 19 positive and 19 generalized place invariants in 5 ms returned sat
[2026-05-22 18:29:29] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2026-05-22 18:29:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:29:29] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2026-05-22 18:29:29] [INFO ] [Nat]Absence check using 19 positive and 19 generalized place invariants in 32 ms returned sat
[2026-05-22 18:29:29] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2026-05-22 18:29:29] [INFO ] Computed and/alt/rep : 179/853/179 causal constraints (skipped 681 transitions) in 88 ms.
[2026-05-22 18:29:30] [INFO ] Added : 17 causal constraints over 4 iterations in 441 ms. Result :sat
Minimization took 528 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA ASLink-PT-04a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-04a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 882/882 transitions.
Applied a total of 0 rules in 10 ms. Remains 357 /357 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 357/357 places, 882/882 transitions.
[2026-05-22 18:29:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (19360 resets) in 1971 ms. (507 steps per ms)
BEST_FIRST walk for 2000001 steps (11611 resets) in 1740 ms. (1148 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-22 18:29:34] [INFO ] Invariant cache hit.
[2026-05-22 18:29:35] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2026-05-22 18:29:35] [INFO ] [Real]Absence check using 19 positive and 19 generalized place invariants in 5 ms returned sat
[2026-05-22 18:29:35] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2026-05-22 18:29:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:29:35] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2026-05-22 18:29:35] [INFO ] [Nat]Absence check using 19 positive and 19 generalized place invariants in 6 ms returned sat
[2026-05-22 18:29:35] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2026-05-22 18:29:35] [INFO ] Computed and/alt/rep : 179/853/179 causal constraints (skipped 681 transitions) in 62 ms.
[2026-05-22 18:29:36] [INFO ] Added : 21 causal constraints over 5 iterations in 515 ms. Result :sat
Minimization took 531 ms.
[2026-05-22 18:29:36] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2026-05-22 18:29:36] [INFO ] [Real]Absence check using 19 positive and 19 generalized place invariants in 6 ms returned sat
[2026-05-22 18:29:37] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2026-05-22 18:29:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 18:29:37] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2026-05-22 18:29:37] [INFO ] [Nat]Absence check using 19 positive and 19 generalized place invariants in 6 ms returned sat
[2026-05-22 18:29:37] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2026-05-22 18:29:37] [INFO ] Computed and/alt/rep : 179/853/179 causal constraints (skipped 681 transitions) in 61 ms.
[2026-05-22 18:29:39] [INFO ] Added : 71 causal constraints over 15 iterations in 1259 ms. Result :sat
Minimization took 580 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 882/882 transitions.
Applied a total of 0 rules in 10 ms. Remains 357 /357 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 357/357 places, 882/882 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 882/882 transitions.
Applied a total of 0 rules in 10 ms. Remains 357 /357 variables (removed 0) and now considering 882/882 (removed 0) transitions.
[2026-05-22 18:29:40] [INFO ] Invariant cache hit.
[2026-05-22 18:29:40] [INFO ] Implicit Places using invariants in 345 ms returned []
[2026-05-22 18:29:40] [INFO ] Invariant cache hit.
[2026-05-22 18:29:41] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
[2026-05-22 18:29:41] [INFO ] Redundant transitions in 67 ms returned []
Running 860 sub problems to find dead transitions.
[2026-05-22 18:29:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 860 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 356/1239 variables, and 36 constraints, problems are : Problem set: 0 solved, 860 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/357 constraints, PredecessorRefiner: 860/860 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 860 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 3 (OVERLAPS) 1/357 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 860 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/1239 variables, and 38 constraints, problems are : Problem set: 0 solved, 860 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/357 constraints, PredecessorRefiner: 0/860 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60431ms problems are : Problem set: 0 solved, 860 unsolved
Search for dead transitions found 0 dead transitions in 60454ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61791 ms. Remains : 357/357 places, 882/882 transitions.
RANDOM walk for 40000 steps (814 resets) in 1086 ms. (36 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (236 resets) in 385 ms. (103 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (230 resets) in 212 ms. (187 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (221 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
[2026-05-22 18:30:42] [INFO ] Flatten gal took : 191 ms
BEST_FIRST walk for 40004 steps (216 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
[2026-05-22 18:30:42] [INFO ] Flatten gal took : 74 ms
[2026-05-22 18:30:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8548982708549882890.gal : 36 ms
[2026-05-22 18:30:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16006765298222922288.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8548982708549882890.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16006765298222922288.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16006765298222922288.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 44
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :44 after 328
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :328 after 8856
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :8856 after 17712
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :17712 after 20064
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :20064 after 20617
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :20617 after 23196
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :23196 after 350426
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,788876,0.515486,18192,2,10866,17,30709,6,0,2314,18503,0
Total reachable state count : 788876

Verifying 4 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.51819,18216,2,358,17,30709,7,0,2317,18503,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,0.520038,18384,2,358,17,30709,8,0,2318,18503,0
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,1,0.521103,18384,2,358,17,30709,9,0,2320,18503,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,1,0.52193,18384,2,358,17,30709,10,0,2321,18503,0
Interrupted probabilistic random walk after 249423 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 4
Probabilistic random walk after 249423 steps, saw 160584 distinct states, run finished after 3006 ms. (steps per millisecond=82 ) properties seen :0
FORMULA ASLink-PT-04a-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-04a-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-22 18:30:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (19435 resets) in 1915 ms. (521 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 217293 ms.

BK_STOP 1779474647622

--------------------
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-04a"
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-04a, 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-177944366200333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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