About the Execution of ITS-Tools for EisenbergMcGuire-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16200.436 | 3600000.00 | 3550796.00 | 126347.80 | 1 ? 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r114-smll-177955740500293.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 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 EisenbergMcGuire-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740500293
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 8.6K Mar 7 05:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 7 05:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 7 05:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 7 05:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 09:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 15 09:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 09:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 05:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Mar 7 05:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 7 05:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 7 05:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 3.1M 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 EisenbergMcGuire-PT-10-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779817924032
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-26 17:52:06] [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-26 17:52:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 17:52:07] [INFO ] Load time of PNML (sax parser for PT used): 765 ms
[2026-05-26 17:52:07] [INFO ] Transformed 1090 places.
[2026-05-26 17:52:07] [INFO ] Transformed 5200 transitions.
[2026-05-26 17:52:07] [INFO ] Found NUPN structural information;
[2026-05-26 17:52:07] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 1037 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8092330939004083819.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3526701290018917546.kers'
[2026-05-26 17:52:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8092330939004083819.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3526701290018917546.kers]
Normalized transition count is 2330 out of 5200 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 2330 rows 1090 cols 5100 entries
Finished phase 1 with 1049 SingleSign rule and 10 generalized
[2026-05-26 17:52:07] [INFO ] Computed 31 invariants in 11 ms
Computed 31 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-3526701290018917546.kers
Total runtime 21 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 (2 resets) in 116 ms. (85 steps per ms)
FORMULA EisenbergMcGuire-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 57 ms. (344 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-26 17:52:08] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5393224912775585658.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3568337147202626360.kers'
[2026-05-26 17:52:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5393224912775585658.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3568337147202626360.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2330 rows 1090 cols 5100 entries
Finished phase 1 with 1049 SingleSign rule and 10 generalized
[2026-05-26 17:52:08] [INFO ] Computed 31 invariants in 17 ms
Computed 31 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-3568337147202626360.kers
Total runtime 23 ms.
[2026-05-26 17:52:09] [INFO ] [Real]Absence check using 21 positive place invariants in 61 ms returned sat
[2026-05-26 17:52:09] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 11 ms returned sat
[2026-05-26 17:52:10] [INFO ] [Real]Absence check using state equation in 1103 ms returned sat
[2026-05-26 17:52:10] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2026-05-26 17:52:10] [INFO ] [Real]Added 1246 Read/Feed constraints in 435 ms returned sat
[2026-05-26 17:52:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 17:52:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 55 ms returned sat
[2026-05-26 17:52:11] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 12 ms returned sat
[2026-05-26 17:52:12] [INFO ] [Nat]Absence check using state equation in 1069 ms returned sat
[2026-05-26 17:52:12] [INFO ] [Nat]Added 1246 Read/Feed constraints in 258 ms returned sat
[2026-05-26 17:52:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-26 17:52:17] [INFO ] [Real]Absence check using 21 positive place invariants in 53 ms returned sat
[2026-05-26 17:52:17] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 12 ms returned sat
[2026-05-26 17:52:18] [INFO ] [Real]Absence check using state equation in 1218 ms returned sat
[2026-05-26 17:52:19] [INFO ] [Real]Added 1246 Read/Feed constraints in 280 ms returned sat
[2026-05-26 17:52:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 17:52:19] [INFO ] [Nat]Absence check using 21 positive place invariants in 44 ms returned sat
[2026-05-26 17:52:19] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2026-05-26 17:52:20] [INFO ] [Nat]Absence check using state equation in 964 ms returned sat
[2026-05-26 17:52:21] [INFO ] [Nat]Added 1246 Read/Feed constraints in 356 ms returned sat
[2026-05-26 17:52:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1090 transition count 5190
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1080 transition count 5190
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 20 place count 1080 transition count 4881
Deduced a syphon composed of 309 places in 9 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 638 place count 771 transition count 4881
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 728 place count 681 transition count 3981
Iterating global reduction 2 with 90 rules applied. Total rules applied 818 place count 681 transition count 3981
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 6 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 998 place count 591 transition count 3891
Applied a total of 998 rules in 1117 ms. Remains 591 /1090 variables (removed 499) and now considering 3891/5200 (removed 1309) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1136 ms. Remains : 591/1090 places, 3891/5200 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15829045026052287625.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-449587640941066024.kers'
[2026-05-26 17:52:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15829045026052287625.kers, --Pflows, --basisKERS=/tmp/petrispot-output-449587640941066024.kers]
Normalized transition count is 1021 out of 3891 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 1021 rows 591 cols 2482 entries
Finished phase 1 with 550 SingleSign rule and 10 generalized
[2026-05-26 17:52:26] [INFO ] Computed 31 invariants in 8 ms
Computed 31 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-449587640941066024.kers
Total runtime 14 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 4544 ms. (220 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1871 ms. (1068 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-26 17:52:32] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-758466443534252269.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4278496880181392553.kers'
[2026-05-26 17:52:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-758466443534252269.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4278496880181392553.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1021 rows 591 cols 2482 entries
Finished phase 1 with 550 SingleSign rule and 10 generalized
[2026-05-26 17:52:32] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4278496880181392553.kers
Total runtime 6 ms.
[2026-05-26 17:52:32] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2026-05-26 17:52:32] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2026-05-26 17:52:33] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2026-05-26 17:52:33] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 17:52:33] [INFO ] [Real]Added 436 Read/Feed constraints in 154 ms returned sat
[2026-05-26 17:52:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 17:52:33] [INFO ] [Nat]Absence check using 21 positive place invariants in 22 ms returned sat
[2026-05-26 17:52:33] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2026-05-26 17:52:34] [INFO ] [Nat]Absence check using state equation in 552 ms returned sat
[2026-05-26 17:52:34] [INFO ] [Nat]Added 436 Read/Feed constraints in 137 ms returned sat
[2026-05-26 17:52:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 483 ms
[2026-05-26 17:52:35] [INFO ] Computed and/alt/rep : 871/1971/601 causal constraints (skipped 410 transitions) in 297 ms.
[2026-05-26 17:52:36] [INFO ] Added : 89 causal constraints over 18 iterations in 2150 ms. Result :sat
Minimization took 812 ms.
[2026-05-26 17:52:37] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2026-05-26 17:52:37] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2026-05-26 17:52:38] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2026-05-26 17:52:38] [INFO ] [Real]Added 436 Read/Feed constraints in 225 ms returned sat
[2026-05-26 17:52:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 17:52:38] [INFO ] [Nat]Absence check using 21 positive place invariants in 22 ms returned sat
[2026-05-26 17:52:38] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 26 ms returned sat
[2026-05-26 17:52:39] [INFO ] [Nat]Absence check using state equation in 568 ms returned sat
[2026-05-26 17:52:39] [INFO ] [Nat]Added 436 Read/Feed constraints in 148 ms returned sat
[2026-05-26 17:52:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2026-05-26 17:52:40] [INFO ] Computed and/alt/rep : 871/1971/601 causal constraints (skipped 410 transitions) in 163 ms.
[2026-05-26 17:52:40] [INFO ] Added : 27 causal constraints over 6 iterations in 883 ms. Result :sat
Minimization took 683 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 260 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 591/591 places, 3891/3891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 266 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
[2026-05-26 17:52:42] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 17:52:42] [INFO ] Invariant cache hit.
[2026-05-26 17:52:44] [INFO ] Implicit Places using invariants in 1883 ms returned []
[2026-05-26 17:52:44] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 17:52:44] [INFO ] Invariant cache hit.
[2026-05-26 17:52:45] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 17:52:53] [INFO ] Implicit Places using invariants and state equation in 8603 ms returned []
Implicit Place search using SMT with State Equation took 10491 ms to find 0 implicit places.
[2026-05-26 17:52:53] [INFO ] Redundant transitions in 570 ms returned []
Running 3881 sub problems to find dead transitions.
[2026-05-26 17:52:54] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 17:52:54] [INFO ] Invariant cache hit.
[2026-05-26 17:52:54] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3881 unsolved
SMT process timed out in 32463ms, After SMT, problems are : Problem set: 0 solved, 3881 unsolved
Search for dead transitions found 0 dead transitions in 32545ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43972 ms. Remains : 591/591 places, 3891/3891 transitions.
RANDOM walk for 40000 steps (8 resets) in 1517 ms. (26 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 4/4 properties
[2026-05-26 17:53:28] [INFO ] Flatten gal took : 792 ms
[2026-05-26 17:53:28] [INFO ] Flatten gal took : 450 ms
[2026-05-26 17:53:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9052821798612506055.gal : 127 ms
[2026-05-26 17:53:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8533944289806154389.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/ReachabilityCardinality9052821798612506055.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8533944289806154389.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 ...328
Loading property file /tmp/ReachabilityCardinality8533944289806154389.prop.
Interrupted probabilistic random walk after 115907 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :2 out of 4
Probabilistic random walk after 115907 steps, saw 83789 distinct states, run finished after 3008 ms. (steps per millisecond=38 ) properties seen :2
[2026-05-26 17:53:30] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 17:53:30] [INFO ] Invariant cache hit.
[2026-05-26 17:53:30] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 11/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 298/864 variables, 9/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/864 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 18/882 variables, 9/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/882 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 99/981 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/981 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :7 after 8
At refinement iteration 24 (OVERLAPS) 631/1612 variables, 415/670 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :9 after 25
At refinement iteration 25 (INCLUDED_ONLY) 0/1612 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :25 after 33
At refinement iteration 26 (INCLUDED_ONLY) 0/1612 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1612 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 1059 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1555 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :33 after 85
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 11/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :85 after 289
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 298/864 variables, 9/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/864 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 18/882 variables, 9/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/882 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :289 after 395
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :395 after 1080
At refinement iteration 22 (INCLUDED_ONLY) 0/882 variables, 8/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/882 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 99/981 variables, 9/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/981 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 631/1612 variables, 415/680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1612 variables, 389/1069 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1612 variables, 1/1070 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1612 variables, 0/1070 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/1612 variables, 0/1070 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
Error getting values : (error "Timeout of Z3 solver reached")
After SMT solving in domain Int declared 1612/1612 variables, and 1070 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5005 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6599ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 568 ms.
Support contains 1 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 591 transition count 3890
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 590 transition count 3890
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1080 after 4136
Applied a total of 2 rules in 227 ms. Remains 590 /591 variables (removed 1) and now considering 3890/3891 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 590/591 places, 3890/3891 transitions.
RANDOM walk for 40000 steps (8 resets) in 374 ms. (106 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 151063 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 2
Probabilistic random walk after 151063 steps, saw 106426 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2026-05-26 17:53:40] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5117336777122154440.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6141568435617509050.kers'
[2026-05-26 17:53:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5117336777122154440.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6141568435617509050.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1020 rows 590 cols 2480 entries
Finished phase 1 with 549 SingleSign rule and 10 generalized
[2026-05-26 17:53:41] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-6141568435617509050.kers
Total runtime 6 ms.
[2026-05-26 17:53:41] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 11/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 297/863 variables, 9/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/863 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 18/881 variables, 9/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/881 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 99/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1610 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1058 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1497 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 11/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 297/863 variables, 9/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/863 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 18/881 variables, 9/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/881 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :4136 after 6704
At refinement iteration 22 (INCLUDED_ONLY) 0/881 variables, 9/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/881 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 99/980 variables, 9/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/980 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/980 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 630/1610 variables, 414/682 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1610 variables, 389/1071 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1610 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/1610 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1071 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7578 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9116ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 356 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 214 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 242 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-26 17:53:50] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-26 17:53:50] [INFO ] Invariant cache hit.
[2026-05-26 17:53:52] [INFO ] Implicit Places using invariants in 1519 ms returned []
[2026-05-26 17:53:52] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-26 17:53:52] [INFO ] Invariant cache hit.
[2026-05-26 17:53:53] [INFO ] State equation strengthened by 436 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :6704 after 19568
[2026-05-26 17:53:59] [INFO ] Implicit Places using invariants and state equation in 7534 ms returned []
Implicit Place search using SMT with State Equation took 9057 ms to find 0 implicit places.
[2026-05-26 17:54:00] [INFO ] Redundant transitions in 703 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-26 17:54:00] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-26 17:54:00] [INFO ] Invariant cache hit.
[2026-05-26 17:54:00] [INFO ] State equation strengthened by 436 read => feed constraints.
Detected timeout of ITS tools.
[2026-05-26 17:54:18] [INFO ] Flatten gal took : 157 ms
[2026-05-26 17:54:18] [INFO ] Applying decomposition
[2026-05-26 17:54:19] [INFO ] Flatten gal took : 136 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1541295853488280080.txt' '-o' '/tmp/graph1541295853488280080.bin' '-w' '/tmp/graph1541295853488280080.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1541295853488280080.bin' '-l' '-1' '-v' '-w' '/tmp/graph1541295853488280080.weights' '-q' '0' '-e' '0.001'
[2026-05-26 17:54:19] [INFO ] Decomposing Gal with order
[2026-05-26 17:54:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 17:54:21] [INFO ] Removed a total of 8638 redundant transitions.
[2026-05-26 17:54:21] [INFO ] Flatten gal took : 1075 ms
[2026-05-26 17:54:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 823 labels/synchronizations in 302 ms.
[2026-05-26 17:54:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4334659128557544696.gal : 44 ms
[2026-05-26 17:54:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5651393080349103684.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4334659128557544696.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5651393080349103684.prop' '--nowitness'
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 ...307
Loading property file /tmp/ReachabilityCardinality5651393080349103684.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5203
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5203 after 5271
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5271 after 5857
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :5857 after 41899
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :41899 after 256583
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 31967ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 32003ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42071 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 7 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
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 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 133 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10037995095155882886.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11015132609257435127.kers'
[2026-05-26 17:54:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10037995095155882886.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11015132609257435127.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 231 rows 61 cols 832 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-26 17:54:32] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-11015132609257435127.kers
Total runtime 7 ms.
[2026-05-26 17:54:32] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2026-05-26 17:54:33] [INFO ] After 76ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2026-05-26 17:54:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-26 17:54:33] [INFO ] After 32ms SMT Verify possible using 10 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-26 17:54:33] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-26 17:54:33] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2026-05-26 17:54:33] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-26 17:54:33] [INFO ] After 16ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-26 17:54:33] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-26 17:54:33] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-26 17:54:33] [INFO ] Flatten gal took : 10 ms
[2026-05-26 17:54:33] [INFO ] Flatten gal took : 7 ms
[2026-05-26 17:54:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5520062884550927214.gal : 4 ms
[2026-05-26 17:54:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality762794359508457236.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/ReachabilityCardinality5520062884550927214.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality762794359508457236.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 ...327
Loading property file /tmp/ReachabilityCardinality762794359508457236.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 48
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 9 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,640,0.056421,6488,2,235,8,1095,6,0,519,650,0
Total reachable state count : 640
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,16,0.057005,6488,2,94,8,1095,7,0,522,650,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,16,0.057268,6488,2,94,8,1095,8,0,523,650,0
Over-approximation ignoring read arcs solved 0 properties in 597 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA EisenbergMcGuire-PT-10-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (after reachability check) : Max Seen:[0] Max Struct:[1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9775180304780664412.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2105196395746661848.kers'
[2026-05-26 17:54:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9775180304780664412.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2105196395746661848.kers]
Normalized transition count is 1021 out of 3891 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 1021 rows 591 cols 2482 entries
Finished phase 1 with 550 SingleSign rule and 10 generalized
[2026-05-26 17:54:33] [INFO ] Computed 31 invariants in 5 ms
Computed 31 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-2105196395746661848.kers
Total runtime 9 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 3728 ms. (268 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 935 ms. (1068 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-26 17:54:38] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13255112277479549386.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8525386951788485459.kers'
[2026-05-26 17:54:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13255112277479549386.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8525386951788485459.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1021 rows 591 cols 2482 entries
Finished phase 1 with 550 SingleSign rule and 10 generalized
[2026-05-26 17:54:38] [INFO ] Computed 31 invariants in 6 ms
Computed 31 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8525386951788485459.kers
Total runtime 8 ms.
[2026-05-26 17:54:38] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2026-05-26 17:54:38] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2026-05-26 17:54:38] [INFO ] [Real]Absence check using state equation in 430 ms returned sat
[2026-05-26 17:54:38] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 17:54:38] [INFO ] [Real]Added 436 Read/Feed constraints in 161 ms returned sat
[2026-05-26 17:54:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 17:54:39] [INFO ] [Nat]Absence check using 21 positive place invariants in 24 ms returned sat
[2026-05-26 17:54:39] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2026-05-26 17:54:39] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2026-05-26 17:54:39] [INFO ] [Nat]Added 436 Read/Feed constraints in 88 ms returned sat
[2026-05-26 17:54:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2026-05-26 17:54:40] [INFO ] Computed and/alt/rep : 871/1971/601 causal constraints (skipped 410 transitions) in 147 ms.
[2026-05-26 17:54:42] [INFO ] Added : 89 causal constraints over 18 iterations in 2087 ms. Result :sat
Minimization took 935 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 591 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p37_3_0) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3890/3890 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 591 transition count 3889
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 590 transition count 3889
Applied a total of 2 rules in 284 ms. Remains 590 /591 variables (removed 1) and now considering 3889/3890 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 284 ms. Remains : 590/591 places, 3889/3890 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-127878257639035450.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9165367415707621725.kers'
[2026-05-26 17:54:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-127878257639035450.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9165367415707621725.kers]
Normalized transition count is 1019 out of 3889 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 1019 rows 590 cols 2476 entries
Finished phase 1 with 549 SingleSign rule and 10 generalized
[2026-05-26 17:54:43] [INFO ] Computed 31 invariants in 6 ms
Computed 31 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-9165367415707621725.kers
Total runtime 10 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 3663 ms. (272 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 911 ms. (1096 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-26 17:54:48] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2027663431088297481.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4928444768791073924.kers'
[2026-05-26 17:54:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2027663431088297481.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4928444768791073924.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1019 rows 590 cols 2476 entries
Finished phase 1 with 549 SingleSign rule and 10 generalized
[2026-05-26 17:54:48] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4928444768791073924.kers
Total runtime 5 ms.
[2026-05-26 17:54:48] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned sat
[2026-05-26 17:54:48] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2026-05-26 17:54:48] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2026-05-26 17:54:48] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 17:54:49] [INFO ] [Real]Added 436 Read/Feed constraints in 118 ms returned sat
[2026-05-26 17:54:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 17:54:49] [INFO ] [Nat]Absence check using 21 positive place invariants in 19 ms returned sat
[2026-05-26 17:54:49] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2026-05-26 17:54:49] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2026-05-26 17:54:49] [INFO ] [Nat]Added 436 Read/Feed constraints in 147 ms returned sat
[2026-05-26 17:54:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 496 ms
[2026-05-26 17:54:50] [INFO ] Computed and/alt/rep : 870/1970/600 causal constraints (skipped 409 transitions) in 171 ms.
[2026-05-26 17:54:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 394 ms
[2026-05-26 17:54:52] [INFO ] Added : 72 causal constraints over 15 iterations in 2328 ms. Result :sat
Minimization took 862 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3889/3889 transitions.
Applied a total of 0 rules in 274 ms. Remains 590 /590 variables (removed 0) and now considering 3889/3889 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 274 ms. Remains : 590/590 places, 3889/3889 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3889/3889 transitions.
Applied a total of 0 rules in 282 ms. Remains 590 /590 variables (removed 0) and now considering 3889/3889 (removed 0) transitions.
[2026-05-26 17:54:54] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-26 17:54:54] [INFO ] Invariant cache hit.
[2026-05-26 17:54:56] [INFO ] Implicit Places using invariants in 2141 ms returned []
[2026-05-26 17:54:56] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-26 17:54:56] [INFO ] Invariant cache hit.
[2026-05-26 17:54:57] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 17:55:04] [INFO ] Implicit Places using invariants and state equation in 8250 ms returned []
Implicit Place search using SMT with State Equation took 10395 ms to find 0 implicit places.
[2026-05-26 17:55:05] [INFO ] Redundant transitions in 343 ms returned []
Running 3879 sub problems to find dead transitions.
[2026-05-26 17:55:05] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-26 17:55:05] [INFO ] Invariant cache hit.
[2026-05-26 17:55:05] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3879 unsolved
SMT process timed out in 31954ms, After SMT, problems are : Problem set: 0 solved, 3879 unsolved
Search for dead transitions found 0 dead transitions in 31972ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43015 ms. Remains : 590/590 places, 3889/3889 transitions.
RANDOM walk for 40000 steps (8 resets) in 839 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
[2026-05-26 17:55:37] [INFO ] Flatten gal took : 198 ms
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
[2026-05-26 17:55:37] [INFO ] Flatten gal took : 117 ms
[2026-05-26 17:55:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality126413723260722797.gal : 37 ms
[2026-05-26 17:55:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5977300008285713346.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality126413723260722797.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5977300008285713346.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 ...327
Loading property file /tmp/ReachabilityCardinality5977300008285713346.prop.
Interrupted probabilistic random walk after 170291 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 2
Probabilistic random walk after 170291 steps, saw 119349 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2026-05-26 17:55:40] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-26 17:55:40] [INFO ] Invariant cache hit.
[2026-05-26 17:55:40] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 11/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 101/159 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 172/331 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/331 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 234/565 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
At refinement iteration 16 (INCLUDED_ONLY) 0/565 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 8
At refinement iteration 17 (INCLUDED_ONLY) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 9
At refinement iteration 18 (OVERLAPS) 297/862 variables, 9/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :9 after 25
At refinement iteration 19 (INCLUDED_ONLY) 0/862 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 18/880 variables, 9/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/880 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 99/979 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 33
At refinement iteration 23 (INCLUDED_ONLY) 0/979 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 630/1609 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :33 after 85
At refinement iteration 25 (INCLUDED_ONLY) 0/1609 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1609 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1609 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1609/1609 variables, and 1058 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1154 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 11/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 101/159 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 172/331 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :85 after 290
At refinement iteration 14 (INCLUDED_ONLY) 0/331 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 234/565 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/565 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 297/862 variables, 9/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/862 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 18/880 variables, 9/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/880 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :290 after 436
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :436 after 1085
At refinement iteration 22 (INCLUDED_ONLY) 0/880 variables, 9/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/880 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 99/979 variables, 9/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/979 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 6175ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 67 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3889/3889 transitions.
Applied a total of 0 rules in 306 ms. Remains 590 /590 variables (removed 0) and now considering 3889/3889 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 590/590 places, 3889/3889 transitions.
RANDOM walk for 40000 steps (8 resets) in 513 ms. (77 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1085 after 4299
Interrupted probabilistic random walk after 179751 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 2
Probabilistic random walk after 179751 steps, saw 125991 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
[2026-05-26 17:55:50] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-26 17:55:50] [INFO ] Invariant cache hit.
[2026-05-26 17:55:50] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 11/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 101/159 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 172/331 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/331 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 234/565 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/565 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 297/862 variables, 9/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/862 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 18/880 variables, 9/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/880 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 99/979 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/979 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 630/1609 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1609 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1609 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1609 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1609/1609 variables, and 1058 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1203 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 11/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 101/159 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 172/331 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/331 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 234/565 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/565 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 297/862 variables, 9/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/862 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 18/880 variables, 9/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/880 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/880 variables, 9/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/880 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 99/979 variables, 9/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/979 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4299 after 6731
At refinement iteration 26 (OVERLAPS) 630/1609 variables, 414/680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1609 variables, 389/1069 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1609 variables, 1/1070 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1609 variables, 0/1070 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/1609 variables, 0/1070 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1609/1609 variables, and 1070 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5549 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6770ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 318 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3889/3889 transitions.
Applied a total of 0 rules in 195 ms. Remains 590 /590 variables (removed 0) and now considering 3889/3889 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 590/590 places, 3889/3889 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3889/3889 transitions.
Applied a total of 0 rules in 199 ms. Remains 590 /590 variables (removed 0) and now considering 3889/3889 (removed 0) transitions.
[2026-05-26 17:55:57] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-26 17:55:57] [INFO ] Invariant cache hit.
[2026-05-26 17:55:59] [INFO ] Implicit Places using invariants in 1821 ms returned []
[2026-05-26 17:55:59] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-26 17:55:59] [INFO ] Invariant cache hit.
[2026-05-26 17:56:00] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 17:56:07] [INFO ] Implicit Places using invariants and state equation in 7964 ms returned []
Implicit Place search using SMT with State Equation took 9787 ms to find 0 implicit places.
[2026-05-26 17:56:07] [INFO ] Redundant transitions in 306 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10300 ms. Remains : 590/590 places, 3889/3889 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 2 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
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 119 rules applied. Total rules applied 120 place count 500 transition count 630
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 630
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 609
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 609
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 430
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 340
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 340
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 330
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 320
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 230
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 230
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 230
Applied a total of 969 rules in 57 ms. Remains 71 /590 variables (removed 519) and now considering 230/3889 (removed 3659) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7060474318527640764.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6788187561728691451.kers'
[2026-05-26 17:56:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7060474318527640764.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6788187561728691451.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 230 rows 61 cols 828 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-26 17:56:08] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6788187561728691451.kers
Total runtime 4 ms.
[2026-05-26 17:56:08] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2026-05-26 17:56:08] [INFO ] After 68ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2026-05-26 17:56:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-26 17:56:08] [INFO ] After 20ms SMT Verify possible using 10 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-26 17:56:08] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-26 17:56:08] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2026-05-26 17:56:08] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-26 17:56:08] [INFO ] After 16ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-26 17:56:08] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-26 17:56:08] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-26 17:56:08] [INFO ] Flatten gal took : 6 ms
[2026-05-26 17:56:08] [INFO ] Flatten gal took : 6 ms
[2026-05-26 17:56:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9604285060896213844.gal : 2 ms
[2026-05-26 17:56:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10073825407336090499.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9604285060896213844.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10073825407336090499.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10073825407336090499.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 48
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 9 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,640,0.054253,6496,2,242,8,1232,6,0,515,756,0
Total reachable state count : 640
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,8,0.054792,6496,2,77,8,1232,7,0,518,756,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,8,0.055031,6496,2,77,8,1232,8,0,519,756,0
Over-approximation ignoring read arcs solved 0 properties in 443 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-26 17:56:08] [INFO ] Flatten gal took : 89 ms
[2026-05-26 17:56:08] [INFO ] Applying decomposition
[2026-05-26 17:56:08] [INFO ] Flatten gal took : 92 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph447681210294529545.txt' '-o' '/tmp/graph447681210294529545.bin' '-w' '/tmp/graph447681210294529545.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph447681210294529545.bin' '-l' '-1' '-v' '-w' '/tmp/graph447681210294529545.weights' '-q' '0' '-e' '0.001'
[2026-05-26 17:56:08] [INFO ] Decomposing Gal with order
[2026-05-26 17:56:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 17:56:09] [INFO ] Removed a total of 8719 redundant transitions.
[2026-05-26 17:56:09] [INFO ] Flatten gal took : 406 ms
[2026-05-26 17:56:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 831 labels/synchronizations in 197 ms.
[2026-05-26 17:56:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14097660587305972559.gal : 30 ms
[2026-05-26 17:56:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17480091431970027180.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14097660587305972559.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17480091431970027180.prop' '--nowitness'
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 ...309
Loading property file /tmp/ReachabilityCardinality17480091431970027180.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5318
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5318 after 15215
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :15215 after 41955
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :41955 after 50191
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :50191 after 1.65966e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.65966e+06 after 1.76127e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.76127e+06 after 2.59595e+06
Detected timeout of ITS tools.
Starting property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1207641151826387972.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2935925850205046070.kers'
[2026-05-26 17:56:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1207641151826387972.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2935925850205046070.kers]
Normalized transition count is 1019 out of 3889 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 1019 rows 590 cols 2476 entries
Finished phase 1 with 549 SingleSign rule and 10 generalized
[2026-05-26 17:56:59] [INFO ] Computed 31 invariants in 8 ms
Computed 31 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-2935925850205046070.kers
Total runtime 14 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 54 ms. (181 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-26 17:57:00] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15422573305681557416.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12524370710481760483.kers'
[2026-05-26 17:57:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15422573305681557416.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12524370710481760483.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1019 rows 590 cols 2476 entries
Finished phase 1 with 549 SingleSign rule and 10 generalized
[2026-05-26 17:57:00] [INFO ] Computed 31 invariants in 8 ms
Computed 31 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-12524370710481760483.kers
Total runtime 10 ms.
[2026-05-26 17:57:00] [INFO ] [Real]Absence check using 21 positive place invariants in 23 ms returned sat
[2026-05-26 17:57:00] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2026-05-26 17:57:00] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2026-05-26 17:57:00] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 17:57:01] [INFO ] [Real]Added 436 Read/Feed constraints in 167 ms returned sat
[2026-05-26 17:57:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 17:57:01] [INFO ] [Nat]Absence check using 21 positive place invariants in 22 ms returned sat
[2026-05-26 17:57:01] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2026-05-26 17:57:01] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2026-05-26 17:57:02] [INFO ] [Nat]Added 436 Read/Feed constraints in 141 ms returned sat
[2026-05-26 17:57:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 449 ms
[2026-05-26 17:57:02] [INFO ] Computed and/alt/rep : 870/1970/600 causal constraints (skipped 409 transitions) in 161 ms.
[2026-05-26 17:57:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 386 ms
[2026-05-26 17:57:04] [INFO ] Added : 72 causal constraints over 15 iterations in 2328 ms. Result :sat
Minimization took 545 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3889/3889 transitions.
Applied a total of 0 rules in 288 ms. Remains 590 /590 variables (removed 0) and now considering 3889/3889 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 295 ms. Remains : 590/590 places, 3889/3889 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10150691450373943045.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3331320684081032938.kers'
[2026-05-26 17:57:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10150691450373943045.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3331320684081032938.kers]
Normalized transition count is 1019 out of 3889 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 1019 rows 590 cols 2476 entries
Finished phase 1 with 549 SingleSign rule and 10 generalized
[2026-05-26 17:57:05] [INFO ] Computed 31 invariants in 9 ms
Computed 31 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-3331320684081032938.kers
Total runtime 14 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 3774 ms. (264 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1109 ms. (900 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-26 17:57:10] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17155992683769596249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1608471746114843696.kers'
[2026-05-26 17:57:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17155992683769596249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1608471746114843696.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1019 rows 590 cols 2476 entries
Finished phase 1 with 549 SingleSign rule and 10 generalized
[2026-05-26 17:57:10] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1608471746114843696.kers
Total runtime 7 ms.
[2026-05-26 17:57:10] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2026-05-26 17:57:10] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2026-05-26 17:57:11] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2026-05-26 17:57:11] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 17:57:11] [INFO ] [Real]Added 436 Read/Feed constraints in 162 ms returned sat
[2026-05-26 17:57:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 17:57:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 22 ms returned sat
[2026-05-26 17:57:11] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2026-05-26 17:57:12] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2026-05-26 17:57:12] [INFO ] [Nat]Added 436 Read/Feed constraints in 137 ms returned sat
[2026-05-26 17:57:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 470 ms
[2026-05-26 17:57:12] [INFO ] Computed and/alt/rep : 870/1970/600 causal constraints (skipped 409 transitions) in 156 ms.
[2026-05-26 17:57:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 378 ms
[2026-05-26 17:57:15] [INFO ] Added : 72 causal constraints over 15 iterations in 2278 ms. Result :sat
Minimization took 946 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 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3889/3889 transitions.
Applied a total of 0 rules in 170 ms. Remains 590 /590 variables (removed 0) and now considering 3889/3889 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 590/590 places, 3889/3889 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3889/3889 transitions.
Applied a total of 0 rules in 169 ms. Remains 590 /590 variables (removed 0) and now considering 3889/3889 (removed 0) transitions.
[2026-05-26 17:57:16] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-26 17:57:16] [INFO ] Invariant cache hit.
[2026-05-26 17:57:18] [INFO ] Implicit Places using invariants in 2098 ms returned []
[2026-05-26 17:57:18] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-26 17:57:18] [INFO ] Invariant cache hit.
[2026-05-26 17:57:19] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 17:57:27] [INFO ] Implicit Places using invariants and state equation in 8288 ms returned []
Implicit Place search using SMT with State Equation took 10388 ms to find 0 implicit places.
[2026-05-26 17:57:27] [INFO ] Redundant transitions in 298 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10865 ms. Remains : 590/590 places, 3889/3889 transitions.
RANDOM walk for 40000 steps (8 resets) in 337 ms. (118 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
[2026-05-26 17:57:27] [INFO ] Flatten gal took : 122 ms
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
[2026-05-26 17:57:27] [INFO ] Flatten gal took : 142 ms
[2026-05-26 17:57:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18315917228655760077.gal : 27 ms
[2026-05-26 17:57:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13737266011384546384.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18315917228655760077.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13737266011384546384.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/ReachabilityCardinality13737266011384546384.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
Interrupted probabilistic random walk after 156211 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 2
Probabilistic random walk after 156211 steps, saw 110005 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
[2026-05-26 17:57:30] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-26 17:57:30] [INFO ] Invariant cache hit.
[2026-05-26 17:57:30] [INFO ] State equation strengthened by 436 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 8
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 9
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :9 after 25
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 33
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 11/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 101/159 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 172/331 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/331 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :33 after 85
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 234/565 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/565 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 297/862 variables, 9/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/862 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 18/880 variables, 9/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/880 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 99/979 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/979 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :85 after 290
At refinement iteration 24 (OVERLAPS) 630/1609 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1609 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1609 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1609 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1609/1609 variables, and 1058 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1048 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 11/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 101/159 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 172/331 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/331 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :290 after 436
At refinement iteration 15 (OVERLAPS) 234/565 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/565 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 297/862 variables, 9/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/862 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 18/880 variables, 9/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/880 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :436 after 1085
At refinement iteration 22 (INCLUDED_ONLY) 0/880 variables, 9/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/880 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 99/979 variables, 9/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/979 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 630/1609 variables, 414/680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1609 variables, 389/1069 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1609 variables, 1/1070 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1609/1609 variables, and 1070 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6068ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3889/3889 transitions.
Applied a total of 0 rules in 180 ms. Remains 590 /590 variables (removed 0) and now considering 3889/3889 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 590/590 places, 3889/3889 transitions.
RANDOM walk for 40000 steps (8 resets) in 304 ms. (131 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1085 after 4299
Interrupted probabilistic random walk after 169730 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 2
Probabilistic random walk after 169730 steps, saw 118946 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2026-05-26 17:57:39] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-26 17:57:39] [INFO ] Invariant cache hit.
[2026-05-26 17:57:39] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 11/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 101/159 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 172/331 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/331 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 234/565 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/565 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 297/862 variables, 9/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/862 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 18/880 variables, 9/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/880 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 99/979 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/979 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 630/1609 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1609 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1609 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1609 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1609/1609 variables, and 1058 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1026 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 11/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 101/159 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 172/331 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/331 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 234/565 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/565 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 297/862 variables, 9/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/862 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 18/880 variables, 9/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/880 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4299 after 6731
At refinement iteration 22 (INCLUDED_ONLY) 0/880 variables, 9/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/880 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 99/979 variables, 9/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/979 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 630/1609 variables, 414/680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1609 variables, 389/1069 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1609 variables, 1/1070 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1609 variables, 0/1070 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/1609 variables, 0/1070 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1609/1609 variables, and 1070 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5180 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6220ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 291 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3889/3889 transitions.
Applied a total of 0 rules in 177 ms. Remains 590 /590 variables (removed 0) and now considering 3889/3889 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 590/590 places, 3889/3889 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3889/3889 transitions.
Applied a total of 0 rules in 173 ms. Remains 590 /590 variables (removed 0) and now considering 3889/3889 (removed 0) transitions.
[2026-05-26 17:57:46] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-26 17:57:46] [INFO ] Invariant cache hit.
[2026-05-26 17:57:48] [INFO ] Implicit Places using invariants in 1363 ms returned []
[2026-05-26 17:57:48] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-26 17:57:48] [INFO ] Invariant cache hit.
[2026-05-26 17:57:48] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 17:57:54] [INFO ] Implicit Places using invariants and state equation in 6584 ms returned []
Implicit Place search using SMT with State Equation took 7949 ms to find 0 implicit places.
[2026-05-26 17:57:55] [INFO ] Redundant transitions in 311 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8446 ms. Remains : 590/590 places, 3889/3889 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
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 119 rules applied. Total rules applied 120 place count 500 transition count 630
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 630
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 609
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 609
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 430
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 340
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 340
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 330
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 320
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 230
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 230
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 230
Applied a total of 969 rules in 49 ms. Remains 71 /590 variables (removed 519) and now considering 230/3889 (removed 3659) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3249065573827566076.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17947121474896447802.kers'
[2026-05-26 17:57:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3249065573827566076.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17947121474896447802.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 230 rows 61 cols 828 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-26 17:57:55] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17947121474896447802.kers
Total runtime 2 ms.
[2026-05-26 17:57:55] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2026-05-26 17:57:55] [INFO ] After 110ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2026-05-26 17:57:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-26 17:57:55] [INFO ] After 27ms SMT Verify possible using 10 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-26 17:57:55] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-26 17:57:55] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2026-05-26 17:57:55] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-26 17:57:55] [INFO ] After 31ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-26 17:57:55] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-26 17:57:55] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-26 17:57:55] [INFO ] Flatten gal took : 6 ms
[2026-05-26 17:57:55] [INFO ] Flatten gal took : 6 ms
[2026-05-26 17:57:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7859170328663907231.gal : 1 ms
[2026-05-26 17:57:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9082620447550404790.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7859170328663907231.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9082620447550404790.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 ...328
Loading property file /tmp/ReachabilityCardinality9082620447550404790.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 48
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 9 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,640,0.054404,6496,2,242,8,1232,6,0,515,756,0
Total reachable state count : 640
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,8,0.054937,6496,2,77,8,1232,7,0,518,756,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,8,0.055161,6496,2,77,8,1232,8,0,519,756,0
Over-approximation ignoring read arcs solved 0 properties in 608 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-26 17:57:55] [INFO ] Flatten gal took : 89 ms
[2026-05-26 17:57:55] [INFO ] Applying decomposition
[2026-05-26 17:57:55] [INFO ] Flatten gal took : 93 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15838280856059789088.txt' '-o' '/tmp/graph15838280856059789088.bin' '-w' '/tmp/graph15838280856059789088.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15838280856059789088.bin' '-l' '-1' '-v' '-w' '/tmp/graph15838280856059789088.weights' '-q' '0' '-e' '0.001'
[2026-05-26 17:57:56] [INFO ] Decomposing Gal with order
[2026-05-26 17:57:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 17:57:56] [INFO ] Removed a total of 8533 redundant transitions.
[2026-05-26 17:57:56] [INFO ] Flatten gal took : 324 ms
[2026-05-26 17:57:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 755 labels/synchronizations in 114 ms.
[2026-05-26 17:57:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4861769489851102505.gal : 28 ms
[2026-05-26 17:57:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15458408496109973576.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4861769489851102505.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15458408496109973576.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality15458408496109973576.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 324
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :324 after 360
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :360 after 731
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :731 after 14051
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14051 after 840904
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :840904 after 1.26034e+06
Detected timeout of ITS tools.
Ending property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-01 in 106967 ms.
[2026-05-26 17:58:47] [INFO ] Flatten gal took : 82 ms
[2026-05-26 17:58:47] [INFO ] Applying decomposition
[2026-05-26 17:58:47] [INFO ] Flatten gal took : 85 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10136080565805107362.txt' '-o' '/tmp/graph10136080565805107362.bin' '-w' '/tmp/graph10136080565805107362.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10136080565805107362.bin' '-l' '-1' '-v' '-w' '/tmp/graph10136080565805107362.weights' '-q' '0' '-e' '0.001'
[2026-05-26 17:58:47] [INFO ] Decomposing Gal with order
[2026-05-26 17:58:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 17:58:47] [INFO ] Removed a total of 8562 redundant transitions.
[2026-05-26 17:58:47] [INFO ] Flatten gal took : 303 ms
[2026-05-26 17:58:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 734 labels/synchronizations in 110 ms.
[2026-05-26 17:58:47] [INFO ] Time to serialize gal into /tmp/UpperBounds43208816758017484.gal : 20 ms
[2026-05-26 17:58:47] [INFO ] Time to serialize properties into /tmp/UpperBounds17269110159493557891.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/UpperBounds43208816758017484.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17269110159493557891.prop' '--nowitness'
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 ...282
Loading property file /tmp/UpperBounds17269110159493557891.prop.
Detected timeout of ITS tools.
[2026-05-26 18:21:04] [INFO ] Applying decomposition
[2026-05-26 18:21:06] [INFO ] Flatten gal took : 1591 ms
[2026-05-26 18:21:07] [INFO ] Decomposing Gal with order
[2026-05-26 18:21:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 18:21:11] [INFO ] Removed a total of 10390 redundant transitions.
[2026-05-26 18:21:12] [INFO ] Flatten gal took : 3523 ms
[2026-05-26 18:21:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 356 labels/synchronizations in 828 ms.
[2026-05-26 18:21:13] [INFO ] Time to serialize gal into /tmp/UpperBounds8387179387042175395.gal : 141 ms
[2026-05-26 18:21:13] [INFO ] Time to serialize properties into /tmp/UpperBounds449437509269059750.prop : 8 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/UpperBounds8387179387042175395.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds449437509269059750.prop' '--nowitness'
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 ...282
Loading property file /tmp/UpperBounds449437509269059750.prop.
Detected timeout of ITS tools.
[2026-05-26 18:43:33] [INFO ] Flatten gal took : 2660 ms
[2026-05-26 18:43:47] [INFO ] Input system was already deterministic with 3889 transitions.
[2026-05-26 18:43:47] [INFO ] Transformed 590 places.
[2026-05-26 18:43:47] [INFO ] Transformed 3889 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-26 18:43:48] [INFO ] Time to serialize gal into /tmp/UpperBounds1534005261329908836.gal : 62 ms
[2026-05-26 18:43:48] [INFO ] Time to serialize properties into /tmp/UpperBounds7363463139253693660.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/UpperBounds1534005261329908836.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7363463139253693660.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds7363463139253693660.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
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="EisenbergMcGuire-PT-10"
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 EisenbergMcGuire-PT-10, 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 r114-smll-177955740500293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-10.tgz
mv EisenbergMcGuire-PT-10 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 '
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 ;