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.r127-smll-177955743800035.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 EisenbergMcGuire-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-smll-177955743800035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 9.5K Mar 7 05:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Mar 7 05:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 05:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 7 05:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 09:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 09:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 09:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Mar 7 05:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 05:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 7 05:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 7 05:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779568990848

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 20:43:12] [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 20:43:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 20:43:13] [INFO ] Load time of PNML (sax parser for PT used): 408 ms
[2026-05-23 20:43:13] [INFO ] Transformed 712 places.
[2026-05-23 20:43:13] [INFO ] Transformed 2816 transitions.
[2026-05-23 20:43:13] [INFO ] Found NUPN structural information;
[2026-05-23 20:43:13] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 618 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[1, 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]
FORMULA EisenbergMcGuire-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-23 20:43:13] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
// Phase 1: matrix 1368 rows 712 cols
[2026-05-23 20:43:13] [INFO ] Computed 25 invariants in 70 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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 103 ms. (96 steps per ms)
FORMULA EisenbergMcGuire-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-23 20:43:13] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
[2026-05-23 20:43:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 20:43:14] [INFO ] [Real]Absence check using 17 positive place invariants in 45 ms returned sat
[2026-05-23 20:43:14] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 10 ms returned sat
[2026-05-23 20:43:15] [INFO ] [Real]Absence check using state equation in 635 ms returned sat
[2026-05-23 20:43:15] [INFO ] State equation strengthened by 676 read => feed constraints.
[2026-05-23 20:43:15] [INFO ] [Real]Added 676 Read/Feed constraints in 188 ms returned sat
[2026-05-23 20:43:15] [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 20:43:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 35 ms returned sat
[2026-05-23 20:43:16] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 9 ms returned sat
[2026-05-23 20:43:16] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2026-05-23 20:43:16] [INFO ] [Nat]Added 676 Read/Feed constraints in 185 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:17] [INFO ] Deduced a trap composed of 3 places in 579 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:18] [INFO ] Deduced a trap composed of 3 places in 619 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:18] [INFO ] Deduced a trap composed of 3 places in 563 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:19] [INFO ] Deduced a trap composed of 3 places in 641 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:20] [INFO ] Deduced a trap composed of 20 places in 625 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:21] [INFO ] Deduced a trap composed of 26 places in 596 ms of which 45 ms to minimize.
[2026-05-23 20:43:21] [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.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 20:43:21] [INFO ] [Real]Absence check using 17 positive place invariants in 32 ms returned sat
[2026-05-23 20:43:21] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2026-05-23 20:43:21] [INFO ] [Real]Absence check using state equation in 541 ms returned sat
[2026-05-23 20:43:22] [INFO ] [Real]Added 676 Read/Feed constraints in 190 ms returned sat
[2026-05-23 20:43:22] [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 20:43:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 34 ms returned sat
[2026-05-23 20:43:22] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 15 ms returned sat
[2026-05-23 20:43:22] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2026-05-23 20:43:23] [INFO ] [Nat]Added 676 Read/Feed constraints in 203 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:23] [INFO ] Deduced a trap composed of 3 places in 654 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:24] [INFO ] Deduced a trap composed of 3 places in 603 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:25] [INFO ] Deduced a trap composed of 3 places in 644 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:25] [INFO ] Deduced a trap composed of 20 places in 597 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:26] [INFO ] Deduced a trap composed of 26 places in 528 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:27] [INFO ] Deduced a trap composed of 3 places in 484 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:27] [INFO ] Deduced a trap composed of 3 places in 411 ms of which 15 ms to minimize.
[2026-05-23 20:43:27] [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.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 20:43:27] [INFO ] [Real]Absence check using 17 positive place invariants in 33 ms returned sat
[2026-05-23 20:43:27] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 9 ms returned sat
[2026-05-23 20:43:28] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2026-05-23 20:43:28] [INFO ] [Real]Added 676 Read/Feed constraints in 134 ms returned sat
[2026-05-23 20:43:28] [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 20:43:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 30 ms returned sat
[2026-05-23 20:43:28] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 9 ms returned sat
[2026-05-23 20:43:29] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2026-05-23 20:43:29] [INFO ] [Nat]Added 676 Read/Feed constraints in 156 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:30] [INFO ] Deduced a trap composed of 3 places in 613 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:30] [INFO ] Deduced a trap composed of 3 places in 552 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:31] [INFO ] Deduced a trap composed of 3 places in 579 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:32] [INFO ] Deduced a trap composed of 23 places in 613 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:32] [INFO ] Deduced a trap composed of 26 places in 498 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:33] [INFO ] Deduced a trap composed of 3 places in 486 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:33] [INFO ] Deduced a trap composed of 3 places in 376 ms of which 16 ms to minimize.
[2026-05-23 20:43:33] [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 20:43:34] [INFO ] [Real]Absence check using 17 positive place invariants in 35 ms returned sat
[2026-05-23 20:43:34] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 9 ms returned sat
[2026-05-23 20:43:34] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2026-05-23 20:43:34] [INFO ] [Real]Added 676 Read/Feed constraints in 137 ms returned sat
[2026-05-23 20:43:34] [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 20:43:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 31 ms returned sat
[2026-05-23 20:43:35] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2026-05-23 20:43:35] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2026-05-23 20:43:35] [INFO ] [Nat]Added 676 Read/Feed constraints in 171 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:36] [INFO ] Deduced a trap composed of 3 places in 569 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:37] [INFO ] Deduced a trap composed of 20 places in 617 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:37] [INFO ] Deduced a trap composed of 3 places in 573 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:38] [INFO ] Deduced a trap composed of 3 places in 563 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:38] [INFO ] Deduced a trap composed of 26 places in 476 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:39] [INFO ] Deduced a trap composed of 3 places in 475 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:39] [INFO ] Deduced a trap composed of 3 places in 365 ms of which 15 ms to minimize.
[2026-05-23 20:43:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 712 transition count 2808
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 704 transition count 2808
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 16 place count 704 transition count 2610
Deduced a syphon composed of 198 places in 4 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 412 place count 506 transition count 2610
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 468 place count 450 transition count 2162
Iterating global reduction 2 with 56 rules applied. Total rules applied 524 place count 450 transition count 2162
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 4 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 636 place count 394 transition count 2106
Applied a total of 636 rules in 411 ms. Remains 394 /712 variables (removed 318) and now considering 2106/2816 (removed 710) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 424 ms. Remains : 394/712 places, 2106/2816 transitions.
[2026-05-23 20:43:40] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
// Phase 1: matrix 658 rows 394 cols
[2026-05-23 20:43:40] [INFO ] Computed 25 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2649 ms. (377 steps per ms)
FORMULA EisenbergMcGuire-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000003 steps (6 resets) in 2068 ms. (1449 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-23 20:43:45] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2026-05-23 20:43:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:43:45] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2026-05-23 20:43:45] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2026-05-23 20:43:45] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2026-05-23 20:43:45] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-23 20:43:45] [INFO ] [Real]Added 284 Read/Feed constraints in 84 ms returned sat
[2026-05-23 20:43:45] [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 20:43:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2026-05-23 20:43:45] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 7 ms returned sat
[2026-05-23 20:43:46] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2026-05-23 20:43:46] [INFO ] [Nat]Added 284 Read/Feed constraints in 73 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:46] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 4 ms to minimize.
[2026-05-23 20:43:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2026-05-23 20:43:46] [INFO ] Computed and/alt/rep : 571/1394/403 causal constraints (skipped 247 transitions) in 128 ms.
[2026-05-23 20:43:47] [INFO ] Added : 49 causal constraints over 10 iterations in 701 ms. Result :sat
Minimization took 267 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:43:47] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2026-05-23 20:43:47] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2026-05-23 20:43:47] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2026-05-23 20:43:47] [INFO ] [Real]Added 284 Read/Feed constraints in 80 ms returned sat
[2026-05-23 20:43:47] [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 20:43:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2026-05-23 20:43:47] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2026-05-23 20:43:48] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2026-05-23 20:43:48] [INFO ] [Nat]Added 284 Read/Feed constraints in 67 ms returned sat
[2026-05-23 20:43:48] [INFO ] Computed and/alt/rep : 571/1394/403 causal constraints (skipped 247 transitions) in 123 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:49] [INFO ] Deduced a trap composed of 3 places in 412 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:50] [INFO ] Deduced a trap composed of 25 places in 385 ms of which 27 ms to minimize.
[2026-05-23 20:43:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 941 ms
[2026-05-23 20:43:50] [INFO ] Added : 91 causal constraints over 19 iterations in 2222 ms. Result :sat
Minimization took 302 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:43:50] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2026-05-23 20:43:50] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2026-05-23 20:43:51] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2026-05-23 20:43:51] [INFO ] [Real]Added 284 Read/Feed constraints in 69 ms returned sat
[2026-05-23 20:43:51] [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 20:43:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2026-05-23 20:43:51] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2026-05-23 20:43:51] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2026-05-23 20:43:51] [INFO ] [Nat]Added 284 Read/Feed constraints in 59 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:51] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 3 ms to minimize.
[2026-05-23 20:43:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2026-05-23 20:43:52] [INFO ] Computed and/alt/rep : 571/1394/403 causal constraints (skipped 247 transitions) in 107 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:52] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:53] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:43:53] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 8 ms to minimize.
[2026-05-23 20:43:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 518 ms
[2026-05-23 20:43:53] [INFO ] Added : 83 causal constraints over 18 iterations in 1702 ms. Result :sat
Minimization took 292 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 91 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 394/394 places, 2106/2106 transitions.
[2026-05-23 20:43:54] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2026-05-23 20:43:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2517 ms. (397 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 1780 ms. (1684 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-23 20:43:59] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2026-05-23 20:43:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:43:59] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2026-05-23 20:43:59] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 9 ms returned sat
[2026-05-23 20:43:59] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2026-05-23 20:43:59] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-23 20:43:59] [INFO ] [Real]Added 284 Read/Feed constraints in 66 ms returned sat
[2026-05-23 20:43:59] [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 20:43:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2026-05-23 20:43:59] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2026-05-23 20:43:59] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2026-05-23 20:44:00] [INFO ] [Nat]Added 284 Read/Feed constraints in 63 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:00] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 3 ms to minimize.
[2026-05-23 20:44:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2026-05-23 20:44:00] [INFO ] Computed and/alt/rep : 571/1394/403 causal constraints (skipped 247 transitions) in 88 ms.
[2026-05-23 20:44:00] [INFO ] Added : 49 causal constraints over 10 iterations in 619 ms. Result :sat
Minimization took 277 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:44:01] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2026-05-23 20:44:01] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2026-05-23 20:44:01] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2026-05-23 20:44:01] [INFO ] [Real]Added 284 Read/Feed constraints in 82 ms returned sat
[2026-05-23 20:44:01] [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 20:44:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2026-05-23 20:44:01] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2026-05-23 20:44:01] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2026-05-23 20:44:02] [INFO ] [Nat]Added 284 Read/Feed constraints in 60 ms returned sat
[2026-05-23 20:44:02] [INFO ] Computed and/alt/rep : 571/1394/403 causal constraints (skipped 247 transitions) in 77 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:03] [INFO ] Deduced a trap composed of 3 places in 389 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:03] [INFO ] Deduced a trap composed of 25 places in 345 ms of which 25 ms to minimize.
[2026-05-23 20:44:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 884 ms
[2026-05-23 20:44:04] [INFO ] Added : 91 causal constraints over 19 iterations in 2024 ms. Result :sat
Minimization took 301 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:44:04] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2026-05-23 20:44:04] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2026-05-23 20:44:04] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2026-05-23 20:44:04] [INFO ] [Real]Added 284 Read/Feed constraints in 71 ms returned sat
[2026-05-23 20:44: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 20:44:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2026-05-23 20:44:05] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2026-05-23 20:44:05] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2026-05-23 20:44:05] [INFO ] [Nat]Added 284 Read/Feed constraints in 60 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:05] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 3 ms to minimize.
[2026-05-23 20:44:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2026-05-23 20:44:05] [INFO ] Computed and/alt/rep : 571/1394/403 causal constraints (skipped 247 transitions) in 79 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:06] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:06] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:06] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 8 ms to minimize.
[2026-05-23 20:44:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 495 ms
[2026-05-23 20:44:07] [INFO ] Added : 83 causal constraints over 18 iterations in 1633 ms. Result :sat
Minimization took 291 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 88 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 394/394 places, 2106/2106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 87 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2026-05-23 20:44:08] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2026-05-23 20:44:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 20:44:08] [INFO ] Implicit Places using invariants in 867 ms returned []
[2026-05-23 20:44:08] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2026-05-23 20:44:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 20:44:09] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-23 20:44:12] [INFO ] Implicit Places using invariants and state equation in 3464 ms returned []
Implicit Place search using SMT with State Equation took 4334 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 20:44:12] [INFO ] Redundant transitions in 165 ms returned []
Running 2098 sub problems to find dead transitions.
[2026-05-23 20:44:12] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2026-05-23 20:44:12] [INFO ] Invariant cache hit.
[2026-05-23 20:44:12] [INFO ] State equation strengthened by 284 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:34] [INFO ] Deduced a trap composed of 3 places in 368 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:34] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:34] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:35] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:35] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:35] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:35] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:35] [INFO ] Deduced a trap composed of 66 places in 262 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:37] [INFO ] Deduced a trap composed of 42 places in 278 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:37] [INFO ] Deduced a trap composed of 66 places in 331 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:38] [INFO ] Deduced a trap composed of 42 places in 280 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:38] [INFO ] Deduced a trap composed of 42 places in 332 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:39] [INFO ] Deduced a trap composed of 42 places in 310 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:39] [INFO ] Deduced a trap composed of 61 places in 262 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:39] [INFO ] Deduced a trap composed of 42 places in 313 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:39] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:40] [INFO ] Deduced a trap composed of 58 places in 282 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:40] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:40] [INFO ] Deduced a trap composed of 31 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 20:44:40] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1052 variables, and 45 constraints, problems are : Problem set: 0 solved, 2098 unsolved in 30102 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2098/2098 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2098 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:52] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:53] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:56] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:44:57] [INFO ] Deduced a trap composed of 15 places in 259 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:00] [INFO ] Deduced a trap composed of 15 places in 290 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:00] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:03] [INFO ] Deduced a trap composed of 17 places in 298 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:04] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:07] [INFO ] Deduced a trap composed of 19 places in 368 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:08] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:11] [INFO ] Deduced a trap composed of 21 places in 394 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:12] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1052 variables, and 57 constraints, problems are : Problem set: 0 solved, 2098 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2098 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61327ms problems are : Problem set: 0 solved, 2098 unsolved
Search for dead transitions found 0 dead transitions in 61377ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66003 ms. Remains : 394/394 places, 2106/2106 transitions.
RANDOM walk for 40000 steps (8 resets) in 1671 ms. (23 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 6/6 properties
[2026-05-23 20:45:15] [INFO ] Flatten gal took : 523 ms
[2026-05-23 20:45:15] [INFO ] Flatten gal took : 273 ms
[2026-05-23 20:45:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18272932022109561545.gal : 97 ms
[2026-05-23 20:45:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4271632943288431776.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/ReachabilityCardinality18272932022109561545.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4271632943288431776.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/ReachabilityCardinality4271632943288431776.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :8 after 22
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :22 after 28
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :28 after 29
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :29 after 72
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :72 after 270
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :270 after 389
Interrupted probabilistic random walk after 176715 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :4 out of 6
Probabilistic random walk after 176715 steps, saw 107170 distinct states, run finished after 3013 ms. (steps per millisecond=58 ) properties seen :4
[2026-05-23 20:45:17] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2026-05-23 20:45:18] [INFO ] Invariant cache hit.
[2026-05-23 20:45:18] [INFO ] State equation strengthened by 284 read => feed constraints.
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, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 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 20:45:18] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 254/644 variables, 14/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/644 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 14/658 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :389 after 1198
[2026-05-23 20:45:19] [INFO ] Deduced a trap composed of 42 places in 473 ms of which 47 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/658 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/658 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 394/1052 variables, 268/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1052 variables, 247/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1052 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1052 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 705 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1591 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 254/644 variables, 14/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/644 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 14/658 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/658 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/658 variables, 1/192 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 20:45:20] [INFO ] Deduced a trap composed of 3 places in 283 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:20] [INFO ] Deduced a trap composed of 3 places in 234 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1198 after 4182
[2026-05-23 20:45:20] [INFO ] Deduced a trap composed of 3 places in 202 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:20] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:21] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 7 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/658 variables, 5/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/658 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 394/1052 variables, 268/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1052 variables, 247/712 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 20:45:21] [INFO ] Deduced a trap composed of 3 places in 375 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:21] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 9 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1052 variables, 2/714 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 20:45:22] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 12 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1052 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1052 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/1052 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1052/1052 variables, and 715 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3042 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4658ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 466 ms.
Support contains 1 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 394 transition count 2104
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 392 transition count 2104
Applied a total of 4 rules in 98 ms. Remains 392 /394 variables (removed 2) and now considering 2104/2106 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 392/394 places, 2104/2106 transitions.
RANDOM walk for 40000 steps (8 resets) in 269 ms. (148 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :4182 after 11300
Interrupted probabilistic random walk after 237852 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 2
Probabilistic random walk after 237852 steps, saw 139152 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2026-05-23 20:45:26] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2026-05-23 20:45:26] [INFO ] Computed 25 invariants in 6 ms
[2026-05-23 20:45:26] [INFO ] State equation strengthened by 284 read => feed constraints.
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, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 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 20:45:26] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/189 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 20:45:27] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 5 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 247/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1085 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/192 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 20:45:28] [INFO ] Deduced a trap composed of 3 places in 316 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:28] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:28] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:28] [INFO ] Deduced a trap composed of 3 places in 199 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:29] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:29] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:29] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 7/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/656 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 392/1048 variables, 266/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 247/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/1048 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 712 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2413 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3526ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 155 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 87 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 84 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2026-05-23 20:45:30] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2026-05-23 20:45:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 20:45:31] [INFO ] Implicit Places using invariants in 801 ms returned []
[2026-05-23 20:45:31] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2026-05-23 20:45:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 20:45:31] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-23 20:45:34] [INFO ] Implicit Places using invariants and state equation in 2984 ms returned []
Implicit Place search using SMT with State Equation took 3807 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 20:45:34] [INFO ] Redundant transitions in 202 ms returned []
Running 2096 sub problems to find dead transitions.
[2026-05-23 20:45:34] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2026-05-23 20:45:34] [INFO ] Invariant cache hit.
[2026-05-23 20:45:34] [INFO ] State equation strengthened by 284 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :11300 after 42276
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :42276 after 79269
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:54] [INFO ] Deduced a trap composed of 3 places in 381 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:54] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:54] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:55] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:55] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:55] [INFO ] Deduced a trap composed of 42 places in 276 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:55] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:57] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:57] [INFO ] Deduced a trap composed of 66 places in 275 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:57] [INFO ] Deduced a trap composed of 66 places in 269 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:58] [INFO ] Deduced a trap composed of 67 places in 268 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:58] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:58] [INFO ] Deduced a trap composed of 58 places in 259 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:59] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:59] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:59] [INFO ] Deduced a trap composed of 65 places in 300 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:45:59] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:46:00] [INFO ] Deduced a trap composed of 66 places in 307 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:46:00] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:46:00] [INFO ] Deduced a trap composed of 66 places in 281 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:46:01] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:46:02] [INFO ] Deduced a trap composed of 68 places in 254 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:46:03] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 48 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Detected timeout of ITS tools.
[2026-05-23 20:46:06] [INFO ] Flatten gal took : 115 ms
[2026-05-23 20:46:06] [INFO ] Applying decomposition
[2026-05-23 20:46:06] [INFO ] Flatten gal took : 100 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/graph18282890764762419180.txt' '-o' '/tmp/graph18282890764762419180.bin' '-w' '/tmp/graph18282890764762419180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18282890764762419180.bin' '-l' '-1' '-v' '-w' '/tmp/graph18282890764762419180.weights' '-q' '0' '-e' '0.001'
[2026-05-23 20:46:06] [INFO ] Decomposing Gal with order
[2026-05-23 20:46:06] [INFO ] Rewriting arrays to variables to allow decomposition.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2026-05-23 20:46:07] [INFO ] Removed a total of 4398 redundant transitions.
[2026-05-23 20:46:07] [INFO ] Flatten gal took : 839 ms
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2026-05-23 20:46:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 534 labels/synchronizations in 179 ms.
[2026-05-23 20:46:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8441512829806507489.gal : 41 ms
[2026-05-23 20:46:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality528054472158819216.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/ReachabilityCardinality8441512829806507489.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality528054472158819216.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 ...306
Loading property file /tmp/ReachabilityCardinality528054472158819216.prop.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4578
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4578 after 56243
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :56243 after 290449
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :290449 after 332689
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:46:12] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:46:12] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:46:15] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:46:19] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :332689 after 1.07841e+06
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:46:23] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:46:26] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:46:31] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:46:34] [INFO ] Deduced a trap composed of 17 places in 403 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:46:35] [INFO ] Deduced a trap composed of 19 places in 391 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:46:35] [INFO ] Deduced a trap composed of 21 places in 420 ms of which 27 ms to minimize.
SMT process timed out in 61165ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61178ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65308 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 5 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 1 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 73 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 154 rows 57 cols
[2026-05-23 20:46:35] [INFO ] Computed 17 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-23 20:46:35] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2026-05-23 20:46:35] [INFO ] After 63ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2026-05-23 20:46:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-23 20:46:35] [INFO ] After 19ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-23 20:46:35] [INFO ] After 134ms 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 20:46:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2026-05-23 20:46:35] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-23 20:46:35] [INFO ] After 14ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-23 20:46:35] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-23 20:46:35] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-23 20:46:35] [INFO ] Flatten gal took : 8 ms
[2026-05-23 20:46:35] [INFO ] Flatten gal took : 7 ms
[2026-05-23 20:46:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5587331387688509281.gal : 2 ms
[2026-05-23 20:46:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6784022150662279310.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/ReachabilityCardinality5587331387688509281.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6784022150662279310.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/ReachabilityCardinality6784022150662279310.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 48
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,480,0.036332,5700,2,282,8,1234,6,0,385,821,0
Total reachable state count : 480

Verifying 2 reachability properties.
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,4,0.036863,5700,2,61,8,1234,7,0,388,821,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,4,0.037071,5700,2,61,8,1234,8,0,389,821,0
Over-approximation ignoring read arcs solved 0 properties in 437 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA EisenbergMcGuire-PT-08-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-08-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-03
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 20:46:35] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
// Phase 1: matrix 658 rows 394 cols
[2026-05-23 20:46:35] [INFO ] Computed 25 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-23 20:46:36] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2026-05-23 20:46:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 20:46:36] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2026-05-23 20:46:36] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2026-05-23 20:46:36] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2026-05-23 20:46:36] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-23 20:46:36] [INFO ] [Real]Added 284 Read/Feed constraints in 84 ms returned sat
[2026-05-23 20:46:36] [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 20:46:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2026-05-23 20:46:36] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2026-05-23 20:46:36] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2026-05-23 20:46:36] [INFO ] [Nat]Added 284 Read/Feed constraints in 59 ms returned sat
[2026-05-23 20:46:37] [INFO ] Computed and/alt/rep : 571/1394/403 causal constraints (skipped 247 transitions) in 65 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:46:38] [INFO ] Deduced a trap composed of 3 places in 380 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:46:38] [INFO ] Deduced a trap composed of 25 places in 394 ms of which 28 ms to minimize.
[2026-05-23 20:46:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 915 ms
[2026-05-23 20:46:38] [INFO ] Added : 91 causal constraints over 19 iterations in 2007 ms. Result :sat
Minimization took 277 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:[1] Max Struct:[1]
Support contains 1 out of 394 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p25_2_7) removed 21 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2085/2085 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 394 transition count 2083
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 392 transition count 2083
Applied a total of 4 rules in 86 ms. Remains 392 /394 variables (removed 2) and now considering 2083/2085 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 392/394 places, 2083/2085 transitions.
[2026-05-23 20:46:39] [INFO ] Flow matrix only has 655 transitions (discarded 1428 similar events)
// Phase 1: matrix 655 rows 392 cols
[2026-05-23 20:46:39] [INFO ] Computed 25 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA EisenbergMcGuire-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 2481 ms. (402 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-23 20:46:42] [INFO ] Flatten gal took : 84 ms
[2026-05-23 20:46:42] [INFO ] Flatten gal took : 78 ms
[2026-05-23 20:46:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3718496206352577519.gal : 18 ms
[2026-05-23 20:46:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15068254828507855578.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/ReachabilityCardinality3718496206352577519.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15068254828507855578.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
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:[] Max Struct:[]
Ending property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-03 in 6339 ms.
[2026-05-23 20:46:42] [INFO ] Flatten gal took : 74 ms
Total runtime 209591 ms.

BK_STOP 1779569202519

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="EisenbergMcGuire-PT-08"
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 EisenbergMcGuire-PT-08, 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 r127-smll-177955743800035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-08.tgz
mv EisenbergMcGuire-PT-08 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;