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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.3K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 920K 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-10a-UpperBounds-00
FORMULA_NAME ASLink-PT-10a-UpperBounds-01
FORMULA_NAME ASLink-PT-10a-UpperBounds-02
FORMULA_NAME ASLink-PT-10a-UpperBounds-03
FORMULA_NAME ASLink-PT-10a-UpperBounds-04
FORMULA_NAME ASLink-PT-10a-UpperBounds-05
FORMULA_NAME ASLink-PT-10a-UpperBounds-06
FORMULA_NAME ASLink-PT-10a-UpperBounds-07
FORMULA_NAME ASLink-PT-10a-UpperBounds-08
FORMULA_NAME ASLink-PT-10a-UpperBounds-09
FORMULA_NAME ASLink-PT-10a-UpperBounds-10
FORMULA_NAME ASLink-PT-10a-UpperBounds-11
FORMULA_NAME ASLink-PT-10a-UpperBounds-12
FORMULA_NAME ASLink-PT-10a-UpperBounds-13
FORMULA_NAME ASLink-PT-10a-UpperBounds-14
FORMULA_NAME ASLink-PT-10a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779488223758

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-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-22 22:17:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 22:17:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 22:17:05] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2026-05-22 22:17:05] [INFO ] Transformed 2186 places.
[2026-05-22 22:17:05] [INFO ] Transformed 3192 transitions.
[2026-05-22 22:17:05] [INFO ] Found NUPN structural information;
[2026-05-22 22:17:05] [INFO ] Parsed PT model containing 2186 places and 3192 transitions and 11972 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 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-6349318639473033178.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6598364385666467664.kers'
[2026-05-22 22:17:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6349318639473033178.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6598364385666467664.kers]
Culling duplicate invariants (modulo rational): removing 40 columns.
Culled 40 columns in 2 ms.
// Phase 1: matrix 3158 rows 2146 cols 11824 entries
Finished phase 1 with 839 SingleSign rule and 925 generalized
[2026-05-22 22:17:05] [INFO ] Computed 422 invariants in 30 ms
Computed 422 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-6598364385666467664.kers
Total runtime 35 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 (36 resets) in 124 ms. (80 steps per ms)
FORMULA ASLink-PT-10a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-10a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-10a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-10a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-10a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-10a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-10a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-10a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-10a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-10a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-10a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (15 resets) in 141 ms. (352 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-22 22:17:05] [INFO ] Invariant cache hit.
[2026-05-22 22:17:06] [INFO ] [Real]Absence check using 100 positive place invariants in 79 ms returned sat
[2026-05-22 22:17:06] [INFO ] [Real]Absence check using 100 positive and 322 generalized place invariants in 101 ms returned sat
[2026-05-22 22:17:08] [INFO ] [Real]Absence check using state equation in 1811 ms returned sat
[2026-05-22 22:17:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:17:09] [INFO ] [Nat]Absence check using 100 positive place invariants in 54 ms returned sat
[2026-05-22 22:17:09] [INFO ] [Nat]Absence check using 100 positive and 322 generalized place invariants in 97 ms returned sat
[2026-05-22 22:17:11] [INFO ] [Nat]Absence check using state equation in 2035 ms returned sat
[2026-05-22 22:17:11] [INFO ] Computed and/alt/rep : 1354/4738/1354 causal constraints (skipped 1803 transitions) in 178 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2026-05-22 22:17:14] [INFO ] [Real]Absence check using 100 positive place invariants in 53 ms returned sat
[2026-05-22 22:17:14] [INFO ] [Real]Absence check using 100 positive and 322 generalized place invariants in 139 ms returned sat
[2026-05-22 22:17:16] [INFO ] [Real]Absence check using state equation in 1585 ms returned sat
[2026-05-22 22:17:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:17:16] [INFO ] [Nat]Absence check using 100 positive place invariants in 72 ms returned sat
[2026-05-22 22:17:16] [INFO ] [Nat]Absence check using 100 positive and 322 generalized place invariants in 151 ms returned sat
[2026-05-22 22:17:18] [INFO ] [Nat]Absence check using state equation in 1656 ms returned sat
[2026-05-22 22:17:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 440 ms
[2026-05-22 22:17:19] [INFO ] Computed and/alt/rep : 1354/4738/1354 causal constraints (skipped 1803 transitions) in 200 ms.
[2026-05-22 22:17:20] [INFO ] Added : 15 causal constraints over 3 iterations in 1489 ms. Result :sat
Minimization took 561 ms.
[2026-05-22 22:17:21] [INFO ] [Real]Absence check using 100 positive place invariants in 47 ms returned sat
[2026-05-22 22:17:21] [INFO ] [Real]Absence check using 100 positive and 322 generalized place invariants in 137 ms returned sat
[2026-05-22 22:17:23] [INFO ] [Real]Absence check using state equation in 1382 ms returned sat
[2026-05-22 22:17:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:17:23] [INFO ] [Nat]Absence check using 100 positive place invariants in 52 ms returned sat
[2026-05-22 22:17:23] [INFO ] [Nat]Absence check using 100 positive and 322 generalized place invariants in 210 ms returned sat
[2026-05-22 22:17:25] [INFO ] [Nat]Absence check using state equation in 1203 ms returned sat
[2026-05-22 22:17:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 492 ms
[2026-05-22 22:17:25] [INFO ] Computed and/alt/rep : 1354/4738/1354 causal constraints (skipped 1803 transitions) in 173 ms.
[2026-05-22 22:17:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java: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 22:17:28] [INFO ] [Real]Absence check using 100 positive place invariants in 54 ms returned sat
[2026-05-22 22:17:28] [INFO ] [Real]Absence check using 100 positive and 322 generalized place invariants in 106 ms returned sat
[2026-05-22 22:17:30] [INFO ] [Real]Absence check using state equation in 1466 ms returned sat
[2026-05-22 22:17:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:17:30] [INFO ] [Nat]Absence check using 100 positive place invariants in 91 ms returned sat
[2026-05-22 22:17:31] [INFO ] [Nat]Absence check using 100 positive and 322 generalized place invariants in 130 ms returned sat
[2026-05-22 22:17:33] [INFO ] [Nat]Absence check using state equation in 2272 ms returned unknown
[2026-05-22 22:17:33] [INFO ] [Real]Absence check using 100 positive place invariants in 63 ms returned sat
[2026-05-22 22:17:33] [INFO ] [Real]Absence check using 100 positive and 322 generalized place invariants in 117 ms returned sat
[2026-05-22 22:17:35] [INFO ] [Real]Absence check using state equation in 1407 ms returned sat
[2026-05-22 22:17:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:17:35] [INFO ] [Nat]Absence check using 100 positive place invariants in 61 ms returned sat
[2026-05-22 22:17:35] [INFO ] [Nat]Absence check using 100 positive and 322 generalized place invariants in 91 ms returned sat
[2026-05-22 22:17:37] [INFO ] [Nat]Absence check using state equation in 1397 ms returned sat
[2026-05-22 22:17:37] [INFO ] Computed and/alt/rep : 1354/4738/1354 causal constraints (skipped 1803 transitions) in 301 ms.
[2026-05-22 22:17: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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 2186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2186/2186 places, 3158/3158 transitions.
Ensure Unique test removed 40 places
Discarding 19 places :
Implicit places reduction removed 19 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 261 rules applied. Total rules applied 261 place count 2127 transition count 2956
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 1 with 202 rules applied. Total rules applied 463 place count 1925 transition count 2956
Performed 209 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 209 Pre rules applied. Total rules applied 463 place count 1925 transition count 2747
Deduced a syphon composed of 209 places in 5 ms
Ensure Unique test removed 83 places
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 2 with 501 rules applied. Total rules applied 964 place count 1633 transition count 2747
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 2 with 1 rules applied. Total rules applied 965 place count 1633 transition count 2746
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 966 place count 1632 transition count 2746
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 979 place count 1619 transition count 2675
Ensure Unique test removed 1 places
Iterating global reduction 4 with 14 rules applied. Total rules applied 993 place count 1618 transition count 2675
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 4 with 6 rules applied. Total rules applied 999 place count 1617 transition count 2670
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1002 place count 1614 transition count 2670
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1003 place count 1613 transition count 2662
Iterating global reduction 6 with 1 rules applied. Total rules applied 1004 place count 1613 transition count 2662
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1005 place count 1612 transition count 2654
Iterating global reduction 6 with 1 rules applied. Total rules applied 1006 place count 1612 transition count 2654
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1007 place count 1611 transition count 2646
Iterating global reduction 6 with 1 rules applied. Total rules applied 1008 place count 1611 transition count 2646
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1009 place count 1610 transition count 2638
Iterating global reduction 6 with 1 rules applied. Total rules applied 1010 place count 1610 transition count 2638
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1011 place count 1609 transition count 2630
Iterating global reduction 6 with 1 rules applied. Total rules applied 1012 place count 1609 transition count 2630
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1013 place count 1608 transition count 2622
Iterating global reduction 6 with 1 rules applied. Total rules applied 1014 place count 1608 transition count 2622
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1015 place count 1607 transition count 2614
Iterating global reduction 6 with 1 rules applied. Total rules applied 1016 place count 1607 transition count 2614
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1017 place count 1606 transition count 2606
Iterating global reduction 6 with 1 rules applied. Total rules applied 1018 place count 1606 transition count 2606
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1019 place count 1605 transition count 2598
Iterating global reduction 6 with 1 rules applied. Total rules applied 1020 place count 1605 transition count 2598
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1021 place count 1604 transition count 2590
Iterating global reduction 6 with 1 rules applied. Total rules applied 1022 place count 1604 transition count 2590
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1023 place count 1603 transition count 2582
Iterating global reduction 6 with 1 rules applied. Total rules applied 1024 place count 1603 transition count 2582
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1025 place count 1602 transition count 2574
Iterating global reduction 6 with 1 rules applied. Total rules applied 1026 place count 1602 transition count 2574
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1027 place count 1601 transition count 2566
Iterating global reduction 6 with 1 rules applied. Total rules applied 1028 place count 1601 transition count 2566
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1029 place count 1600 transition count 2558
Iterating global reduction 6 with 1 rules applied. Total rules applied 1030 place count 1600 transition count 2558
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1031 place count 1599 transition count 2550
Iterating global reduction 6 with 1 rules applied. Total rules applied 1032 place count 1599 transition count 2550
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1033 place count 1598 transition count 2542
Iterating global reduction 6 with 1 rules applied. Total rules applied 1034 place count 1598 transition count 2542
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 3 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 6 with 138 rules applied. Total rules applied 1172 place count 1529 transition count 2473
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1180 place count 1529 transition count 2465
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1188 place count 1521 transition count 2465
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 1199 place count 1521 transition count 2465
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1200 place count 1520 transition count 2464
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 1219 place count 1501 transition count 2464
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 37 Pre rules applied. Total rules applied 1219 place count 1501 transition count 2427
Deduced a syphon composed of 37 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 8 with 75 rules applied. Total rules applied 1294 place count 1463 transition count 2427
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 8 with 11 rules applied. Total rules applied 1305 place count 1452 transition count 2427
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1305 place count 1452 transition count 2426
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1307 place count 1451 transition count 2426
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1329 place count 1440 transition count 2415
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 1339 place count 1430 transition count 2405
Iterating global reduction 9 with 10 rules applied. Total rules applied 1349 place count 1430 transition count 2405
Free-agglomeration rule applied 10 times.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1359 place count 1430 transition count 2395
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1369 place count 1420 transition count 2395
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 10 with 10 rules applied. Total rules applied 1379 place count 1420 transition count 2395
Applied a total of 1379 rules in 2658 ms. Remains 1420 /2186 variables (removed 766) and now considering 2395/3158 (removed 763) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2666 ms. Remains : 1420/2186 places, 2395/3158 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6776814788682600382.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9016867770712062329.kers'
[2026-05-22 22:17:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6776814788682600382.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9016867770712062329.kers]
Culling duplicate invariants (modulo rational): removing 23 columns.
Culled 23 columns in 5 ms.
// Phase 1: matrix 2395 rows 1397 cols 9382 entries
Finished phase 1 with 357 SingleSign rule and 816 generalized
[2026-05-22 22:17:43] [INFO ] Computed 247 invariants in 59 ms
Computed 247 P flows in 60 ms.
Exported basis to /tmp/petrispot-output-9016867770712062329.kers
Total runtime 62 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (9441 resets) in 4110 ms. (243 steps per ms)
FORMULA ASLink-PT-10a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000004 steps (3629 resets) in 7313 ms. (546 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-22 22:17:54] [INFO ] Invariant cache hit.
[2026-05-22 22:17:54] [INFO ] [Real]Absence check using 93 positive place invariants in 44 ms returned sat
[2026-05-22 22:17:54] [INFO ] [Real]Absence check using 93 positive and 154 generalized place invariants in 63 ms returned sat
[2026-05-22 22:17:55] [INFO ] [Real]Absence check using state equation in 917 ms returned sat
[2026-05-22 22:17:56] [INFO ] Computed and/alt/rep : 959/3597/959 causal constraints (skipped 1387 transitions) in 149 ms.
[2026-05-22 22:17:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:17:56] [INFO ] [Nat]Absence check using 93 positive place invariants in 28 ms returned sat
[2026-05-22 22:17:56] [INFO ] [Nat]Absence check using 93 positive and 154 generalized place invariants in 42 ms returned sat
[2026-05-22 22:17:58] [INFO ] [Nat]Absence check using state equation in 1235 ms returned sat
[2026-05-22 22:17:58] [INFO ] Computed and/alt/rep : 959/3597/959 causal constraints (skipped 1387 transitions) in 142 ms.
[2026-05-22 22:18:18] [INFO ] Added : 665 causal constraints over 133 iterations in 20063 ms.(timeout) Result :sat
Minimization took 1491 ms.
[2026-05-22 22:18:20] [INFO ] [Real]Absence check using 93 positive place invariants in 21 ms returned sat
[2026-05-22 22:18:20] [INFO ] [Real]Absence check using 93 positive and 154 generalized place invariants in 53 ms returned sat
[2026-05-22 22:18:21] [INFO ] [Real]Absence check using state equation in 1004 ms returned sat
[2026-05-22 22:18:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:18:21] [INFO ] [Nat]Absence check using 93 positive place invariants in 24 ms returned sat
[2026-05-22 22:18:21] [INFO ] [Nat]Absence check using 93 positive and 154 generalized place invariants in 32 ms returned sat
[2026-05-22 22:18:22] [INFO ] [Nat]Absence check using state equation in 875 ms returned sat
[2026-05-22 22:18:22] [INFO ] Computed and/alt/rep : 959/3597/959 causal constraints (skipped 1387 transitions) in 121 ms.
[2026-05-22 22:18:42] [INFO ] Added : 675 causal constraints over 135 iterations in 20047 ms.(timeout) Result :sat
Minimization took 2097 ms.
[2026-05-22 22:18:44] [INFO ] [Real]Absence check using 93 positive place invariants in 32 ms returned sat
[2026-05-22 22:18:45] [INFO ] [Real]Absence check using 93 positive and 154 generalized place invariants in 32 ms returned sat
[2026-05-22 22:18:45] [INFO ] [Real]Absence check using state equation in 822 ms returned sat
[2026-05-22 22:18:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:18:46] [INFO ] [Nat]Absence check using 93 positive place invariants in 23 ms returned sat
[2026-05-22 22:18:46] [INFO ] [Nat]Absence check using 93 positive and 154 generalized place invariants in 69 ms returned sat
[2026-05-22 22:18:47] [INFO ] [Nat]Absence check using state equation in 1474 ms returned sat
[2026-05-22 22:18:47] [INFO ] Computed and/alt/rep : 959/3597/959 causal constraints (skipped 1387 transitions) in 151 ms.
[2026-05-22 22:19:00] [INFO ] Added : 267 causal constraints over 54 iterations in 12410 ms. Result :sat
Minimization took 1321 ms.
[2026-05-22 22:19:01] [INFO ] [Real]Absence check using 93 positive place invariants in 40 ms returned sat
[2026-05-22 22:19:01] [INFO ] [Real]Absence check using 93 positive and 154 generalized place invariants in 54 ms returned sat
[2026-05-22 22:19:02] [INFO ] [Real]Absence check using state equation in 819 ms returned sat
[2026-05-22 22:19:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:19:03] [INFO ] [Nat]Absence check using 93 positive place invariants in 25 ms returned sat
[2026-05-22 22:19:03] [INFO ] [Nat]Absence check using 93 positive and 154 generalized place invariants in 33 ms returned sat
[2026-05-22 22:19:04] [INFO ] [Nat]Absence check using state equation in 937 ms returned sat
[2026-05-22 22:19:04] [INFO ] Computed and/alt/rep : 959/3597/959 causal constraints (skipped 1387 transitions) in 112 ms.
[2026-05-22 22:19:24] [INFO ] Added : 625 causal constraints over 125 iterations in 20307 ms.(timeout) Result :sat
Minimization took 1248 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 1420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1420/1420 places, 2395/2395 transitions.
Applied a total of 0 rules in 65 ms. Remains 1420 /1420 variables (removed 0) and now considering 2395/2395 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1420/1420 places, 2395/2395 transitions.
[2026-05-22 22:19:34] [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 (9303 resets) in 3736 ms. (267 steps per ms)
BEST_FIRST walk for 4000004 steps (3635 resets) in 7145 ms. (559 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-22 22:19:45] [INFO ] Invariant cache hit.
[2026-05-22 22:19:45] [INFO ] [Real]Absence check using 93 positive place invariants in 23 ms returned sat
[2026-05-22 22:19:45] [INFO ] [Real]Absence check using 93 positive and 154 generalized place invariants in 65 ms returned sat
[2026-05-22 22:19:46] [INFO ] [Real]Absence check using state equation in 848 ms returned sat
[2026-05-22 22:19:47] [INFO ] Computed and/alt/rep : 959/3597/959 causal constraints (skipped 1387 transitions) in 122 ms.
[2026-05-22 22:19:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:19:47] [INFO ] [Nat]Absence check using 93 positive place invariants in 27 ms returned sat
[2026-05-22 22:19:47] [INFO ] [Nat]Absence check using 93 positive and 154 generalized place invariants in 48 ms returned sat
[2026-05-22 22:19:48] [INFO ] [Nat]Absence check using state equation in 975 ms returned sat
[2026-05-22 22:19:48] [INFO ] Computed and/alt/rep : 959/3597/959 causal constraints (skipped 1387 transitions) in 103 ms.
[2026-05-22 22:20:08] [INFO ] Added : 726 causal constraints over 146 iterations in 19717 ms. Result :sat
Minimization took 1396 ms.
[2026-05-22 22:20:10] [INFO ] [Real]Absence check using 93 positive place invariants in 31 ms returned sat
[2026-05-22 22:20:10] [INFO ] [Real]Absence check using 93 positive and 154 generalized place invariants in 39 ms returned sat
[2026-05-22 22:20:11] [INFO ] [Real]Absence check using state equation in 904 ms returned sat
[2026-05-22 22:20:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:20:11] [INFO ] [Nat]Absence check using 93 positive place invariants in 44 ms returned sat
[2026-05-22 22:20:11] [INFO ] [Nat]Absence check using 93 positive and 154 generalized place invariants in 62 ms returned sat
[2026-05-22 22:20:13] [INFO ] [Nat]Absence check using state equation in 2174 ms returned sat
[2026-05-22 22:20:14] [INFO ] Computed and/alt/rep : 959/3597/959 causal constraints (skipped 1387 transitions) in 272 ms.
[2026-05-22 22:20:33] [INFO ] Added : 575 causal constraints over 115 iterations in 20144 ms.(timeout) Result :sat
Minimization took 2669 ms.
[2026-05-22 22:20:36] [INFO ] [Real]Absence check using 93 positive place invariants in 27 ms returned sat
[2026-05-22 22:20:37] [INFO ] [Real]Absence check using 93 positive and 154 generalized place invariants in 41 ms returned sat
[2026-05-22 22:20:37] [INFO ] [Real]Absence check using state equation in 873 ms returned sat
[2026-05-22 22:20:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:20:38] [INFO ] [Nat]Absence check using 93 positive place invariants in 45 ms returned sat
[2026-05-22 22:20:38] [INFO ] [Nat]Absence check using 93 positive and 154 generalized place invariants in 44 ms returned sat
[2026-05-22 22:20:39] [INFO ] [Nat]Absence check using state equation in 1210 ms returned sat
[2026-05-22 22:20:39] [INFO ] Computed and/alt/rep : 959/3597/959 causal constraints (skipped 1387 transitions) in 136 ms.
[2026-05-22 22:20:50] [INFO ] Added : 267 causal constraints over 54 iterations in 10959 ms. Result :sat
Minimization took 1322 ms.
[2026-05-22 22:20:52] [INFO ] [Real]Absence check using 93 positive place invariants in 22 ms returned sat
[2026-05-22 22:20:52] [INFO ] [Real]Absence check using 93 positive and 154 generalized place invariants in 32 ms returned sat
[2026-05-22 22:20:53] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2026-05-22 22:20:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:20:53] [INFO ] [Nat]Absence check using 93 positive place invariants in 24 ms returned sat
[2026-05-22 22:20:53] [INFO ] [Nat]Absence check using 93 positive and 154 generalized place invariants in 57 ms returned sat
[2026-05-22 22:20:54] [INFO ] [Nat]Absence check using state equation in 745 ms returned sat
[2026-05-22 22:20:54] [INFO ] Computed and/alt/rep : 959/3597/959 causal constraints (skipped 1387 transitions) in 103 ms.
[2026-05-22 22:21:14] [INFO ] Added : 605 causal constraints over 121 iterations in 20055 ms.(timeout) Result :sat
Minimization took 1442 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 1420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1420/1420 places, 2395/2395 transitions.
Applied a total of 0 rules in 65 ms. Remains 1420 /1420 variables (removed 0) and now considering 2395/2395 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1420/1420 places, 2395/2395 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1420/1420 places, 2395/2395 transitions.
Applied a total of 0 rules in 62 ms. Remains 1420 /1420 variables (removed 0) and now considering 2395/2395 (removed 0) transitions.
[2026-05-22 22:21:27] [INFO ] Invariant cache hit.
[2026-05-22 22:21:29] [INFO ] Implicit Places using invariants in 1328 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 151, 152, 153, 171, 189, 258, 262, 263, 274, 275, 276, 294, 312, 381, 385, 386, 397, 398, 399, 417, 435, 504, 508, 509, 520, 521, 522, 540, 558, 627, 631, 632, 643, 644, 645, 663, 681, 757, 771, 772, 773, 791, 809, 878, 882, 883, 894, 895, 896, 914, 932, 1001, 1005, 1006, 1017, 1018, 1019, 1037, 1055, 1124, 1128, 1129, 1140, 1141, 1142, 1160, 1178, 1247, 1251, 1252, 1255, 1266, 1267, 1268, 1286, 1288, 1291, 1309, 1310, 1311, 1312, 1324, 1330, 1336, 1342, 1348, 1354, 1360, 1366, 1372, 1378, 1384]
[2026-05-22 22:21:29] [INFO ] Actually due to overlaps returned [1286, 1268, 30, 48, 153, 171, 276, 294, 399, 417, 522, 540, 645, 663, 773, 791, 896, 914, 1019, 1037, 1142, 1160, 1291, 152, 275, 398, 521, 644, 772, 895, 1018, 1141, 1267, 1310, 151, 274, 397, 520, 643, 771, 894, 1017, 1140, 1266, 1288, 1309, 0, 262, 263, 385, 386, 508, 509, 631, 632, 757, 882, 883, 1005, 1006, 1128, 1129, 1251, 1252, 18, 19, 66, 189, 312, 435, 558, 681, 809, 932, 1055, 1178, 1312, 1354, 1372, 1384, 139, 1255, 1311, 1324, 1330, 1336, 1342, 1348, 1360, 1366, 1378]
Discarding 91 places :
Implicit Place search using SMT only with invariants took 1338 ms to find 91 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1329/1420 places, 2395/2395 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 180 transitions
Trivial Post-agglo rules discarded 180 transitions
Performed 180 trivial Post agglomeration. Transition count delta: 180
Iterating post reduction 0 with 189 rules applied. Total rules applied 189 place count 1320 transition count 2215
Reduce places removed 180 places and 0 transitions.
Iterating post reduction 1 with 180 rules applied. Total rules applied 369 place count 1140 transition count 2215
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 369 place count 1140 transition count 2168
Deduced a syphon composed of 47 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 95 rules applied. Total rules applied 464 place count 1092 transition count 2168
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 476 place count 1088 transition count 2160
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 484 place count 1080 transition count 2160
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 499 place count 1065 transition count 2145
Iterating global reduction 4 with 15 rules applied. Total rules applied 514 place count 1065 transition count 2145
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 517 place count 1065 transition count 2142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 517 place count 1065 transition count 2141
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 519 place count 1064 transition count 2141
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 522 place count 1061 transition count 2138
Iterating global reduction 5 with 3 rules applied. Total rules applied 525 place count 1061 transition count 2138
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 526 place count 1060 transition count 2137
Iterating global reduction 5 with 1 rules applied. Total rules applied 527 place count 1060 transition count 2137
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 528 place count 1059 transition count 2136
Iterating global reduction 5 with 1 rules applied. Total rules applied 529 place count 1059 transition count 2136
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 3 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 5 with 166 rules applied. Total rules applied 695 place count 976 transition count 2053
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 704 place count 976 transition count 2044
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 713 place count 967 transition count 2035
Iterating global reduction 6 with 9 rules applied. Total rules applied 722 place count 967 transition count 2035
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 731 place count 967 transition count 2026
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 7 with 23 rules applied. Total rules applied 754 place count 967 transition count 2003
Ensure Unique test removed 2 places
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 779 place count 942 transition count 2003
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 780 place count 942 transition count 2002
Partial Free-agglomeration rule applied 31 times.
Drop transitions (Partial Free agglomeration) removed 31 transitions
Iterating global reduction 8 with 31 rules applied. Total rules applied 811 place count 942 transition count 2002
Applied a total of 811 rules in 724 ms. Remains 942 /1329 variables (removed 387) and now considering 2002/2395 (removed 393) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11896170796370117648.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13865623923816767785.kers'
[2026-05-22 22:21:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11896170796370117648.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13865623923816767785.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 7 ms.
// Phase 1: matrix 2002 rows 941 cols 8225 entries
Finished phase 1 with 286 SingleSign rule and 516 generalized
[2026-05-22 22:21:30] [INFO ] Computed 140 invariants in 43 ms
Computed 140 P flows in 44 ms.
Exported basis to /tmp/petrispot-output-13865623923816767785.kers
Total runtime 46 ms.
[2026-05-22 22:21:30] [INFO ] Implicit Places using invariants in 882 ms returned [72, 89, 95, 98, 100, 103, 104, 156, 173, 179, 182, 184, 189, 190, 242, 259, 265, 268, 270, 275, 276, 328, 345, 351, 354, 356, 361, 362, 414, 431, 437, 440, 442, 447, 448, 517, 523, 526, 528, 532, 539, 540, 593, 610, 616, 619, 621, 626, 627, 679, 696, 702, 705, 707, 712, 713, 765, 782, 788, 791, 793, 798, 799, 851, 868, 874, 877, 879]
[2026-05-22 22:21:30] [INFO ] Actually due to overlaps returned [103, 189, 275, 361, 447, 539, 626, 712, 798, 104, 190, 276, 362, 448, 540, 627, 713, 799, 89, 95, 100, 173, 179, 184, 259, 265, 270, 345, 351, 356, 431, 437, 442, 517, 523, 528, 610, 616, 621, 696, 702, 707, 782, 788, 793, 868, 874, 879, 72, 156, 242, 328, 414, 532, 593, 679, 765, 851]
Discarding 58 places :
Implicit Place search using SMT only with invariants took 886 ms to find 58 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 884/1420 places, 2002/2395 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 843 transition count 1961
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 843 transition count 1961
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 833 transition count 1951
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 833 transition count 1951
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 140 place count 814 transition count 1932
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 170 place count 814 transition count 1902
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 200 place count 784 transition count 1902
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 209 place count 784 transition count 1893
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 218 place count 775 transition count 1893
Applied a total of 218 rules in 251 ms. Remains 775 /884 variables (removed 109) and now considering 1893/2002 (removed 109) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10803059286266384723.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-566845359347439388.kers'
[2026-05-22 22:21:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10803059286266384723.kers, --Pflows, --basisKERS=/tmp/petrispot-output-566845359347439388.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 1893 rows 774 cols 7738 entries
Finished phase 1 with 266 SingleSign rule and 427 generalized
[2026-05-22 22:21:31] [INFO ] Computed 82 invariants in 48 ms
Computed 82 P flows in 49 ms.
Exported basis to /tmp/petrispot-output-566845359347439388.kers
Total runtime 53 ms.
[2026-05-22 22:21:31] [INFO ] Implicit Places using invariants in 654 ms returned []
[2026-05-22 22:21:31] [INFO ] Invariant cache hit.
[2026-05-22 22:21:33] [INFO ] Implicit Places using invariants and state equation in 1943 ms returned []
Implicit Place search using SMT with State Equation took 2622 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 775/1420 places, 1893/2395 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5893 ms. Remains : 775/1420 places, 1893/2395 transitions.
[2026-05-22 22:21:33] [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 (16025 resets) in 3066 ms. (326 steps per ms)
BEST_FIRST walk for 4000003 steps (8604 resets) in 4299 ms. (930 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-22 22:21:41] [INFO ] Invariant cache hit.
[2026-05-22 22:21:41] [INFO ] [Real]Absence check using 39 positive place invariants in 14 ms returned sat
[2026-05-22 22:21:41] [INFO ] [Real]Absence check using 39 positive and 43 generalized place invariants in 28 ms returned sat
[2026-05-22 22:21:42] [INFO ] [Real]Absence check using state equation in 729 ms returned sat
[2026-05-22 22:21:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:21:42] [INFO ] [Nat]Absence check using 39 positive place invariants in 26 ms returned sat
[2026-05-22 22:21:42] [INFO ] [Nat]Absence check using 39 positive and 43 generalized place invariants in 11 ms returned sat
[2026-05-22 22:21:42] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2026-05-22 22:21:43] [INFO ] Computed and/alt/rep : 438/1872/438 causal constraints (skipped 1409 transitions) in 117 ms.
[2026-05-22 22:21:43] [INFO ] Added : 30 causal constraints over 6 iterations in 949 ms. Result :sat
Minimization took 1176 ms.
[2026-05-22 22:21:45] [INFO ] [Real]Absence check using 39 positive place invariants in 34 ms returned sat
[2026-05-22 22:21:45] [INFO ] [Real]Absence check using 39 positive and 43 generalized place invariants in 11 ms returned sat
[2026-05-22 22:21:46] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2026-05-22 22:21:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:21:46] [INFO ] [Nat]Absence check using 39 positive place invariants in 27 ms returned sat
[2026-05-22 22:21:46] [INFO ] [Nat]Absence check using 39 positive and 43 generalized place invariants in 9 ms returned sat
[2026-05-22 22:21:47] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2026-05-22 22:21:47] [INFO ] Computed and/alt/rep : 438/1872/438 causal constraints (skipped 1409 transitions) in 115 ms.
[2026-05-22 22:21:48] [INFO ] Added : 31 causal constraints over 7 iterations in 1082 ms. Result :sat
Minimization took 1184 ms.
[2026-05-22 22:21:49] [INFO ] [Real]Absence check using 39 positive place invariants in 13 ms returned sat
[2026-05-22 22:21:49] [INFO ] [Real]Absence check using 39 positive and 43 generalized place invariants in 10 ms returned sat
[2026-05-22 22:21:50] [INFO ] [Real]Absence check using state equation in 553 ms returned sat
[2026-05-22 22:21:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:21:50] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2026-05-22 22:21:50] [INFO ] [Nat]Absence check using 39 positive and 43 generalized place invariants in 11 ms returned sat
[2026-05-22 22:21:51] [INFO ] [Nat]Absence check using state equation in 714 ms returned sat
[2026-05-22 22:21:51] [INFO ] Computed and/alt/rep : 438/1872/438 causal constraints (skipped 1409 transitions) in 131 ms.
[2026-05-22 22:21:53] [INFO ] Added : 66 causal constraints over 14 iterations in 1854 ms. Result :sat
Minimization took 1465 ms.
[2026-05-22 22:21:54] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2026-05-22 22:21:54] [INFO ] [Real]Absence check using 39 positive and 43 generalized place invariants in 25 ms returned sat
[2026-05-22 22:21:56] [INFO ] [Real]Absence check using state equation in 1135 ms returned sat
[2026-05-22 22:21:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:21:56] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2026-05-22 22:21:56] [INFO ] [Nat]Absence check using 39 positive and 43 generalized place invariants in 24 ms returned sat
[2026-05-22 22:21:56] [INFO ] [Nat]Absence check using state equation in 656 ms returned sat
[2026-05-22 22:21:57] [INFO ] Computed and/alt/rep : 438/1872/438 causal constraints (skipped 1409 transitions) in 127 ms.
[2026-05-22 22:21:59] [INFO ] Added : 95 causal constraints over 19 iterations in 2910 ms. Result :sat
Minimization took 1222 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA ASLink-PT-10a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 775 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p209) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 775/775 places, 1892/1892 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 775 transition count 1891
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 773 transition count 1891
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 773 transition count 1890
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 772 transition count 1890
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 771 transition count 1889
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 771 transition count 1888
Applied a total of 8 rules in 80 ms. Remains 771 /775 variables (removed 4) and now considering 1888/1892 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 771/775 places, 1888/1892 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9597496154839226314.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16122018932275376451.kers'
[2026-05-22 22:22:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9597496154839226314.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16122018932275376451.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 1888 rows 770 cols 7695 entries
Finished phase 1 with 263 SingleSign rule and 427 generalized
[2026-05-22 22:22:03] [INFO ] Computed 81 invariants in 35 ms
Computed 81 P flows in 36 ms.
Exported basis to /tmp/petrispot-output-16122018932275376451.kers
Total runtime 37 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (16279 resets) in 2872 ms. (348 steps per ms)
BEST_FIRST walk for 1000001 steps (2203 resets) in 990 ms. (1009 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-22 22:22:07] [INFO ] Invariant cache hit.
[2026-05-22 22:22:07] [INFO ] [Real]Absence check using 41 positive place invariants in 19 ms returned sat
[2026-05-22 22:22:07] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 10 ms returned sat
[2026-05-22 22:22:08] [INFO ] [Real]Absence check using state equation in 676 ms returned sat
[2026-05-22 22:22:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:22:08] [INFO ] [Nat]Absence check using 41 positive place invariants in 15 ms returned sat
[2026-05-22 22:22:08] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 8 ms returned sat
[2026-05-22 22:22:09] [INFO ] [Nat]Absence check using state equation in 657 ms returned sat
[2026-05-22 22:22:09] [INFO ] Computed and/alt/rep : 426/1882/426 causal constraints (skipped 1416 transitions) in 128 ms.
[2026-05-22 22:22:12] [INFO ] Added : 109 causal constraints over 22 iterations in 3597 ms. Result :sat
Minimization took 1902 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1888/1888 transitions.
Applied a total of 0 rules in 36 ms. Remains 771 /771 variables (removed 0) and now considering 1888/1888 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 771/771 places, 1888/1888 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1888/1888 transitions.
Applied a total of 0 rules in 32 ms. Remains 771 /771 variables (removed 0) and now considering 1888/1888 (removed 0) transitions.
[2026-05-22 22:22:15] [INFO ] Invariant cache hit.
[2026-05-22 22:22:16] [INFO ] Implicit Places using invariants in 679 ms returned [415, 432]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 683 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 769/771 places, 1888/1888 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 768 transition count 1887
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 768 transition count 1886
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 767 transition count 1886
Applied a total of 4 rules in 156 ms. Remains 767 /769 variables (removed 2) and now considering 1886/1888 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3649506342746016917.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13886856446780036970.kers'
[2026-05-22 22:22:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3649506342746016917.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13886856446780036970.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1886 rows 767 cols 7703 entries
Finished phase 1 with 262 SingleSign rule and 426 generalized
[2026-05-22 22:22:16] [INFO ] Computed 79 invariants in 45 ms
Computed 79 P flows in 46 ms.
Exported basis to /tmp/petrispot-output-13886856446780036970.kers
Total runtime 48 ms.
[2026-05-22 22:22:17] [INFO ] Implicit Places using invariants in 875 ms returned []
[2026-05-22 22:22:17] [INFO ] Invariant cache hit.
[2026-05-22 22:22:19] [INFO ] Implicit Places using invariants and state equation in 1886 ms returned []
Implicit Place search using SMT with State Equation took 2763 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 767/771 places, 1886/1888 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3634 ms. Remains : 767/771 places, 1886/1888 transitions.
[2026-05-22 22:22:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (16221 resets) in 2967 ms. (336 steps per ms)
BEST_FIRST walk for 1000001 steps (2207 resets) in 1047 ms. (954 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-22 22:22:23] [INFO ] Invariant cache hit.
[2026-05-22 22:22:23] [INFO ] [Real]Absence check using 42 positive place invariants in 19 ms returned sat
[2026-05-22 22:22:23] [INFO ] [Real]Absence check using 42 positive and 37 generalized place invariants in 26 ms returned sat
[2026-05-22 22:22:24] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2026-05-22 22:22:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:22:24] [INFO ] [Nat]Absence check using 42 positive place invariants in 24 ms returned sat
[2026-05-22 22:22:24] [INFO ] [Nat]Absence check using 42 positive and 37 generalized place invariants in 10 ms returned sat
[2026-05-22 22:22:25] [INFO ] [Nat]Absence check using state equation in 758 ms returned sat
[2026-05-22 22:22:25] [INFO ] Computed and/alt/rep : 433/1841/433 causal constraints (skipped 1407 transitions) in 96 ms.
[2026-05-22 22:22:26] [INFO ] Added : 46 causal constraints over 10 iterations in 1354 ms. Result :sat
Minimization took 1011 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 767/767 places, 1886/1886 transitions.
Applied a total of 0 rules in 71 ms. Remains 767 /767 variables (removed 0) and now considering 1886/1886 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 767/767 places, 1886/1886 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 767/767 places, 1886/1886 transitions.
Applied a total of 0 rules in 57 ms. Remains 767 /767 variables (removed 0) and now considering 1886/1886 (removed 0) transitions.
[2026-05-22 22:22:28] [INFO ] Invariant cache hit.
[2026-05-22 22:22:29] [INFO ] Implicit Places using invariants in 789 ms returned []
[2026-05-22 22:22:29] [INFO ] Invariant cache hit.
[2026-05-22 22:22:31] [INFO ] Implicit Places using invariants and state equation in 1962 ms returned []
Implicit Place search using SMT with State Equation took 2787 ms to find 0 implicit places.
[2026-05-22 22:22:31] [INFO ] Redundant transitions in 141 ms returned []
Running 1840 sub problems to find dead transitions.
[2026-05-22 22:22:31] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 30931ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 30968ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34003 ms. Remains : 767/767 places, 1886/1886 transitions.
RANDOM walk for 40000 steps (639 resets) in 959 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (86 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (85 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
[2026-05-22 22:23:02] [INFO ] Flatten gal took : 193 ms
[2026-05-22 22:23:03] [INFO ] Flatten gal took : 116 ms
[2026-05-22 22:23:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11281874852461594446.gal : 60 ms
[2026-05-22 22:23:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14904994286084671273.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/ReachabilityCardinality11281874852461594446.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14904994286084671273.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 ...330
Loading property file /tmp/ReachabilityCardinality14904994286084671273.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 44
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :44 after 328
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :328 after 2448
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2448 after 136384
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :136384 after 5.67148e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5.67148e+07 after 3.47047e+09
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3.47047e+09 after 3.57426e+09
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3.57426e+09 after 3.57475e+09
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3.57475e+09 after 1.36156e+11
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.43323e+12,2.10916,50752,2,35856,17,100953,6,0,4954,69310,0
Total reachable state count : 2433230335856

Verifying 2 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,2,2.12066,50752,2,808,17,100953,7,0,4957,69310,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,2,2.13004,50752,2,808,17,100953,8,0,4958,69310,0
Interrupted probabilistic random walk after 159413 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 2
Probabilistic random walk after 159413 steps, saw 103235 distinct states, run finished after 3004 ms. (steps per millisecond=53 ) properties seen :0
FORMULA ASLink-PT-10a-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-22 22:23:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (16133 resets) in 3035 ms. (329 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 363805 ms.

BK_STOP 1779488588873

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

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