MCC'2025- Execution of r125-tall-174876435800058

About the Execution of 2024-gold for JoinFreeModules-PT-0500

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15686.160	1125027.00	1369886.00	3122.00	502 501 501 501 502 502 502 500 501 502 503 501 500 501 502 502	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r125-tall-174876435800058.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is JoinFreeModules-PT-0500, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r125-tall-174876435800058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.6M May 29 14:32 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 JoinFreeModules-PT-0500-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748774438248

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0500
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 10:40:39] [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]
[2025-06-01 10:40:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 10:40:39] [INFO ] Load time of PNML (sax parser for PT used): 256 ms
[2025-06-01 10:40:39] [INFO ] Transformed 2501 places.
[2025-06-01 10:40:39] [INFO ] Transformed 4001 transitions.
[2025-06-01 10:40:39] [INFO ] Parsed PT model containing 2501 places and 4001 transitions and 11502 arcs in 435 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 21 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 1, 1, 1, 2, 2, 2, 500, 1, 0, 0, 1, 500, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 1, 1, 1, 2, 2, 2, 500, 1, 0, 0, 1, 500, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 4001 rows 2500 cols
[2025-06-01 10:40:40] [INFO ] Computed 500 invariants in 44 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 1, 1, 2, 2, 2, 500, 1, 0, 0, 1, 500, 1, 0, 0] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
RANDOM walk for 10033 steps (2 resets) in 256 ms. (39 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 3934 ms. (40 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 5, 5, 5, 2, 2, 2, 500, 5, 4, 4, 5, 500, 5, 4, 4] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
[2025-06-01 10:40:44] [INFO ] Invariant cache hit.
[2025-06-01 10:40:44] [INFO ] [Real]Absence check using 500 positive place invariants in 140 ms returned sat
[2025-06-01 10:40:46] [INFO ] [Real]Absence check using state equation in 1178 ms returned sat
[2025-06-01 10:40:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:46] [INFO ] [Nat]Absence check using 500 positive place invariants in 108 ms returned sat
[2025-06-01 10:40:49] [INFO ] [Nat]Absence check using state equation in 2390 ms returned sat
[2025-06-01 10:40:49] [INFO ] State equation strengthened by 500 read => feed constraints.
[2025-06-01 10:40:49] [INFO ] [Nat]Added 500 Read/Feed constraints in 467 ms returned sat
[2025-06-01 10:40:50] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 30 ms to minimize.
[2025-06-01 10:40:50] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 4 ms to minimize.
[2025-06-01 10:40:50] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 4 ms to minimize.
[2025-06-01 10:40:50] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 3 ms to minimize.
[2025-06-01 10:40:51] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 3 ms to minimize.
[2025-06-01 10:40:51] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 3 ms to minimize.
[2025-06-01 10:40:53] [INFO ] Deduced a trap composed of 3 places in 1950 ms of which 17 ms to minimize.
[2025-06-01 10:40:53] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-01 10:40:53] [INFO ] [Real]Absence check using 500 positive place invariants in 97 ms returned sat
[2025-06-01 10:40:54] [INFO ] [Real]Absence check using state equation in 1041 ms returned sat
[2025-06-01 10:40:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:55] [INFO ] [Nat]Absence check using 500 positive place invariants in 94 ms returned sat
[2025-06-01 10:40:57] [INFO ] [Nat]Absence check using state equation in 2057 ms returned sat
[2025-06-01 10:40:57] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-01 10:40:58] [INFO ] [Nat]Added 500 Read/Feed constraints in 675 ms returned sat
[2025-06-01 10:40:58] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 4 ms to minimize.
[2025-06-01 10:40:58] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 4 ms to minimize.
[2025-06-01 10:40:58] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 4 ms to minimize.
[2025-06-01 10:40:59] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 4 ms to minimize.
[2025-06-01 10:40:59] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 4 ms to minimize.
[2025-06-01 10:40:59] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 4 ms to minimize.
[2025-06-01 10:41:00] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 4 ms to minimize.
[2025-06-01 10:41:00] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-01 10:41:00] [INFO ] [Real]Absence check using 500 positive place invariants in 105 ms returned sat
[2025-06-01 10:41:01] [INFO ] [Real]Absence check using state equation in 1157 ms returned sat
[2025-06-01 10:41:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:41:02] [INFO ] [Nat]Absence check using 500 positive place invariants in 98 ms returned sat
[2025-06-01 10:41:04] [INFO ] [Nat]Absence check using state equation in 2472 ms returned unknown
[2025-06-01 10:41:04] [INFO ] [Real]Absence check using 500 positive place invariants in 115 ms returned sat
[2025-06-01 10:41:05] [INFO ] [Real]Absence check using state equation in 1066 ms returned sat
[2025-06-01 10:41:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:41:06] [INFO ] [Nat]Absence check using 500 positive place invariants in 99 ms returned sat
[2025-06-01 10:41:08] [INFO ] [Nat]Absence check using state equation in 2094 ms returned sat
[2025-06-01 10:41:09] [INFO ] [Nat]Added 500 Read/Feed constraints in 501 ms returned sat
[2025-06-01 10:41:09] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 4 ms to minimize.
[2025-06-01 10:41:09] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 4 ms to minimize.
[2025-06-01 10:41:09] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 4 ms to minimize.
[2025-06-01 10:41:10] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 4 ms to minimize.
[2025-06-01 10:41:10] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 4 ms to minimize.
[2025-06-01 10:41:10] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 4 ms to minimize.
[2025-06-01 10:41:10] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 4 ms to minimize.
[2025-06-01 10:41:11] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 4 ms to minimize.
[2025-06-01 10:41:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-01 10:41:11] [INFO ] [Real]Absence check using 500 positive place invariants in 94 ms returned sat
[2025-06-01 10:41:12] [INFO ] [Real]Absence check using state equation in 1032 ms returned sat
[2025-06-01 10:41:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:41:13] [INFO ] [Nat]Absence check using 500 positive place invariants in 96 ms returned sat
[2025-06-01 10:41:15] [INFO ] [Nat]Absence check using state equation in 2045 ms returned sat
[2025-06-01 10:41:15] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-01 10:41:15] [INFO ] [Nat]Added 500 Read/Feed constraints in 620 ms returned sat
[2025-06-01 10:41:16] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 4 ms to minimize.
[2025-06-01 10:41:16] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 4 ms to minimize.
[2025-06-01 10:41:16] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 4 ms to minimize.
[2025-06-01 10:41:16] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 4 ms to minimize.
[2025-06-01 10:41:17] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 4 ms to minimize.
[2025-06-01 10:41:17] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 3 ms to minimize.
[2025-06-01 10:41:17] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 4 ms to minimize.
[2025-06-01 10:41:17] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 3 ms to minimize.
[2025-06-01 10:41:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-01 10:41:18] [INFO ] [Real]Absence check using 500 positive place invariants in 98 ms returned sat
[2025-06-01 10:41:19] [INFO ] [Real]Absence check using state equation in 1062 ms returned sat
[2025-06-01 10:41:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:41:19] [INFO ] [Nat]Absence check using 500 positive place invariants in 95 ms returned sat
[2025-06-01 10:41:21] [INFO ] [Nat]Absence check using state equation in 2101 ms returned unknown
[2025-06-01 10:41:22] [INFO ] [Real]Absence check using 500 positive place invariants in 95 ms returned sat
[2025-06-01 10:41:23] [INFO ] [Real]Absence check using state equation in 1108 ms returned sat
[2025-06-01 10:41:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:41:23] [INFO ] [Nat]Absence check using 500 positive place invariants in 96 ms returned sat
[2025-06-01 10:41:26] [INFO ] [Nat]Absence check using state equation in 2752 ms returned sat
[2025-06-01 10:41:26] [INFO ] [Nat]Added 500 Read/Feed constraints in 382 ms returned sat
[2025-06-01 10:41:27] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 2 ms to minimize.
[2025-06-01 10:41:27] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
[2025-06-01 10:41:27] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
[2025-06-01 10:41:27] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2025-06-01 10:41:27] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 5 ms to minimize.
[2025-06-01 10:41:28] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2025-06-01 10:41:28] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
[2025-06-01 10:41:28] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
[2025-06-01 10:41:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-01 10:41:28] [INFO ] [Real]Absence check using 500 positive place invariants in 101 ms returned sat
[2025-06-01 10:41:30] [INFO ] [Real]Absence check using state equation in 1122 ms returned sat
[2025-06-01 10:41:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:41:30] [INFO ] [Nat]Absence check using 500 positive place invariants in 105 ms returned sat
[2025-06-01 10:41:32] [INFO ] [Nat]Absence check using state equation in 2185 ms returned unknown
[2025-06-01 10:41:33] [INFO ] [Real]Absence check using 500 positive place invariants in 100 ms returned sat
[2025-06-01 10:41:34] [INFO ] [Real]Absence check using state equation in 1078 ms returned sat
[2025-06-01 10:41:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:41:34] [INFO ] [Nat]Absence check using 500 positive place invariants in 102 ms returned sat
[2025-06-01 10:41:36] [INFO ] [Nat]Absence check using state equation in 2077 ms returned sat
[2025-06-01 10:41:37] [INFO ] [Nat]Added 500 Read/Feed constraints in 533 ms returned sat
[2025-06-01 10:41:37] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 4 ms to minimize.
[2025-06-01 10:41:37] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 5 ms to minimize.
[2025-06-01 10:41:38] [INFO ] Deduced a trap composed of 3 places in 188 ms of which 3 ms to minimize.
[2025-06-01 10:41:38] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 3 ms to minimize.
[2025-06-01 10:41:38] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 4 ms to minimize.
[2025-06-01 10:41:38] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 3 ms to minimize.
[2025-06-01 10:41:39] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 3 ms to minimize.
[2025-06-01 10:41:39] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 2066 ms
[2025-06-01 10:41:39] [INFO ] [Real]Absence check using 500 positive place invariants in 101 ms returned sat
[2025-06-01 10:41:40] [INFO ] [Real]Absence check using state equation in 1143 ms returned sat
[2025-06-01 10:41:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:41:41] [INFO ] [Nat]Absence check using 500 positive place invariants in 104 ms returned sat
[2025-06-01 10:41:43] [INFO ] [Nat]Absence check using state equation in 2037 ms returned sat
[2025-06-01 10:41:43] [INFO ] [Nat]Added 500 Read/Feed constraints in 494 ms returned sat
[2025-06-01 10:41:44] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 4 ms to minimize.
[2025-06-01 10:41:44] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 4 ms to minimize.
[2025-06-01 10:41:44] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 5 ms to minimize.
[2025-06-01 10:41:44] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 3 ms to minimize.
[2025-06-01 10:41:45] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 3 ms to minimize.
[2025-06-01 10:41:45] [INFO ] Deduced a trap composed of 3 places in 188 ms of which 3 ms to minimize.
[2025-06-01 10:41:45] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 3 ms to minimize.
[2025-06-01 10:41:46] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 4 ms to minimize.
[2025-06-01 10:41:46] [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 9
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-01 10:41:46] [INFO ] [Real]Absence check using 500 positive place invariants in 97 ms returned sat
[2025-06-01 10:41:47] [INFO ] [Real]Absence check using state equation in 1072 ms returned sat
[2025-06-01 10:41:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:41:47] [INFO ] [Nat]Absence check using 500 positive place invariants in 97 ms returned sat
[2025-06-01 10:41:49] [INFO ] [Nat]Absence check using state equation in 2098 ms returned sat
[2025-06-01 10:41:50] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-01 10:41:50] [INFO ] [Nat]Added 500 Read/Feed constraints in 577 ms returned sat
[2025-06-01 10:41:50] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 4 ms to minimize.
[2025-06-01 10:41:51] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 4 ms to minimize.
[2025-06-01 10:41:51] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 4 ms to minimize.
[2025-06-01 10:41:51] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 4 ms to minimize.
[2025-06-01 10:41:51] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 3 ms to minimize.
[2025-06-01 10:41:52] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 4 ms to minimize.
[2025-06-01 10:41:52] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 3 ms to minimize.
[2025-06-01 10:41:52] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 4 ms to minimize.
[2025-06-01 10:41:52] [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 10
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-01 10:41:53] [INFO ] [Real]Absence check using 500 positive place invariants in 99 ms returned sat
[2025-06-01 10:41:54] [INFO ] [Real]Absence check using state equation in 1051 ms returned sat
[2025-06-01 10:41:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:41:54] [INFO ] [Nat]Absence check using 500 positive place invariants in 97 ms returned sat
[2025-06-01 10:41:57] [INFO ] [Nat]Absence check using state equation in 2699 ms returned sat
[2025-06-01 10:41:57] [INFO ] [Nat]Added 500 Read/Feed constraints in 395 ms returned sat
[2025-06-01 10:41:57] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 2 ms to minimize.
[2025-06-01 10:41:58] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 3 ms to minimize.
[2025-06-01 10:41:58] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2025-06-01 10:41:58] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
[2025-06-01 10:41:58] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 3 ms to minimize.
[2025-06-01 10:41:59] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 3 ms to minimize.
[2025-06-01 10:41:59] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2025-06-01 10:41:59] [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 11
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-01 10:41:59] [INFO ] [Real]Absence check using 500 positive place invariants in 93 ms returned sat
[2025-06-01 10:42:00] [INFO ] [Real]Absence check using state equation in 1043 ms returned sat
[2025-06-01 10:42:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:42:01] [INFO ] [Nat]Absence check using 500 positive place invariants in 97 ms returned sat
[2025-06-01 10:42:03] [INFO ] [Nat]Absence check using state equation in 2539 ms returned sat
[2025-06-01 10:42:04] [INFO ] [Nat]Added 500 Read/Feed constraints in 334 ms returned sat
[2025-06-01 10:42:04] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 3 ms to minimize.
[2025-06-01 10:42:04] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 3 ms to minimize.
[2025-06-01 10:42:04] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 2 ms to minimize.
[2025-06-01 10:42:05] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 3 ms to minimize.
[2025-06-01 10:42:05] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 3 ms to minimize.
[2025-06-01 10:42:05] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 2 ms to minimize.
[2025-06-01 10:42:05] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 3 ms to minimize.
[2025-06-01 10:42:05] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 3 ms to minimize.
[2025-06-01 10:42:05] [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 12
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-01 10:42:06] [INFO ] [Real]Absence check using 500 positive place invariants in 98 ms returned sat
[2025-06-01 10:42:07] [INFO ] [Real]Absence check using state equation in 1017 ms returned sat
[2025-06-01 10:42:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:42:07] [INFO ] [Nat]Absence check using 500 positive place invariants in 94 ms returned sat
[2025-06-01 10:42:09] [INFO ] [Nat]Absence check using state equation in 2085 ms returned unknown
[2025-06-01 10:42:10] [INFO ] [Real]Absence check using 500 positive place invariants in 98 ms returned sat
[2025-06-01 10:42:11] [INFO ] [Real]Absence check using state equation in 1080 ms returned sat
[2025-06-01 10:42:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:42:11] [INFO ] [Nat]Absence check using 500 positive place invariants in 98 ms returned sat
[2025-06-01 10:42:13] [INFO ] [Nat]Absence check using state equation in 2103 ms returned unknown
[2025-06-01 10:42:14] [INFO ] [Real]Absence check using 500 positive place invariants in 95 ms returned sat
[2025-06-01 10:42:15] [INFO ] [Real]Absence check using state equation in 1074 ms returned sat
[2025-06-01 10:42:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:42:15] [INFO ] [Nat]Absence check using 500 positive place invariants in 103 ms returned sat
[2025-06-01 10:42:17] [INFO ] [Nat]Absence check using state equation in 2183 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4, 5, 5, 5, 2, 2, 2, 500, 5, 4, 4, 5, 500, 5, 4, 4] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[250, 5, 5, 5, 2, 2, 13, 500, 5, 4, 250, 501, 500, 5, 4, 4] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Support contains 16 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 80 are kept as prefixes of interest. Removing 2420 places using SCC suffix rule.8 ms
Discarding 2420 places :
Also discarding 3872 output transitions
Drop transitions (Output transitions of discarded places.) removed 3872 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 128
Applied a total of 2 rules in 67 ms. Remains 80 /2500 variables (removed 2420) and now considering 128/4001 (removed 3873) transitions.
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 128 rows 80 cols
[2025-06-01 10:42:47] [INFO ] Computed 16 invariants in 5 ms
[2025-06-01 10:42:47] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 112 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1938 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 96/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 208 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2712 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 4696ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4705ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4786 ms. Remains : 80/2500 places, 128/4001 transitions.
[2025-06-01 10:42:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[250, 5, 5, 5, 2, 2, 13, 500, 5, 4, 250, 501, 500, 5, 4, 4] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
RANDOM walk for 1000060 steps (2 resets) in 1030 ms. (969 steps per ms)
FORMULA JoinFreeModules-PT-0500-UpperBounds-10 503 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 15000015 steps (30 resets) in 17904 ms. (837 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[495, 501, 501, 501, 483, 491, 470, 500, 501, 480, 501, 500, 501, 478, 489] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
[2025-06-01 10:43:11] [INFO ] Invariant cache hit.
[2025-06-01 10:43:11] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:11] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:43:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:11] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-06-01 10:43:11] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-01 10:43:11] [INFO ] [Nat]Added 16 Read/Feed constraints in 60 ms returned sat
[2025-06-01 10:43:11] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-01 10:43:11] [INFO ] Added : 58 causal constraints over 14 iterations in 131 ms. Result :sat
Minimization took 48 ms.
[2025-06-01 10:43:12] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:12] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:12] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:43:12] [INFO ] [Nat]Added 16 Read/Feed constraints in 41 ms returned sat
[2025-06-01 10:43:12] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:43:12] [INFO ] Added : 62 causal constraints over 14 iterations in 189 ms. Result :sat
Minimization took 39 ms.
[2025-06-01 10:43:12] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:12] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:43:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:12] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-06-01 10:43:12] [INFO ] [Nat]Added 16 Read/Feed constraints in 28 ms returned sat
[2025-06-01 10:43:12] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:43:12] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2025-06-01 10:43:12] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2025-06-01 10:43:12] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2025-06-01 10:43:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 85 ms
[2025-06-01 10:43:12] [INFO ] Added : 66 causal constraints over 14 iterations in 203 ms. Result :sat
Minimization took 33 ms.
[2025-06-01 10:43:12] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:12] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:12] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2025-06-01 10:43:12] [INFO ] [Nat]Added 16 Read/Feed constraints in 23 ms returned sat
[2025-06-01 10:43:12] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:43:13] [INFO ] Added : 50 causal constraints over 12 iterations in 119 ms. Result :sat
Minimization took 31 ms.
[2025-06-01 10:43:13] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:13] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:43:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:13] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:43:13] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:43:13] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:43:13] [INFO ] Added : 59 causal constraints over 13 iterations in 106 ms. Result :sat
Minimization took 61 ms.
[2025-06-01 10:43:13] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:13] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:13] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:43:13] [INFO ] [Nat]Added 16 Read/Feed constraints in 39 ms returned sat
[2025-06-01 10:43:13] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:43:13] [INFO ] Added : 62 causal constraints over 14 iterations in 169 ms. Result :sat
Minimization took 56 ms.
[2025-06-01 10:43:13] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:13] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:43:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:13] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:43:13] [INFO ] [Nat]Added 16 Read/Feed constraints in 40 ms returned sat
[2025-06-01 10:43:13] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:43:14] [INFO ] Added : 55 causal constraints over 12 iterations in 104 ms. Result :sat
Minimization took 29 ms.
[2025-06-01 10:43:14] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:14] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:43:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:14] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2025-06-01 10:43:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 31 ms returned sat
[2025-06-01 10:43:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:43:14] [INFO ] Added : 53 causal constraints over 12 iterations in 110 ms. Result :sat
Minimization took 32 ms.
[2025-06-01 10:43:14] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:14] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:43:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:14] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:43:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 40 ms returned sat
[2025-06-01 10:43:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:43:14] [INFO ] Added : 57 causal constraints over 12 iterations in 132 ms. Result :sat
Minimization took 33 ms.
[2025-06-01 10:43:14] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:14] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:43:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:14] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:43:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:43:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:43:14] [INFO ] Added : 56 causal constraints over 12 iterations in 100 ms. Result :sat
Minimization took 58 ms.
[2025-06-01 10:43:15] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:15] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:43:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:15] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-01 10:43:15] [INFO ] [Nat]Added 16 Read/Feed constraints in 59 ms returned sat
[2025-06-01 10:43:15] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:43:15] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2025-06-01 10:43:15] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2025-06-01 10:43:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 68 ms
[2025-06-01 10:43:15] [INFO ] Added : 68 causal constraints over 14 iterations in 197 ms. Result :sat
Minimization took 37 ms.
[2025-06-01 10:43:15] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:15] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:15] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:43:15] [INFO ] [Nat]Added 16 Read/Feed constraints in 63 ms returned sat
[2025-06-01 10:43:15] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-01 10:43:15] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2025-06-01 10:43:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2025-06-01 10:43:15] [INFO ] Added : 51 causal constraints over 11 iterations in 136 ms. Result :sat
Minimization took 30 ms.
[2025-06-01 10:43:15] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:15] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-01 10:43:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:15] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:15] [INFO ] [Nat]Added 16 Read/Feed constraints in 39 ms returned sat
[2025-06-01 10:43:15] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:43:16] [INFO ] Added : 50 causal constraints over 11 iterations in 88 ms. Result :sat
Minimization took 31 ms.
[2025-06-01 10:43:16] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-01 10:43:16] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-01 10:43:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:16] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-01 10:43:16] [INFO ] [Nat]Added 16 Read/Feed constraints in 61 ms returned sat
[2025-06-01 10:43:16] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:43:16] [INFO ] Added : 60 causal constraints over 13 iterations in 130 ms. Result :sat
Minimization took 67 ms.
[2025-06-01 10:43:16] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:16] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-01 10:43:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:16] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-01 10:43:16] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:43:16] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:43:16] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2025-06-01 10:43:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2025-06-01 10:43:16] [INFO ] Added : 61 causal constraints over 13 iterations in 196 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[495, 501, 501, 501, 483, 491, 470, 500, 501, 480, 501, 500, 501, 478, 489] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501, 501, 501, 501, 502, 502, 502, 500, 501, 501, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Support contains 15 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 75 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 13 ms. Remains 75 /80 variables (removed 5) and now considering 120/128 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 75/80 places, 120/128 transitions.
// Phase 1: matrix 120 rows 75 cols
[2025-06-01 10:43:39] [INFO ] Computed 15 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[501, 501, 501, 501, 502, 502, 502, 500, 501, 501, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
RANDOM walk for 1000004 steps (2 resets) in 942 ms. (1060 steps per ms)
BEST_FIRST walk for 15000015 steps (30 resets) in 16965 ms. (884 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501, 501, 501, 501, 502, 502, 502, 500, 501, 501, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
[2025-06-01 10:43:57] [INFO ] Invariant cache hit.
[2025-06-01 10:43:57] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:57] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:57] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:57] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2025-06-01 10:43:57] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-01 10:43:58] [INFO ] [Nat]Added 15 Read/Feed constraints in 27 ms returned sat
[2025-06-01 10:43:58] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-01 10:43:58] [INFO ] Added : 50 causal constraints over 11 iterations in 98 ms. Result :sat
Minimization took 30 ms.
[2025-06-01 10:43:58] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:58] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-01 10:43:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:58] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:58] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:58] [INFO ] [Nat]Added 15 Read/Feed constraints in 22 ms returned sat
[2025-06-01 10:43:58] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:43:58] [INFO ] Added : 57 causal constraints over 13 iterations in 99 ms. Result :sat
Minimization took 36 ms.
[2025-06-01 10:43:58] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2025-06-01 10:43:58] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:43:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:58] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:58] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:58] [INFO ] [Nat]Added 15 Read/Feed constraints in 62 ms returned sat
[2025-06-01 10:43:58] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:43:58] [INFO ] Added : 41 causal constraints over 9 iterations in 69 ms. Result :sat
Minimization took 28 ms.
[2025-06-01 10:43:58] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:58] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:58] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:58] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2025-06-01 10:43:58] [INFO ] [Nat]Added 15 Read/Feed constraints in 25 ms returned sat
[2025-06-01 10:43:58] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:43:58] [INFO ] Added : 57 causal constraints over 12 iterations in 94 ms. Result :sat
Minimization took 32 ms.
[2025-06-01 10:43:59] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:59] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:43:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:59] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:59] [INFO ] [Nat]Added 15 Read/Feed constraints in 22 ms returned sat
[2025-06-01 10:43:59] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:43:59] [INFO ] Added : 48 causal constraints over 13 iterations in 108 ms. Result :sat
Minimization took 21 ms.
[2025-06-01 10:43:59] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:59] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:59] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:43:59] [INFO ] [Nat]Added 15 Read/Feed constraints in 23 ms returned sat
[2025-06-01 10:43:59] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:43:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2025-06-01 10:43:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2025-06-01 10:43:59] [INFO ] Added : 51 causal constraints over 12 iterations in 154 ms. Result :sat
Minimization took 22 ms.
[2025-06-01 10:43:59] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:59] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:43:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:59] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:43:59] [INFO ] [Nat]Added 15 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:43:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2025-06-01 10:43:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2025-06-01 10:43:59] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:59] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:43:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:59] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:59] [INFO ] [Nat]Added 15 Read/Feed constraints in 85 ms returned sat
[2025-06-01 10:43:59] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:44:00] [INFO ] Added : 65 causal constraints over 15 iterations in 114 ms. Result :sat
Minimization took 32 ms.
[2025-06-01 10:44:00] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:00] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:44:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:00] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:44:00] [INFO ] [Nat]Added 15 Read/Feed constraints in 62 ms returned sat
[2025-06-01 10:44:00] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:44:00] [INFO ] Added : 51 causal constraints over 11 iterations in 86 ms. Result :sat
Minimization took 29 ms.
[2025-06-01 10:44:00] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:00] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:44:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:00] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2025-06-01 10:44:00] [INFO ] [Nat]Added 15 Read/Feed constraints in 9 ms returned sat
[2025-06-01 10:44:00] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:44:00] [INFO ] Added : 44 causal constraints over 10 iterations in 77 ms. Result :sat
Minimization took 40 ms.
[2025-06-01 10:44:00] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:00] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:44:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:00] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:44:00] [INFO ] [Nat]Added 15 Read/Feed constraints in 43 ms returned sat
[2025-06-01 10:44:00] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:44:00] [INFO ] Added : 50 causal constraints over 11 iterations in 113 ms. Result :sat
Minimization took 37 ms.
[2025-06-01 10:44:00] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:00] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:44:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:01] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:44:01] [INFO ] [Nat]Added 15 Read/Feed constraints in 64 ms returned sat
[2025-06-01 10:44:01] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-01 10:44:01] [INFO ] Added : 37 causal constraints over 8 iterations in 67 ms. Result :sat
Minimization took 31 ms.
[2025-06-01 10:44:01] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:01] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:44:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:01] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2025-06-01 10:44:01] [INFO ] [Nat]Added 15 Read/Feed constraints in 21 ms returned sat
[2025-06-01 10:44:01] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:44:01] [INFO ] Added : 51 causal constraints over 11 iterations in 107 ms. Result :sat
Minimization took 29 ms.
[2025-06-01 10:44:01] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:01] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:44:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:01] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2025-06-01 10:44:01] [INFO ] [Nat]Added 15 Read/Feed constraints in 29 ms returned sat
[2025-06-01 10:44:01] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-01 10:44:01] [INFO ] Added : 38 causal constraints over 9 iterations in 73 ms. Result :sat
Minimization took 38 ms.
[2025-06-01 10:44:01] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:01] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-01 10:44:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:01] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-06-01 10:44:01] [INFO ] [Nat]Added 15 Read/Feed constraints in 5 ms returned sat
[2025-06-01 10:44:01] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:44:02] [INFO ] Added : 47 causal constraints over 10 iterations in 104 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501, 501, 501, 501, 502, 502, 502, 500, 501, 501, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 503, 503, 502, 503, 503, 503, 503, 503, 503, 503, 503]
FORMULA JoinFreeModules-PT-0500-UpperBounds-06 502 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501, 501, 501, 501, 502, 502, 500, 501, 501, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Support contains 14 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 70 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 11 ms. Remains 70 /75 variables (removed 5) and now considering 112/120 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 70/75 places, 112/120 transitions.
// Phase 1: matrix 112 rows 70 cols
[2025-06-01 10:44:20] [INFO ] Computed 14 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[501, 501, 501, 501, 502, 502, 500, 501, 501, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
RANDOM walk for 1000094 steps (2 resets) in 904 ms. (1105 steps per ms)
BEST_FIRST walk for 14000014 steps (28 resets) in 14928 ms. (937 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501, 501, 501, 501, 502, 502, 500, 501, 501, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
[2025-06-01 10:44:36] [INFO ] Invariant cache hit.
[2025-06-01 10:44:36] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:36] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:44:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:36] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:44:36] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:44:36] [INFO ] [Nat]Added 14 Read/Feed constraints in 64 ms returned sat
[2025-06-01 10:44:36] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:44:36] [INFO ] Added : 34 causal constraints over 8 iterations in 63 ms. Result :sat
Minimization took 26 ms.
[2025-06-01 10:44:36] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:36] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:44:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:36] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:44:36] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:44:36] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:44:36] [INFO ] Added : 28 causal constraints over 7 iterations in 64 ms. Result :sat
Minimization took 28 ms.
[2025-06-01 10:44:36] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:36] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:44:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:36] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:44:36] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:44:36] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:44:36] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2025-06-01 10:44:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2025-06-01 10:44:37] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2025-06-01 10:44:37] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2025-06-01 10:44:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 116 ms
[2025-06-01 10:44:37] [INFO ] Added : 45 causal constraints over 11 iterations in 276 ms. Result :sat
Minimization took 29 ms.
[2025-06-01 10:44:37] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:37] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:44:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2025-06-01 10:44:37] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:44:37] [INFO ] [Nat]Added 14 Read/Feed constraints in 65 ms returned sat
[2025-06-01 10:44:37] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:44:37] [INFO ] Added : 32 causal constraints over 7 iterations in 61 ms. Result :sat
Minimization took 26 ms.
[2025-06-01 10:44:37] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:37] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:44:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:37] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:44:37] [INFO ] [Nat]Added 14 Read/Feed constraints in 63 ms returned sat
[2025-06-01 10:44:37] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:44:37] [INFO ] Added : 28 causal constraints over 7 iterations in 55 ms. Result :sat
Minimization took 18 ms.
[2025-06-01 10:44:37] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:37] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:44:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:37] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:44:37] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:44:37] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:44:37] [INFO ] Added : 42 causal constraints over 10 iterations in 141 ms. Result :sat
Minimization took 20 ms.
[2025-06-01 10:44:37] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:37] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:44:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:37] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:44:38] [INFO ] [Nat]Added 14 Read/Feed constraints in 66 ms returned sat
[2025-06-01 10:44:38] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:44:38] [INFO ] Added : 32 causal constraints over 7 iterations in 67 ms. Result :sat
Minimization took 24 ms.
[2025-06-01 10:44:38] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:38] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:44:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2025-06-01 10:44:38] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:44:38] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:44:38] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:44:38] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2025-06-01 10:44:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2025-06-01 10:44:38] [INFO ] Added : 43 causal constraints over 10 iterations in 171 ms. Result :sat
Minimization took 26 ms.
[2025-06-01 10:44:38] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:38] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:44:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:38] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:44:38] [INFO ] [Nat]Added 14 Read/Feed constraints in 64 ms returned sat
[2025-06-01 10:44:38] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:44:38] [INFO ] Added : 34 causal constraints over 8 iterations in 61 ms. Result :sat
Minimization took 26 ms.
[2025-06-01 10:44:38] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:38] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:44:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:38] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:44:38] [INFO ] [Nat]Added 14 Read/Feed constraints in 64 ms returned sat
[2025-06-01 10:44:38] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:44:38] [INFO ] Added : 32 causal constraints over 7 iterations in 56 ms. Result :sat
Minimization took 30 ms.
[2025-06-01 10:44:38] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:39] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:44:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2025-06-01 10:44:39] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-01 10:44:39] [INFO ] [Nat]Added 14 Read/Feed constraints in 151 ms returned sat
[2025-06-01 10:44:39] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:44:39] [INFO ] Added : 41 causal constraints over 9 iterations in 73 ms. Result :sat
Minimization took 35 ms.
[2025-06-01 10:44:39] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:39] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:44:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:39] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:44:39] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:44:39] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:44:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2025-06-01 10:44:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2025-06-01 10:44:39] [INFO ] Added : 37 causal constraints over 8 iterations in 163 ms. Result :sat
Minimization took 26 ms.
[2025-06-01 10:44:39] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:39] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:44:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:39] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-06-01 10:44:39] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2025-06-01 10:44:39] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:44:39] [INFO ] Added : 27 causal constraints over 6 iterations in 44 ms. Result :sat
Minimization took 25 ms.
[2025-06-01 10:44:39] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:39] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:44:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:39] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:44:39] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:44:39] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:44:40] [INFO ] Added : 51 causal constraints over 11 iterations in 175 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501, 501, 501, 501, 502, 502, 500, 501, 501, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501, 501, 501, 501, 502, 502, 500, 501, 501, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Support contains 14 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Applied a total of 0 rules in 13 ms. Remains 70 /70 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 70/70 places, 112/112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Applied a total of 0 rules in 9 ms. Remains 70 /70 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2025-06-01 10:44:55] [INFO ] Invariant cache hit.
[2025-06-01 10:44:55] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-01 10:44:55] [INFO ] Invariant cache hit.
[2025-06-01 10:44:55] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:44:55] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2025-06-01 10:44:55] [INFO ] Redundant transitions in 2 ms returned []
Running 84 sub problems to find dead transitions.
[2025-06-01 10:44:55] [INFO ] Invariant cache hit.
[2025-06-01 10:44:55] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 14/70 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 112/182 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 98 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1362 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 70/70 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 14/70 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 112/182 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 84/182 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 182 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1986 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 70/70 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
After SMT, in 3384ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3388ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3481 ms. Remains : 70/70 places, 112/112 transitions.
RANDOM walk for 40715 steps (8 resets) in 111 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
[2025-06-01 10:44:59] [INFO ] Flatten gal took : 64 ms
[2025-06-01 10:44:59] [INFO ] Flatten gal took : 20 ms
[2025-06-01 10:44:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1112168818988721976.gal : 13 ms
[2025-06-01 10:44:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3657881785678659562.prop : 3 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1112168818988721976.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3657881785678659562.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality3657881785678659562.prop.
SDD proceeding with computation,28 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,28 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,28 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,28 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,28 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,28 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,28 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 132975 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 28
Probabilistic random walk after 132975 steps, saw 125912 distinct states, run finished after 3007 ms. (steps per millisecond=44 ) properties seen :0
[2025-06-01 10:45:02] [INFO ] Invariant cache hit.
[2025-06-01 10:45:02] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 56/70 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-06-01 10:45:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
[2025-06-01 10:45:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2025-06-01 10:45:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2025-06-01 10:45:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2025-06-01 10:45:02] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2025-06-01 10:45:02] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2025-06-01 10:45:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2025-06-01 10:45:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2025-06-01 10:45:03] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2025-06-01 10:45:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2025-06-01 10:45:03] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2025-06-01 10:45:03] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2025-06-01 10:45:03] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2025-06-01 10:45:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MIN4 is UNSAT
Problem MAX5 is UNSAT
Problem MIN5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
Problem MAX9 is UNSAT
Problem MAX10 is UNSAT
Problem MAX11 is UNSAT
Problem MAX12 is UNSAT
Problem MAX13 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 14/28 constraints. Problems are: Problem set: 16 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/28 constraints. Problems are: Problem set: 16 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 112/182 variables, 70/98 constraints. Problems are: Problem set: 16 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 14/112 constraints. Problems are: Problem set: 16 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/112 constraints. Problems are: Problem set: 16 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/112 constraints. Problems are: Problem set: 16 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 112 constraints, problems are : Problem set: 16 solved, 12 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 70/70 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 16 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 48/60 variables, 12/12 constraints. Problems are: Problem set: 16 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 12/24 constraints. Problems are: Problem set: 16 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/24 constraints. Problems are: Problem set: 16 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 96/156 variables, 60/84 constraints. Problems are: Problem set: 16 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 12/96 constraints. Problems are: Problem set: 16 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 12/108 constraints. Problems are: Problem set: 16 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/108 constraints. Problems are: Problem set: 16 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/156 variables, 0/108 constraints. Problems are: Problem set: 16 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/182 variables, and 108 constraints, problems are : Problem set: 16 solved, 12 unsolved in 1034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, State Equation: 60/70 constraints, ReadFeed: 12/14 constraints, PredecessorRefiner: 12/28 constraints, Known Traps: 12/14 constraints]
After SMT, in 1699ms problems are : Problem set: 16 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
SDD proceeding with computation,28 properties remain. new max is 512
SDD size :11747 after 45400
Parikh walk visited 4 properties in 17619 ms.
Support contains 8 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 40 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 15 ms. Remains 40 /70 variables (removed 30) and now considering 64/112 (removed 48) transitions.
Running 48 sub problems to find dead transitions.
// Phase 1: matrix 64 rows 40 cols
[2025-06-01 10:45:21] [INFO ] Computed 8 invariants in 0 ms
[2025-06-01 10:45:21] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 8/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 64/104 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/104 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 56 constraints, problems are : Problem set: 0 solved, 48 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 8/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 64/104 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 48/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 104 constraints, problems are : Problem set: 0 solved, 48 unsolved in 822 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 1298ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1299ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1314 ms. Remains : 40/70 places, 64/112 transitions.
RANDOM walk for 40234 steps (8 resets) in 31 ms. (1257 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 154112 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 8
Probabilistic random walk after 154112 steps, saw 138767 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
[2025-06-01 10:45:26] [INFO ] Invariant cache hit.
[2025-06-01 10:45:26] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 32/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 64/104 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/104 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 56 constraints, problems are : Problem set: 0 solved, 8 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 32/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-01 10:45:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 64/104 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-01 10:45:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2025-06-01 10:45:26] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2025-06-01 10:45:27] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2025-06-01 10:45:27] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 69 constraints, problems are : Problem set: 0 solved, 8 unsolved in 642 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 5/5 constraints]
After SMT, in 743ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11082 ms.
Support contains 8 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 40/40 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-01 10:45:38] [INFO ] Invariant cache hit.
[2025-06-01 10:45:38] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-01 10:45:38] [INFO ] Invariant cache hit.
[2025-06-01 10:45:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 10:45:38] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2025-06-01 10:45:38] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2025-06-01 10:45:38] [INFO ] Invariant cache hit.
[2025-06-01 10:45:38] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 8/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 64/104 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/104 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 56 constraints, problems are : Problem set: 0 solved, 48 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 8/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 64/104 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 48/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 104 constraints, problems are : Problem set: 0 solved, 48 unsolved in 976 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 1684ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1685ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1748 ms. Remains : 40/40 places, 64/64 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 10:45:40] [INFO ] Flatten gal took : 27 ms
[2025-06-01 10:45:40] [INFO ] Applying decomposition
[2025-06-01 10:45:40] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16323238764347512413.txt' '-o' '/tmp/graph16323238764347512413.bin' '-w' '/tmp/graph16323238764347512413.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16323238764347512413.bin' '-l' '-1' '-v' '-w' '/tmp/graph16323238764347512413.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:45:40] [INFO ] Decomposing Gal with order
[2025-06-01 10:45:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:45:40] [INFO ] Flatten gal took : 7 ms
[2025-06-01 10:45:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:45:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17467672922413107976.gal : 1 ms
[2025-06-01 10:45:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11678790788219324801.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17467672922413107976.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11678790788219324801.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality11678790788219324801.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :3104 after 11747
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :11747 after 45400
Detected timeout of ITS tools.
FORMULA JoinFreeModules-PT-0500-UpperBounds-05 502 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0500-UpperBounds-04 502 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[501, 501, 501, 501, 500, 501, 501, 501, 500, 501, 501, 501] Max Struct:[503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503]
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[503]
// Phase 1: matrix 112 rows 70 cols
[2025-06-01 10:46:30] [INFO ] Computed 14 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[503]
RANDOM walk for 10399 steps (2 resets) in 8 ms. (1155 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[105] Max Struct:[503]
[2025-06-01 10:46:30] [INFO ] Invariant cache hit.
[2025-06-01 10:46:30] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:46:30] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-01 10:46:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:46:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:46:30] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:46:30] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:46:30] [INFO ] [Nat]Added 14 Read/Feed constraints in 69 ms returned sat
[2025-06-01 10:46:30] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:46:30] [INFO ] Added : 40 causal constraints over 8 iterations in 71 ms. Result :sat
Minimization took 138 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[105] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[500] Max Struct:[503]
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 5 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.0 ms
Discarding 65 places :
Also discarding 104 output transitions
Drop transitions (Output transitions of discarded places.) removed 104 transitions
Applied a total of 1 rules in 6 ms. Remains 5 /70 variables (removed 65) and now considering 8/112 (removed 104) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-01 10:46:31] [INFO ] Computed 1 invariants in 1 ms
[2025-06-01 10:46:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 114ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 5/70 places, 8/112 transitions.
[2025-06-01 10:46:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[500] Max Struct:[503]
RANDOM walk for 1000010 steps (2 resets) in 121 ms. (8196 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 149 ms. (6666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-01 10:46:32] [INFO ] Invariant cache hit.
[2025-06-01 10:46:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:46:32] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:46:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:46:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:46:32] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:46:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:46:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:46:32] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-01 10:46:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2025-06-01 10:46:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2025-06-01 10:46:32] [INFO ] Added : 5 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:46:32] [INFO ] Invariant cache hit.
[2025-06-01 10:46:32] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-01 10:46:32] [INFO ] Invariant cache hit.
[2025-06-01 10:46:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:46:32] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2025-06-01 10:46:32] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:46:32] [INFO ] Invariant cache hit.
[2025-06-01 10:46:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 92ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 92ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-01 10:46:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501] Max Struct:[503]
RANDOM walk for 1000044 steps (2 resets) in 121 ms. (8197 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 149 ms. (6666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-01 10:46:32] [INFO ] Invariant cache hit.
[2025-06-01 10:46:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:46:32] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-01 10:46:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:46:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:46:32] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-01 10:46:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:46:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:46:32] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:46:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2025-06-01 10:46:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2025-06-01 10:46:32] [INFO ] Added : 5 causal constraints over 2 iterations in 32 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:46:32] [INFO ] Invariant cache hit.
[2025-06-01 10:46:32] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-01 10:46:32] [INFO ] Invariant cache hit.
[2025-06-01 10:46:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:46:32] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2025-06-01 10:46:33] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:46:33] [INFO ] Invariant cache hit.
[2025-06-01 10:46:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 97ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 97ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-01 10:46:33] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 40270 steps (8 resets) in 17 ms. (2237 steps per ms) remains 2/2 properties
[2025-06-01 10:46:33] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:46:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14934827782743684692.gal : 1 ms
[2025-06-01 10:46:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3382330655251309663.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14934827782743684692.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3382330655251309663.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3382330655251309663.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
BEST_FIRST walk for 40003 steps (8 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 964934 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :0 out of 2
Probabilistic random walk after 964934 steps, saw 377439 distinct states, run finished after 3001 ms. (steps per millisecond=321 ) properties seen :0
[2025-06-01 10:46:36] [INFO ] Invariant cache hit.
[2025-06-01 10:46:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 10:46:36] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 58ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-01 10:46:36] [INFO ] Invariant cache hit.
[2025-06-01 10:46:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 122ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40364 steps (8 resets) in 11 ms. (3363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 13 ms. (2857 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3888541 steps, run timeout after 3001 ms. (steps per millisecond=1295 ) properties seen :0 out of 1
Probabilistic random walk after 3888541 steps, saw 1353868 distinct states, run finished after 3001 ms. (steps per millisecond=1295 ) properties seen :0
[2025-06-01 10:46:39] [INFO ] Invariant cache hit.
[2025-06-01 10:46:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 39ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:46:39] [INFO ] Invariant cache hit.
[2025-06-01 10:46:39] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-01 10:46:39] [INFO ] Invariant cache hit.
[2025-06-01 10:46:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:46:39] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2025-06-01 10:46:39] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:46:39] [INFO ] Invariant cache hit.
[2025-06-01 10:46:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 10:46:39] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:46:39] [INFO ] Applying decomposition
[2025-06-01 10:46:39] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6474569406232881467.txt' '-o' '/tmp/graph6474569406232881467.bin' '-w' '/tmp/graph6474569406232881467.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6474569406232881467.bin' '-l' '-1' '-v' '-w' '/tmp/graph6474569406232881467.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:46:39] [INFO ] Decomposing Gal with order
[2025-06-01 10:46:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:46:39] [INFO ] Flatten gal took : 23 ms
[2025-06-01 10:46:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:46:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14083891899878316458.gal : 1 ms
[2025-06-01 10:46:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16043920547658931260.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14083891899878316458.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16043920547658931260.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality16043920547658931260.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9466 after 20358
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.23653e+07 after 6.23653e+07
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[501] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-00 in 59295 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[503]
// Phase 1: matrix 112 rows 70 cols
[2025-06-01 10:47:29] [INFO ] Computed 14 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[503]
RANDOM walk for 10055 steps (2 resets) in 9 ms. (1005 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[113] Max Struct:[503]
[2025-06-01 10:47:29] [INFO ] Invariant cache hit.
[2025-06-01 10:47:29] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:47:29] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:47:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:47:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:47:29] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:47:29] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:47:29] [INFO ] [Nat]Added 14 Read/Feed constraints in 45 ms returned sat
[2025-06-01 10:47:29] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-01 10:47:29] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2025-06-01 10:47:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2025-06-01 10:47:29] [INFO ] Added : 34 causal constraints over 8 iterations in 121 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[113] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[499] Max Struct:[503]
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 5 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.0 ms
Discarding 65 places :
Also discarding 104 output transitions
Drop transitions (Output transitions of discarded places.) removed 104 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /70 variables (removed 65) and now considering 8/112 (removed 104) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-01 10:47:31] [INFO ] Computed 1 invariants in 0 ms
[2025-06-01 10:47:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 111ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 5/70 places, 8/112 transitions.
[2025-06-01 10:47:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[499] Max Struct:[503]
RANDOM walk for 1000030 steps (2 resets) in 113 ms. (8772 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 227 ms. (4385 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-01 10:47:31] [INFO ] Invariant cache hit.
[2025-06-01 10:47:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 10:47:31] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:47:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:47:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:47:31] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:47:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:47:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-01 10:47:31] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-01 10:47:31] [INFO ] Added : 6 causal constraints over 3 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:47:31] [INFO ] Invariant cache hit.
[2025-06-01 10:47:31] [INFO ] Implicit Places using invariants in 13 ms returned []
[2025-06-01 10:47:31] [INFO ] Invariant cache hit.
[2025-06-01 10:47:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:47:31] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2025-06-01 10:47:31] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:47:31] [INFO ] Invariant cache hit.
[2025-06-01 10:47:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 84ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-01 10:47:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501] Max Struct:[503]
RANDOM walk for 1000006 steps (2 resets) in 111 ms. (8928 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 190 ms. (5235 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-01 10:47:32] [INFO ] Invariant cache hit.
[2025-06-01 10:47:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 10:47:32] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-01 10:47:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:47:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:47:32] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-01 10:47:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:47:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:47:32] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:47:32] [INFO ] Added : 6 causal constraints over 3 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:47:32] [INFO ] Invariant cache hit.
[2025-06-01 10:47:32] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-01 10:47:32] [INFO ] Invariant cache hit.
[2025-06-01 10:47:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:47:32] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2025-06-01 10:47:32] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:47:32] [INFO ] Invariant cache hit.
[2025-06-01 10:47:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 91ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-01 10:47:32] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:47:32] [INFO ] Flatten gal took : 0 ms
[2025-06-01 10:47:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3556873137228622407.gal : 1 ms
RANDOM walk for 40285 steps (8 resets) in 18 ms. (2120 steps per ms) remains 2/2 properties
[2025-06-01 10:47:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5635357165652220418.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3556873137228622407.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5635357165652220418.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5635357165652220418.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1643119 steps, run timeout after 3001 ms. (steps per millisecond=547 ) properties seen :0 out of 2
Probabilistic random walk after 1643119 steps, saw 556256 distinct states, run finished after 3001 ms. (steps per millisecond=547 ) properties seen :0
[2025-06-01 10:47:35] [INFO ] Invariant cache hit.
[2025-06-01 10:47:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 10:47:35] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 78ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-01 10:47:35] [INFO ] Invariant cache hit.
[2025-06-01 10:47:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 115ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40523 steps (8 resets) in 9 ms. (4052 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 11 ms. (3333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4040124 steps, run timeout after 3001 ms. (steps per millisecond=1346 ) properties seen :0 out of 1
Probabilistic random walk after 4040124 steps, saw 1407750 distinct states, run finished after 3001 ms. (steps per millisecond=1346 ) properties seen :0
[2025-06-01 10:47:38] [INFO ] Invariant cache hit.
[2025-06-01 10:47:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 75ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:47:38] [INFO ] Invariant cache hit.
[2025-06-01 10:47:38] [INFO ] Implicit Places using invariants in 12 ms returned []
[2025-06-01 10:47:38] [INFO ] Invariant cache hit.
[2025-06-01 10:47:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:47:38] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2025-06-01 10:47:38] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:47:38] [INFO ] Invariant cache hit.
[2025-06-01 10:47:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 83ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 10:47:38] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:47:38] [INFO ] Applying decomposition
[2025-06-01 10:47:38] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2835856973387297423.txt' '-o' '/tmp/graph2835856973387297423.bin' '-w' '/tmp/graph2835856973387297423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2835856973387297423.bin' '-l' '-1' '-v' '-w' '/tmp/graph2835856973387297423.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:47:38] [INFO ] Decomposing Gal with order
[2025-06-01 10:47:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:47:38] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:47:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:47:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15496415775775136989.gal : 0 ms
[2025-06-01 10:47:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7297322585759529124.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15496415775775136989.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7297322585759529124.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality7297322585759529124.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9469 after 18373
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :38113 after 96629
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :96629 after 100569
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :100569 after 170458
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :170458 after 182263
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :182263 after 286964
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :286964 after 456754
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :642217 after 943064
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.80815e+06 after 2.36332e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[501] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-01 in 59157 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[503]
// Phase 1: matrix 112 rows 70 cols
[2025-06-01 10:48:28] [INFO ] Computed 14 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[503]
RANDOM walk for 10443 steps (2 resets) in 9 ms. (1044 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:[501] Max Struct:[503]
[2025-06-01 10:48:28] [INFO ] Invariant cache hit.
[2025-06-01 10:48:28] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:48:28] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:48:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:48:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:48:28] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:48:28] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:48:28] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:48:28] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:48:29] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2025-06-01 10:48:29] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2025-06-01 10:48:29] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2025-06-01 10:48:29] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2025-06-01 10:48:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 108 ms
[2025-06-01 10:48:29] [INFO ] Added : 45 causal constraints over 11 iterations in 267 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 5 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.0 ms
Discarding 65 places :
Also discarding 104 output transitions
Drop transitions (Output transitions of discarded places.) removed 104 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /70 variables (removed 65) and now considering 8/112 (removed 104) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-01 10:48:30] [INFO ] Computed 1 invariants in 0 ms
[2025-06-01 10:48:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 112ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 5/70 places, 8/112 transitions.
[2025-06-01 10:48:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501] Max Struct:[503]
RANDOM walk for 1000138 steps (2 resets) in 116 ms. (8548 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 146 ms. (6802 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-01 10:48:30] [INFO ] Invariant cache hit.
[2025-06-01 10:48:30] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:48:30] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:48:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:48:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:48:30] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-01 10:48:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:48:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 10:48:30] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:48:30] [INFO ] Added : 6 causal constraints over 3 iterations in 7 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:48:30] [INFO ] Invariant cache hit.
[2025-06-01 10:48:30] [INFO ] Implicit Places using invariants in 13 ms returned []
[2025-06-01 10:48:30] [INFO ] Invariant cache hit.
[2025-06-01 10:48:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:48:30] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2025-06-01 10:48:30] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:48:30] [INFO ] Invariant cache hit.
[2025-06-01 10:48:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 108ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40208 steps (8 resets) in 11 ms. (3350 steps per ms) remains 2/2 properties
[2025-06-01 10:48:30] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:48:30] [INFO ] Flatten gal took : 4 ms
[2025-06-01 10:48:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6411090679402477269.gal : 1 ms
[2025-06-01 10:48:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14487962745523283864.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6411090679402477269.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14487962745523283864.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14487962745523283864.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1770603 steps, run timeout after 3001 ms. (steps per millisecond=590 ) properties seen :0 out of 2
Probabilistic random walk after 1770603 steps, saw 601683 distinct states, run finished after 3001 ms. (steps per millisecond=590 ) properties seen :0
[2025-06-01 10:48:33] [INFO ] Invariant cache hit.
[2025-06-01 10:48:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 10:48:34] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 88ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-01 10:48:34] [INFO ] Invariant cache hit.
[2025-06-01 10:48:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 85ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40355 steps (8 resets) in 14 ms. (2690 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4172939 steps, run timeout after 3001 ms. (steps per millisecond=1390 ) properties seen :0 out of 1
Probabilistic random walk after 4172939 steps, saw 1452899 distinct states, run finished after 3001 ms. (steps per millisecond=1390 ) properties seen :0
[2025-06-01 10:48:37] [INFO ] Invariant cache hit.
[2025-06-01 10:48:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 54ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:48:37] [INFO ] Invariant cache hit.
[2025-06-01 10:48:37] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-01 10:48:37] [INFO ] Invariant cache hit.
[2025-06-01 10:48:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:48:37] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2025-06-01 10:48:37] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:48:37] [INFO ] Invariant cache hit.
[2025-06-01 10:48:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 96ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 96ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 10:48:37] [INFO ] Flatten gal took : 0 ms
[2025-06-01 10:48:37] [INFO ] Applying decomposition
[2025-06-01 10:48:37] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1706788945622876311.txt' '-o' '/tmp/graph1706788945622876311.bin' '-w' '/tmp/graph1706788945622876311.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1706788945622876311.bin' '-l' '-1' '-v' '-w' '/tmp/graph1706788945622876311.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:48:37] [INFO ] Decomposing Gal with order
[2025-06-01 10:48:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:48:37] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:48:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:48:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2562225939817346824.gal : 1 ms
[2025-06-01 10:48:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3954746720894729340.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2562225939817346824.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3954746720894729340.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality3954746720894729340.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9461 after 20349
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5.72417e+07 after 5.72463e+07
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[501] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-02 in 58642 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[503]
// Phase 1: matrix 112 rows 70 cols
[2025-06-01 10:49:27] [INFO ] Computed 14 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[503]
RANDOM walk for 10343 steps (2 resets) in 76 ms. (134 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-01 10:49:27] [INFO ] Invariant cache hit.
[2025-06-01 10:49:27] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:27] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:49:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:49:27] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:27] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:49:27] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:49:27] [INFO ] [Nat]Added 14 Read/Feed constraints in 63 ms returned sat
[2025-06-01 10:49:27] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:49:27] [INFO ] Added : 32 causal constraints over 7 iterations in 53 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 5 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.1 ms
Discarding 65 places :
Also discarding 104 output transitions
Drop transitions (Output transitions of discarded places.) removed 104 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /70 variables (removed 65) and now considering 8/112 (removed 104) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-01 10:49:28] [INFO ] Computed 1 invariants in 0 ms
[2025-06-01 10:49:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 90ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 5/70 places, 8/112 transitions.
[2025-06-01 10:49:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501] Max Struct:[503]
RANDOM walk for 1000049 steps (2 resets) in 120 ms. (8264 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 178 ms. (5586 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-01 10:49:29] [INFO ] Invariant cache hit.
[2025-06-01 10:49:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 10:49:29] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:49:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:49:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 10:49:29] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-01 10:49:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:49:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:49:29] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-01 10:49:29] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:49:29] [INFO ] Invariant cache hit.
[2025-06-01 10:49:29] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-01 10:49:29] [INFO ] Invariant cache hit.
[2025-06-01 10:49:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:49:29] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2025-06-01 10:49:29] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:49:29] [INFO ] Invariant cache hit.
[2025-06-01 10:49:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 91ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-01 10:49:29] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:49:29] [INFO ] Flatten gal took : 0 ms
RANDOM walk for 40350 steps (8 resets) in 18 ms. (2123 steps per ms) remains 2/2 properties
[2025-06-01 10:49:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5046005900314515947.gal : 2 ms
[2025-06-01 10:49:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5499538969592845522.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5046005900314515947.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5499538969592845522.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5499538969592845522.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1298926 steps, run timeout after 3001 ms. (steps per millisecond=432 ) properties seen :0 out of 2
Probabilistic random walk after 1298926 steps, saw 435122 distinct states, run finished after 3005 ms. (steps per millisecond=432 ) properties seen :0
[2025-06-01 10:49:32] [INFO ] Invariant cache hit.
[2025-06-01 10:49:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 10:49:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 81ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-01 10:49:32] [INFO ] Invariant cache hit.
[2025-06-01 10:49:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40416 steps (8 resets) in 11 ms. (3368 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4000955 steps, run timeout after 3001 ms. (steps per millisecond=1333 ) properties seen :0 out of 1
Probabilistic random walk after 4000955 steps, saw 1393482 distinct states, run finished after 3001 ms. (steps per millisecond=1333 ) properties seen :0
[2025-06-01 10:49:35] [INFO ] Invariant cache hit.
[2025-06-01 10:49:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 67ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:49:35] [INFO ] Invariant cache hit.
[2025-06-01 10:49:35] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-01 10:49:35] [INFO ] Invariant cache hit.
[2025-06-01 10:49:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:49:35] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2025-06-01 10:49:35] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:49:35] [INFO ] Invariant cache hit.
[2025-06-01 10:49:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 102ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 10:49:35] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:49:35] [INFO ] Applying decomposition
[2025-06-01 10:49:35] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8973689387194628411.txt' '-o' '/tmp/graph8973689387194628411.bin' '-w' '/tmp/graph8973689387194628411.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8973689387194628411.bin' '-l' '-1' '-v' '-w' '/tmp/graph8973689387194628411.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:49:35] [INFO ] Decomposing Gal with order
[2025-06-01 10:49:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:49:35] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:49:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:49:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4732224579780715845.gal : 1 ms
[2025-06-01 10:49:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8275772867647136707.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4732224579780715845.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8275772867647136707.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality8275772867647136707.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9466 after 20358
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.23653e+07 after 6.23653e+07
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[501] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-03 in 58498 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[500] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[500] Max Struct:[503]
// Phase 1: matrix 112 rows 70 cols
[2025-06-01 10:50:25] [INFO ] Computed 14 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[500] Max Struct:[503]
RANDOM walk for 10121 steps (2 resets) in 15 ms. (632 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[500] Max Struct:[503]
[2025-06-01 10:50:26] [INFO ] Invariant cache hit.
[2025-06-01 10:50:26] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:50:26] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:50:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:50:26] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:50:26] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:50:26] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:50:26] [INFO ] [Nat]Added 14 Read/Feed constraints in 67 ms returned sat
[2025-06-01 10:50:26] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:50:26] [INFO ] Added : 32 causal constraints over 7 iterations in 65 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[500] Max Struct:[503]
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 5 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.0 ms
Discarding 65 places :
Also discarding 104 output transitions
Drop transitions (Output transitions of discarded places.) removed 104 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /70 variables (removed 65) and now considering 8/112 (removed 104) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-01 10:50:27] [INFO ] Computed 1 invariants in 0 ms
[2025-06-01 10:50:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 92ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 5/70 places, 8/112 transitions.
[2025-06-01 10:50:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[500] Max Struct:[503]
RANDOM walk for 1000023 steps (2 resets) in 138 ms. (7194 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 154 ms. (6451 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[500] Max Struct:[503]
[2025-06-01 10:50:27] [INFO ] Invariant cache hit.
[2025-06-01 10:50:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 10:50:27] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:50:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:50:27] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:50:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:50:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:50:27] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-01 10:50:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-01 10:50:27] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:50:27] [INFO ] Added : 5 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[500] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:50:27] [INFO ] Invariant cache hit.
[2025-06-01 10:50:27] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-01 10:50:27] [INFO ] Invariant cache hit.
[2025-06-01 10:50:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:50:27] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2025-06-01 10:50:27] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:50:27] [INFO ] Invariant cache hit.
[2025-06-01 10:50:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 86ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-01 10:50:27] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:50:27] [INFO ] Flatten gal took : 2 ms
[2025-06-01 10:50:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9744607330410946221.gal : 0 ms
[2025-06-01 10:50:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5200581090255548931.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9744607330410946221.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5200581090255548931.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40100 steps (8 resets) in 13 ms. (2864 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality5200581090255548931.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1535325 steps, run timeout after 3001 ms. (steps per millisecond=511 ) properties seen :0 out of 2
Probabilistic random walk after 1535325 steps, saw 516628 distinct states, run finished after 3001 ms. (steps per millisecond=511 ) properties seen :0
[2025-06-01 10:50:30] [INFO ] Invariant cache hit.
[2025-06-01 10:50:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 10:50:30] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 61ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-01 10:50:30] [INFO ] Invariant cache hit.
[2025-06-01 10:50:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 81ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40173 steps (8 resets) in 11 ms. (3347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4309871 steps, run timeout after 3001 ms. (steps per millisecond=1436 ) properties seen :0 out of 1
Probabilistic random walk after 4309871 steps, saw 1499411 distinct states, run finished after 3001 ms. (steps per millisecond=1436 ) properties seen :0
[2025-06-01 10:50:33] [INFO ] Invariant cache hit.
[2025-06-01 10:50:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:50:34] [INFO ] Invariant cache hit.
[2025-06-01 10:50:34] [INFO ] Implicit Places using invariants in 14 ms returned []
[2025-06-01 10:50:34] [INFO ] Invariant cache hit.
[2025-06-01 10:50:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:50:34] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2025-06-01 10:50:34] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:50:34] [INFO ] Invariant cache hit.
[2025-06-01 10:50:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 83ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 84ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 10:50:34] [INFO ] Flatten gal took : 0 ms
[2025-06-01 10:50:34] [INFO ] Applying decomposition
[2025-06-01 10:50:34] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3512138781004759216.txt' '-o' '/tmp/graph3512138781004759216.bin' '-w' '/tmp/graph3512138781004759216.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3512138781004759216.bin' '-l' '-1' '-v' '-w' '/tmp/graph3512138781004759216.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:50:34] [INFO ] Decomposing Gal with order
[2025-06-01 10:50:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:50:34] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:50:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-01 10:50:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2612382458028423837.gal : 0 ms
[2025-06-01 10:50:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3945593041895827835.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2612382458028423837.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3945593041895827835.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality3945593041895827835.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :18384 after 19373
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :38107 after 84787
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :84787 after 162614
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :162614 after 181274
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :181274 after 286975
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :286975 after 306490
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :306490 after 455831
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :455831 after 639161
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.34608e+06 after 1.80801e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[500] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-07 in 58286 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[503]
// Phase 1: matrix 112 rows 70 cols
[2025-06-01 10:51:24] [INFO ] Computed 14 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[503]
RANDOM walk for 10152 steps (2 resets) in 11 ms. (846 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:[501] Max Struct:[503]
[2025-06-01 10:51:24] [INFO ] Invariant cache hit.
[2025-06-01 10:51:24] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:51:24] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:51:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:51:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:51:24] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:51:24] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:51:24] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:51:24] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:51:24] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2025-06-01 10:51:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2025-06-01 10:51:24] [INFO ] Added : 43 causal constraints over 10 iterations in 179 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 5 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.0 ms
Discarding 65 places :
Also discarding 104 output transitions
Drop transitions (Output transitions of discarded places.) removed 104 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /70 variables (removed 65) and now considering 8/112 (removed 104) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-01 10:51:25] [INFO ] Computed 1 invariants in 0 ms
[2025-06-01 10:51:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 110ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 5/70 places, 8/112 transitions.
[2025-06-01 10:51:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501] Max Struct:[503]
RANDOM walk for 1000180 steps (2 resets) in 131 ms. (7577 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 178 ms. (5586 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-01 10:51:26] [INFO ] Invariant cache hit.
[2025-06-01 10:51:26] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:51:26] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:51:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:51:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 10:51:26] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-01 10:51:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:51:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:51:26] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:51:26] [INFO ] Added : 6 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:51:26] [INFO ] Invariant cache hit.
[2025-06-01 10:51:26] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-01 10:51:26] [INFO ] Invariant cache hit.
[2025-06-01 10:51:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:51:26] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2025-06-01 10:51:26] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:51:26] [INFO ] Invariant cache hit.
[2025-06-01 10:51:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 83ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 83ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40426 steps (8 resets) in 12 ms. (3109 steps per ms) remains 2/2 properties
[2025-06-01 10:51:26] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:51:26] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:51:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12588970937805956576.gal : 5 ms
[2025-06-01 10:51:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5599087486224143352.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12588970937805956576.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5599087486224143352.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality5599087486224143352.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1834803 steps, run timeout after 3001 ms. (steps per millisecond=611 ) properties seen :0 out of 2
Probabilistic random walk after 1834803 steps, saw 625181 distinct states, run finished after 3001 ms. (steps per millisecond=611 ) properties seen :0
[2025-06-01 10:51:29] [INFO ] Invariant cache hit.
[2025-06-01 10:51:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 10:51:29] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 66ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-01 10:51:29] [INFO ] Invariant cache hit.
[2025-06-01 10:51:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 91ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40186 steps (8 resets) in 12 ms. (3091 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 15 ms. (2500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4410161 steps, run timeout after 3001 ms. (steps per millisecond=1469 ) properties seen :0 out of 1
Probabilistic random walk after 4410161 steps, saw 1534328 distinct states, run finished after 3001 ms. (steps per millisecond=1469 ) properties seen :0
[2025-06-01 10:51:32] [INFO ] Invariant cache hit.
[2025-06-01 10:51:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 66ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:51:32] [INFO ] Invariant cache hit.
[2025-06-01 10:51:32] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-01 10:51:32] [INFO ] Invariant cache hit.
[2025-06-01 10:51:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:51:32] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2025-06-01 10:51:32] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:51:32] [INFO ] Invariant cache hit.
[2025-06-01 10:51:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 10:51:32] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:51:32] [INFO ] Applying decomposition
[2025-06-01 10:51:32] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4711188677404598647.txt' '-o' '/tmp/graph4711188677404598647.bin' '-w' '/tmp/graph4711188677404598647.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4711188677404598647.bin' '-l' '-1' '-v' '-w' '/tmp/graph4711188677404598647.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:51:32] [INFO ] Decomposing Gal with order
[2025-06-01 10:51:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:51:32] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:51:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:51:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7993019766748809052.gal : 0 ms
[2025-06-01 10:51:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5542355546426211472.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7993019766748809052.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5542355546426211472.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5542355546426211472.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9469 after 18373
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :38107 after 97586
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :97586 after 102022
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :102022 after 172419
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :172419 after 183231
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :183231 after 286917
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :286917 after 456694
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :456694 after 642145
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.3641e+06 after 1.80766e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[501] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-08 in 58499 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-09
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:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[503]
// Phase 1: matrix 112 rows 70 cols
[2025-06-01 10:52:22] [INFO ] Computed 14 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[503]
RANDOM walk for 10172 steps (2 resets) in 7 ms. (1271 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[250] Max Struct:[503]
[2025-06-01 10:52:22] [INFO ] Invariant cache hit.
[2025-06-01 10:52:22] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:52:22] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:52:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:52:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:52:22] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:52:22] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:52:22] [INFO ] [Nat]Added 14 Read/Feed constraints in 63 ms returned sat
[2025-06-01 10:52:22] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:52:22] [INFO ] Added : 29 causal constraints over 8 iterations in 67 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[250] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 5 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.0 ms
Discarding 65 places :
Also discarding 104 output transitions
Drop transitions (Output transitions of discarded places.) removed 104 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /70 variables (removed 65) and now considering 8/112 (removed 104) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-01 10:52:24] [INFO ] Computed 1 invariants in 0 ms
[2025-06-01 10:52:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 99ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 100ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 5/70 places, 8/112 transitions.
[2025-06-01 10:52:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501] Max Struct:[503]
RANDOM walk for 1000015 steps (2 resets) in 163 ms. (6097 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 140 ms. (7092 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-01 10:52:24] [INFO ] Invariant cache hit.
[2025-06-01 10:52:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 10:52:24] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-01 10:52:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:52:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 10:52:24] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:52:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:52:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 10:52:24] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:52:24] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2025-06-01 10:52:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2025-06-01 10:52:24] [INFO ] Added : 5 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:52:24] [INFO ] Invariant cache hit.
[2025-06-01 10:52:24] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-01 10:52:24] [INFO ] Invariant cache hit.
[2025-06-01 10:52:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:52:24] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2025-06-01 10:52:24] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:52:24] [INFO ] Invariant cache hit.
[2025-06-01 10:52:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-01 10:52:24] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:52:24] [INFO ] Flatten gal took : 0 ms
[2025-06-01 10:52:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4917778099406586257.gal : 1 ms
[2025-06-01 10:52:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16316061989095590253.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4917778099406586257.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16316061989095590253.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :
RANDOM walk for 40239 steps (8 resets) in 12 ms. (3095 steps per ms) remains 2/2 properties

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16316061989095590253.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
BEST_FIRST walk for 40001 steps (8 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1266194 steps, run timeout after 3001 ms. (steps per millisecond=421 ) properties seen :0 out of 2
Probabilistic random walk after 1266194 steps, saw 434778 distinct states, run finished after 3001 ms. (steps per millisecond=421 ) properties seen :0
[2025-06-01 10:52:27] [INFO ] Invariant cache hit.
[2025-06-01 10:52:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 10:52:28] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 61ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-01 10:52:28] [INFO ] Invariant cache hit.
[2025-06-01 10:52:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40413 steps (8 resets) in 10 ms. (3673 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 12 ms. (3077 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4299704 steps, run timeout after 3001 ms. (steps per millisecond=1432 ) properties seen :0 out of 1
Probabilistic random walk after 4299704 steps, saw 1495996 distinct states, run finished after 3001 ms. (steps per millisecond=1432 ) properties seen :0
[2025-06-01 10:52:31] [INFO ] Invariant cache hit.
[2025-06-01 10:52:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 61ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:52:31] [INFO ] Invariant cache hit.
[2025-06-01 10:52:31] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-01 10:52:31] [INFO ] Invariant cache hit.
[2025-06-01 10:52:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:52:31] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2025-06-01 10:52:31] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:52:31] [INFO ] Invariant cache hit.
[2025-06-01 10:52:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 87ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 10:52:31] [INFO ] Flatten gal took : 0 ms
[2025-06-01 10:52:31] [INFO ] Applying decomposition
[2025-06-01 10:52:31] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2904195051675200858.txt' '-o' '/tmp/graph2904195051675200858.bin' '-w' '/tmp/graph2904195051675200858.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2904195051675200858.bin' '-l' '-1' '-v' '-w' '/tmp/graph2904195051675200858.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:52:31] [INFO ] Decomposing Gal with order
[2025-06-01 10:52:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:52:31] [INFO ] Flatten gal took : 2 ms
[2025-06-01 10:52:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:52:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6521746992776716052.gal : 3 ms
[2025-06-01 10:52:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14428231026436244553.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6521746992776716052.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14428231026436244553.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality14428231026436244553.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9469 after 18373
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :38113 after 96632
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :96632 after 100569
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :100569 after 170458
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :170458 after 182255
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :182255 after 286964
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :286964 after 456754
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :642217 after 943064
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.3642e+06 after 1.80778e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[501] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-09 in 58771 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[503]
// Phase 1: matrix 112 rows 70 cols
[2025-06-01 10:53:21] [INFO ] Computed 14 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[503]
RANDOM walk for 10442 steps (2 resets) in 9 ms. (1044 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[113] Max Struct:[503]
[2025-06-01 10:53:21] [INFO ] Invariant cache hit.
[2025-06-01 10:53:21] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:53:21] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:53:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:53:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:53:21] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:53:21] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:53:21] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:53:21] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:53:21] [INFO ] Added : 27 causal constraints over 6 iterations in 46 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[113] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 5 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.1 ms
Discarding 65 places :
Also discarding 104 output transitions
Drop transitions (Output transitions of discarded places.) removed 104 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /70 variables (removed 65) and now considering 8/112 (removed 104) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-01 10:53:22] [INFO ] Computed 1 invariants in 0 ms
[2025-06-01 10:53:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 5/70 places, 8/112 transitions.
[2025-06-01 10:53:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501] Max Struct:[503]
RANDOM walk for 1000008 steps (2 resets) in 118 ms. (8403 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 147 ms. (6756 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-01 10:53:23] [INFO ] Invariant cache hit.
[2025-06-01 10:53:23] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:53:23] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:53:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:53:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:53:23] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:53:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:53:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:53:23] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-01 10:53:23] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:53:23] [INFO ] Invariant cache hit.
[2025-06-01 10:53:23] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-01 10:53:23] [INFO ] Invariant cache hit.
[2025-06-01 10:53:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:53:23] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2025-06-01 10:53:23] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:53:23] [INFO ] Invariant cache hit.
[2025-06-01 10:53:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 89ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40219 steps (8 resets) in 14 ms. (2681 steps per ms) remains 2/2 properties
[2025-06-01 10:53:23] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:53:23] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:53:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9436224802989761850.gal : 0 ms
[2025-06-01 10:53:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17659517821653948436.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9436224802989761850.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17659517821653948436.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17659517821653948436.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
BEST_FIRST walk for 40004 steps (8 resets) in 19 ms. (2000 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1137278 steps, run timeout after 3024 ms. (steps per millisecond=376 ) properties seen :0 out of 2
Probabilistic random walk after 1137278 steps, saw 432285 distinct states, run finished after 3024 ms. (steps per millisecond=376 ) properties seen :0
[2025-06-01 10:53:26] [INFO ] Invariant cache hit.
[2025-06-01 10:53:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 10:53:26] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 76ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-01 10:53:26] [INFO ] Invariant cache hit.
[2025-06-01 10:53:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 87ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 87ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40557 steps (8 resets) in 11 ms. (3379 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 13 ms. (2857 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4277906 steps, run timeout after 3001 ms. (steps per millisecond=1425 ) properties seen :0 out of 1
Probabilistic random walk after 4277906 steps, saw 1488647 distinct states, run finished after 3002 ms. (steps per millisecond=1425 ) properties seen :0
[2025-06-01 10:53:29] [INFO ] Invariant cache hit.
[2025-06-01 10:53:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 58ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:53:29] [INFO ] Invariant cache hit.
[2025-06-01 10:53:29] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-01 10:53:29] [INFO ] Invariant cache hit.
[2025-06-01 10:53:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:53:29] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2025-06-01 10:53:29] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:53:29] [INFO ] Invariant cache hit.
[2025-06-01 10:53:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 94ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 10:53:29] [INFO ] Flatten gal took : 0 ms
[2025-06-01 10:53:29] [INFO ] Applying decomposition
[2025-06-01 10:53:29] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1632981146082277020.txt' '-o' '/tmp/graph1632981146082277020.bin' '-w' '/tmp/graph1632981146082277020.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1632981146082277020.bin' '-l' '-1' '-v' '-w' '/tmp/graph1632981146082277020.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:53:29] [INFO ] Decomposing Gal with order
[2025-06-01 10:53:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:53:29] [INFO ] Flatten gal took : 2 ms
[2025-06-01 10:53:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:53:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9530217069961641794.gal : 0 ms
[2025-06-01 10:53:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6309512317746768403.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9530217069961641794.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6309512317746768403.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality6309512317746768403.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9469 after 18373
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :38107 after 97562
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :97562 after 101993
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :101993 after 172419
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :172419 after 183249
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :183249 after 286917
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :286917 after 456694
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :456694 after 642145
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.3641e+06 after 1.80766e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[501] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-11 in 58409 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[500] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[500] Max Struct:[503]
// Phase 1: matrix 112 rows 70 cols
[2025-06-01 10:54:19] [INFO ] Computed 14 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[500] Max Struct:[503]
RANDOM walk for 10482 steps (2 resets) in 8 ms. (1164 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[500] Max Struct:[503]
[2025-06-01 10:54:19] [INFO ] Invariant cache hit.
[2025-06-01 10:54:19] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:54:20] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:54:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:54:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:54:20] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-01 10:54:20] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:54:20] [INFO ] [Nat]Added 14 Read/Feed constraints in 151 ms returned sat
[2025-06-01 10:54:20] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-01 10:54:20] [INFO ] Added : 41 causal constraints over 9 iterations in 74 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[500] Max Struct:[503]
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 5 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.1 ms
Discarding 65 places :
Also discarding 104 output transitions
Drop transitions (Output transitions of discarded places.) removed 104 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /70 variables (removed 65) and now considering 8/112 (removed 104) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-01 10:54:21] [INFO ] Computed 1 invariants in 0 ms
[2025-06-01 10:54:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 5/70 places, 8/112 transitions.
[2025-06-01 10:54:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[500] Max Struct:[503]
RANDOM walk for 1000053 steps (2 resets) in 171 ms. (5814 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 147 ms. (6756 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[500] Max Struct:[503]
[2025-06-01 10:54:21] [INFO ] Invariant cache hit.
[2025-06-01 10:54:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 10:54:21] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 10:54:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:54:21] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 10:54:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:54:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:54:21] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-01 10:54:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:54:21] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-01 10:54:21] [INFO ] Added : 5 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[500] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[500] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:54:21] [INFO ] Invariant cache hit.
[2025-06-01 10:54:21] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-01 10:54:21] [INFO ] Invariant cache hit.
[2025-06-01 10:54:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:54:21] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2025-06-01 10:54:21] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:54:21] [INFO ] Invariant cache hit.
[2025-06-01 10:54:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 92ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 92ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-01 10:54:21] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:54:21] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 40547 steps (8 resets) in 9 ms. (4054 steps per ms) remains 2/2 properties
[2025-06-01 10:54:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13953920501891654983.gal : 5 ms
[2025-06-01 10:54:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3610047632689858487.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13953920501891654983.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3610047632689858487.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3610047632689858487.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 15 ms. (2500 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1540813 steps, run timeout after 3001 ms. (steps per millisecond=513 ) properties seen :0 out of 2
Probabilistic random walk after 1540813 steps, saw 518513 distinct states, run finished after 3001 ms. (steps per millisecond=513 ) properties seen :0
[2025-06-01 10:54:24] [INFO ] Invariant cache hit.
[2025-06-01 10:54:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 10:54:24] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 85ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-01 10:54:24] [INFO ] Invariant cache hit.
[2025-06-01 10:54:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 95ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 95ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40559 steps (8 resets) in 8 ms. (4506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4689422 steps, run timeout after 3001 ms. (steps per millisecond=1562 ) properties seen :0 out of 1
Probabilistic random walk after 4689422 steps, saw 1630220 distinct states, run finished after 3001 ms. (steps per millisecond=1562 ) properties seen :0
[2025-06-01 10:54:28] [INFO ] Invariant cache hit.
[2025-06-01 10:54:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:54:28] [INFO ] Invariant cache hit.
[2025-06-01 10:54:28] [INFO ] Implicit Places using invariants in 12 ms returned []
[2025-06-01 10:54:28] [INFO ] Invariant cache hit.
[2025-06-01 10:54:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:54:28] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2025-06-01 10:54:28] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:54:28] [INFO ] Invariant cache hit.
[2025-06-01 10:54:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 78ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 78ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 10:54:28] [INFO ] Flatten gal took : 0 ms
[2025-06-01 10:54:28] [INFO ] Applying decomposition
[2025-06-01 10:54:28] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph200478745446573983.txt' '-o' '/tmp/graph200478745446573983.bin' '-w' '/tmp/graph200478745446573983.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph200478745446573983.bin' '-l' '-1' '-v' '-w' '/tmp/graph200478745446573983.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:54:28] [INFO ] Decomposing Gal with order
[2025-06-01 10:54:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:54:28] [INFO ] Flatten gal took : 0 ms
[2025-06-01 10:54:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:54:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12097946068994992275.gal : 0 ms
[2025-06-01 10:54:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14836035531734999861.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12097946068994992275.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14836035531734999861.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality14836035531734999861.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9469 after 18379
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :84808 after 85783
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :85783 after 160544
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :160544 after 177251
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :177251 after 281980
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :281980 after 302551
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :302551 after 453243
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :639162 after 659498
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.8051e+06 after 2.36318e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[500] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-12 in 58475 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[503]
// Phase 1: matrix 112 rows 70 cols
[2025-06-01 10:55:18] [INFO ] Computed 14 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[503]
RANDOM walk for 10237 steps (2 resets) in 8 ms. (1137 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-01 10:55:18] [INFO ] Invariant cache hit.
[2025-06-01 10:55:18] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:55:18] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:55:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:55:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:55:18] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:55:18] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:55:18] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:55:18] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:55:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2025-06-01 10:55:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2025-06-01 10:55:18] [INFO ] Added : 37 causal constraints over 8 iterations in 189 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 5 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.0 ms
Discarding 65 places :
Also discarding 104 output transitions
Drop transitions (Output transitions of discarded places.) removed 104 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /70 variables (removed 65) and now considering 8/112 (removed 104) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-01 10:55:19] [INFO ] Computed 1 invariants in 1 ms
[2025-06-01 10:55:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 100ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 5/70 places, 8/112 transitions.
[2025-06-01 10:55:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501] Max Struct:[503]
RANDOM walk for 1000001 steps (2 resets) in 167 ms. (5952 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 149 ms. (6666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-01 10:55:20] [INFO ] Invariant cache hit.
[2025-06-01 10:55:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 10:55:20] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:55:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:55:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:55:20] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-01 10:55:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:55:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 10:55:20] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:55:20] [INFO ] Added : 6 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:55:20] [INFO ] Invariant cache hit.
[2025-06-01 10:55:20] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-01 10:55:20] [INFO ] Invariant cache hit.
[2025-06-01 10:55:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:55:20] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2025-06-01 10:55:20] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:55:20] [INFO ] Invariant cache hit.
[2025-06-01 10:55:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-01 10:55:20] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 40145 steps (8 resets) in 13 ms. (2867 steps per ms) remains 2/2 properties
[2025-06-01 10:55:20] [INFO ] Flatten gal took : 0 ms
[2025-06-01 10:55:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13361858690733810158.gal : 0 ms
[2025-06-01 10:55:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15573829546409203441.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13361858690733810158.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15573829546409203441.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15573829546409203441.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1520010 steps, run timeout after 3001 ms. (steps per millisecond=506 ) properties seen :0 out of 2
Probabilistic random walk after 1520010 steps, saw 510935 distinct states, run finished after 3001 ms. (steps per millisecond=506 ) properties seen :0
[2025-06-01 10:55:23] [INFO ] Invariant cache hit.
[2025-06-01 10:55:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 10:55:23] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 67ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-01 10:55:23] [INFO ] Invariant cache hit.
[2025-06-01 10:55:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 97ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 97ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40204 steps (8 resets) in 13 ms. (2871 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 14 ms. (2666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4285107 steps, run timeout after 3001 ms. (steps per millisecond=1427 ) properties seen :0 out of 1
Probabilistic random walk after 4285107 steps, saw 1490979 distinct states, run finished after 3001 ms. (steps per millisecond=1427 ) properties seen :0
[2025-06-01 10:55:26] [INFO ] Invariant cache hit.
[2025-06-01 10:55:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 62ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:55:26] [INFO ] Invariant cache hit.
[2025-06-01 10:55:26] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-01 10:55:26] [INFO ] Invariant cache hit.
[2025-06-01 10:55:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:55:26] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2025-06-01 10:55:26] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:55:26] [INFO ] Invariant cache hit.
[2025-06-01 10:55:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 90ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 10:55:26] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:55:26] [INFO ] Applying decomposition
[2025-06-01 10:55:26] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3737431087910035093.txt' '-o' '/tmp/graph3737431087910035093.bin' '-w' '/tmp/graph3737431087910035093.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3737431087910035093.bin' '-l' '-1' '-v' '-w' '/tmp/graph3737431087910035093.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:55:26] [INFO ] Decomposing Gal with order
[2025-06-01 10:55:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:55:26] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:55:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:55:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2439863770726224457.gal : 0 ms
[2025-06-01 10:55:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6171245245080399874.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2439863770726224457.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6171245245080399874.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality6171245245080399874.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9469 after 18378
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :84808 after 85783
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :85783 after 160544
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :160544 after 177263
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :177263 after 177337
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :177337 after 281980
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :281980 after 453243
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :639162 after 890296
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.8051e+06 after 2.36318e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[501] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-13 in 58508 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[503]
// Phase 1: matrix 112 rows 70 cols
[2025-06-01 10:56:16] [INFO ] Computed 14 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[503]
RANDOM walk for 10041 steps (2 resets) in 15 ms. (627 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:[105] Max Struct:[503]
[2025-06-01 10:56:16] [INFO ] Invariant cache hit.
[2025-06-01 10:56:16] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:56:16] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:56:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:56:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:56:17] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:56:17] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:56:17] [INFO ] [Nat]Added 14 Read/Feed constraints in 22 ms returned sat
[2025-06-01 10:56:17] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:56:17] [INFO ] Added : 28 causal constraints over 7 iterations in 57 ms. Result :sat
Minimization took 111 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[105] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[502] Max Struct:[503]
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 5 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.0 ms
Discarding 65 places :
Also discarding 104 output transitions
Drop transitions (Output transitions of discarded places.) removed 104 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /70 variables (removed 65) and now considering 8/112 (removed 104) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-01 10:56:18] [INFO ] Computed 1 invariants in 1 ms
[2025-06-01 10:56:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 119ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 120ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 5/70 places, 8/112 transitions.
[2025-06-01 10:56:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[502] Max Struct:[503]
RANDOM walk for 1000023 steps (2 resets) in 130 ms. (7633 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 134 ms. (7407 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[502] Max Struct:[503]
[2025-06-01 10:56:18] [INFO ] Invariant cache hit.
[2025-06-01 10:56:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 10:56:18] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:56:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:56:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:56:18] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-01 10:56:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:56:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:56:18] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2025-06-01 10:56:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
Current structural bounds on expressions (after SMT) : Max Seen:[502] Max Struct:[502]
FORMULA JoinFreeModules-PT-0500-UpperBounds-14 502 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2025-06-01 10:56:18] [INFO ] Flatten gal took : 3 ms
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-01 10:56:18] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:56:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5400777725260618572.gal : 1 ms
[2025-06-01 10:56:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13230410265973940173.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5400777725260618572.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13230410265973940173.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13230410265973940173.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,8,0.001741,3512,2,15,5,61,6,0,45,39,0
Total reachable state count : 8

Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-14 in 1913 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[503]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[503]
// Phase 1: matrix 112 rows 70 cols
[2025-06-01 10:56:18] [INFO ] Computed 14 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[503]
RANDOM walk for 10132 steps (2 resets) in 10 ms. (921 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[250] Max Struct:[503]
[2025-06-01 10:56:18] [INFO ] Invariant cache hit.
[2025-06-01 10:56:18] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:56:18] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:56:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:56:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:56:18] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:56:18] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:56:18] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:56:18] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:56:19] [INFO ] Added : 35 causal constraints over 9 iterations in 113 ms. Result :sat
Minimization took 111 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[250] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 5 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.1 ms
Discarding 65 places :
Also discarding 104 output transitions
Drop transitions (Output transitions of discarded places.) removed 104 transitions
Applied a total of 1 rules in 3 ms. Remains 5 /70 variables (removed 65) and now considering 8/112 (removed 104) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-01 10:56:20] [INFO ] Computed 1 invariants in 0 ms
[2025-06-01 10:56:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 98ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 99ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 5/70 places, 8/112 transitions.
[2025-06-01 10:56:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[501] Max Struct:[503]
RANDOM walk for 1000074 steps (2 resets) in 113 ms. (8772 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 148 ms. (6711 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[501] Max Struct:[503]
[2025-06-01 10:56:20] [INFO ] Invariant cache hit.
[2025-06-01 10:56:20] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:56:20] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:56:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:56:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:56:20] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:56:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:56:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 10:56:20] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-01 10:56:20] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2025-06-01 10:56:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2025-06-01 10:56:20] [INFO ] Added : 5 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[501] Max Struct:[503]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[501] Max Struct:[503]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:56:20] [INFO ] Invariant cache hit.
[2025-06-01 10:56:20] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-01 10:56:20] [INFO ] Invariant cache hit.
[2025-06-01 10:56:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:56:20] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2025-06-01 10:56:20] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:56:20] [INFO ] Invariant cache hit.
[2025-06-01 10:56:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-01 10:56:21] [INFO ] Flatten gal took : 0 ms
RANDOM walk for 40155 steps (8 resets) in 29 ms. (1338 steps per ms) remains 2/2 properties
[2025-06-01 10:56:21] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:56:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17928552698566108889.gal : 1 ms
[2025-06-01 10:56:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3832577846705570570.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17928552698566108889.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3832577846705570570.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3832577846705570570.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40003 steps (8 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1346579 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :0 out of 2
Probabilistic random walk after 1346579 steps, saw 448117 distinct states, run finished after 3001 ms. (steps per millisecond=448 ) properties seen :0
[2025-06-01 10:56:24] [INFO ] Invariant cache hit.
[2025-06-01 10:56:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 10:56:24] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 60ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-01 10:56:24] [INFO ] Invariant cache hit.
[2025-06-01 10:56:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 82ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40113 steps (8 resets) in 11 ms. (3342 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4147934 steps, run timeout after 3001 ms. (steps per millisecond=1382 ) properties seen :0 out of 1
Probabilistic random walk after 4147934 steps, saw 1444613 distinct states, run finished after 3001 ms. (steps per millisecond=1382 ) properties seen :0
[2025-06-01 10:56:27] [INFO ] Invariant cache hit.
[2025-06-01 10:56:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 54ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:56:27] [INFO ] Invariant cache hit.
[2025-06-01 10:56:27] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-01 10:56:27] [INFO ] Invariant cache hit.
[2025-06-01 10:56:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:56:27] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2025-06-01 10:56:27] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:56:27] [INFO ] Invariant cache hit.
[2025-06-01 10:56:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 78ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 78ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 10:56:27] [INFO ] Flatten gal took : 2 ms
[2025-06-01 10:56:27] [INFO ] Applying decomposition
[2025-06-01 10:56:27] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14738310771396675080.txt' '-o' '/tmp/graph14738310771396675080.bin' '-w' '/tmp/graph14738310771396675080.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14738310771396675080.bin' '-l' '-1' '-v' '-w' '/tmp/graph14738310771396675080.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:56:27] [INFO ] Decomposing Gal with order
[2025-06-01 10:56:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:56:27] [INFO ] Flatten gal took : 2 ms
[2025-06-01 10:56:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:56:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6323422982231978863.gal : 1 ms
[2025-06-01 10:56:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12318030834946978991.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6323422982231978863.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12318030834946978991.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality12318030834946978991.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9466 after 22831
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5.70182e+07 after 6.23591e+07
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[501] Max Struct:[503]
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-15 in 58726 ms.
[2025-06-01 10:57:17] [INFO ] Flatten gal took : 9 ms
[2025-06-01 10:57:17] [INFO ] Applying decomposition
[2025-06-01 10:57:17] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2992722899107616022.txt' '-o' '/tmp/graph2992722899107616022.bin' '-w' '/tmp/graph2992722899107616022.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2992722899107616022.bin' '-l' '-1' '-v' '-w' '/tmp/graph2992722899107616022.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:57:17] [INFO ] Decomposing Gal with order
[2025-06-01 10:57:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:57:17] [INFO ] Flatten gal took : 4 ms
[2025-06-01 10:57:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:57:17] [INFO ] Time to serialize gal into /tmp/UpperBounds17717882775654056535.gal : 1 ms
[2025-06-01 10:57:17] [INFO ] Time to serialize properties into /tmp/UpperBounds2239417290878090958.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17717882775654056535.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2239417290878090958.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds2239417290878090958.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.21714e+132,122.058,1138688,16,3519,46,2.01088e+06,63,0,70,2.38547e+06,0
Total reachable state count : 1.21713867250855098517187710340592781024e+132

Verifying 11 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 502
Bounds property JoinFreeModules-PT-0500-UpperBounds-00 :0 <= u3.p734 <= 502
FORMULA JoinFreeModules-PT-0500-UpperBounds-00 502 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-00,0,122.18,1138688,1,0,86,2.01088e+06,147,15,585,2.38547e+06,177
Min sum of variable value : 0
Maximum sum along a path : 501
Bounds property JoinFreeModules-PT-0500-UpperBounds-01 :0 <= u7.p1797 <= 501
FORMULA JoinFreeModules-PT-0500-UpperBounds-01 501 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-01,0,124.424,1138688,1,0,96,2.01088e+06,176,15,1097,2.38547e+06,202
Min sum of variable value : 0
Maximum sum along a path : 501
Bounds property JoinFreeModules-PT-0500-UpperBounds-02 :0 <= u1.p337 <= 501
FORMULA JoinFreeModules-PT-0500-UpperBounds-02 501 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-02,0,124.424,1138688,1,0,110,2.01088e+06,197,15,1097,2.38547e+06,229
Min sum of variable value : 0
Maximum sum along a path : 501
Bounds property JoinFreeModules-PT-0500-UpperBounds-03 :0 <= u4.p1212 <= 501
FORMULA JoinFreeModules-PT-0500-UpperBounds-03 501 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-03,0,124.424,1138688,1,0,121,2.01088e+06,217,15,1097,2.38547e+06,250
Min sum of variable value : 0
Maximum sum along a path : 500
Bounds property JoinFreeModules-PT-0500-UpperBounds-07 :0 <= u8.p2043 <= 500
FORMULA JoinFreeModules-PT-0500-UpperBounds-07 500 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-07,0,125.465,1138688,1,0,129,2.01088e+06,243,15,1605,2.38547e+06,266
Min sum of variable value : 0
Maximum sum along a path : 501
Bounds property JoinFreeModules-PT-0500-UpperBounds-08 :0 <= u6.p1727 <= 501
FORMULA JoinFreeModules-PT-0500-UpperBounds-08 501 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-08,0,125.465,1138688,1,0,138,2.01088e+06,265,15,1605,2.38547e+06,283
Min sum of variable value : 0
Maximum sum along a path : 502
Bounds property JoinFreeModules-PT-0500-UpperBounds-09 :0 <= u12.p2359 <= 502
FORMULA JoinFreeModules-PT-0500-UpperBounds-09 502 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-09,0,125.465,1138688,1,0,141,2.01088e+06,297,15,1605,2.38547e+06,296
Min sum of variable value : 0
Maximum sum along a path : 501
Bounds property JoinFreeModules-PT-0500-UpperBounds-11 :0 <= u0.p202 <= 501
FORMULA JoinFreeModules-PT-0500-UpperBounds-11 501 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-11,0,125.465,1138688,1,0,155,2.01088e+06,314,15,1605,2.38547e+06,323
Min sum of variable value : 0
Maximum sum along a path : 500
Bounds property JoinFreeModules-PT-0500-UpperBounds-12 :0 <= u2.p478 <= 500
FORMULA JoinFreeModules-PT-0500-UpperBounds-12 500 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-12,0,125.466,1138688,1,0,168,2.01088e+06,332,15,1605,2.38547e+06,348
Min sum of variable value : 0
Maximum sum along a path : 501
Bounds property JoinFreeModules-PT-0500-UpperBounds-13 :0 <= u13.p2377 <= 501
FORMULA JoinFreeModules-PT-0500-UpperBounds-13 501 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-13,0,125.466,1138688,1,0,170,2.01088e+06,360,15,1605,2.38547e+06,353
Min sum of variable value : 0
Maximum sum along a path : 502
Bounds property JoinFreeModules-PT-0500-UpperBounds-15 :0 <= u9.p2094 <= 502
FORMULA JoinFreeModules-PT-0500-UpperBounds-15 502 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-15,0,125.466,1138688,1,0,176,2.01088e+06,385,15,1605,2.38547e+06,364
Total runtime 1123725 ms.

BK_STOP 1748775563275

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="JoinFreeModules-PT-0500"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is JoinFreeModules-PT-0500, 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 r125-tall-174876435800058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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