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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 8.6K Mar 7 05:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 7 05:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 7 05:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 7 05:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 09:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 15 09:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 09:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 05:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Mar 7 05:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 7 05:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 7 05:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 3.1M Mar 3 18:30 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779569319342

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 20:48:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 20:48:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 20:48:42] [INFO ] Load time of PNML (sax parser for PT used): 540 ms
[2026-05-23 20:48:42] [INFO ] Transformed 1090 places.
[2026-05-23 20:48:42] [INFO ] Transformed 5200 transitions.
[2026-05-23 20:48:42] [INFO ] Found NUPN structural information;
[2026-05-23 20:48:42] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 749 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-23 20:48:42] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
// Phase 1: matrix 2330 rows 1090 cols
[2026-05-23 20:48:42] [INFO ] Computed 31 invariants in 57 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 116 ms. (85 steps per ms)
FORMULA EisenbergMcGuire-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 41 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-23 20:48:42] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
[2026-05-23 20:48:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 20:48:43] [INFO ] [Real]Absence check using 21 positive place invariants in 63 ms returned sat
[2026-05-23 20:48:43] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 15 ms returned sat
[2026-05-23 20:48:44] [INFO ] [Real]Absence check using state equation in 1022 ms returned sat
[2026-05-23 20:48:44] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2026-05-23 20:48:45] [INFO ] [Real]Added 1246 Read/Feed constraints in 344 ms returned sat
[2026-05-23 20:48:45] [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:48:45] [INFO ] [Nat]Absence check using 21 positive place invariants in 47 ms returned sat
[2026-05-23 20:48:45] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 13 ms returned sat
[2026-05-23 20:48:46] [INFO ] [Nat]Absence check using state equation in 848 ms returned sat
[2026-05-23 20:48:46] [INFO ] [Nat]Added 1246 Read/Feed constraints in 271 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:48:47] [INFO ] Deduced a trap composed of 3 places in 989 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:48:49] [INFO ] Deduced a trap composed of 3 places in 1112 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:48:50] [INFO ] Deduced a trap composed of 3 places in 1067 ms of which 36 ms to minimize.
[2026-05-23 20:48:50] [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:48:50] [INFO ] [Real]Absence check using 21 positive place invariants in 49 ms returned sat
[2026-05-23 20:48:50] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 12 ms returned sat
[2026-05-23 20:48:51] [INFO ] [Real]Absence check using state equation in 832 ms returned sat
[2026-05-23 20:48:51] [INFO ] [Real]Added 1246 Read/Feed constraints in 246 ms returned sat
[2026-05-23 20:48:51] [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:48:52] [INFO ] [Nat]Absence check using 21 positive place invariants in 43 ms returned sat
[2026-05-23 20:48:52] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 12 ms returned sat
[2026-05-23 20:48:53] [INFO ] [Nat]Absence check using state equation in 861 ms returned sat
[2026-05-23 20:48:53] [INFO ] [Nat]Added 1246 Read/Feed constraints in 288 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:48:54] [INFO ] Deduced a trap composed of 3 places in 996 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:48:55] [INFO ] Deduced a trap composed of 3 places in 1042 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:48:56] [INFO ] Deduced a trap composed of 20 places in 1064 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:48:57] [INFO ] Deduced a trap composed of 3 places in 1041 ms of which 34 ms to minimize.
[2026-05-23 20:48:57] [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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1090 transition count 5190
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1080 transition count 5190
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 20 place count 1080 transition count 4881
Deduced a syphon composed of 309 places in 6 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 638 place count 771 transition count 4881
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 728 place count 681 transition count 3981
Iterating global reduction 2 with 90 rules applied. Total rules applied 818 place count 681 transition count 3981
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 13 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 998 place count 591 transition count 3891
Applied a total of 998 rules in 871 ms. Remains 591 /1090 variables (removed 499) and now considering 3891/5200 (removed 1309) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 886 ms. Remains : 591/1090 places, 3891/5200 transitions.
[2026-05-23 20:48:58] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2026-05-23 20:48:58] [INFO ] Computed 31 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 3210 ms. (311 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1330 ms. (1502 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-23 20:49:03] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-23 20:49:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:49:03] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned sat
[2026-05-23 20:49:03] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2026-05-23 20:49:03] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2026-05-23 20:49:04] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-23 20:49:04] [INFO ] [Real]Added 436 Read/Feed constraints in 109 ms returned sat
[2026-05-23 20:49: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:49:04] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2026-05-23 20:49:04] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2026-05-23 20:49:04] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2026-05-23 20:49:04] [INFO ] [Nat]Added 436 Read/Feed constraints in 104 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:49:05] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:49:05] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 3 ms to minimize.
[2026-05-23 20:49:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 344 ms
[2026-05-23 20:49:05] [INFO ] Computed and/alt/rep : 871/1971/601 causal constraints (skipped 410 transitions) in 184 ms.
[2026-05-23 20:49:06] [INFO ] Added : 104 causal constraints over 21 iterations in 1650 ms. Result :sat
Minimization took 397 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:49:07] [INFO ] [Real]Absence check using 21 positive place invariants in 20 ms returned sat
[2026-05-23 20:49:07] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 11 ms returned sat
[2026-05-23 20:49:07] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2026-05-23 20:49:07] [INFO ] [Real]Added 436 Read/Feed constraints in 123 ms returned sat
[2026-05-23 20:49:08] [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:49:08] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2026-05-23 20:49:08] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2026-05-23 20:49:08] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2026-05-23 20:49:08] [INFO ] [Nat]Added 436 Read/Feed constraints in 94 ms returned sat
[2026-05-23 20:49:08] [INFO ] Computed and/alt/rep : 871/1971/601 causal constraints (skipped 410 transitions) in 122 ms.
[2026-05-23 20:49:10] [INFO ] Added : 110 causal constraints over 22 iterations in 1689 ms. Result :sat
Minimization took 382 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 245 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 591/591 places, 3891/3891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 341 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
[2026-05-23 20:49:12] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-23 20:49:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 20:49:14] [INFO ] Implicit Places using invariants in 1643 ms returned []
[2026-05-23 20:49:14] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-23 20:49:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 20:49:14] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-23 20:49:22] [INFO ] Implicit Places using invariants and state equation in 8795 ms returned []
Implicit Place search using SMT with State Equation took 10441 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 20:49:23] [INFO ] Redundant transitions in 422 ms returned []
Running 3881 sub problems to find dead transitions.
[2026-05-23 20:49:23] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-23 20:49:23] [INFO ] Invariant cache hit.
[2026-05-23 20:49:23] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3881 unsolved
SMT process timed out in 32767ms, After SMT, problems are : Problem set: 0 solved, 3881 unsolved
Search for dead transitions found 0 dead transitions in 32827ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44082 ms. Remains : 591/591 places, 3891/3891 transitions.
RANDOM walk for 40000 steps (8 resets) in 1757 ms. (22 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
[2026-05-23 20:49:57] [INFO ] Flatten gal took : 789 ms
[2026-05-23 20:49:58] [INFO ] Flatten gal took : 336 ms
[2026-05-23 20:49:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6811677437165091698.gal : 153 ms
[2026-05-23 20:49:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15176630210209846668.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/ReachabilityCardinality6811677437165091698.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15176630210209846668.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/ReachabilityCardinality15176630210209846668.prop.
Interrupted probabilistic random walk after 135916 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :2 out of 4
Probabilistic random walk after 135916 steps, saw 97111 distinct states, run finished after 3007 ms. (steps per millisecond=45 ) properties seen :2
[2026-05-23 20:50:00] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-23 20:50:00] [INFO ] Invariant cache hit.
[2026-05-23 20:50:00] [INFO ] State equation strengthened by 436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 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:50:00] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
At refinement iteration 16 (OVERLAPS) 397/963 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :7 after 8
At refinement iteration 17 (INCLUDED_ONLY) 0/963 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 18/981 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :9 after 25
At refinement iteration 19 (INCLUDED_ONLY) 0/981 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :25 after 33
At refinement iteration 20 (OVERLAPS) 631/1612 variables, 415/670 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :33 after 85
At refinement iteration 21 (INCLUDED_ONLY) 0/1612 variables, 389/1059 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1612 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1612 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 1059 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1280 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :85 after 289
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 397/963 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/963 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 18/981 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/981 variables, 2/257 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,4 properties remain. new max is 1024
SDD size :289 after 395
[2026-05-23 20:50:02] [INFO ] Deduced a trap composed of 15 places in 649 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:50:03] [INFO ] Deduced a trap composed of 72 places in 640 ms of which 66 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/981 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/981 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 631/1612 variables, 415/674 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1612 variables, 389/1063 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:50:04] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 11 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1612 variables, 1/1064 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :395 after 1080
At refinement iteration 25 (INCLUDED_ONLY) 0/1612 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1612 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1612/1612 variables, and 1064 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3263 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4590ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 456 ms.
Support contains 1 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 591 transition count 3890
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 590 transition count 3890
Applied a total of 2 rules in 226 ms. Remains 590 /591 variables (removed 1) and now considering 3890/3891 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 590/591 places, 3890/3891 transitions.
RANDOM walk for 40000 steps (8 resets) in 307 ms. (129 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1080 after 4136
Interrupted probabilistic random walk after 188067 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 2
Probabilistic random walk after 188067 steps, saw 131431 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2026-05-23 20:50:08] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2026-05-23 20:50:08] [INFO ] Computed 31 invariants in 8 ms
[2026-05-23 20:50:08] [INFO ] State equation strengthened by 436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 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:50:08] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1058 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1128 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1060 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:50:11] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 1/1061 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1061 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1937 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3097ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 342 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 213 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 187 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-23 20:50:12] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-23 20:50:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 20:50:14] [INFO ] Implicit Places using invariants in 1582 ms returned []
[2026-05-23 20:50:14] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-23 20:50:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :4136 after 6704
[2026-05-23 20:50:14] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-23 20:50:20] [INFO ] Implicit Places using invariants and state equation in 6338 ms returned []
Implicit Place search using SMT with State Equation took 7933 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 20:50:20] [INFO ] Redundant transitions in 445 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-23 20:50:21] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-23 20:50:21] [INFO ] Invariant cache hit.
[2026-05-23 20:50:21] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :6704 after 19568
Detected timeout of ITS tools.
[2026-05-23 20:50:48] [INFO ] Flatten gal took : 253 ms
[2026-05-23 20:50:48] [INFO ] Applying decomposition
[2026-05-23 20:50:48] [INFO ] Flatten gal took : 190 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/graph10103634745980458353.txt' '-o' '/tmp/graph10103634745980458353.bin' '-w' '/tmp/graph10103634745980458353.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10103634745980458353.bin' '-l' '-1' '-v' '-w' '/tmp/graph10103634745980458353.weights' '-q' '0' '-e' '0.001'
[2026-05-23 20:50:49] [INFO ] Decomposing Gal with order
[2026-05-23 20:50:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 20:50:51] [INFO ] Removed a total of 8670 redundant transitions.
[2026-05-23 20:50:51] [INFO ] Flatten gal took : 944 ms
[2026-05-23 20:50:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 733 labels/synchronizations in 335 ms.
[2026-05-23 20:50:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13899728551332582708.gal : 69 ms
[2026-05-23 20:50:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14728373411964115053.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/ReachabilityCardinality13899728551332582708.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14728373411964115053.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality14728373411964115053.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1380
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1380 after 1530
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 32368ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 32397ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41014 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 7 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 95 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 231 rows 71 cols
[2026-05-23 20:50:53] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-23 20:50:53] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2026-05-23 20:50:53] [INFO ] After 143ms 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:50:53] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2026-05-23 20:50:53] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-23 20:50:53] [INFO ] State equation strengthened by 10 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1530 after 5398
[2026-05-23 20:50:53] [INFO ] After 20ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-23 20:50:53] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-23 20:50:53] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-23 20:50:53] [INFO ] Flatten gal took : 10 ms
[2026-05-23 20:50:53] [INFO ] Flatten gal took : 9 ms
[2026-05-23 20:50:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12850597897221914627.gal : 9 ms
[2026-05-23 20:50:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5812057565310824137.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/ReachabilityCardinality12850597897221914627.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5812057565310824137.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/ReachabilityCardinality5812057565310824137.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 48
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,640,0.05883,6388,2,235,8,1095,6,0,518,650,0
Total reachable state count : 640

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,16,0.059358,6388,2,94,8,1095,7,0,521,650,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,16,0.059595,6388,2,94,8,1095,8,0,522,650,0
Over-approximation ignoring read arcs solved 0 properties in 562 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA EisenbergMcGuire-PT-10-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2026-05-23 20:50:53] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2026-05-23 20:50:53] [INFO ] Computed 31 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 35 ms. (277 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-23 20:50:54] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-23 20:50:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 20:50:54] [INFO ] [Real]Absence check using 21 positive place invariants in 19 ms returned sat
[2026-05-23 20:50:54] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2026-05-23 20:50:54] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2026-05-23 20:50:54] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-23 20:50:54] [INFO ] [Real]Added 436 Read/Feed constraints in 109 ms returned sat
[2026-05-23 20:50:54] [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:50:54] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2026-05-23 20:50:54] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2026-05-23 20:50:55] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2026-05-23 20:50:55] [INFO ] [Nat]Added 436 Read/Feed constraints in 104 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:50:55] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:50:55] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 8 ms to minimize.
[2026-05-23 20:50:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 314 ms
[2026-05-23 20:50:55] [INFO ] Computed and/alt/rep : 871/1971/601 causal constraints (skipped 410 transitions) in 102 ms.
[2026-05-23 20:50:57] [INFO ] Added : 104 causal constraints over 21 iterations in 1663 ms. Result :sat
Minimization took 456 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 591 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p37_3_0) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3890/3890 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 591 transition count 3889
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 590 transition count 3889
Applied a total of 2 rules in 192 ms. Remains 590 /591 variables (removed 1) and now considering 3889/3890 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 590/591 places, 3889/3890 transitions.
[2026-05-23 20:50:58] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
// Phase 1: matrix 1019 rows 590 cols
[2026-05-23 20:50:58] [INFO ] Computed 31 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 3425 ms. (291 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 637 ms. (1567 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-23 20:51:02] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-23 20:51:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:51:02] [INFO ] [Real]Absence check using 21 positive place invariants in 20 ms returned sat
[2026-05-23 20:51:02] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2026-05-23 20:51:03] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2026-05-23 20:51:03] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-23 20:51:03] [INFO ] [Real]Added 436 Read/Feed constraints in 137 ms returned sat
[2026-05-23 20:51:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:51:03] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2026-05-23 20:51:03] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2026-05-23 20:51:03] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2026-05-23 20:51:04] [INFO ] [Nat]Added 436 Read/Feed constraints in 110 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:51:04] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 4 ms to minimize.
[2026-05-23 20:51:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2026-05-23 20:51:04] [INFO ] Computed and/alt/rep : 870/1970/600 causal constraints (skipped 409 transitions) in 117 ms.
[2026-05-23 20:51:05] [INFO ] Added : 50 causal constraints over 10 iterations in 893 ms. Result :sat
Minimization took 493 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3889/3889 transitions.
Applied a total of 0 rules in 158 ms. Remains 590 /590 variables (removed 0) and now considering 3889/3889 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 590/590 places, 3889/3889 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3889/3889 transitions.
Applied a total of 0 rules in 256 ms. Remains 590 /590 variables (removed 0) and now considering 3889/3889 (removed 0) transitions.
[2026-05-23 20:51:06] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-23 20:51:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 20:51:07] [INFO ] Implicit Places using invariants in 1538 ms returned []
[2026-05-23 20:51:07] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-23 20:51:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 20:51:08] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-23 20:51:14] [INFO ] Implicit Places using invariants and state equation in 7056 ms returned []
Implicit Place search using SMT with State Equation took 8597 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 20:51:15] [INFO ] Redundant transitions in 209 ms returned []
Running 3879 sub problems to find dead transitions.
[2026-05-23 20:51:15] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-23 20:51:15] [INFO ] Invariant cache hit.
[2026-05-23 20:51:15] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3879 unsolved
SMT process timed out in 32090ms, After SMT, problems are : Problem set: 0 solved, 3879 unsolved
Search for dead transitions found 0 dead transitions in 32106ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41184 ms. Remains : 590/590 places, 3889/3889 transitions.
RANDOM walk for 40000 steps (8 resets) in 341 ms. (116 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
[2026-05-23 20:51:47] [INFO ] Flatten gal took : 156 ms
[2026-05-23 20:51:47] [INFO ] Flatten gal took : 159 ms
[2026-05-23 20:51:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3062219837287114373.gal : 41 ms
[2026-05-23 20:51:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17641843383895844303.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/ReachabilityCardinality3062219837287114373.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17641843383895844303.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/ReachabilityCardinality17641843383895844303.prop.
Interrupted probabilistic random walk after 184415 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 184415 steps, saw 129100 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2026-05-23 20:51:50] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-23 20:51:50] [INFO ] Invariant cache hit.
[2026-05-23 20:51:50] [INFO ] State equation strengthened by 436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 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:51:50] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 101/159 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 172/331 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/331 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 8
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :9 after 25
At refinement iteration 13 (OVERLAPS) 234/565 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 33
At refinement iteration 16 (OVERLAPS) 396/961 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/961 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 18/979 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/979 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :33 after 85
At refinement iteration 20 (OVERLAPS) 630/1609 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1609 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1609 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1609 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1609/1609 variables, and 1058 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1050 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 101/159 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :85 after 290
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 172/331 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/331 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 234/565 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 396/961 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/961 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 18/979 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/979 variables, 2/257 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:51:52] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :290 after 436
[2026-05-23 20:51:52] [INFO ] Deduced a trap composed of 81 places in 577 ms of which 47 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/979 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/979 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 630/1609 variables, 414/673 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1609 variables, 389/1062 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:51:53] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 4 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1609 variables, 1/1063 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1609 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1609 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1609/1609 variables, and 1063 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2502 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3572ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :436 after 1085
Parikh walk visited 0 properties in 445 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3889/3889 transitions.
Applied a total of 0 rules in 167 ms. Remains 590 /590 variables (removed 0) and now considering 3889/3889 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 590/590 places, 3889/3889 transitions.
RANDOM walk for 40000 steps (8 resets) in 293 ms. (136 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 179575 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 2
Probabilistic random walk after 179575 steps, saw 125901 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
[2026-05-23 20:51:57] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-23 20:51:57] [INFO ] Invariant cache hit.
[2026-05-23 20:51:57] [INFO ] State equation strengthened by 436 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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 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:51:57] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 101/159 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 172/331 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/331 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 234/565 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 396/961 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/961 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 18/979 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/979 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1085 after 4299
At refinement iteration 20 (OVERLAPS) 630/1609 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1609 variables, 389/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1609 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1609 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1609/1609 variables, and 1058 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1083 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 101/159 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 172/331 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/331 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 234/565 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 396/961 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/961 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 18/979 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/979 variables, 2/257 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:51:59] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:52:00] [INFO ] Deduced a trap composed of 81 places in 672 ms of which 53 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/979 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/979 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 630/1609 variables, 414/673 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1609 variables, 389/1062 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:52:00] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 4 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1609 variables, 1/1063 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1609 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1609 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1609/1609 variables, and 1063 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2677 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3776ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 521 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3889/3889 transitions.
Applied a total of 0 rules in 174 ms. Remains 590 /590 variables (removed 0) and now considering 3889/3889 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 590/590 places, 3889/3889 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3889/3889 transitions.
Applied a total of 0 rules in 185 ms. Remains 590 /590 variables (removed 0) and now considering 3889/3889 (removed 0) transitions.
[2026-05-23 20:52:02] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-23 20:52:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 20:52:03] [INFO ] Implicit Places using invariants in 1450 ms returned []
[2026-05-23 20:52:03] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-23 20:52:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 20:52:04] [INFO ] State equation strengthened by 436 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4299 after 6731
[2026-05-23 20:52:10] [INFO ] Implicit Places using invariants and state equation in 6124 ms returned []
Implicit Place search using SMT with State Equation took 7589 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 20:52:10] [INFO ] Redundant transitions in 221 ms returned []
Running 3879 sub problems to find dead transitions.
[2026-05-23 20:52:10] [INFO ] Flow matrix only has 1019 transitions (discarded 2870 similar events)
[2026-05-23 20:52:10] [INFO ] Invariant cache hit.
[2026-05-23 20:52:10] [INFO ] State equation strengthened by 436 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :6731 after 17807
Detected timeout of ITS tools.
[2026-05-23 20:52:37] [INFO ] Flatten gal took : 112 ms
[2026-05-23 20:52:37] [INFO ] Applying decomposition
[2026-05-23 20:52:37] [INFO ] Flatten gal took : 114 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/graph9748329986222987579.txt' '-o' '/tmp/graph9748329986222987579.bin' '-w' '/tmp/graph9748329986222987579.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9748329986222987579.bin' '-l' '-1' '-v' '-w' '/tmp/graph9748329986222987579.weights' '-q' '0' '-e' '0.001'
[2026-05-23 20:52:38] [INFO ] Decomposing Gal with order
[2026-05-23 20:52:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 20:52:38] [INFO ] Removed a total of 8785 redundant transitions.
[2026-05-23 20:52:38] [INFO ] Flatten gal took : 415 ms
[2026-05-23 20:52:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 787 labels/synchronizations in 150 ms.
[2026-05-23 20:52:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10100940044939972231.gal : 47 ms
[2026-05-23 20:52:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8263431391741370455.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/ReachabilityCardinality10100940044939972231.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8263431391741370455.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality8263431391741370455.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 11599
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :11599 after 11882
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3879 unsolved
SMT process timed out in 31987ms, After SMT, problems are : Problem set: 0 solved, 3879 unsolved
Search for dead transitions found 0 dead transitions in 31997ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40012 ms. Remains : 590/590 places, 3889/3889 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3668 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 3 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 630
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 630
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 609
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 609
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 430
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 340
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 759 place count 161 transition count 340
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 330
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 320
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 230
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 230
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 230
Applied a total of 969 rules in 68 ms. Remains 71 /590 variables (removed 519) and now considering 230/3889 (removed 3659) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 230 rows 71 cols
[2026-05-23 20:52:42] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-23 20:52:42] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2026-05-23 20:52:42] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2026-05-23 20:52:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-23 20:52:42] [INFO ] After 21ms SMT Verify possible using 10 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-23 20:52:42] [INFO ] After 169ms 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:52:42] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2026-05-23 20:52:42] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-23 20:52:42] [INFO ] After 17ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-23 20:52:42] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-23 20:52:42] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-23 20:52:42] [INFO ] Flatten gal took : 15 ms
[2026-05-23 20:52:42] [INFO ] Flatten gal took : 6 ms
[2026-05-23 20:52:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11466407019600257201.gal : 2 ms
[2026-05-23 20:52:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15313252589713756292.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/ReachabilityCardinality11466407019600257201.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15313252589713756292.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 ...330
Loading property file /tmp/ReachabilityCardinality15313252589713756292.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 48
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,640,0.05491,6384,2,242,8,1232,6,0,514,756,0
Total reachable state count : 640

Verifying 2 reachability properties.
Reachability property MAX0 is true.

SDD proceeding with computation,2 properties remain. new max is 16
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,8,0.055713,6384,2,77,8,1232,7,0,517,756,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,8,0.055945,6384,2,77,8,1232,8,0,518,756,0
Over-approximation ignoring read arcs solved 0 properties in 546 ms.
ITS runner timed out or was interrupted.
SDD size :11882 after 89864
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-01 in 108855 ms.
[2026-05-23 20:52:42] [INFO ] Flatten gal took : 122 ms
[2026-05-23 20:52:43] [INFO ] Applying decomposition
[2026-05-23 20:52:43] [INFO ] Flatten gal took : 126 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/graph14926422283215570068.txt' '-o' '/tmp/graph14926422283215570068.bin' '-w' '/tmp/graph14926422283215570068.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14926422283215570068.bin' '-l' '-1' '-v' '-w' '/tmp/graph14926422283215570068.weights' '-q' '0' '-e' '0.001'
[2026-05-23 20:52:43] [INFO ] Decomposing Gal with order
[2026-05-23 20:52:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 20:52:43] [INFO ] Removed a total of 8799 redundant transitions.
[2026-05-23 20:52:43] [INFO ] Flatten gal took : 358 ms
[2026-05-23 20:52:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 803 labels/synchronizations in 147 ms.
[2026-05-23 20:52:44] [INFO ] Time to serialize gal into /tmp/UpperBounds9518755243041732512.gal : 26 ms
[2026-05-23 20:52:44] [INFO ] Time to serialize properties into /tmp/UpperBounds11298289352748011581.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/UpperBounds9518755243041732512.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11298289352748011581.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 ...284
Loading property file /tmp/UpperBounds11298289352748011581.prop.
Detected timeout of ITS tools.
[2026-05-23 21:14:04] [INFO ] Applying decomposition
[2026-05-23 21:14:04] [INFO ] Flatten gal took : 109 ms
[2026-05-23 21:14:05] [INFO ] Decomposing Gal with order
[2026-05-23 21:14:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 21:14:05] [INFO ] Removed a total of 10391 redundant transitions.
[2026-05-23 21:14:05] [INFO ] Flatten gal took : 426 ms
[2026-05-23 21:14:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 356 labels/synchronizations in 85 ms.
[2026-05-23 21:14:05] [INFO ] Time to serialize gal into /tmp/UpperBounds10785352967892447660.gal : 21 ms
[2026-05-23 21:14:05] [INFO ] Time to serialize properties into /tmp/UpperBounds1977863383418274301.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/UpperBounds10785352967892447660.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1977863383418274301.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 ...284
Loading property file /tmp/UpperBounds1977863383418274301.prop.
Detected timeout of ITS tools.
[2026-05-23 21:35:35] [INFO ] Flatten gal took : 1379 ms
[2026-05-23 21:35:44] [INFO ] Input system was already deterministic with 3891 transitions.
[2026-05-23 21:35:44] [INFO ] Transformed 591 places.
[2026-05-23 21:35:44] [INFO ] Transformed 3891 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-23 21:35:45] [INFO ] Time to serialize gal into /tmp/UpperBounds12118357096647240214.gal : 57 ms
[2026-05-23 21:35:45] [INFO ] Time to serialize properties into /tmp/UpperBounds13554731024747237266.prop : 9 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/UpperBounds12118357096647240214.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13554731024747237266.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds13554731024747237266.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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-10"
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-10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r127-smll-177955743800037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;