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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 980K
-rw-r--r-- 1 mcc users 6.0K Mar 5 14:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 5 14:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 5 14:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 5 14:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Mar 5 14:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 5 14:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 5 14:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 5 14:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 597K 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-06a-UpperBounds-00
FORMULA_NAME ASLink-PT-06a-UpperBounds-01
FORMULA_NAME ASLink-PT-06a-UpperBounds-02
FORMULA_NAME ASLink-PT-06a-UpperBounds-03
FORMULA_NAME ASLink-PT-06a-UpperBounds-04
FORMULA_NAME ASLink-PT-06a-UpperBounds-05
FORMULA_NAME ASLink-PT-06a-UpperBounds-06
FORMULA_NAME ASLink-PT-06a-UpperBounds-07
FORMULA_NAME ASLink-PT-06a-UpperBounds-08
FORMULA_NAME ASLink-PT-06a-UpperBounds-09
FORMULA_NAME ASLink-PT-06a-UpperBounds-10
FORMULA_NAME ASLink-PT-06a-UpperBounds-11
FORMULA_NAME ASLink-PT-06a-UpperBounds-12
FORMULA_NAME ASLink-PT-06a-UpperBounds-13
FORMULA_NAME ASLink-PT-06a-UpperBounds-14
FORMULA_NAME ASLink-PT-06a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779478360139

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-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-22 19:32:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 19:32:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 19:32:41] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2026-05-22 19:32:41] [INFO ] Transformed 1406 places.
[2026-05-22 19:32:41] [INFO ] Transformed 2100 transitions.
[2026-05-22 19:32:41] [INFO ] Found NUPN structural information;
[2026-05-22 19:32:41] [INFO ] Parsed PT model containing 1406 places and 2100 transitions and 7896 arcs in 346 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 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-17645541296897698914.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14262728905473170087.kers'
[2026-05-22 19:32:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17645541296897698914.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14262728905473170087.kers]
Culling duplicate invariants (modulo rational): removing 24 columns.
Culled 24 columns in 1 ms.
// Phase 1: matrix 2078 rows 1382 cols 7804 entries
Finished phase 1 with 529 SingleSign rule and 607 generalized
[2026-05-22 19:32:42] [INFO ] Computed 270 invariants in 16 ms
Computed 270 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-14262728905473170087.kers
Total runtime 18 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 (51 resets) in 65 ms. (151 steps per ms)
FORMULA ASLink-PT-06a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-06a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (52 resets) in 152 ms. (457 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2026-05-22 19:32:42] [INFO ] Invariant cache hit.
[2026-05-22 19:32:42] [INFO ] [Real]Absence check using 62 positive place invariants in 62 ms returned sat
[2026-05-22 19:32:42] [INFO ] [Real]Absence check using 62 positive and 208 generalized place invariants in 84 ms returned sat
[2026-05-22 19:32:44] [INFO ] [Real]Absence check using state equation in 1173 ms returned sat
[2026-05-22 19:32:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:32:44] [INFO ] [Nat]Absence check using 62 positive place invariants in 44 ms returned sat
[2026-05-22 19:32:44] [INFO ] [Nat]Absence check using 62 positive and 208 generalized place invariants in 61 ms returned sat
[2026-05-22 19:32:45] [INFO ] [Nat]Absence check using state equation in 949 ms returned sat
[2026-05-22 19:32:46] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 192 ms.
Maximisation of solution failed !
Minimization took 4 ms.
[2026-05-22 19:32:49] [INFO ] [Real]Absence check using 62 positive place invariants in 32 ms returned sat
[2026-05-22 19:32:49] [INFO ] [Real]Absence check using 62 positive and 208 generalized place invariants in 119 ms returned sat
[2026-05-22 19:32:50] [INFO ] [Real]Absence check using state equation in 866 ms returned sat
[2026-05-22 19:32:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:32:50] [INFO ] [Nat]Absence check using 62 positive place invariants in 31 ms returned sat
[2026-05-22 19:32:51] [INFO ] [Nat]Absence check using 62 positive and 208 generalized place invariants in 57 ms returned sat
[2026-05-22 19:32:51] [INFO ] [Nat]Absence check using state equation in 713 ms returned sat
[2026-05-22 19:32:52] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 206 ms.
[2026-05-22 19:32:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-22 19:32:56] [INFO ] [Real]Absence check using 62 positive place invariants in 32 ms returned sat
[2026-05-22 19:32:56] [INFO ] [Real]Absence check using 62 positive and 208 generalized place invariants in 100 ms returned sat
[2026-05-22 19:32:57] [INFO ] [Real]Absence check using state equation in 1162 ms returned sat
[2026-05-22 19:32:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:32:57] [INFO ] [Nat]Absence check using 62 positive place invariants in 32 ms returned sat
[2026-05-22 19:32:57] [INFO ] [Nat]Absence check using 62 positive and 208 generalized place invariants in 64 ms returned sat
[2026-05-22 19:32:58] [INFO ] [Nat]Absence check using state equation in 1037 ms returned sat
[2026-05-22 19:32:59] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 135 ms.
[2026-05-22 19:33:02] [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 19:33:02] [INFO ] [Real]Absence check using 62 positive place invariants in 28 ms returned sat
[2026-05-22 19:33:02] [INFO ] [Real]Absence check using 62 positive and 208 generalized place invariants in 57 ms returned sat
[2026-05-22 19:33:03] [INFO ] [Real]Absence check using state equation in 853 ms returned sat
[2026-05-22 19:33:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:33:03] [INFO ] [Nat]Absence check using 62 positive place invariants in 31 ms returned sat
[2026-05-22 19:33:04] [INFO ] [Nat]Absence check using 62 positive and 208 generalized place invariants in 85 ms returned sat
[2026-05-22 19:33:05] [INFO ] [Nat]Absence check using state equation in 1080 ms returned sat
[2026-05-22 19:33:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 372 ms
[2026-05-22 19:33:05] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 132 ms.
[2026-05-22 19:33:08] [INFO ] Added : 100 causal constraints over 20 iterations in 3233 ms. Result :unknown
[2026-05-22 19:33:09] [INFO ] [Real]Absence check using 62 positive place invariants in 32 ms returned sat
[2026-05-22 19:33:09] [INFO ] [Real]Absence check using 62 positive and 208 generalized place invariants in 90 ms returned sat
[2026-05-22 19:33:10] [INFO ] [Real]Absence check using state equation in 772 ms returned sat
[2026-05-22 19:33:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:33:10] [INFO ] [Nat]Absence check using 62 positive place invariants in 31 ms returned sat
[2026-05-22 19:33:10] [INFO ] [Nat]Absence check using 62 positive and 208 generalized place invariants in 84 ms returned sat
[2026-05-22 19:33:11] [INFO ] [Nat]Absence check using state equation in 989 ms returned sat
[2026-05-22 19:33:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 406 ms
[2026-05-22 19:33:12] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 130 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2026-05-22 19:33:15] [INFO ] [Real]Absence check using 62 positive place invariants in 31 ms returned sat
[2026-05-22 19:33:15] [INFO ] [Real]Absence check using 62 positive and 208 generalized place invariants in 130 ms returned sat
[2026-05-22 19:33:16] [INFO ] [Real]Absence check using state equation in 779 ms returned sat
[2026-05-22 19:33:16] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 157 ms.
[2026-05-22 19:33:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:33:17] [INFO ] [Nat]Absence check using 62 positive place invariants in 34 ms returned sat
[2026-05-22 19:33:17] [INFO ] [Nat]Absence check using 62 positive and 208 generalized place invariants in 87 ms returned sat
[2026-05-22 19:33:18] [INFO ] [Nat]Absence check using state equation in 690 ms returned sat
[2026-05-22 19:33:18] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 126 ms.
Maximisation of solution failed !
Minimization took 13 ms.
[2026-05-22 19:33:22] [INFO ] [Real]Absence check using 62 positive place invariants in 30 ms returned sat
[2026-05-22 19:33:22] [INFO ] [Real]Absence check using 62 positive and 208 generalized place invariants in 65 ms returned sat
[2026-05-22 19:33:23] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2026-05-22 19:33:23] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 151 ms.
[2026-05-22 19:33:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:33:24] [INFO ] [Nat]Absence check using 62 positive place invariants in 29 ms returned sat
[2026-05-22 19:33:24] [INFO ] [Nat]Absence check using 62 positive and 208 generalized place invariants in 81 ms returned sat
[2026-05-22 19:33:24] [INFO ] [Nat]Absence check using state equation in 564 ms returned sat
[2026-05-22 19:33:25] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 140 ms.
[2026-05-22 19:33:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.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, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 0, 0, 0, 0, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-06a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
FORMULA ASLink-PT-06a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
FORMULA ASLink-PT-06a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
Support contains 4 out of 1406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Ensure Unique test removed 24 places
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 163 rules applied. Total rules applied 163 place count 1370 transition count 1951
Reduce places removed 127 places and 0 transitions.
Iterating post reduction 1 with 127 rules applied. Total rules applied 290 place count 1243 transition count 1951
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 129 Pre rules applied. Total rules applied 290 place count 1243 transition count 1822
Deduced a syphon composed of 129 places in 2 ms
Ensure Unique test removed 51 places
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 309 rules applied. Total rules applied 599 place count 1063 transition count 1822
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 600 place count 1063 transition count 1821
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 601 place count 1062 transition count 1821
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 610 place count 1053 transition count 1774
Ensure Unique test removed 1 places
Iterating global reduction 4 with 10 rules applied. Total rules applied 620 place count 1052 transition count 1774
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 626 place count 1051 transition count 1769
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 629 place count 1048 transition count 1769
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 630 place count 1047 transition count 1761
Iterating global reduction 6 with 1 rules applied. Total rules applied 631 place count 1047 transition count 1761
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 632 place count 1046 transition count 1753
Iterating global reduction 6 with 1 rules applied. Total rules applied 633 place count 1046 transition count 1753
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 634 place count 1045 transition count 1745
Iterating global reduction 6 with 1 rules applied. Total rules applied 635 place count 1045 transition count 1745
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 636 place count 1044 transition count 1737
Iterating global reduction 6 with 1 rules applied. Total rules applied 637 place count 1044 transition count 1737
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 638 place count 1043 transition count 1729
Iterating global reduction 6 with 1 rules applied. Total rules applied 639 place count 1043 transition count 1729
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 640 place count 1042 transition count 1721
Iterating global reduction 6 with 1 rules applied. Total rules applied 641 place count 1042 transition count 1721
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 642 place count 1041 transition count 1713
Iterating global reduction 6 with 1 rules applied. Total rules applied 643 place count 1041 transition count 1713
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 644 place count 1040 transition count 1705
Iterating global reduction 6 with 1 rules applied. Total rules applied 645 place count 1040 transition count 1705
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 646 place count 1039 transition count 1697
Iterating global reduction 6 with 1 rules applied. Total rules applied 647 place count 1039 transition count 1697
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 648 place count 1038 transition count 1689
Iterating global reduction 6 with 1 rules applied. Total rules applied 649 place count 1038 transition count 1689
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 650 place count 1037 transition count 1681
Iterating global reduction 6 with 1 rules applied. Total rules applied 651 place count 1037 transition count 1681
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 652 place count 1036 transition count 1673
Iterating global reduction 6 with 1 rules applied. Total rules applied 653 place count 1036 transition count 1673
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 654 place count 1035 transition count 1665
Iterating global reduction 6 with 1 rules applied. Total rules applied 655 place count 1035 transition count 1665
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 656 place count 1034 transition count 1657
Iterating global reduction 6 with 1 rules applied. Total rules applied 657 place count 1034 transition count 1657
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 658 place count 1033 transition count 1649
Iterating global reduction 6 with 1 rules applied. Total rules applied 659 place count 1033 transition count 1649
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 660 place count 1032 transition count 1641
Iterating global reduction 6 with 1 rules applied. Total rules applied 661 place count 1032 transition count 1641
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 745 place count 990 transition count 1599
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 750 place count 990 transition count 1594
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 755 place count 985 transition count 1594
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 762 place count 985 transition count 1594
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 763 place count 984 transition count 1593
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 775 place count 972 transition count 1593
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 24 Pre rules applied. Total rules applied 775 place count 972 transition count 1569
Deduced a syphon composed of 24 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 8 with 49 rules applied. Total rules applied 824 place count 947 transition count 1569
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 8 with 7 rules applied. Total rules applied 831 place count 940 transition count 1569
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 831 place count 940 transition count 1568
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 833 place count 939 transition count 1568
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 9 with 14 rules applied. Total rules applied 847 place count 932 transition count 1561
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 853 place count 926 transition count 1555
Iterating global reduction 9 with 6 rules applied. Total rules applied 859 place count 926 transition count 1555
Free-agglomeration rule applied 6 times.
Iterating global reduction 9 with 6 rules applied. Total rules applied 865 place count 926 transition count 1549
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 871 place count 920 transition count 1549
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 877 place count 920 transition count 1549
Applied a total of 877 rules in 1375 ms. Remains 920 /1406 variables (removed 486) and now considering 1549/2078 (removed 529) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1382 ms. Remains : 920/1406 places, 1549/2078 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10407856045324494907.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1135241376248824454.kers'
[2026-05-22 19:33:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10407856045324494907.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1135241376248824454.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 5 ms.
// Phase 1: matrix 1549 rows 905 cols 6066 entries
Finished phase 1 with 262 SingleSign rule and 497 generalized
[2026-05-22 19:33:31] [INFO ] Computed 161 invariants in 27 ms
Computed 161 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-1135241376248824454.kers
Total runtime 29 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (11436 resets) in 3006 ms. (332 steps per ms)
BEST_FIRST walk for 4000004 steps (7489 resets) in 5420 ms. (737 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-22 19:33:39] [INFO ] Invariant cache hit.
[2026-05-22 19:33:40] [INFO ] [Real]Absence check using 56 positive place invariants in 13 ms returned sat
[2026-05-22 19:33:40] [INFO ] [Real]Absence check using 56 positive and 105 generalized place invariants in 43 ms returned sat
[2026-05-22 19:33:40] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2026-05-22 19:33:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:33:40] [INFO ] [Nat]Absence check using 56 positive place invariants in 20 ms returned sat
[2026-05-22 19:33:40] [INFO ] [Nat]Absence check using 56 positive and 105 generalized place invariants in 30 ms returned sat
[2026-05-22 19:33:41] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2026-05-22 19:33:41] [INFO ] Computed and/alt/rep : 609/2326/609 causal constraints (skipped 907 transitions) in 98 ms.
[2026-05-22 19:33:53] [INFO ] Added : 482 causal constraints over 97 iterations in 11802 ms. Result :sat
Minimization took 1044 ms.
[2026-05-22 19:33:54] [INFO ] [Real]Absence check using 56 positive place invariants in 13 ms returned sat
[2026-05-22 19:33:54] [INFO ] [Real]Absence check using 56 positive and 105 generalized place invariants in 23 ms returned sat
[2026-05-22 19:33:55] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2026-05-22 19:33:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:33:55] [INFO ] [Nat]Absence check using 56 positive place invariants in 17 ms returned sat
[2026-05-22 19:33:55] [INFO ] [Nat]Absence check using 56 positive and 105 generalized place invariants in 61 ms returned sat
[2026-05-22 19:33:55] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2026-05-22 19:33:56] [INFO ] Computed and/alt/rep : 609/2326/609 causal constraints (skipped 907 transitions) in 117 ms.
[2026-05-22 19:34:06] [INFO ] Added : 460 causal constraints over 92 iterations in 10254 ms. Result :sat
Minimization took 1253 ms.
[2026-05-22 19:34:07] [INFO ] [Real]Absence check using 56 positive place invariants in 18 ms returned sat
[2026-05-22 19:34:07] [INFO ] [Real]Absence check using 56 positive and 105 generalized place invariants in 27 ms returned sat
[2026-05-22 19:34:08] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2026-05-22 19:34:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:34:08] [INFO ] [Nat]Absence check using 56 positive place invariants in 18 ms returned sat
[2026-05-22 19:34:08] [INFO ] [Nat]Absence check using 56 positive and 105 generalized place invariants in 30 ms returned sat
[2026-05-22 19:34:09] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2026-05-22 19:34:09] [INFO ] Computed and/alt/rep : 609/2326/609 causal constraints (skipped 907 transitions) in 107 ms.
[2026-05-22 19:34:19] [INFO ] Added : 372 causal constraints over 75 iterations in 10361 ms. Result :sat
Minimization took 1078 ms.
[2026-05-22 19:34:20] [INFO ] [Real]Absence check using 56 positive place invariants in 13 ms returned sat
[2026-05-22 19:34:20] [INFO ] [Real]Absence check using 56 positive and 105 generalized place invariants in 48 ms returned sat
[2026-05-22 19:34:21] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2026-05-22 19:34:21] [INFO ] Computed and/alt/rep : 609/2326/609 causal constraints (skipped 907 transitions) in 79 ms.
[2026-05-22 19:34:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:34:21] [INFO ] [Nat]Absence check using 56 positive place invariants in 34 ms returned sat
[2026-05-22 19:34:21] [INFO ] [Nat]Absence check using 56 positive and 105 generalized place invariants in 21 ms returned sat
[2026-05-22 19:34:22] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2026-05-22 19:34:22] [INFO ] Computed and/alt/rep : 609/2326/609 causal constraints (skipped 907 transitions) in 98 ms.
[2026-05-22 19:34:29] [INFO ] Added : 302 causal constraints over 61 iterations in 7126 ms. Result :sat
Minimization took 715 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 920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 1549/1549 transitions.
Applied a total of 0 rules in 37 ms. Remains 920 /920 variables (removed 0) and now considering 1549/1549 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 920/920 places, 1549/1549 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 1549/1549 transitions.
Applied a total of 0 rules in 35 ms. Remains 920 /920 variables (removed 0) and now considering 1549/1549 (removed 0) transitions.
[2026-05-22 19:34:50] [INFO ] Invariant cache hit.
[2026-05-22 19:34:51] [INFO ] Implicit Places using invariants in 1053 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 255, 259, 260, 271, 272, 273, 291, 309, 378, 382, 383, 394, 395, 396, 414, 432, 501, 505, 506, 517, 518, 519, 537, 555, 624, 628, 629, 640, 641, 642, 660, 678, 747, 751, 752, 755, 766, 767, 768, 786, 788, 791, 809, 810, 811, 812, 824, 830, 836, 842, 848, 854, 860, 866, 872, 878, 884]
[2026-05-22 19:34:51] [INFO ] Actually due to overlaps returned [786, 768, 30, 48, 150, 168, 273, 291, 396, 414, 519, 537, 642, 660, 791, 149, 272, 395, 518, 641, 767, 810, 148, 271, 394, 517, 640, 766, 788, 809, 0, 259, 260, 382, 383, 505, 506, 628, 629, 751, 752, 18, 19, 66, 186, 309, 432, 555, 678, 812, 854, 872, 884, 755, 811, 824, 830, 836, 842, 848, 860, 866, 878]
Discarding 63 places :
Implicit Place search using SMT only with invariants took 1068 ms to find 63 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 857/920 places, 1549/1549 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 851 transition count 1430
Reduce places removed 119 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 120 rules applied. Total rules applied 245 place count 732 transition count 1429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 246 place count 731 transition count 1429
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 246 place count 731 transition count 1398
Deduced a syphon composed of 31 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 309 place count 699 transition count 1398
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 321 place count 695 transition count 1390
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 329 place count 687 transition count 1390
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 344 place count 672 transition count 1375
Iterating global reduction 5 with 15 rules applied. Total rules applied 359 place count 672 transition count 1375
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 362 place count 672 transition count 1372
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 362 place count 672 transition count 1371
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 364 place count 671 transition count 1371
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 367 place count 668 transition count 1368
Iterating global reduction 6 with 3 rules applied. Total rules applied 370 place count 668 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 371 place count 667 transition count 1367
Iterating global reduction 6 with 1 rules applied. Total rules applied 372 place count 667 transition count 1367
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 373 place count 666 transition count 1366
Iterating global reduction 6 with 1 rules applied. Total rules applied 374 place count 666 transition count 1366
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 6 with 106 rules applied. Total rules applied 480 place count 613 transition count 1313
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 486 place count 613 transition count 1307
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 492 place count 607 transition count 1301
Iterating global reduction 7 with 6 rules applied. Total rules applied 498 place count 607 transition count 1301
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 504 place count 607 transition count 1295
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 8 with 14 rules applied. Total rules applied 518 place count 607 transition count 1281
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 533 place count 592 transition count 1281
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 551 place count 592 transition count 1281
Applied a total of 551 rules in 483 ms. Remains 592 /857 variables (removed 265) and now considering 1281/1549 (removed 268) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13530242025362030418.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9551222305885680109.kers'
[2026-05-22 19:34:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13530242025362030418.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9551222305885680109.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 1281 rows 591 cols 5235 entries
Finished phase 1 with 214 SingleSign rule and 292 generalized
[2026-05-22 19:34:51] [INFO ] Computed 86 invariants in 26 ms
Computed 86 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-9551222305885680109.kers
Total runtime 31 ms.
[2026-05-22 19:34:52] [INFO ] Implicit Places using invariants in 487 ms returned [72, 89, 95, 98, 100, 101, 104, 105, 157, 174, 180, 183, 185, 190, 191, 243, 260, 266, 269, 271, 276, 277, 329, 346, 352, 355, 357, 362, 363, 415, 432, 438, 441, 443, 448, 449, 501, 518, 524, 527, 529]
[2026-05-22 19:34:52] [INFO ] Actually due to overlaps returned [104, 190, 276, 362, 448, 105, 191, 277, 363, 449, 89, 95, 100, 101, 180, 185, 260, 266, 271, 346, 352, 357, 432, 438, 443, 518, 524, 529, 72, 157, 174, 243, 329, 415, 501]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 503 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 557/920 places, 1281/1549 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 534 transition count 1258
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 534 transition count 1258
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 529 transition count 1253
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 529 transition count 1253
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 80 place count 517 transition count 1241
Free-agglomeration rule applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 98 place count 517 transition count 1223
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 116 place count 499 transition count 1223
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 122 place count 499 transition count 1217
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 128 place count 493 transition count 1217
Applied a total of 128 rules in 313 ms. Remains 493 /557 variables (removed 64) and now considering 1217/1281 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8557771983679245179.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-608420302178306392.kers'
[2026-05-22 19:34:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8557771983679245179.kers, --Pflows, --basisKERS=/tmp/petrispot-output-608420302178306392.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1217 rows 493 cols 4970 entries
Finished phase 1 with 170 SingleSign rule and 272 generalized
[2026-05-22 19:34:52] [INFO ] Computed 51 invariants in 8 ms
Computed 51 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-608420302178306392.kers
Total runtime 10 ms.
[2026-05-22 19:34:52] [INFO ] Implicit Places using invariants in 381 ms returned []
[2026-05-22 19:34:52] [INFO ] Invariant cache hit.
[2026-05-22 19:34:54] [INFO ] Implicit Places using invariants and state equation in 1229 ms returned []
Implicit Place search using SMT with State Equation took 1612 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 493/920 places, 1217/1549 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4025 ms. Remains : 493/920 places, 1217/1549 transitions.
[2026-05-22 19:34:54] [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 (17911 resets) in 1966 ms. (508 steps per ms)
FORMULA ASLink-PT-06a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000003 steps (11972 resets) in 2262 ms. (1325 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-22 19:34:58] [INFO ] Invariant cache hit.
[2026-05-22 19:34:58] [INFO ] [Real]Absence check using 26 positive place invariants in 9 ms returned sat
[2026-05-22 19:34:58] [INFO ] [Real]Absence check using 26 positive and 25 generalized place invariants in 15 ms returned sat
[2026-05-22 19:34:58] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2026-05-22 19:34:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:34:58] [INFO ] [Nat]Absence check using 26 positive place invariants in 10 ms returned sat
[2026-05-22 19:34:58] [INFO ] [Nat]Absence check using 26 positive and 25 generalized place invariants in 30 ms returned sat
[2026-05-22 19:34:59] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2026-05-22 19:34:59] [INFO ] Computed and/alt/rep : 264/1184/264 causal constraints (skipped 923 transitions) in 64 ms.
[2026-05-22 19:35:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2026-05-22 19:35:01] [INFO ] Added : 55 causal constraints over 12 iterations in 1975 ms. Result :sat
Minimization took 782 ms.
[2026-05-22 19:35:02] [INFO ] [Real]Absence check using 26 positive place invariants in 11 ms returned sat
[2026-05-22 19:35:02] [INFO ] [Real]Absence check using 26 positive and 25 generalized place invariants in 6 ms returned sat
[2026-05-22 19:35:02] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2026-05-22 19:35:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:35:02] [INFO ] [Nat]Absence check using 26 positive place invariants in 10 ms returned sat
[2026-05-22 19:35:02] [INFO ] [Nat]Absence check using 26 positive and 25 generalized place invariants in 31 ms returned sat
[2026-05-22 19:35:03] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2026-05-22 19:35:03] [INFO ] Computed and/alt/rep : 264/1184/264 causal constraints (skipped 923 transitions) in 63 ms.
[2026-05-22 19:35:03] [INFO ] Added : 9 causal constraints over 2 iterations in 240 ms. Result :sat
Minimization took 680 ms.
[2026-05-22 19:35:04] [INFO ] [Real]Absence check using 26 positive place invariants in 10 ms returned sat
[2026-05-22 19:35:04] [INFO ] [Real]Absence check using 26 positive and 25 generalized place invariants in 7 ms returned sat
[2026-05-22 19:35:04] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2026-05-22 19:35:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 19:35:04] [INFO ] [Nat]Absence check using 26 positive place invariants in 11 ms returned sat
[2026-05-22 19:35:04] [INFO ] [Nat]Absence check using 26 positive and 25 generalized place invariants in 6 ms returned sat
[2026-05-22 19:35:05] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2026-05-22 19:35:05] [INFO ] Computed and/alt/rep : 264/1184/264 causal constraints (skipped 923 transitions) in 51 ms.
[2026-05-22 19:35:05] [INFO ] Added : 21 causal constraints over 5 iterations in 612 ms. Result :sat
Minimization took 885 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA ASLink-PT-06a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-06a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-06a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 145588 ms.

BK_STOP 1779478507240

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-06a"
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-06a, 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-177944366200365"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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