About the Execution of 2025-gold for DES-PT-50b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2724.407 | 844025.00 | 1415360.00 | 2472.60 | 1 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.r095-smll-177946996300055.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 gold2025
Input is DES-PT-50b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r095-smll-177946996300055
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 8.1K Mar 6 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Mar 6 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 6 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 6 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Mar 15 08:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 08:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Mar 6 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 6 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 6 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 127K 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 DES-PT-50b-UpperBounds-00
FORMULA_NAME DES-PT-50b-UpperBounds-01
FORMULA_NAME DES-PT-50b-UpperBounds-02
FORMULA_NAME DES-PT-50b-UpperBounds-03
FORMULA_NAME DES-PT-50b-UpperBounds-04
FORMULA_NAME DES-PT-50b-UpperBounds-05
FORMULA_NAME DES-PT-50b-UpperBounds-06
FORMULA_NAME DES-PT-50b-UpperBounds-07
FORMULA_NAME DES-PT-50b-UpperBounds-08
FORMULA_NAME DES-PT-50b-UpperBounds-09
FORMULA_NAME DES-PT-50b-UpperBounds-10
FORMULA_NAME DES-PT-50b-UpperBounds-11
FORMULA_NAME DES-PT-50b-UpperBounds-12
FORMULA_NAME DES-PT-50b-UpperBounds-13
FORMULA_NAME DES-PT-50b-UpperBounds-14
FORMULA_NAME DES-PT-50b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779528248867
Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 09:24:11] [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-23 09:24:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 09:24:11] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2026-05-23 09:24:11] [INFO ] Transformed 479 places.
[2026-05-23 09:24:11] [INFO ] Transformed 430 transitions.
[2026-05-23 09:24:11] [INFO ] Found NUPN structural information;
[2026-05-23 09:24:11] [INFO ] Parsed PT model containing 479 places and 430 transitions and 1463 arcs in 473 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 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]
// Phase 1: matrix 430 rows 479 cols
[2026-05-23 09:24:12] [INFO ] Computed 65 invariants in 55 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 (84 resets) in 99 ms. (100 steps per ms)
FORMULA DES-PT-50b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (52 resets) in 141 ms. (352 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-23 09:24:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:24:13] [INFO ] [Real]Absence check using 40 positive place invariants in 67 ms returned sat
[2026-05-23 09:24:13] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 81 ms returned sat
[2026-05-23 09:24:13] [INFO ] [Real]Absence check using state equation in 828 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:14] [INFO ] Deduced a trap composed of 9 places in 514 ms of which 38 ms to minimize.
[2026-05-23 09:24:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:24:15] [INFO ] [Nat]Absence check using 40 positive place invariants in 54 ms returned sat
[2026-05-23 09:24:15] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 80 ms returned sat
[2026-05-23 09:24:15] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:16] [INFO ] Deduced a trap composed of 14 places in 387 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:16] [INFO ] Deduced a trap composed of 23 places in 418 ms of which 41 ms to minimize.
[2026-05-23 09:24:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 963 ms
[2026-05-23 09:24:16] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 62 ms.
[2026-05-23 09:24:19] [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:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:24:20] [INFO ] [Real]Absence check using 40 positive place invariants in 44 ms returned sat
[2026-05-23 09:24:20] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 76 ms returned sat
[2026-05-23 09:24:20] [INFO ] [Real]Absence check using state equation in 659 ms returned sat
[2026-05-23 09:24:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:24:21] [INFO ] [Nat]Absence check using 40 positive place invariants in 44 ms returned sat
[2026-05-23 09:24:21] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 69 ms returned sat
[2026-05-23 09:24:21] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:22] [INFO ] Deduced a trap composed of 9 places in 398 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:22] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:22] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:22] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:22] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:23] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:23] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:23] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:23] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:23] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 10 ms to minimize.
[2026-05-23 09:24:23] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2227 ms
[2026-05-23 09:24:23] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 59 ms.
[2026-05-23 09:24:25] [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:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:24:26] [INFO ] [Real]Absence check using 40 positive place invariants in 48 ms returned sat
[2026-05-23 09:24:26] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 67 ms returned sat
[2026-05-23 09:24:26] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:27] [INFO ] Deduced a trap composed of 14 places in 347 ms of which 34 ms to minimize.
[2026-05-23 09:24:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:24:27] [INFO ] [Nat]Absence check using 40 positive place invariants in 49 ms returned sat
[2026-05-23 09:24:27] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 67 ms returned sat
[2026-05-23 09:24:27] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:28] [INFO ] Deduced a trap composed of 14 places in 483 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:28] [INFO ] Deduced a trap composed of 17 places in 382 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:29] [INFO ] Deduced a trap composed of 27 places in 480 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:29] [INFO ] Deduced a trap composed of 34 places in 454 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:30] [INFO ] Deduced a trap composed of 15 places in 446 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:30] [INFO ] Deduced a trap composed of 28 places in 480 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:31] [INFO ] Deduced a trap composed of 35 places in 461 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:31] [INFO ] Deduced a trap composed of 16 places in 422 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:32] [INFO ] Deduced a trap composed of 17 places in 433 ms of which 40 ms to minimize.
[2026-05-23 09:24:32] [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 2
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:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:24:32] [INFO ] [Real]Absence check using 40 positive place invariants in 46 ms returned sat
[2026-05-23 09:24:32] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 65 ms returned sat
[2026-05-23 09:24:33] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2026-05-23 09:24:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:24:33] [INFO ] [Nat]Absence check using 40 positive place invariants in 44 ms returned sat
[2026-05-23 09:24:33] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 60 ms returned sat
[2026-05-23 09:24:33] [INFO ] [Nat]Absence check using state equation in 489 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:34] [INFO ] Deduced a trap composed of 9 places in 348 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:34] [INFO ] Deduced a trap composed of 10 places in 328 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:34] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:34] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:35] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:35] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:35] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 5 ms to minimize.
[2026-05-23 09:24:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1385 ms
[2026-05-23 09:24:35] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 60 ms.
Maximisation of solution failed !
Minimization took 2 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:24:38] [INFO ] [Real]Absence check using 40 positive place invariants in 37 ms returned sat
[2026-05-23 09:24:38] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 62 ms returned sat
[2026-05-23 09:24:39] [INFO ] [Real]Absence check using state equation in 639 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:39] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 10 ms to minimize.
[2026-05-23 09:24:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:24:39] [INFO ] [Nat]Absence check using 40 positive place invariants in 26 ms returned sat
[2026-05-23 09:24:39] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 37 ms returned sat
[2026-05-23 09:24:40] [INFO ] [Nat]Absence check using state equation in 553 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:40] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:40] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:40] [INFO ] Deduced a trap composed of 9 places in 288 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:41] [INFO ] Deduced a trap composed of 13 places in 274 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:41] [INFO ] Deduced a trap composed of 10 places in 370 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:42] [INFO ] Deduced a trap composed of 14 places in 351 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:42] [INFO ] Deduced a trap composed of 14 places in 279 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:42] [INFO ] Deduced a trap composed of 14 places in 229 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:42] [INFO ] Deduced a trap composed of 15 places in 287 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:43] [INFO ] Deduced a trap composed of 22 places in 277 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:43] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:43] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:43] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:44] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:44] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 19 ms to minimize.
[2026-05-23 09:24:44] [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 4
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:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 430/430 transitions.
Graph (complete) has 1098 edges and 479 vertex of which 472 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 472 transition count 403
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 451 transition count 403
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 451 transition count 394
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 442 transition count 394
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 423 transition count 375
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 423 transition count 375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 423 transition count 374
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 422 transition count 374
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 407 transition count 359
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 407 transition count 359
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 407 transition count 344
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 405 transition count 343
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 405 transition count 340
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 402 transition count 340
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 325 transition count 263
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 323 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 323 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 322 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 321 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 320 transition count 263
Applied a total of 319 rules in 496 ms. Remains 320 /479 variables (removed 159) and now considering 263/430 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 515 ms. Remains : 320/479 places, 263/430 transitions.
// Phase 1: matrix 263 rows 320 cols
[2026-05-23 09:24:44] [INFO ] Computed 63 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (47583 resets) in 2695 ms. (370 steps per ms)
BEST_FIRST walk for 5000003 steps (45637 resets) in 5918 ms. (844 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-23 09:24:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:24:53] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2026-05-23 09:24:53] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 43 ms returned sat
[2026-05-23 09:24:54] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2026-05-23 09:24:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:24:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 20 ms returned sat
[2026-05-23 09:24:54] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 45 ms returned sat
[2026-05-23 09:24:54] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2026-05-23 09:24:54] [INFO ] Computed and/alt/rep : 249/442/249 causal constraints (skipped 11 transitions) in 38 ms.
[2026-05-23 09:24:57] [INFO ] Added : 200 causal constraints over 40 iterations in 2621 ms. Result :sat
Minimization took 360 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:24:57] [INFO ] [Real]Absence check using 35 positive place invariants in 21 ms returned sat
[2026-05-23 09:24:57] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 44 ms returned sat
[2026-05-23 09:24:58] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2026-05-23 09:24:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:24:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 28 ms returned sat
[2026-05-23 09:24:58] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 36 ms returned sat
[2026-05-23 09:24:58] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:24:58] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 11 ms to minimize.
[2026-05-23 09:24:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2026-05-23 09:24:58] [INFO ] Computed and/alt/rep : 249/442/249 causal constraints (skipped 11 transitions) in 31 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:25:01] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:25:02] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 16 ms to minimize.
[2026-05-23 09:25:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 652 ms
[2026-05-23 09:25:02] [INFO ] Added : 223 causal constraints over 46 iterations in 3724 ms. Result :sat
Minimization took 384 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:25:03] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2026-05-23 09:25:03] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 45 ms returned sat
[2026-05-23 09:25:03] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2026-05-23 09:25:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:25:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 21 ms returned sat
[2026-05-23 09:25:03] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 43 ms returned sat
[2026-05-23 09:25:03] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:25:04] [INFO ] Deduced a trap composed of 18 places in 232 ms of which 18 ms to minimize.
[2026-05-23 09:25:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2026-05-23 09:25:04] [INFO ] Computed and/alt/rep : 249/442/249 causal constraints (skipped 11 transitions) in 25 ms.
[2026-05-23 09:25:05] [INFO ] Added : 133 causal constraints over 27 iterations in 1212 ms. Result :sat
Minimization took 296 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:25:05] [INFO ] [Real]Absence check using 35 positive place invariants in 21 ms returned sat
[2026-05-23 09:25:05] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 44 ms returned sat
[2026-05-23 09:25:06] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:25:06] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 5 ms to minimize.
[2026-05-23 09:25:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:25:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 22 ms returned sat
[2026-05-23 09:25:06] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 39 ms returned sat
[2026-05-23 09:25:06] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2026-05-23 09:25:06] [INFO ] Computed and/alt/rep : 249/442/249 causal constraints (skipped 11 transitions) in 30 ms.
[2026-05-23 09:25:09] [INFO ] Added : 210 causal constraints over 42 iterations in 2857 ms. Result :sat
Minimization took 319 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:25:10] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2026-05-23 09:25:10] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 44 ms returned sat
[2026-05-23 09:25:10] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2026-05-23 09:25:10] [INFO ] Computed and/alt/rep : 249/442/249 causal constraints (skipped 11 transitions) in 34 ms.
[2026-05-23 09:25:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:25:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2026-05-23 09:25:10] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 41 ms returned sat
[2026-05-23 09:25:11] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2026-05-23 09:25:11] [INFO ] Computed and/alt/rep : 249/442/249 causal constraints (skipped 11 transitions) in 31 ms.
[2026-05-23 09:25:13] [INFO ] Added : 244 causal constraints over 49 iterations in 2576 ms. Result :sat
Minimization took 397 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 263/263 transitions.
Applied a total of 0 rules in 16 ms. Remains 320 /320 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 320/320 places, 263/263 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 263/263 transitions.
Applied a total of 0 rules in 15 ms. Remains 320 /320 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2026-05-23 09:25:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:25:17] [INFO ] Implicit Places using invariants in 498 ms returned []
[2026-05-23 09:25:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:25:19] [INFO ] Implicit Places using invariants and state equation in 1448 ms returned []
Implicit Place search using SMT with State Equation took 1948 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:25:19] [INFO ] Redundant transitions in 15 ms returned []
Running 260 sub problems to find dead transitions.
[2026-05-23 09:25:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/320 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 263/583 variables, 320/383 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:25:32] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:25:33] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 21 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:25:40] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:25:41] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:25:41] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 3/388 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/583 variables, and 388 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 3/320 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 263/583 variables, 320/388 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 260/648 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/583 variables, and 648 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60400ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60413ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62424 ms. Remains : 320/320 places, 263/263 transitions.
RANDOM walk for 40000 steps (1926 resets) in 1251 ms. (31 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (380 resets) in 283 ms. (140 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (357 resets) in 310 ms. (128 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (360 resets) in 364 ms. (109 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (361 resets) in 346 ms. (115 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (363 resets) in 182 ms. (218 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (368 resets) in 222 ms. (179 steps per ms) remains 10/10 properties
[2026-05-23 09:26:20] [INFO ] Flatten gal took : 294 ms
BEST_FIRST walk for 40004 steps (365 resets) in 230 ms. (173 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (359 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
[2026-05-23 09:26:20] [INFO ] Flatten gal took : 87 ms
BEST_FIRST walk for 40004 steps (352 resets) in 217 ms. (183 steps per ms) remains 10/10 properties
[2026-05-23 09:26:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3477049572339380094.gal : 33 ms
[2026-05-23 09:26:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8046502311396490338.prop : 2 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3477049572339380094.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8046502311396490338.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (355 resets) in 181 ms. (219 steps per ms) remains 10/10 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8046502311396490338.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :4 after 32
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :32 after 36
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :36 after 58
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :58 after 1240
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :1240 after 2044
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :2044 after 8104
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :8104 after 85336
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :197648 after 264832
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :264832 after 629648
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :1.84298e+06 after 2.00111e+09
Interrupted probabilistic random walk after 370575 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :2 out of 10
Probabilistic random walk after 370575 steps, saw 94034 distinct states, run finished after 3007 ms. (steps per millisecond=123 ) properties seen :2
[2026-05-23 09:26:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 237/241 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 35/276 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 25/301 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :2.00111e+09 after 2.089e+09
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 7/308 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 259/567 variables, 308/366 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 14/581 variables, 10/376 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 2/583 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/583 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/583 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/583 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 383 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2926 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,10 properties remain. new max is 32768
At refinement iteration 1 (OVERLAPS) 237/241 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD size :2.335e+09 after 2.79672e+09
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 35/276 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 25/301 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 7/308 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 259/567 variables, 308/366 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 6/372 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 14/581 variables, 10/382 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/581 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 2/583 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/583 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:26:29] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 11 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/583 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/583 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 0/583 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 583/583 variables, and 392 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3503 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6441ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 2 different solutions.
SDD proceeding with computation,10 properties remain. new max is 65536
SDD size :2.85325e+09 after 2.29388e+10
Parikh walk visited 0 properties in 10795 ms.
Support contains 4 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 263/263 transitions.
Applied a total of 0 rules in 14 ms. Remains 320 /320 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 320/320 places, 263/263 transitions.
RANDOM walk for 40000 steps (1929 resets) in 289 ms. (137 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (391 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (372 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (360 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (329 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (362 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (350 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (376 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (372 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 395893 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 8
Probabilistic random walk after 395893 steps, saw 100284 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
[2026-05-23 09:26:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 237/241 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 35/276 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 25/301 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 7/308 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 259/567 variables, 308/366 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 14/581 variables, 10/376 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 2/583 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/583 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/583 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,10 properties remain. new max is 131072
At refinement iteration 17 (OVERLAPS) 0/583 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
SDD size :2.67828e+10 after 9.15915e+10
After SMT solving in domain Real declared 583/583 variables, and 383 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3485 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 237/241 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 35/276 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 25/301 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 7/308 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 259/567 variables, 308/366 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 6/372 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 14/581 variables, 10/382 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/581 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 2/583 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/583 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:26:51] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 13 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/583 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/583 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 0/583 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 583/583 variables, and 392 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4580 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8080ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9999 ms.
Support contains 4 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 263/263 transitions.
Applied a total of 0 rules in 13 ms. Remains 320 /320 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 320/320 places, 263/263 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 263/263 transitions.
Applied a total of 0 rules in 12 ms. Remains 320 /320 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2026-05-23 09:27:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:27:03] [INFO ] Implicit Places using invariants in 294 ms returned []
[2026-05-23 09:27:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:27:04] [INFO ] Implicit Places using invariants and state equation in 1811 ms returned []
Implicit Place search using SMT with State Equation took 2107 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:27:04] [INFO ] Redundant transitions in 5 ms returned []
Running 260 sub problems to find dead transitions.
[2026-05-23 09:27:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Detected timeout of ITS tools.
[2026-05-23 09:27:11] [INFO ] Flatten gal took : 63 ms
[2026-05-23 09:27:11] [INFO ] Applying decomposition
[2026-05-23 09:27:11] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7041171016846631818.txt' '-o' '/tmp/graph7041171016846631818.bin' '-w' '/tmp/graph7041171016846631818.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7041171016846631818.bin' '-l' '-1' '-v' '-w' '/tmp/graph7041171016846631818.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:27:11] [INFO ] Decomposing Gal with order
[2026-05-23 09:27:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:27:11] [INFO ] Removed a total of 86 redundant transitions.
[2026-05-23 09:27:11] [INFO ] Flatten gal took : 154 ms
[2026-05-23 09:27:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 24 ms.
[2026-05-23 09:27:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15757106174576055115.gal : 14 ms
[2026-05-23 09:27:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10853836573979129041.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15757106174576055115.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10853836573979129041.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality10853836573979129041.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 18
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :18 after 770
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :770 after 2066
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :2066 after 34360
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :50736 after 3.48196e+09
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :3.48196e+09 after 5.99544e+09
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :5.99544e+09 after 9.45147e+09
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/320 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :9.45147e+09 after 4.70249e+10
At refinement iteration 5 (OVERLAPS) 263/583 variables, 320/383 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:27:16] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:27:16] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:27:21] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:27:22] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:27:22] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 3/388 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/583 variables, and 388 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 3/320 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 263/583 variables, 320/388 constraints. Problems are: Problem set: 0 solved, 260 unsolved
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :2.15217e+13 after 2.29721e+13
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :4.18273e+13 after 4.32777e+13
Detected timeout of ITS tools.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 260/648 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/583 variables, and 648 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60234ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60237ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62373 ms. Remains : 320/320 places, 263/263 transitions.
FORMULA DES-PT-50b-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50b-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Starting property specific reduction for DES-PT-50b-UpperBounds-00
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]
[2026-05-23 09:28:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (490 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10001 steps (97 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-23 09:28:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:05] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2026-05-23 09:28:05] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 29 ms returned sat
[2026-05-23 09:28:05] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2026-05-23 09:28:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:28:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2026-05-23 09:28:05] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 34 ms returned sat
[2026-05-23 09:28:05] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2026-05-23 09:28:05] [INFO ] Computed and/alt/rep : 249/442/249 causal constraints (skipped 11 transitions) in 26 ms.
[2026-05-23 09:28:07] [INFO ] Added : 200 causal constraints over 40 iterations in 2017 ms. Result :sat
Minimization took 218 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 320 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p163) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 262/262 transitions.
Graph (complete) has 1100 edges and 320 vertex of which 316 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 315 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 314 transition count 259
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 313 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5 place count 312 transition count 257
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 6 place count 312 transition count 257
Applied a total of 6 rules in 56 ms. Remains 312 /320 variables (removed 8) and now considering 257/262 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 312/320 places, 257/262 transitions.
// Phase 1: matrix 257 rows 312 cols
[2026-05-23 09:28:08] [INFO ] Computed 61 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (48017 resets) in 2622 ms. (381 steps per ms)
BEST_FIRST walk for 1000001 steps (9026 resets) in 936 ms. (1067 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-23 09:28:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:28:12] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2026-05-23 09:28:12] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 32 ms returned sat
[2026-05-23 09:28:12] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2026-05-23 09:28:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:28:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2026-05-23 09:28:12] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 32 ms returned sat
[2026-05-23 09:28:13] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:13] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 4 ms to minimize.
[2026-05-23 09:28:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2026-05-23 09:28:13] [INFO ] Computed and/alt/rep : 243/435/243 causal constraints (skipped 11 transitions) in 24 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:15] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 5 ms to minimize.
[2026-05-23 09:28:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2026-05-23 09:28:15] [INFO ] Added : 236 causal constraints over 48 iterations in 1907 ms. Result :sat
Minimization took 193 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 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 257/257 transitions.
Applied a total of 0 rules in 21 ms. Remains 312 /312 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 312/312 places, 257/257 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 257/257 transitions.
Applied a total of 0 rules in 19 ms. Remains 312 /312 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2026-05-23 09:28:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:28:16] [INFO ] Implicit Places using invariants in 480 ms returned []
[2026-05-23 09:28:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:28:17] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1474 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:28:17] [INFO ] Redundant transitions in 5 ms returned []
Running 254 sub problems to find dead transitions.
[2026-05-23 09:28:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 2/310 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 1/311 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 257/568 variables, 311/372 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:40] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:42] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:42] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:45] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 4/376 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 568/569 variables, and 376 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/312 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 1/311 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:53] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 10 (OVERLAPS) 257/568 variables, 311/377 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/568 variables, 254/631 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/569 variables, and 631 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/312 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61706 ms. Remains : 312/312 places, 257/257 transitions.
[2026-05-23 09:29:17] [INFO ] Flatten gal took : 51 ms
[2026-05-23 09:29:17] [INFO ] Flatten gal took : 29 ms
[2026-05-23 09:29:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3816646139706767528.gal : 6 ms
[2026-05-23 09:29:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13841445053612297426.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3816646139706767528.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13841445053612297426.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (1924 resets) in 228 ms. (174 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (348 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (368 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality13841445053612297426.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 28
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :28 after 40
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :40 after 84
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :84 after 860
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :860 after 5148
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5148 after 36968
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :36968 after 188168
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :188168 after 493000
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :493000 after 1.90059e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.77546e+09 after 2.66377e+09
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.78051e+09 after 2.78512e+09
Interrupted probabilistic random walk after 504176 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 2
Probabilistic random walk after 504176 steps, saw 127538 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2026-05-23 09:29:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 119/165 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 43/208 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 33/241 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/250 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 203/453 variables, 250/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/466 variables, 8/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/468 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/468 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/468 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 52/520 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/520 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/520 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 49/569 variables, 49/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/569 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/569 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 373 constraints, problems are : Problem set: 0 solved, 2 unsolved in 721 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 119/165 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 43/208 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:21] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 33/241 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 9/250 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 203/453 variables, 250/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/453 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 13/466 variables, 8/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/466 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/468 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/468 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/468 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/520 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/520 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/520 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/569 variables, 49/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.79085e+10 after 2.53258e+10
At refinement iteration 25 (INCLUDED_ONLY) 0/569 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/569 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 376 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1231 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1961ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2072 ms.
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 257/257 transitions.
Applied a total of 0 rules in 18 ms. Remains 312 /312 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 312/312 places, 257/257 transitions.
RANDOM walk for 40000 steps (1901 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (364 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (364 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :7.37836e+10 after 9.64794e+10
Interrupted probabilistic random walk after 553081 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 2
Probabilistic random walk after 553081 steps, saw 139965 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
[2026-05-23 09:29:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 119/165 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 43/208 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 33/241 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/250 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 203/453 variables, 250/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/466 variables, 8/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/468 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/468 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/468 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 52/520 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/520 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/520 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 49/569 variables, 49/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/569 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/569 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 373 constraints, problems are : Problem set: 0 solved, 2 unsolved in 681 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 119/165 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 43/208 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:28] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 33/241 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 9/250 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 203/453 variables, 250/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/453 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 13/466 variables, 8/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/466 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/468 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/468 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/468 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/520 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/520 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/520 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/569 variables, 49/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/569 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/569 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 376 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1144 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1841ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2006 ms.
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 257/257 transitions.
Applied a total of 0 rules in 12 ms. Remains 312 /312 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 312/312 places, 257/257 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 257/257 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2026-05-23 09:29:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:29:32] [INFO ] Implicit Places using invariants in 356 ms returned []
[2026-05-23 09:29:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:29:32] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 1004 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:29:32] [INFO ] Redundant transitions in 2 ms returned []
Running 254 sub problems to find dead transitions.
[2026-05-23 09:29:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 254 unsolved
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :2.4334e+11 after 2.43513e+11
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 2/310 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 1/311 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 254 unsolved
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :7.47559e+11 after 7.47932e+11
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 257/568 variables, 311/372 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:55] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:56] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:57] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:29:59] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 4/376 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:30:02] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 568/569 variables, and 377 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/312 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 1/311 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Detected timeout of ITS tools.
[2026-05-23 09:30:07] [INFO ] Flatten gal took : 23 ms
[2026-05-23 09:30:07] [INFO ] Applying decomposition
[2026-05-23 09:30:07] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17736870385517051931.txt' '-o' '/tmp/graph17736870385517051931.bin' '-w' '/tmp/graph17736870385517051931.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17736870385517051931.bin' '-l' '-1' '-v' '-w' '/tmp/graph17736870385517051931.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:30:07] [INFO ] Decomposing Gal with order
[2026-05-23 09:30:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:30:07] [INFO ] Removed a total of 45 redundant transitions.
[2026-05-23 09:30:07] [INFO ] Flatten gal took : 35 ms
[2026-05-23 09:30:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 6 ms.
[2026-05-23 09:30:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15762020790033691482.gal : 8 ms
[2026-05-23 09:30:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8608522290601946416.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15762020790033691482.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8608522290601946416.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality8608522290601946416.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 706
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :706 after 4132
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :4132 after 48952
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :48952 after 1.37796e+09
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.37796e+09 after 2.39695e+09
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.39695e+09 after 3.58576e+09
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.58576e+09 after 5.4539e+09
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:30:09] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:30:09] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 10 (OVERLAPS) 257/568 variables, 311/379 constraints. Problems are: Problem set: 0 solved, 254 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2.67313e+12 after 2.67313e+12
At refinement iteration 11 (INCLUDED_ONLY) 0/568 variables, 254/633 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/569 variables, and 633 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/312 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61186 ms. Remains : 312/312 places, 257/257 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 257
Applied a total of 1 rules in 29 ms. Remains 312 /312 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 257 rows 312 cols
[2026-05-23 09:30:33] [INFO ] Computed 61 invariants in 6 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-23 09:30:33] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2026-05-23 09:30:33] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 34 ms returned sat
[2026-05-23 09:30:33] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-23 09:30:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2026-05-23 09:30:33] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 30 ms returned sat
[2026-05-23 09:30:33] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:30:33] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 4 ms to minimize.
[2026-05-23 09:30:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
TRAPS : Iteration 1
[2026-05-23 09:30:33] [INFO ] After 389ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-23 09:30:33] [INFO ] After 635ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-23 09:30:33] [INFO ] Flatten gal took : 34 ms
[2026-05-23 09:30:33] [INFO ] Flatten gal took : 33 ms
[2026-05-23 09:30:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10197356296913982075.gal : 4 ms
[2026-05-23 09:30:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5093988593549546048.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10197356296913982075.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5093988593549546048.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5093988593549546048.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 32
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :32 after 34
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :34 after 48
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :48 after 948
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :948 after 2452
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2452 after 38984
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :38984 after 191368
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :191368 after 544104
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :544104 after 1.91706e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.77546e+09 after 2.66492e+09
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.78051e+09 after 2.80315e+09
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.79085e+10 after 2.53312e+10
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :9.91794e+10 after 9.91878e+10
Detected timeout of ITS tools.
[2026-05-23 09:30:49] [INFO ] Flatten gal took : 20 ms
[2026-05-23 09:30:49] [INFO ] Applying decomposition
[2026-05-23 09:30:49] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12213333267285756585.txt' '-o' '/tmp/graph12213333267285756585.bin' '-w' '/tmp/graph12213333267285756585.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12213333267285756585.bin' '-l' '-1' '-v' '-w' '/tmp/graph12213333267285756585.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:30:49] [INFO ] Decomposing Gal with order
[2026-05-23 09:30:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:30:49] [INFO ] Removed a total of 37 redundant transitions.
[2026-05-23 09:30:49] [INFO ] Flatten gal took : 27 ms
[2026-05-23 09:30:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 3 ms.
[2026-05-23 09:30:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2026130065373504726.gal : 14 ms
[2026-05-23 09:30:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4976064766582321400.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2026130065373504726.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4976064766582321400.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4976064766582321400.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 708
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :708 after 34360
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :50736 after 6.06381e+08
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6.06381e+08 after 1.11588e+09
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.11588e+09 after 1.96503e+09
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.96503e+09 after 3.15384e+09
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3.15384e+09 after 5.19181e+09
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.57096e+13 after 1.61959e+13
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 2049 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\_mod\_flat,5.98372e+13,7.54654,171260,9574,8692,404248,23749,309,325634,453,183150,0
Total reachable state count : 59837155256494
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,34224,7.57539,171260,81,357,404248,23749,311,325634,456,183150,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,34224,7.58211,171260,81,357,404248,23749,315,325634,458,183150,0
Over-approximation ignoring read arcs solved 0 properties in 23812 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-50b-UpperBounds-00 in 171752 ms.
Starting property specific reduction for DES-PT-50b-UpperBounds-14
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]
// Phase 1: matrix 263 rows 320 cols
[2026-05-23 09:30:56] [INFO ] Computed 63 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (478 resets) in 22 ms. (434 steps per ms)
BEST_FIRST walk for 10001 steps (83 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-23 09:30:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:30:57] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2026-05-23 09:30:57] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 28 ms returned sat
[2026-05-23 09:30:57] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:30:57] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 4 ms to minimize.
[2026-05-23 09:30:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:30:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2026-05-23 09:30:57] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 26 ms returned sat
[2026-05-23 09:30:57] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2026-05-23 09:30:57] [INFO ] Computed and/alt/rep : 249/442/249 causal constraints (skipped 11 transitions) in 29 ms.
[2026-05-23 09:31:00] [INFO ] Added : 210 causal constraints over 42 iterations in 2807 ms. Result :sat
Minimization took 208 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 320 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p8) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 262/262 transitions.
Graph (complete) has 1098 edges and 320 vertex of which 316 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 315 transition count 260
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 315 transition count 260
Applied a total of 3 rules in 21 ms. Remains 315 /320 variables (removed 5) and now considering 260/262 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 315/320 places, 260/262 transitions.
// Phase 1: matrix 260 rows 315 cols
[2026-05-23 09:31:01] [INFO ] Computed 61 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47931 resets) in 2022 ms. (494 steps per ms)
BEST_FIRST walk for 1000000 steps (9031 resets) in 1011 ms. (988 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-23 09:31:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:31:04] [INFO ] [Real]Absence check using 37 positive place invariants in 14 ms returned sat
[2026-05-23 09:31:04] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 19 ms returned sat
[2026-05-23 09:31:04] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2026-05-23 09:31:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:31:04] [INFO ] [Nat]Absence check using 37 positive place invariants in 13 ms returned sat
[2026-05-23 09:31:04] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 17 ms returned sat
[2026-05-23 09:31:05] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2026-05-23 09:31:05] [INFO ] Computed and/alt/rep : 246/434/246 causal constraints (skipped 11 transitions) in 16 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:31:06] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 5 ms to minimize.
[2026-05-23 09:31:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2026-05-23 09:31:06] [INFO ] Added : 243 causal constraints over 49 iterations in 1925 ms. Result :sat
Minimization took 270 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 315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 260/260 transitions.
Applied a total of 0 rules in 9 ms. Remains 315 /315 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 315/315 places, 260/260 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 260/260 transitions.
Applied a total of 0 rules in 9 ms. Remains 315 /315 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2026-05-23 09:31:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:31:08] [INFO ] Implicit Places using invariants in 402 ms returned []
[2026-05-23 09:31:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:31:09] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:31:09] [INFO ] Redundant transitions in 1 ms returned []
Running 257 sub problems to find dead transitions.
[2026-05-23 09:31:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:31:17] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 2/314 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (OVERLAPS) 260/574 variables, 314/376 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:31:28] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:31:30] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:31:31] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:31:32] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:31:32] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:31:33] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 6/382 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 574/575 variables, and 382 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 314/315 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 1/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 2/314 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:31:47] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:31:52] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:31:52] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 16 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 11 (OVERLAPS) 260/574 variables, 314/385 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 257/642 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/575 variables, and 642 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 314/315 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61334 ms. Remains : 315/315 places, 260/260 transitions.
[2026-05-23 09:32:09] [INFO ] Flatten gal took : 17 ms
[2026-05-23 09:32:09] [INFO ] Flatten gal took : 16 ms
[2026-05-23 09:32:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4947229243601715018.gal : 6 ms
[2026-05-23 09:32:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13522177637155231319.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4947229243601715018.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13522177637155231319.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (1925 resets) in 253 ms. (157 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (370 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality13522177637155231319.prop.
BEST_FIRST walk for 40004 steps (362 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 28
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :28 after 40
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :40 after 84
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :84 after 854
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :854 after 1556
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1556 after 28040
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :28040 after 187740
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :187740 after 446168
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :446168 after 1.89034e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.77546e+09 after 2.66356e+09
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.78051e+09 after 2.78489e+09
Interrupted probabilistic random walk after 561038 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 2
Probabilistic random walk after 561038 steps, saw 141804 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
[2026-05-23 09:32:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 136/184 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/221 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/246 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/253 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 206/459 variables, 253/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/472 variables, 8/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/472 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/474 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/474 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/474 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 52/526 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/526 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 49/575 variables, 49/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/575 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/575 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 575/575 variables, and 376 constraints, problems are : Problem set: 0 solved, 2 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 136/184 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/221 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/246 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/253 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 206/459 variables, 253/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/459 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 13/472 variables, 8/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/472 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
At refinement iteration 16 (INCLUDED_ONLY) 0/472 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/474 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/474 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :1.79085e+10 after 2.53216e+10
At refinement iteration 19 (INCLUDED_ONLY) 0/474 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 52/526 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/526 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/575 variables, 49/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/575 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/575 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 575/575 variables, and 378 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1727ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2388 ms.
Support contains 1 out of 315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 260/260 transitions.
Applied a total of 0 rules in 9 ms. Remains 315 /315 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 315/315 places, 260/260 transitions.
RANDOM walk for 40000 steps (1876 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (367 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (347 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :7.37836e+10 after 9.64653e+10
Interrupted probabilistic random walk after 541255 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 2
Probabilistic random walk after 541255 steps, saw 136819 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2026-05-23 09:32:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 136/184 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/221 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/246 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/253 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 206/459 variables, 253/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/472 variables, 8/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/472 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/474 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/474 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/474 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 52/526 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/526 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 49/575 variables, 49/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/575 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/575 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 575/575 variables, and 376 constraints, problems are : Problem set: 0 solved, 2 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 136/184 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/221 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/246 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/253 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 206/459 variables, 253/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/459 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 13/472 variables, 8/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/472 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/472 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/474 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/474 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/474 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 52/526 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/526 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/575 variables, 49/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/575 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/575 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 575/575 variables, and 378 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1233 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1783ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2229 ms.
Support contains 1 out of 315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 260/260 transitions.
Applied a total of 0 rules in 9 ms. Remains 315 /315 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 315/315 places, 260/260 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 260/260 transitions.
Applied a total of 0 rules in 9 ms. Remains 315 /315 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2026-05-23 09:32:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:32:23] [INFO ] Implicit Places using invariants in 291 ms returned []
[2026-05-23 09:32:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:32:24] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:32:24] [INFO ] Redundant transitions in 1 ms returned []
Running 257 sub problems to find dead transitions.
[2026-05-23 09:32:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :2.4334e+11 after 2.43509e+11
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:32:36] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 257 unsolved
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :7.47559e+11 after 7.4789e+11
At refinement iteration 6 (OVERLAPS) 2/314 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (OVERLAPS) 260/574 variables, 314/376 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:32:47] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:32:49] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:32:49] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:32:50] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:32:50] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:32:52] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 9 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 6/382 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 574/575 variables, and 382 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 314/315 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 1/312 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Detected timeout of ITS tools.
[2026-05-23 09:32:59] [INFO ] Flatten gal took : 24 ms
[2026-05-23 09:32:59] [INFO ] Applying decomposition
[2026-05-23 09:32:59] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12516490644886055551.txt' '-o' '/tmp/graph12516490644886055551.bin' '-w' '/tmp/graph12516490644886055551.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12516490644886055551.bin' '-l' '-1' '-v' '-w' '/tmp/graph12516490644886055551.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:32:59] [INFO ] Decomposing Gal with order
[2026-05-23 09:32:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:32:59] [INFO ] Removed a total of 82 redundant transitions.
[2026-05-23 09:32:59] [INFO ] Flatten gal took : 40 ms
[2026-05-23 09:32:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 7 ms.
[2026-05-23 09:32:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8588101428602088095.gal : 7 ms
[2026-05-23 09:32:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16867732766630890971.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8588101428602088095.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16867732766630890971.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality16867732766630890971.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 770
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :770 after 2066
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2066 after 34360
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 257 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :50736 after 1.05213e+10
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.05213e+10 after 1.99626e+10
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.99626e+10 after 3.1502e+10
At refinement iteration 7 (OVERLAPS) 2/314 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:33:03] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 11 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :7.52963e+10 after 7.7357e+10
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:33:08] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:33:08] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 18 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 11 (OVERLAPS) 260/574 variables, 314/385 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 257/642 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/575 variables, and 642 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 314/315 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61396 ms. Remains : 315/315 places, 260/260 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 315 transition count 260
Applied a total of 1 rules in 17 ms. Remains 315 /315 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 260 rows 315 cols
[2026-05-23 09:33:25] [INFO ] Computed 61 invariants in 3 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-23 09:33:25] [INFO ] [Real]Absence check using 37 positive place invariants in 16 ms returned sat
[2026-05-23 09:33:25] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 32 ms returned sat
[2026-05-23 09:33:25] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-23 09:33:25] [INFO ] [Nat]Absence check using 37 positive place invariants in 16 ms returned sat
[2026-05-23 09:33:25] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 29 ms returned sat
[2026-05-23 09:33:25] [INFO ] After 365ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-23 09:33:25] [INFO ] After 432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-23 09:33:25] [INFO ] After 645ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-23 09:33:25] [INFO ] Flatten gal took : 19 ms
[2026-05-23 09:33:25] [INFO ] Flatten gal took : 18 ms
[2026-05-23 09:33:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9295224692997106709.gal : 3 ms
[2026-05-23 09:33:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16089119622351539014.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9295224692997106709.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16089119622351539014.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16089119622351539014.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 28
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :28 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 78
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :78 after 1140
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1140 after 2492
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2492 after 44648
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :44648 after 191208
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :191208 after 558776
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :558776 after 1.93554e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.77546e+09 after 2.66497e+09
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.78051e+09 after 2.80319e+09
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.79085e+10 after 2.53312e+10
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :9.91794e+10 after 9.91881e+10
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :2.4334e+11 after 2.45092e+11
Detected timeout of ITS tools.
[2026-05-23 09:33:40] [INFO ] Flatten gal took : 13 ms
[2026-05-23 09:33:40] [INFO ] Applying decomposition
[2026-05-23 09:33:40] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1518173060362467043.txt' '-o' '/tmp/graph1518173060362467043.bin' '-w' '/tmp/graph1518173060362467043.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1518173060362467043.bin' '-l' '-1' '-v' '-w' '/tmp/graph1518173060362467043.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:33:41] [INFO ] Decomposing Gal with order
[2026-05-23 09:33:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:33:41] [INFO ] Removed a total of 37 redundant transitions.
[2026-05-23 09:33:41] [INFO ] Flatten gal took : 32 ms
[2026-05-23 09:33:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 2 ms.
[2026-05-23 09:33:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9992104905691045265.gal : 4 ms
[2026-05-23 09:33:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16293090875037217095.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9992104905691045265.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16293090875037217095.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality16293090875037217095.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 804
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :804 after 34360
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :50736 after 6.06307e+08
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6.06307e+08 after 1.1158e+09
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.1158e+09 after 1.96495e+09
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.96495e+09 after 3.15377e+09
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3.15377e+09 after 5.19173e+09
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3.27871e+13 after 3.34626e+13
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.57096e+13 after 1.61959e+13
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5.77417e+13 after 5.83877e+13
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\_mod\_flat,6.72354e+13,6.56065,180992,26533,8974,507154,22902,295,315235,438,190663,0
Total reachable state count : 67235430600178
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,3.86494e+09,6.59438,180992,308,752,507154,22902,295,315235,440,190663,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,3.86494e+09,6.60179,180992,308,752,507154,22902,297,315235,441,190663,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 22693 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-50b-UpperBounds-14 in 170897 ms.
Starting property specific reduction for DES-PT-50b-UpperBounds-15
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]
// Phase 1: matrix 263 rows 320 cols
[2026-05-23 09:33:47] [INFO ] Computed 63 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (465 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10000 steps (111 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-23 09:33:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:33:47] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2026-05-23 09:33:47] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 28 ms returned sat
[2026-05-23 09:33:48] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2026-05-23 09:33:48] [INFO ] Computed and/alt/rep : 249/442/249 causal constraints (skipped 11 transitions) in 30 ms.
[2026-05-23 09:33:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:33:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 20 ms returned sat
[2026-05-23 09:33:48] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 42 ms returned sat
[2026-05-23 09:33:48] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2026-05-23 09:33:48] [INFO ] Computed and/alt/rep : 249/442/249 causal constraints (skipped 11 transitions) in 28 ms.
[2026-05-23 09:33:52] [INFO ] Added : 244 causal constraints over 49 iterations in 3470 ms. Result :sat
Minimization took 438 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 320 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p56) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 262/262 transitions.
Graph (complete) has 1103 edges and 320 vertex of which 317 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 317 transition count 262
Applied a total of 2 rules in 20 ms. Remains 317 /320 variables (removed 3) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 317/320 places, 262/262 transitions.
// Phase 1: matrix 262 rows 317 cols
[2026-05-23 09:33:53] [INFO ] Computed 61 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47868 resets) in 2050 ms. (487 steps per ms)
BEST_FIRST walk for 1000001 steps (9066 resets) in 927 ms. (1077 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-23 09:33:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:33:56] [INFO ] [Real]Absence check using 37 positive place invariants in 20 ms returned sat
[2026-05-23 09:33:56] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 25 ms returned sat
[2026-05-23 09:33:57] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2026-05-23 09:33:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:33:57] [INFO ] [Nat]Absence check using 37 positive place invariants in 21 ms returned sat
[2026-05-23 09:33:57] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 29 ms returned sat
[2026-05-23 09:33:57] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2026-05-23 09:33:57] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 28 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:34:00] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 7 ms to minimize.
[2026-05-23 09:34:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2026-05-23 09:34:00] [INFO ] Added : 247 causal constraints over 50 iterations in 2743 ms. Result :sat
Minimization took 338 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 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 262/262 transitions.
Applied a total of 0 rules in 13 ms. Remains 317 /317 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 317/317 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 262/262 transitions.
Applied a total of 0 rules in 13 ms. Remains 317 /317 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2026-05-23 09:34:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:34:02] [INFO ] Implicit Places using invariants in 550 ms returned []
[2026-05-23 09:34:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:34:03] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1548 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:34:03] [INFO ] Redundant transitions in 2 ms returned []
Running 259 sub problems to find dead transitions.
[2026-05-23 09:34:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 2/315 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/316 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 262/578 variables, 316/377 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:34:22] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:34:24] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:34:25] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/579 variables, and 380 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/317 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 2/315 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:34:38] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:34:39] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 1/316 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (OVERLAPS) 262/578 variables, 316/382 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 259/641 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/579 variables, and 641 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/317 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61735 ms. Remains : 317/317 places, 262/262 transitions.
[2026-05-23 09:35:03] [INFO ] Flatten gal took : 21 ms
[2026-05-23 09:35:03] [INFO ] Flatten gal took : 13 ms
[2026-05-23 09:35:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6933009386421536444.gal : 3 ms
[2026-05-23 09:35:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2050995945650980012.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6933009386421536444.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2050995945650980012.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2050995945650980012.prop.
RANDOM walk for 40000 steps (1929 resets) in 275 ms. (144 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (353 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 28
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :28 after 40
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :40 after 84
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :84 after 1128
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1128 after 2804
BEST_FIRST walk for 40002 steps (376 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2804 after 38984
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :38984 after 190956
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :190956 after 478648
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :478648 after 1.88554e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.77546e+09 after 2.66415e+09
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.78051e+09 after 2.80306e+09
Interrupted probabilistic random walk after 565990 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 2
Probabilistic random walk after 565990 steps, saw 142994 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
[2026-05-23 09:35:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 135/186 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/223 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 208/463 variables, 255/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/463 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/476 variables, 8/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/478 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/478 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/478 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 52/530 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 49/579 variables, 49/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/579 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/579 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/579 variables, and 378 constraints, problems are : Problem set: 0 solved, 2 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :1.79085e+10 after 2.53259e+10
At refinement iteration 3 (OVERLAPS) 135/186 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/223 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 208/463 variables, 255/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/463 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:35:07] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/463 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 13/476 variables, 8/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/476 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/476 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/478 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/478 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/478 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/530 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/530 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/530 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/579 variables, 49/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:35:08] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 7 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/579 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/579 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/579 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 579/579 variables, and 382 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1237 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1950ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2504 ms.
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 317 /317 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 317/317 places, 262/262 transitions.
RANDOM walk for 40000 steps (1967 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (356 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (362 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :7.37836e+10 after 9.64698e+10
Interrupted probabilistic random walk after 566069 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 2
Probabilistic random walk after 566069 steps, saw 143017 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
[2026-05-23 09:35:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 135/186 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/223 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 208/463 variables, 255/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/463 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/476 variables, 8/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/478 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/478 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/478 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 52/530 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 49/579 variables, 49/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/579 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/579 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/579 variables, and 378 constraints, problems are : Problem set: 0 solved, 2 unsolved in 995 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 135/186 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/223 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/248 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/255 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 208/463 variables, 255/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/463 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:35:15] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/463 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 13/476 variables, 8/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/476 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/476 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/478 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/478 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/478 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/530 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/530 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/530 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/579 variables, 49/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:35:16] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 4 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/579 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/579 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/579 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 579/579 variables, and 382 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1331 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2332ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2498 ms.
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 317 /317 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 317/317 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 317 /317 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2026-05-23 09:35:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :2.4334e+11 after 2.45082e+11
[2026-05-23 09:35:19] [INFO ] Implicit Places using invariants in 343 ms returned []
[2026-05-23 09:35:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:35:19] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:35:19] [INFO ] Redundant transitions in 2 ms returned []
Running 259 sub problems to find dead transitions.
[2026-05-23 09:35:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 2/315 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/316 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 262/578 variables, 316/377 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:35:35] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 15 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :7.47559e+11 after 7.47625e+11
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:35:37] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:35:38] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (OVERLAPS) 1/579 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 579/579 variables, and 381 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 2/315 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Detected timeout of ITS tools.
[2026-05-23 09:35:53] [INFO ] Flatten gal took : 22 ms
[2026-05-23 09:35:53] [INFO ] Applying decomposition
[2026-05-23 09:35:53] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17324854488485821542.txt' '-o' '/tmp/graph17324854488485821542.bin' '-w' '/tmp/graph17324854488485821542.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17324854488485821542.bin' '-l' '-1' '-v' '-w' '/tmp/graph17324854488485821542.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:35:53] [INFO ] Decomposing Gal with order
[2026-05-23 09:35:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:35:53] [INFO ] Removed a total of 47 redundant transitions.
[2026-05-23 09:35:53] [INFO ] Flatten gal took : 23 ms
[2026-05-23 09:35:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 2 ms.
[2026-05-23 09:35:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4665146905099502779.gal : 4 ms
[2026-05-23 09:35:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4618667316160308510.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4665146905099502779.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4618667316160308510.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4618667316160308510.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 386
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :386 after 4132
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :4132 after 50736
[2026-05-23 09:35:53] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:35:54] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 259 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :50736 after 1.37795e+09
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.37795e+09 after 2.39693e+09
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.39693e+09 after 3.58574e+09
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.58574e+09 after 5.45388e+09
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 1/316 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (OVERLAPS) 262/578 variables, 316/382 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 259/641 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/579 variables, and 641 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 316/317 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 60176ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61105 ms. Remains : 317/317 places, 262/262 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 317 transition count 262
Applied a total of 1 rules in 16 ms. Remains 317 /317 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 262 rows 317 cols
[2026-05-23 09:36:20] [INFO ] Computed 61 invariants in 4 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-23 09:36:20] [INFO ] [Real]Absence check using 37 positive place invariants in 12 ms returned sat
[2026-05-23 09:36:20] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 32 ms returned sat
[2026-05-23 09:36:20] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-23 09:36:20] [INFO ] [Nat]Absence check using 37 positive place invariants in 12 ms returned sat
[2026-05-23 09:36:20] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 29 ms returned sat
[2026-05-23 09:36:20] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:36:20] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 4 ms to minimize.
[2026-05-23 09:36:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
TRAPS : Iteration 1
[2026-05-23 09:36:20] [INFO ] After 395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-23 09:36:20] [INFO ] After 566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-23 09:36:20] [INFO ] Flatten gal took : 13 ms
[2026-05-23 09:36:20] [INFO ] Flatten gal took : 13 ms
[2026-05-23 09:36:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1658801946611165575.gal : 2 ms
[2026-05-23 09:36:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8388713552828962225.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1658801946611165575.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8388713552828962225.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8388713552828962225.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 28
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :28 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 78
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :78 after 992
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :992 after 2924
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2924 after 80768
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :80768 after 128760
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :128760 after 386144
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.77546e+09 after 1.83241e+09
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.99798e+09 after 3.00269e+09
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.79085e+10 after 1.83418e+10
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.78314e+10 after 2.78693e+10
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.04648e+11 after 1.04753e+11
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :4.79991e+11 after 4.8001e+11
Detected timeout of ITS tools.
[2026-05-23 09:36:35] [INFO ] Flatten gal took : 12 ms
[2026-05-23 09:36:35] [INFO ] Applying decomposition
[2026-05-23 09:36:35] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12587949026207100221.txt' '-o' '/tmp/graph12587949026207100221.bin' '-w' '/tmp/graph12587949026207100221.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12587949026207100221.bin' '-l' '-1' '-v' '-w' '/tmp/graph12587949026207100221.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:36:35] [INFO ] Decomposing Gal with order
[2026-05-23 09:36:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:36:35] [INFO ] Removed a total of 38 redundant transitions.
[2026-05-23 09:36:35] [INFO ] Flatten gal took : 25 ms
[2026-05-23 09:36:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 2 ms.
[2026-05-23 09:36:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16105155667863216785.gal : 4 ms
[2026-05-23 09:36:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9482747523537025020.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16105155667863216785.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9482747523537025020.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality9482747523537025020.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 3032
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :3032 after 34360
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :50736 after 1.1065e+09
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.1065e+09 after 2.01981e+09
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.01981e+09 after 3.54199e+09
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.54199e+09 after 5.67304e+09
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5.67304e+09 after 9.32628e+09
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.57096e+13 after 1.61959e+13
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5.77417e+13 after 5.79239e+13
Detected timeout of ITS tools.
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\_mod\_flat,6.89686e+13,9.65742,198780,10483,10060,463618,25395,309,375004,438,219188,0
Total reachable state count : 68968559607162
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,2.13712e+11,9.71199,198908,965,853,463618,25395,309,375004,440,219188,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,2.13712e+11,9.72685,198908,965,853,463618,25395,311,375004,441,219188,0
Over-approximation ignoring read arcs solved 0 properties in 25738 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-50b-UpperBounds-15 in 177937 ms.
[2026-05-23 09:36:45] [INFO ] Flatten gal took : 17 ms
[2026-05-23 09:36:45] [INFO ] Applying decomposition
[2026-05-23 09:36:45] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6101869726877433883.txt' '-o' '/tmp/graph6101869726877433883.bin' '-w' '/tmp/graph6101869726877433883.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6101869726877433883.bin' '-l' '-1' '-v' '-w' '/tmp/graph6101869726877433883.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:36:45] [INFO ] Decomposing Gal with order
[2026-05-23 09:36:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:36:45] [INFO ] Removed a total of 88 redundant transitions.
[2026-05-23 09:36:45] [INFO ] Flatten gal took : 21 ms
[2026-05-23 09:36:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 4 ms.
[2026-05-23 09:36:45] [INFO ] Time to serialize gal into /tmp/UpperBounds13902623154458910572.gal : 3 ms
[2026-05-23 09:36:45] [INFO ] Time to serialize properties into /tmp/UpperBounds15829950690955520843.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13902623154458910572.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15829950690955520843.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds15829950690955520843.prop.
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\_mod\_flat,6.90188e+13,66.9319,972784,19847,8128,1.02395e+06,19961,344,7.42959e+06,448,263674,0
Total reachable state count : 69018791059726
Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-50b-UpperBounds-00 :0 <= u2.p163 <= 1
FORMULA DES-PT-50b-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-50b-UpperBounds-00,0,82.9779,972784,1,0,1.02395e+06,19961,525,7.42959e+06,605,359895,1658
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-50b-UpperBounds-14 :0 <= i3.u14.p8 <= 1
FORMULA DES-PT-50b-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-50b-UpperBounds-14,0,84.7245,972784,1,0,1.02395e+06,19961,556,7.42959e+06,658,364977,2075
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-50b-UpperBounds-15 :0 <= u48.p56 <= 1
FORMULA DES-PT-50b-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-50b-UpperBounds-15,0,86.476,972784,1,0,1.02395e+06,19961,584,7.42959e+06,772,371569,2535
Total runtime 841413 ms.
BK_STOP 1779529092892
--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="DES-PT-50b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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 gold2025"
echo " Input is DES-PT-50b, 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 r095-smll-177946996300055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50b.tgz
mv DES-PT-50b 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 ;