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-174876435800059.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-1000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r125-tall-174876435800059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K 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 3.1M 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-1000-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748774660214

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-1000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 10:44:21] [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:44:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 10:44:21] [INFO ] Load time of PNML (sax parser for PT used): 300 ms
[2025-06-01 10:44:21] [INFO ] Transformed 5001 places.
[2025-06-01 10:44:21] [INFO ] Transformed 8001 transitions.
[2025-06-01 10:44:21] [INFO ] Parsed PT model containing 5001 places and 8001 transitions and 23002 arcs in 430 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 1000, 0, 1000, 2, 1, 0, 0, 2, 1, 1000, 0, 2, 2, 1000] 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, 0, 1000, 0, 1000, 2, 1, 0, 0, 2, 1, 1000, 0, 2, 2, 1000] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 8001 rows 5000 cols
[2025-06-01 10:44:22] [INFO ] Computed 1000 invariants in 88 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1000, 0, 1000, 2, 1, 0, 0, 2, 1, 1000, 0, 2, 2, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 10016 steps (2 resets) in 472 ms. (21 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 7612 ms. (21 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 1000, 2, 1000, 2, 3, 2, 2, 2, 3, 1000, 2, 2, 2, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
[2025-06-01 10:44:30] [INFO ] Invariant cache hit.
[2025-06-01 10:44:31] [INFO ] [Real]Absence check using 1000 positive place invariants in 256 ms returned sat
[2025-06-01 10:44:33] [INFO ] [Real]Absence check using state equation in 2797 ms returned sat
[2025-06-01 10:44:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:35] [INFO ] [Nat]Absence check using 1000 positive place invariants in 250 ms returned sat
[2025-06-01 10:44:39] [INFO ] [Nat]Absence check using state equation in 4261 ms returned unknown
[2025-06-01 10:44:40] [INFO ] [Real]Absence check using 1000 positive place invariants in 242 ms returned sat
[2025-06-01 10:44:42] [INFO ] [Real]Absence check using state equation in 2777 ms returned sat
[2025-06-01 10:44:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:43] [INFO ] [Nat]Absence check using 1000 positive place invariants in 244 ms returned sat
[2025-06-01 10:44:48] [INFO ] [Nat]Absence check using state equation in 4297 ms returned unknown
[2025-06-01 10:44:48] [INFO ] [Real]Absence check using 1000 positive place invariants in 246 ms returned sat
[2025-06-01 10:44:51] [INFO ] [Real]Absence check using state equation in 2794 ms returned sat
[2025-06-01 10:44:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:52] [INFO ] [Nat]Absence check using 1000 positive place invariants in 243 ms returned sat
[2025-06-01 10:44:57] [INFO ] [Nat]Absence check using state equation in 4304 ms returned unknown
[2025-06-01 10:44:57] [INFO ] [Real]Absence check using 1000 positive place invariants in 244 ms returned sat
[2025-06-01 10:45:00] [INFO ] [Real]Absence check using state equation in 2848 ms returned sat
[2025-06-01 10:45:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:01] [INFO ] [Nat]Absence check using 1000 positive place invariants in 244 ms returned sat
[2025-06-01 10:45:06] [INFO ] [Nat]Absence check using state equation in 4335 ms returned unknown
[2025-06-01 10:45:06] [INFO ] [Real]Absence check using 1000 positive place invariants in 243 ms returned sat
[2025-06-01 10:45:09] [INFO ] [Real]Absence check using state equation in 2794 ms returned sat
[2025-06-01 10:45:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:10] [INFO ] [Nat]Absence check using 1000 positive place invariants in 243 ms returned sat
[2025-06-01 10:45:14] [INFO ] [Nat]Absence check using state equation in 4308 ms returned unknown
[2025-06-01 10:45:15] [INFO ] [Real]Absence check using 1000 positive place invariants in 243 ms returned sat
[2025-06-01 10:45:18] [INFO ] [Real]Absence check using state equation in 2834 ms returned sat
[2025-06-01 10:45:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:19] [INFO ] [Nat]Absence check using 1000 positive place invariants in 252 ms returned sat
[2025-06-01 10:45:23] [INFO ] [Nat]Absence check using state equation in 4264 ms returned unknown
[2025-06-01 10:45:24] [INFO ] [Real]Absence check using 1000 positive place invariants in 245 ms returned sat
[2025-06-01 10:45:27] [INFO ] [Real]Absence check using state equation in 2695 ms returned sat
[2025-06-01 10:45:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:28] [INFO ] [Nat]Absence check using 1000 positive place invariants in 251 ms returned sat
[2025-06-01 10:45:32] [INFO ] [Nat]Absence check using state equation in 4276 ms returned unknown
[2025-06-01 10:45:33] [INFO ] [Real]Absence check using 1000 positive place invariants in 237 ms returned sat
[2025-06-01 10:45:36] [INFO ] [Real]Absence check using state equation in 2782 ms returned sat
[2025-06-01 10:45:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:37] [INFO ] [Nat]Absence check using 1000 positive place invariants in 250 ms returned sat
[2025-06-01 10:45:41] [INFO ] [Nat]Absence check using state equation in 4272 ms returned unknown
[2025-06-01 10:45:42] [INFO ] [Real]Absence check using 1000 positive place invariants in 243 ms returned sat
[2025-06-01 10:45:44] [INFO ] [Real]Absence check using state equation in 2770 ms returned sat
[2025-06-01 10:45:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:45] [INFO ] [Nat]Absence check using 1000 positive place invariants in 247 ms returned sat
[2025-06-01 10:45:50] [INFO ] [Nat]Absence check using state equation in 4280 ms returned unknown
[2025-06-01 10:45:50] [INFO ] [Real]Absence check using 1000 positive place invariants in 243 ms returned sat
[2025-06-01 10:45:53] [INFO ] [Real]Absence check using state equation in 2810 ms returned sat
[2025-06-01 10:45:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:54] [INFO ] [Nat]Absence check using 1000 positive place invariants in 247 ms returned sat
[2025-06-01 10:45:57] [INFO ] [Nat]Absence check using state equation in 2710 ms returned sat
[2025-06-01 10:45:57] [INFO ] State equation strengthened by 1000 read => feed constraints.
[2025-06-01 10:45:58] [INFO ] [Nat]Added 1000 Read/Feed constraints in 489 ms returned sat
[2025-06-01 10:45:59] [INFO ] Deduced a trap composed of 3 places in 1197 ms of which 98 ms to minimize.
[2025-06-01 10:45: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 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:46:00] [INFO ] [Real]Absence check using 1000 positive place invariants in 279 ms returned sat
[2025-06-01 10:46:03] [INFO ] [Real]Absence check using state equation in 2953 ms returned sat
[2025-06-01 10:46:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:46:04] [INFO ] [Nat]Absence check using 1000 positive place invariants in 228 ms returned sat
[2025-06-01 10:46:08] [INFO ] [Nat]Absence check using state equation in 4397 ms returned unknown
[2025-06-01 10:46:09] [INFO ] [Real]Absence check using 1000 positive place invariants in 233 ms returned sat
[2025-06-01 10:46:12] [INFO ] [Real]Absence check using state equation in 2817 ms returned sat
[2025-06-01 10:46:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:46:13] [INFO ] [Nat]Absence check using 1000 positive place invariants in 249 ms returned sat
[2025-06-01 10:46:17] [INFO ] [Nat]Absence check using state equation in 4267 ms returned unknown
[2025-06-01 10:46:18] [INFO ] [Real]Absence check using 1000 positive place invariants in 228 ms returned sat
[2025-06-01 10:46:21] [INFO ] [Real]Absence check using state equation in 2716 ms returned sat
[2025-06-01 10:46:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:46:22] [INFO ] [Nat]Absence check using 1000 positive place invariants in 249 ms returned sat
[2025-06-01 10:46:26] [INFO ] [Nat]Absence check using state equation in 4276 ms returned unknown
[2025-06-01 10:46:27] [INFO ] [Real]Absence check using 1000 positive place invariants in 237 ms returned sat
[2025-06-01 10:46:29] [INFO ] [Real]Absence check using state equation in 2724 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 1000 positive place invariants in 246 ms returned sat
[2025-06-01 10:46:35] [INFO ] [Nat]Absence check using state equation in 4313 ms returned unknown
[2025-06-01 10:46:35] [INFO ] [Real]Absence check using 1000 positive place invariants in 230 ms returned sat
[2025-06-01 10:46:38] [INFO ] [Real]Absence check using state equation in 2642 ms returned sat
[2025-06-01 10:46:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:46:39] [INFO ] [Nat]Absence check using 1000 positive place invariants in 246 ms returned sat
[2025-06-01 10:46:43] [INFO ] [Nat]Absence check using state equation in 4303 ms returned unknown
[2025-06-01 10:46:44] [INFO ] [Real]Absence check using 1000 positive place invariants in 245 ms returned sat
[2025-06-01 10:46:47] [INFO ] [Real]Absence check using state equation in 2729 ms returned sat
[2025-06-01 10:46:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:46:48] [INFO ] [Nat]Absence check using 1000 positive place invariants in 249 ms returned sat
[2025-06-01 10:46:52] [INFO ] [Nat]Absence check using state equation in 4326 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 1000, 2, 1000, 2, 3, 2, 2, 2, 3, 1000, 2, 2, 2, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 1000, 2, 1000, 2, 3, 2, 2, 2, 3, 1000, 2, 2, 2, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Support contains 16 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 80 are kept as prefixes of interest. Removing 4920 places using SCC suffix rule.13 ms
Discarding 4920 places :
Also discarding 7872 output transitions
Drop transitions (Output transitions of discarded places.) removed 7872 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 60 ms. Remains 80 /5000 variables (removed 4920) and now considering 128/8001 (removed 7873) transitions.
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 128 rows 80 cols
[2025-06-01 10:46:52] [INFO ] Computed 16 invariants in 1 ms
[2025-06-01 10:46:52] [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 1820 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
[2025-06-01 10:46:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2025-06-01 10:46:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 210 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4405 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: 2/2 constraints]
After SMT, in 6268ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 6277ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6359 ms. Remains : 80/5000 places, 128/8001 transitions.
[2025-06-01 10:46:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 1000, 2, 1000, 2, 3, 2, 2, 2, 3, 1000, 2, 2, 2, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 1000178 steps (2 resets) in 1076 ms. (928 steps per ms)
BEST_FIRST walk for 16000016 steps (32 resets) in 21083 ms. (758 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000, 947, 1000, 1001, 1000, 920, 1001, 1000, 967, 927, 1001, 1000, 967, 974, 998, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
[2025-06-01 10:47:21] [INFO ] Invariant cache hit.
[2025-06-01 10:47:21] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:47:21] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:47:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:47:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:47:21] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2025-06-01 10:47:21] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-01 10:47:21] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:47:21] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-01 10:47:21] [INFO ] Added : 50 causal constraints over 10 iterations in 133 ms. Result :sat
Minimization took 42 ms.
[2025-06-01 10:47:21] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:47:21] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:47:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:47:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:47:21] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:47:21] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:47:21] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:47:21] [INFO ] Added : 68 causal constraints over 17 iterations in 207 ms. Result :sat
Minimization took 82 ms.
[2025-06-01 10:47:21] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:47:21] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:47:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:47:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:47:22] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2025-06-01 10:47:22] [INFO ] [Nat]Added 16 Read/Feed constraints in 43 ms returned sat
[2025-06-01 10:47:22] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:47:22] [INFO ] Added : 69 causal constraints over 15 iterations in 124 ms. Result :sat
Minimization took 37 ms.
[2025-06-01 10:47:22] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:47:22] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:47:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:47:22] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:47:22] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2025-06-01 10:47:22] [INFO ] [Nat]Added 16 Read/Feed constraints in 26 ms returned sat
[2025-06-01 10:47:22] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-01 10:47:22] [INFO ] Added : 37 causal constraints over 9 iterations in 80 ms. Result :sat
Minimization took 40 ms.
[2025-06-01 10:47:22] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:47:22] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:47:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:47:22] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:47:22] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2025-06-01 10:47:22] [INFO ] [Nat]Added 16 Read/Feed constraints in 47 ms returned sat
[2025-06-01 10:47:22] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:47:22] [INFO ] Added : 34 causal constraints over 8 iterations in 115 ms. Result :sat
Minimization took 29 ms.
[2025-06-01 10:47:23] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:47:23] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-06-01 10:47:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:47:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:47:23] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:47:23] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:47:23] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:47:23] [INFO ] Added : 60 causal constraints over 14 iterations in 193 ms. Result :sat
Minimization took 58 ms.
[2025-06-01 10:47:23] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:47:23] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:47:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:47:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:47:23] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:47:23] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:47:23] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:47:23] [INFO ] Added : 54 causal constraints over 11 iterations in 155 ms. Result :sat
Minimization took 33 ms.
[2025-06-01 10:47:23] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:47:23] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:47:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:47:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:47:23] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2025-06-01 10:47:23] [INFO ] [Nat]Added 16 Read/Feed constraints in 7 ms returned sat
[2025-06-01 10:47:23] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-01 10:47:24] [INFO ] Added : 30 causal constraints over 6 iterations in 70 ms. Result :sat
Minimization took 25 ms.
[2025-06-01 10:47:24] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:47:24] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-01 10:47:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:47:24] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:47:24] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:47:24] [INFO ] [Nat]Added 16 Read/Feed constraints in 28 ms returned sat
[2025-06-01 10:47:24] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:47:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2025-06-01 10:47:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2025-06-01 10:47:24] [INFO ] Added : 56 causal constraints over 12 iterations in 208 ms. Result :sat
Minimization took 67 ms.
[2025-06-01 10:47:24] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:47:24] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:47:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:47:24] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:47:24] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:47:24] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2025-06-01 10:47:24] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:47:24] [INFO ] Added : 56 causal constraints over 12 iterations in 124 ms. Result :sat
Minimization took 88 ms.
[2025-06-01 10:47:24] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:47:24] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:47:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:47:24] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:47:24] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:47:24] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2025-06-01 10:47:24] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:47:25] [INFO ] Added : 66 causal constraints over 14 iterations in 183 ms. Result :sat
Minimization took 36 ms.
[2025-06-01 10:47:25] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:47:25] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:47:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:47:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:47:25] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:47:25] [INFO ] [Nat]Added 16 Read/Feed constraints in 60 ms returned sat
[2025-06-01 10:47:25] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:47:25] [INFO ] Added : 49 causal constraints over 11 iterations in 119 ms. Result :sat
Minimization took 30 ms.
[2025-06-01 10:47:25] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:47:25] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:47:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:47:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:47:25] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-06-01 10:47:25] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2025-06-01 10:47:25] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:47:25] [INFO ] Added : 63 causal constraints over 13 iterations in 119 ms. Result :sat
Minimization took 351 ms.
[2025-06-01 10:47:26] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:47:26] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:47:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:47:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:47:26] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-01 10:47:26] [INFO ] [Nat]Added 16 Read/Feed constraints in 6 ms returned sat
[2025-06-01 10:47:26] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:47:26] [INFO ] Added : 59 causal constraints over 12 iterations in 194 ms. Result :sat
Minimization took 66 ms.
[2025-06-01 10:47:26] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2025-06-01 10:47:26] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:47:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:47:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:47:26] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:47:26] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2025-06-01 10:47:26] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:47:26] [INFO ] Added : 74 causal constraints over 15 iterations in 197 ms. Result :sat
Minimization took 43 ms.
[2025-06-01 10:47:26] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:47:26] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:47:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:47:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:47:27] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:47:27] [INFO ] [Nat]Added 16 Read/Feed constraints in 43 ms returned sat
[2025-06-01 10:47:27] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-01 10:47:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2025-06-01 10:47:27] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2025-06-01 10:47:27] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2025-06-01 10:47:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 107 ms
[2025-06-01 10:47:27] [INFO ] Added : 62 causal constraints over 14 iterations in 254 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000, 947, 1000, 1001, 1000, 920, 1001, 1000, 967, 927, 1001, 1000, 967, 974, 998, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1001, 1001, 1000, 1001, 1000, 1002, 1001, 1000, 1001, 1002, 1001, 1000, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Support contains 16 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 13 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 80/80 places, 128/128 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-06-01 10:48:21] [INFO ] Invariant cache hit.
[2025-06-01 10:48:21] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-01 10:48:21] [INFO ] Invariant cache hit.
[2025-06-01 10:48:22] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-01 10:48:22] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2025-06-01 10:48:22] [INFO ] Redundant transitions in 3 ms returned []
Running 96 sub problems to find dead transitions.
[2025-06-01 10:48:22] [INFO ] Invariant cache hit.
[2025-06-01 10:48:22] [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 1694 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 2127 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 3853ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 3856ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3961 ms. Remains : 80/80 places, 128/128 transitions.
[2025-06-01 10:48:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1001, 1001, 1000, 1001, 1000, 1002, 1001, 1000, 1001, 1002, 1001, 1000, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 1000249 steps (2 resets) in 1096 ms. (911 steps per ms)
BEST_FIRST walk for 16000016 steps (32 resets) in 20780 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1002, 1001, 1000, 1001, 1000, 1002, 1001, 1000, 1001, 1002, 1001, 1000, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
[2025-06-01 10:48:47] [INFO ] Invariant cache hit.
[2025-06-01 10:48:47] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:48:47] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:48:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:48:47] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:48:47] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2025-06-01 10:48:47] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-01 10:48:47] [INFO ] [Nat]Added 16 Read/Feed constraints in 21 ms returned sat
[2025-06-01 10:48:47] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-01 10:48:48] [INFO ] Added : 33 causal constraints over 8 iterations in 91 ms. Result :sat
Minimization took 20 ms.
[2025-06-01 10:48:48] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:48:48] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:48:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:48:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:48:48] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-06-01 10:48:48] [INFO ] [Nat]Added 16 Read/Feed constraints in 38 ms returned sat
[2025-06-01 10:48:48] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:48:48] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2025-06-01 10:48:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2025-06-01 10:48:48] [INFO ] Added : 68 causal constraints over 15 iterations in 198 ms. Result :sat
Minimization took 36 ms.
[2025-06-01 10:48:48] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:48:48] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:48:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:48:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:48:48] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-06-01 10:48:48] [INFO ] [Nat]Added 16 Read/Feed constraints in 43 ms returned sat
[2025-06-01 10:48:48] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:48:48] [INFO ] Added : 69 causal constraints over 15 iterations in 124 ms. Result :sat
Minimization took 34 ms.
[2025-06-01 10:48:48] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:48:48] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:48:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:48:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:48:48] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2025-06-01 10:48:49] [INFO ] [Nat]Added 16 Read/Feed constraints in 25 ms returned sat
[2025-06-01 10:48:49] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:48:49] [INFO ] Added : 37 causal constraints over 9 iterations in 76 ms. Result :sat
Minimization took 27 ms.
[2025-06-01 10:48:49] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:48:49] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:48:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:48:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:48:49] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2025-06-01 10:48:49] [INFO ] [Nat]Added 16 Read/Feed constraints in 47 ms returned sat
[2025-06-01 10:48:49] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-01 10:48:49] [INFO ] Added : 34 causal constraints over 8 iterations in 97 ms. Result :sat
Minimization took 27 ms.
[2025-06-01 10:48:49] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:48:49] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:48:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:48:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:48:49] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2025-06-01 10:48:49] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2025-06-01 10:48:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2025-06-01 10:48:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2025-06-01 10:48:49] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:48:49] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:48:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:48:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:48:49] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:48:49] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2025-06-01 10:48:49] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:48:49] [INFO ] Added : 54 causal constraints over 11 iterations in 154 ms. Result :sat
Minimization took 33 ms.
[2025-06-01 10:48:50] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:48:50] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:48:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:48:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:48:50] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2025-06-01 10:48:50] [INFO ] [Nat]Added 16 Read/Feed constraints in 6 ms returned sat
[2025-06-01 10:48:50] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:48:50] [INFO ] Added : 30 causal constraints over 6 iterations in 55 ms. Result :sat
Minimization took 24 ms.
[2025-06-01 10:48:50] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:48:50] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:48:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:48:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:48:50] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-06-01 10:48:50] [INFO ] [Nat]Added 16 Read/Feed constraints in 23 ms returned sat
[2025-06-01 10:48:50] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:48:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2025-06-01 10:48:50] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2025-06-01 10:48:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2025-06-01 10:48:50] [INFO ] Added : 72 causal constraints over 16 iterations in 202 ms. Result :sat
Minimization took 38 ms.
[2025-06-01 10:48:50] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:48:50] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:48:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:48:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:48:50] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:48:50] [INFO ] [Nat]Added 16 Read/Feed constraints in 61 ms returned sat
[2025-06-01 10:48:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2025-06-01 10:48:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2025-06-01 10:48:50] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:48:50] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:48:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:48:51] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:48:51] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-01 10:48:51] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:48:51] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:48:51] [INFO ] Added : 66 causal constraints over 14 iterations in 176 ms. Result :sat
Minimization took 42 ms.
[2025-06-01 10:48:51] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:48:51] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-01 10:48:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:48:51] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:48:51] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:48:51] [INFO ] [Nat]Added 16 Read/Feed constraints in 59 ms returned sat
[2025-06-01 10:48:51] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-01 10:48:51] [INFO ] Added : 49 causal constraints over 11 iterations in 123 ms. Result :sat
Minimization took 33 ms.
[2025-06-01 10:48:51] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:48:51] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-01 10:48:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:48:51] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:48:51] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2025-06-01 10:48:51] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2025-06-01 10:48:51] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:48:51] [INFO ] Added : 52 causal constraints over 11 iterations in 130 ms. Result :sat
Minimization took 39 ms.
[2025-06-01 10:48:52] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:48:52] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:48:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:48:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:48:52] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:48:52] [INFO ] [Nat]Added 16 Read/Feed constraints in 39 ms returned sat
[2025-06-01 10:48:52] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-01 10:48:52] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2025-06-01 10:48:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
Minimization took 20 ms.
[2025-06-01 10:48:52] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:48:52] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:48:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:48:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:48:52] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:48:52] [INFO ] [Nat]Added 16 Read/Feed constraints in 39 ms returned sat
[2025-06-01 10:48:52] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:48:52] [INFO ] Added : 70 causal constraints over 15 iterations in 133 ms. Result :sat
Minimization took 26 ms.
[2025-06-01 10:48:52] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:48:52] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:48:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:48:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:48:52] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-01 10:48:52] [INFO ] [Nat]Added 16 Read/Feed constraints in 43 ms returned sat
[2025-06-01 10:48:52] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:48:53] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2025-06-01 10:48:53] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2025-06-01 10:48:53] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2025-06-01 10:48:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 107 ms
[2025-06-01 10:48:53] [INFO ] Added : 62 causal constraints over 14 iterations in 259 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1002, 1001, 1000, 1001, 1000, 1002, 1001, 1000, 1001, 1002, 1001, 1000, 1001, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1002, 1003, 1003, 1003, 1002, 1003, 1003, 1003, 1002, 1003, 1003]
FORMULA JoinFreeModules-PT-1000-UpperBounds-13 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-1000-UpperBounds-09 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-1000-UpperBounds-05 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1002, 1002, 1000, 1001, 1000, 1001, 1000, 1002, 1001, 1000, 1001, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Support contains 13 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 65 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 5 ms. Remains 65 /80 variables (removed 15) and now considering 104/128 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 65/80 places, 104/128 transitions.
// Phase 1: matrix 104 rows 65 cols
[2025-06-01 10:49:34] [INFO ] Computed 13 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1002, 1002, 1000, 1001, 1000, 1001, 1000, 1002, 1001, 1000, 1001, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 1000197 steps (2 resets) in 829 ms. (1205 steps per ms)
BEST_FIRST walk for 13000013 steps (26 resets) in 13778 ms. (943 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1002, 1002, 1000, 1001, 1000, 1001, 1002, 1002, 1001, 1000, 1001, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
[2025-06-01 10:49:49] [INFO ] Invariant cache hit.
[2025-06-01 10:49:49] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-01 10:49:49] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:49:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:49:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:49] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:49:49] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 10:49:49] [INFO ] [Nat]Added 13 Read/Feed constraints in 67 ms returned sat
[2025-06-01 10:49:49] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 19 ms.
[2025-06-01 10:49:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2025-06-01 10:49:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2025-06-01 10:49:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2025-06-01 10:49:49] [INFO ] Added : 47 causal constraints over 11 iterations in 292 ms. Result :sat
Minimization took 19 ms.
[2025-06-01 10:49:49] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:49] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:49:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:49:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:49] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:49:49] [INFO ] [Nat]Added 13 Read/Feed constraints in 66 ms returned sat
[2025-06-01 10:49:49] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:49:50] [INFO ] Added : 72 causal constraints over 15 iterations in 139 ms. Result :sat
Minimization took 30 ms.
[2025-06-01 10:49:50] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-01 10:49:50] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:49:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:49:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2025-06-01 10:49:50] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-01 10:49:50] [INFO ] [Nat]Added 13 Read/Feed constraints in 25 ms returned sat
[2025-06-01 10:49:50] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:49:50] [INFO ] Added : 54 causal constraints over 12 iterations in 81 ms. Result :sat
Minimization took 29 ms.
[2025-06-01 10:49:50] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:50] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:49:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:49:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:50] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2025-06-01 10:49:50] [INFO ] [Nat]Added 13 Read/Feed constraints in 24 ms returned sat
[2025-06-01 10:49:50] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:49:50] [INFO ] Added : 26 causal constraints over 6 iterations in 44 ms. Result :sat
Minimization took 21 ms.
[2025-06-01 10:49:50] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:50] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-01 10:49:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:49:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:50] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:49:50] [INFO ] [Nat]Added 13 Read/Feed constraints in 69 ms returned sat
[2025-06-01 10:49:50] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-01 10:49:51] [INFO ] Added : 64 causal constraints over 15 iterations in 134 ms. Result :sat
Minimization took 29 ms.
[2025-06-01 10:49:51] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:51] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:49:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:49:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:51] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-06-01 10:49:51] [INFO ] [Nat]Added 13 Read/Feed constraints in 47 ms returned sat
[2025-06-01 10:49:51] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:49:51] [INFO ] Added : 47 causal constraints over 12 iterations in 84 ms. Result :sat
Minimization took 29 ms.
[2025-06-01 10:49:51] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:51] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-01 10:49:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:49:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:51] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:49:51] [INFO ] [Nat]Added 13 Read/Feed constraints in 68 ms returned sat
[2025-06-01 10:49:51] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-01 10:49:51] [INFO ] Added : 57 causal constraints over 15 iterations in 117 ms. Result :sat
Minimization took 21 ms.
[2025-06-01 10:49:51] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:51] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:49:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:49:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:51] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:49:51] [INFO ] [Nat]Added 13 Read/Feed constraints in 23 ms returned sat
[2025-06-01 10:49:51] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-01 10:49:52] [INFO ] Added : 62 causal constraints over 14 iterations in 106 ms. Result :sat
Minimization took 32 ms.
[2025-06-01 10:49:52] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2025-06-01 10:49:52] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-01 10:49:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:49:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:52] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2025-06-01 10:49:52] [INFO ] [Nat]Added 13 Read/Feed constraints in 25 ms returned sat
[2025-06-01 10:49:52] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:49:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2025-06-01 10:49:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2025-06-01 10:49:52] [INFO ] Added : 64 causal constraints over 14 iterations in 154 ms. Result :sat
Minimization took 23 ms.
[2025-06-01 10:49:52] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:52] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:49:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:49:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-01 10:49:52] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:49:52] [INFO ] [Nat]Added 13 Read/Feed constraints in 77 ms returned sat
[2025-06-01 10:49:52] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:49:52] [INFO ] Added : 45 causal constraints over 11 iterations in 104 ms. Result :sat
Minimization took 27 ms.
[2025-06-01 10:49:52] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:52] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:49:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:49:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:53] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2025-06-01 10:49:53] [INFO ] [Nat]Added 13 Read/Feed constraints in 24 ms returned sat
[2025-06-01 10:49:53] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:49:53] [INFO ] Added : 66 causal constraints over 15 iterations in 101 ms. Result :sat
Minimization took 33 ms.
[2025-06-01 10:49:53] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:53] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-01 10:49:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:49:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:53] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:49:53] [INFO ] [Nat]Added 13 Read/Feed constraints in 45 ms returned sat
[2025-06-01 10:49:53] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:49:53] [INFO ] Added : 67 causal constraints over 15 iterations in 103 ms. Result :sat
Minimization took 23 ms.
[2025-06-01 10:49:53] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:53] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-01 10:49:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:49:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:49:53] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2025-06-01 10:49:53] [INFO ] [Nat]Added 13 Read/Feed constraints in 34 ms returned sat
[2025-06-01 10:49:53] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:49:53] [INFO ] Added : 47 causal constraints over 10 iterations in 71 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1002, 1002, 1000, 1001, 1000, 1001, 1002, 1002, 1001, 1000, 1001, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1002, 1002, 1000, 1001, 1000, 1001, 1002, 1002, 1001, 1000, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Support contains 13 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 65/65 places, 104/104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2025-06-01 10:50:22] [INFO ] Invariant cache hit.
[2025-06-01 10:50:22] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-01 10:50:22] [INFO ] Invariant cache hit.
[2025-06-01 10:50:22] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 10:50:22] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2025-06-01 10:50:22] [INFO ] Redundant transitions in 2 ms returned []
Running 78 sub problems to find dead transitions.
[2025-06-01 10:50:22] [INFO ] Invariant cache hit.
[2025-06-01 10:50:22] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 13/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 104/169 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/169 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 91 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1190 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 13/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 104/169 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 78/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 169 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1718 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 2929ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 2931ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3052 ms. Remains : 65/65 places, 104/104 transitions.
[2025-06-01 10:50:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1002, 1002, 1000, 1001, 1000, 1001, 1002, 1002, 1001, 1000, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
RANDOM walk for 1000184 steps (2 resets) in 875 ms. (1141 steps per ms)
BEST_FIRST walk for 13000013 steps (26 resets) in 13772 ms. (943 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1002, 1002, 1000, 1001, 1000, 1001, 1002, 1002, 1001, 1000, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
[2025-06-01 10:50:39] [INFO ] Invariant cache hit.
[2025-06-01 10:50:39] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-01 10:50:40] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:50:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:50:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:40] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:50:40] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 10:50:40] [INFO ] [Nat]Added 13 Read/Feed constraints in 66 ms returned sat
[2025-06-01 10:50:40] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:50:40] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2025-06-01 10:50:40] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2025-06-01 10:50:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2025-06-01 10:50:40] [INFO ] Added : 47 causal constraints over 11 iterations in 218 ms. Result :sat
Minimization took 19 ms.
[2025-06-01 10:50:40] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:40] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-01 10:50:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:50:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:40] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:50:40] [INFO ] [Nat]Added 13 Read/Feed constraints in 66 ms returned sat
[2025-06-01 10:50:40] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-01 10:50:40] [INFO ] Added : 72 causal constraints over 15 iterations in 149 ms. Result :sat
Minimization took 30 ms.
[2025-06-01 10:50:40] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:40] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:50:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:50:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:40] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-01 10:50:40] [INFO ] [Nat]Added 13 Read/Feed constraints in 24 ms returned sat
[2025-06-01 10:50:40] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:50:41] [INFO ] Added : 54 causal constraints over 12 iterations in 95 ms. Result :sat
Minimization took 29 ms.
[2025-06-01 10:50:41] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:41] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:50:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:50:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:41] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2025-06-01 10:50:41] [INFO ] [Nat]Added 13 Read/Feed constraints in 24 ms returned sat
[2025-06-01 10:50:41] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-01 10:50:41] [INFO ] Added : 26 causal constraints over 6 iterations in 67 ms. Result :sat
Minimization took 22 ms.
[2025-06-01 10:50:41] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:41] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:50:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:50:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:41] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:50:41] [INFO ] [Nat]Added 13 Read/Feed constraints in 68 ms returned sat
[2025-06-01 10:50:41] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:50:41] [INFO ] Added : 64 causal constraints over 15 iterations in 146 ms. Result :sat
Minimization took 29 ms.
[2025-06-01 10:50:41] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:41] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:50:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:50:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:41] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2025-06-01 10:50:42] [INFO ] [Nat]Added 13 Read/Feed constraints in 47 ms returned sat
[2025-06-01 10:50:42] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-01 10:50:42] [INFO ] Added : 47 causal constraints over 12 iterations in 115 ms. Result :sat
Minimization took 27 ms.
[2025-06-01 10:50:42] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:42] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-01 10:50:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:50:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:42] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:50:42] [INFO ] [Nat]Added 13 Read/Feed constraints in 69 ms returned sat
[2025-06-01 10:50:42] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:50:42] [INFO ] Added : 57 causal constraints over 15 iterations in 102 ms. Result :sat
Minimization took 21 ms.
[2025-06-01 10:50:42] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:42] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:50:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:50:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:42] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:50:42] [INFO ] [Nat]Added 13 Read/Feed constraints in 24 ms returned sat
[2025-06-01 10:50:42] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:50:42] [INFO ] Added : 62 causal constraints over 14 iterations in 100 ms. Result :sat
Minimization took 33 ms.
[2025-06-01 10:50:42] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:42] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:50:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:50:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:43] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2025-06-01 10:50:43] [INFO ] [Nat]Added 13 Read/Feed constraints in 25 ms returned sat
[2025-06-01 10:50:43] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:50:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
[2025-06-01 10:50:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2025-06-01 10:50:43] [INFO ] Added : 64 causal constraints over 14 iterations in 145 ms. Result :sat
Minimization took 20 ms.
[2025-06-01 10:50:43] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:43] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:50:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:50:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:43] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:50:43] [INFO ] [Nat]Added 13 Read/Feed constraints in 68 ms returned sat
[2025-06-01 10:50:43] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:50:43] [INFO ] Added : 45 causal constraints over 11 iterations in 111 ms. Result :sat
Minimization took 27 ms.
[2025-06-01 10:50:43] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:43] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:50:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:50:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:43] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2025-06-01 10:50:43] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2025-06-01 10:50:43] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:50:44] [INFO ] Added : 58 causal constraints over 13 iterations in 92 ms. Result :sat
Minimization took 22 ms.
[2025-06-01 10:50:44] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:44] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:50:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:50:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:44] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:50:44] [INFO ] [Nat]Added 13 Read/Feed constraints in 46 ms returned sat
[2025-06-01 10:50:44] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-01 10:50:44] [INFO ] Added : 67 causal constraints over 15 iterations in 112 ms. Result :sat
Minimization took 22 ms.
[2025-06-01 10:50:44] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:44] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:50:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:50:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:50:44] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:50:44] [INFO ] [Nat]Added 13 Read/Feed constraints in 25 ms returned sat
[2025-06-01 10:50:44] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:50:44] [INFO ] Added : 47 causal constraints over 10 iterations in 77 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1002, 1002, 1000, 1001, 1000, 1001, 1002, 1002, 1001, 1000, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1002, 1002, 1000, 1001, 1000, 1001, 1002, 1002, 1001, 1000, 1002, 1002, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003]
Support contains 13 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 65/65 places, 104/104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2025-06-01 10:51:12] [INFO ] Invariant cache hit.
[2025-06-01 10:51:12] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-01 10:51:12] [INFO ] Invariant cache hit.
[2025-06-01 10:51:12] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 10:51:12] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2025-06-01 10:51:12] [INFO ] Redundant transitions in 2 ms returned []
Running 78 sub problems to find dead transitions.
[2025-06-01 10:51:12] [INFO ] Invariant cache hit.
[2025-06-01 10:51:12] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 13/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 104/169 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/169 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 91 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1149 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 13/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 104/169 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 78/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 169 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1658 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 2850ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 2851ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2955 ms. Remains : 65/65 places, 104/104 transitions.
RANDOM walk for 40398 steps (8 resets) in 132 ms. (303 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
[2025-06-01 10:51:16] [INFO ] Flatten gal took : 55 ms
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
[2025-06-01 10:51:16] [INFO ] Flatten gal took : 33 ms
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
[2025-06-01 10:51:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17983008094224452961.gal : 6 ms
[2025-06-01 10:51:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11391543887129203664.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/ReachabilityCardinality17983008094224452961.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11391543887129203664.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 ...330
Loading property file /tmp/ReachabilityCardinality11391543887129203664.prop.
SDD proceeding with computation,26 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,26 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,26 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,26 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,26 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,26 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,26 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 136630 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 26
Probabilistic random walk after 136630 steps, saw 129611 distinct states, run finished after 3004 ms. (steps per millisecond=45 ) properties seen :0
[2025-06-01 10:51:19] [INFO ] Invariant cache hit.
[2025-06-01 10:51:19] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 52/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2025-06-01 10:51:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2025-06-01 10:51:19] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2025-06-01 10:51:19] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2025-06-01 10:51:19] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2025-06-01 10:51:19] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2025-06-01 10:51:19] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2025-06-01 10:51:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2025-06-01 10:51:19] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2025-06-01 10:51:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2025-06-01 10:51:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem MAX1 is UNSAT
Problem MIN1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX7 is UNSAT
Problem MIN7 is UNSAT
Problem MAX8 is UNSAT
Problem MAX9 is UNSAT
Problem MAX10 is UNSAT
Problem MIN10 is UNSAT
Problem MAX11 is UNSAT
Problem MIN11 is UNSAT
Problem MAX12 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 10/23 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/23 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 104/169 variables, 65/88 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 13/101 constraints. Problems are: Problem set: 14 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/101 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/101 constraints. Problems are: Problem set: 14 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 101 constraints, problems are : Problem set: 14 solved, 12 unsolved in 869 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 14 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 36/45 variables, 9/9 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 6/15 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/15 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 72/117 variables, 45/60 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 9/69 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 12/81 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/81 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/81 constraints. Problems are: Problem set: 14 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/169 variables, and 81 constraints, problems are : Problem set: 14 solved, 12 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 9/13 constraints, State Equation: 45/65 constraints, ReadFeed: 9/13 constraints, PredecessorRefiner: 12/26 constraints, Known Traps: 6/10 constraints]
After SMT, in 1340ms problems are : Problem set: 14 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
SDD proceeding with computation,26 properties remain. new max is 512
SDD size :11747 after 45500
Parikh walk visited 5 properties in 8642 ms.
Support contains 7 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 35 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 17 ms. Remains 35 /65 variables (removed 30) and now considering 56/104 (removed 48) transitions.
Running 42 sub problems to find dead transitions.
// Phase 1: matrix 56 rows 35 cols
[2025-06-01 10:51:29] [INFO ] Computed 7 invariants in 1 ms
[2025-06-01 10:51:29] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 42 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 91 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1054 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 1629ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1641ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1672 ms. Remains : 35/65 places, 56/104 transitions.
RANDOM walk for 41170 steps (8 resets) in 31 ms. (1286 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 551536 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 7
Probabilistic random walk after 551536 steps, saw 484775 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
[2025-06-01 10:51:34] [INFO ] Invariant cache hit.
[2025-06-01 10:51:34] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 7 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2025-06-01 10:51:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2025-06-01 10:51:34] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2025-06-01 10:51:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 59 constraints, problems are : Problem set: 0 solved, 7 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints]
After SMT, in 511ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 4845 ms.
Support contains 6 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 30 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 2 ms. Remains 30 /35 variables (removed 5) and now considering 48/56 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/35 places, 48/56 transitions.
RANDOM walk for 42908 steps (8 resets) in 36 ms. (1159 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 183496 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 6
Probabilistic random walk after 183496 steps, saw 162573 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
// Phase 1: matrix 48 rows 30 cols
[2025-06-01 10:51:42] [INFO ] Computed 6 invariants in 0 ms
[2025-06-01 10:51:42] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 6 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 10:51:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2025-06-01 10:51:42] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2025-06-01 10:51:42] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2025-06-01 10:51:42] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 52 constraints, problems are : Problem set: 0 solved, 6 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 422ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4999 ms.
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 30/30 places, 48/48 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2025-06-01 10:51:48] [INFO ] Invariant cache hit.
[2025-06-01 10:51:48] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-01 10:51:48] [INFO ] Invariant cache hit.
[2025-06-01 10:51:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 10:51:48] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2025-06-01 10:51:48] [INFO ] Redundant transitions in 1 ms returned []
Running 36 sub problems to find dead transitions.
[2025-06-01 10:51:48] [INFO ] Invariant cache hit.
[2025-06-01 10:51:48] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 36 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 78 constraints, problems are : Problem set: 0 solved, 36 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 784ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 785ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 861 ms. Remains : 30/30 places, 48/48 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 10:51:48] [INFO ] Flatten gal took : 7 ms
[2025-06-01 10:51:48] [INFO ] Applying decomposition
[2025-06-01 10:51:48] [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/graph737371619602880266.txt' '-o' '/tmp/graph737371619602880266.bin' '-w' '/tmp/graph737371619602880266.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph737371619602880266.bin' '-l' '-1' '-v' '-w' '/tmp/graph737371619602880266.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:51:49] [INFO ] Decomposing Gal with order
[2025-06-01 10:51:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:51:49] [INFO ] Flatten gal took : 6 ms
[2025-06-01 10:51:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:51:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6808634886964549914.gal : 2 ms
[2025-06-01 10:51:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2434143897728322361.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/ReachabilityCardinality6808634886964549914.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2434143897728322361.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/ReachabilityCardinality2434143897728322361.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :3104 after 11747
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :11747 after 45500
Detected timeout of ITS tools.
FORMULA JoinFreeModules-PT-1000-UpperBounds-14 1002 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-1000-UpperBounds-12 1002 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-1000-UpperBounds-08 1002 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-1000-UpperBounds-07 1003 TECHNIQUES REACHABILITY_MAX
FORMULA JoinFreeModules-PT-1000-UpperBounds-03 1003 TECHNIQUES REACHABILITY_MAX
FORMULA JoinFreeModules-PT-1000-UpperBounds-01 1002 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-1000-UpperBounds-00 1003 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 7 queries.) : Max Seen:[1000, 1000, 1001, 1001, 1000, 1000] Max Struct:[1003, 1003, 1003, 1003, 1003, 1003]
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[1000] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1000] Max Struct:[1003]
// Phase 1: matrix 104 rows 65 cols
[2025-06-01 10:52:39] [INFO ] Computed 13 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 10183 steps (2 resets) in 10 ms. (925 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000] Max Struct:[1003]
[2025-06-01 10:52:39] [INFO ] Invariant cache hit.
[2025-06-01 10:52:39] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-01 10:52:39] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:52:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:52:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-01 10:52:39] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-01 10:52:39] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 10:52:39] [INFO ] [Nat]Added 13 Read/Feed constraints in 25 ms returned sat
[2025-06-01 10:52:39] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:52:39] [INFO ] Added : 54 causal constraints over 12 iterations in 89 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-01 10:52:41] [INFO ] Computed 1 invariants in 1 ms
[2025-06-01 10:52:41] [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 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]
After SMT, in 122ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 123ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 5/65 places, 8/104 transitions.
[2025-06-01 10:52:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 1000415 steps (2 resets) in 111 ms. (8932 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:[1000] Max Struct:[1003]
[2025-06-01 10:52:41] [INFO ] Invariant cache hit.
[2025-06-01 10:52:41] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:52:41] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:52:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:52:41] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 10:52:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:52:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 10:52:41] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:52:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:52:41] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:52:41] [INFO ] Added : 5 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
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:41] [INFO ] Invariant cache hit.
[2025-06-01 10:52:41] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-01 10:52:41] [INFO ] Invariant cache hit.
[2025-06-01 10:52:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:52:41] [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:52:41] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:52:41] [INFO ] Invariant cache hit.
[2025-06-01 10:52:41] [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 58 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 116ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 116ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40884 steps (8 resets) in 13 ms. (2920 steps per ms) remains 2/2 properties
[2025-06-01 10:52:41] [INFO ] Flatten gal took : 3 ms
[2025-06-01 10:52:41] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:52:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6559815311328673490.gal : 2 ms
[2025-06-01 10:52:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9596857503626714432.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/ReachabilityCardinality6559815311328673490.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9596857503626714432.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/ReachabilityCardinality9596857503626714432.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 47 ms. (833 steps per ms) remains 2/2 properties
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 916943 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :0 out of 2
Probabilistic random walk after 916943 steps, saw 368998 distinct states, run finished after 3001 ms. (steps per millisecond=305 ) properties seen :0
[2025-06-01 10:52:44] [INFO ] Invariant cache hit.
[2025-06-01 10:52:44] [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:44] [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
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 42 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 71ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 11 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:52:44] [INFO ] Invariant cache hit.
[2025-06-01 10:52:44] [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 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]
After SMT, in 109ms 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 111 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40605 steps (8 resets) in 8 ms. (4511 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 4289620 steps, run timeout after 3001 ms. (steps per millisecond=1429 ) properties seen :0 out of 1
Probabilistic random walk after 4289620 steps, saw 1510159 distinct states, run finished after 3003 ms. (steps per millisecond=1428 ) properties seen :0
[2025-06-01 10:52:48] [INFO ] Invariant cache hit.
[2025-06-01 10:52:48] [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 33 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 26 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 64ms 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:52:48] [INFO ] Invariant cache hit.
[2025-06-01 10:52:48] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-01 10:52:48] [INFO ] Invariant cache hit.
[2025-06-01 10:52:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:52:48] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2025-06-01 10:52:48] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:52:48] [INFO ] Invariant cache hit.
[2025-06-01 10:52:48] [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 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 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 145 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:48] [INFO ] Flatten gal took : 2 ms
[2025-06-01 10:52:48] [INFO ] Applying decomposition
[2025-06-01 10:52:48] [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/graph13772212278845730583.txt' '-o' '/tmp/graph13772212278845730583.bin' '-w' '/tmp/graph13772212278845730583.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13772212278845730583.bin' '-l' '-1' '-v' '-w' '/tmp/graph13772212278845730583.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:52:48] [INFO ] Decomposing Gal with order
[2025-06-01 10:52:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:52:48] [INFO ] Flatten gal took : 27 ms
[2025-06-01 10:52:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-01 10:52:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3558196458253471509.gal : 1 ms
[2025-06-01 10:52:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1380664773616325704.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/ReachabilityCardinality3558196458253471509.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1380664773616325704.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/ReachabilityCardinality1380664773616325704.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 :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :97470 after 172777
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :9.19488e+08 after 9.5932e+08
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1000] Max Struct:[1003]
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-02 in 59191 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[1000] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1000] Max Struct:[1003]
// Phase 1: matrix 104 rows 65 cols
[2025-06-01 10:53:38] [INFO ] Computed 13 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 10136 steps (2 resets) in 10 ms. (921 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000] Max Struct:[1003]
[2025-06-01 10:53:38] [INFO ] Invariant cache hit.
[2025-06-01 10:53:38] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:53:38] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2025-06-01 10:53:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:53:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:53:38] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-01 10:53:38] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 10:53:38] [INFO ] [Nat]Added 13 Read/Feed constraints in 71 ms returned sat
[2025-06-01 10:53:38] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 26 ms.
[2025-06-01 10:53:38] [INFO ] Added : 64 causal constraints over 15 iterations in 184 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-01 10:53:40] [INFO ] Computed 1 invariants in 0 ms
[2025-06-01 10:53:40] [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 65 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 144ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 144ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 5/65 places, 8/104 transitions.
[2025-06-01 10:53:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 1000209 steps (2 resets) in 103 ms. (9617 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 152 ms. (6535 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000] Max Struct:[1003]
[2025-06-01 10:53:41] [INFO ] Invariant cache hit.
[2025-06-01 10:53:41] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:53:41] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-01 10:53:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:53:41] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:53:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:53:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:53:41] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-01 10:53:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:53:41] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:53:41] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
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:41] [INFO ] Invariant cache hit.
[2025-06-01 10:53:41] [INFO ] Implicit Places using invariants in 12 ms returned []
[2025-06-01 10:53:41] [INFO ] Invariant cache hit.
[2025-06-01 10:53:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:53:41] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2025-06-01 10:53:41] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:53:41] [INFO ] Invariant cache hit.
[2025-06-01 10:53:41] [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 61 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 127ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 127ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40590 steps (8 resets) in 9 ms. (4059 steps per ms) remains 2/2 properties
[2025-06-01 10:53:41] [INFO ] Flatten gal took : 2 ms
[2025-06-01 10:53:41] [INFO ] Flatten gal took : 0 ms
[2025-06-01 10:53:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15754484740442935494.gal : 1 ms
[2025-06-01 10:53:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8277546878477922829.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/ReachabilityCardinality15754484740442935494.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8277546878477922829.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/ReachabilityCardinality8277546878477922829.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 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 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 750758 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :0 out of 2
Probabilistic random walk after 750758 steps, saw 307688 distinct states, run finished after 3001 ms. (steps per millisecond=250 ) properties seen :0
[2025-06-01 10:53:44] [INFO ] Invariant cache hit.
[2025-06-01 10:53:44] [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:44] [INFO ] Deduced a trap composed of 3 places in 24 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 100 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 32 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 135ms 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 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:53:44] [INFO ] Invariant cache hit.
[2025-06-01 10:53:44] [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 78 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 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]
After SMT, in 156ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 157ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 41032 steps (8 resets) in 9 ms. (4103 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 3551846 steps, run timeout after 3001 ms. (steps per millisecond=1183 ) properties seen :0 out of 1
Probabilistic random walk after 3551846 steps, saw 1251426 distinct states, run finished after 3001 ms. (steps per millisecond=1183 ) properties seen :0
[2025-06-01 10:53:47] [INFO ] Invariant cache hit.
[2025-06-01 10:53:47] [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 53 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 22 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 88ms 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 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:53:47] [INFO ] Invariant cache hit.
[2025-06-01 10:53:47] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-01 10:53:47] [INFO ] Invariant cache hit.
[2025-06-01 10:53:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:53:47] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2025-06-01 10:53:47] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:53:47] [INFO ] Invariant cache hit.
[2025-06-01 10:53:47] [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 2538 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
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :11747 after 45500
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 2324 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 4900ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 4900ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4979 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:52] [INFO ] Flatten gal took : 0 ms
[2025-06-01 10:53:52] [INFO ] Applying decomposition
[2025-06-01 10:53:52] [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/graph12441426910313087921.txt' '-o' '/tmp/graph12441426910313087921.bin' '-w' '/tmp/graph12441426910313087921.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12441426910313087921.bin' '-l' '-1' '-v' '-w' '/tmp/graph12441426910313087921.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:53:52] [INFO ] Decomposing Gal with order
[2025-06-01 10:53:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:53:52] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:53:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:53:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4987826043783945773.gal : 15 ms
[2025-06-01 10:53:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9003489811294677257.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/ReachabilityCardinality4987826043783945773.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9003489811294677257.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/ReachabilityCardinality9003489811294677257.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 :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :97458 after 172761
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :9.19488e+08 after 9.19488e+08
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1000] Max Struct:[1003]
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-04 in 64513 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-06
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:[1003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[1003]
// Phase 1: matrix 104 rows 65 cols
[2025-06-01 10:54:42] [INFO ] Computed 13 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1003]
RANDOM walk for 10618 steps (2 resets) in 9 ms. (1061 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:[1001] Max Struct:[1003]
[2025-06-01 10:54:42] [INFO ] Invariant cache hit.
[2025-06-01 10:54:42] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:54:42] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:54:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:54:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:54:43] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-06-01 10:54:43] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 10:54:43] [INFO ] [Nat]Added 13 Read/Feed constraints in 46 ms returned sat
[2025-06-01 10:54:43] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 19 ms.
[2025-06-01 10:54:43] [INFO ] Added : 47 causal constraints over 12 iterations in 158 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1001] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1001] Max Struct:[1003]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.1 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-01 10:54:45] [INFO ] Computed 1 invariants in 1 ms
[2025-06-01 10:54:45] [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 73 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 158ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 159ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 5/65 places, 8/104 transitions.
[2025-06-01 10:54:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1001] Max Struct:[1003]
RANDOM walk for 1000000 steps (2 resets) in 105 ms. (9433 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 233 ms. (4273 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1001] Max Struct:[1003]
[2025-06-01 10:54:45] [INFO ] Invariant cache hit.
[2025-06-01 10:54:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 10:54:45] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:54:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:54:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:54:45] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-01 10:54:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:54:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:54:45] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-01 10:54:45] [INFO ] Added : 6 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1001] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1001] Max Struct:[1003]
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:45] [INFO ] Invariant cache hit.
[2025-06-01 10:54:45] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-01 10:54:45] [INFO ] Invariant cache hit.
[2025-06-01 10:54:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:54:45] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2025-06-01 10:54:45] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:54:45] [INFO ] Invariant cache hit.
[2025-06-01 10:54:45] [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 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 125ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 126ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-01 10:54:46] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:54:46] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:54:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7986071190210018721.gal : 1 ms
[2025-06-01 10:54:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10697787372418082336.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/ReachabilityCardinality7986071190210018721.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10697787372418082336.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/ReachabilityCardinality10697787372418082336.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
RANDOM walk for 40268 steps (8 resets) in 40 ms. (982 steps per ms) remains 2/2 properties
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 38 ms. (1025 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 40004 steps (8 resets) in 73 ms. (540 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 1102424 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :0 out of 2
Probabilistic random walk after 1102424 steps, saw 436829 distinct states, run finished after 3001 ms. (steps per millisecond=367 ) properties seen :0
[2025-06-01 10:54:49] [INFO ] Invariant cache hit.
[2025-06-01 10:54:49] [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:49] [INFO ] Deduced a trap composed of 3 places in 17 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 47 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 75ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 44 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:49] [INFO ] Invariant cache hit.
[2025-06-01 10:54:49] [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 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 119ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 119ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40904 steps (8 resets) in 9 ms. (4090 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 3582226 steps, run timeout after 3001 ms. (steps per millisecond=1193 ) properties seen :0 out of 1
Probabilistic random walk after 3582226 steps, saw 1261962 distinct states, run finished after 3001 ms. (steps per millisecond=1193 ) properties seen :0
[2025-06-01 10:54:52] [INFO ] Invariant cache hit.
[2025-06-01 10:54:52] [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 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 59ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 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:52] [INFO ] Invariant cache hit.
[2025-06-01 10:54:52] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-01 10:54:52] [INFO ] Invariant cache hit.
[2025-06-01 10:54:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:54:52] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2025-06-01 10:54:52] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:54:52] [INFO ] Invariant cache hit.
[2025-06-01 10:54:52] [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 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 145 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:52] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:54:52] [INFO ] Applying decomposition
[2025-06-01 10:54:52] [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/graph6253110299444927116.txt' '-o' '/tmp/graph6253110299444927116.bin' '-w' '/tmp/graph6253110299444927116.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6253110299444927116.bin' '-l' '-1' '-v' '-w' '/tmp/graph6253110299444927116.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:54:52] [INFO ] Decomposing Gal with order
[2025-06-01 10:54:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:54:52] [INFO ] Flatten gal took : 2 ms
[2025-06-01 10:54:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:54:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16721865068204961280.gal : 0 ms
[2025-06-01 10:54:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16096760760393781770.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/ReachabilityCardinality16721865068204961280.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16096760760393781770.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/ReachabilityCardinality16096760760393781770.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 :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :93475 after 93485
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :9.1947e+08 after 9.59303e+08
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1001] Max Struct:[1003]
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-06 in 59800 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-10
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:[1003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[1003]
// Phase 1: matrix 104 rows 65 cols
[2025-06-01 10:55:42] [INFO ] Computed 13 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1003]
RANDOM walk for 10349 steps (2 resets) in 11 ms. (862 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:[121] Max Struct:[1003]
[2025-06-01 10:55:42] [INFO ] Invariant cache hit.
[2025-06-01 10:55:42] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:55:42] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:55:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:55:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:55:42] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2025-06-01 10:55:42] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 10:55:42] [INFO ] [Nat]Added 13 Read/Feed constraints in 12 ms returned sat
[2025-06-01 10:55:42] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:55:43] [INFO ] Added : 61 causal constraints over 13 iterations in 89 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[121] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1001] Max Struct:[1003]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-01 10:55:44] [INFO ] Computed 1 invariants in 0 ms
[2025-06-01 10:55:44] [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 74 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 82 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 173ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 173ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 5/65 places, 8/104 transitions.
[2025-06-01 10:55:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1001] Max Struct:[1003]
RANDOM walk for 1000372 steps (2 resets) in 105 ms. (9437 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 148 ms. (6711 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1001] Max Struct:[1003]
[2025-06-01 10:55:45] [INFO ] Invariant cache hit.
[2025-06-01 10:55:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 10:55:45] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-01 10:55:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:55:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:55:45] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:55:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:55:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:55:45] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:55:45] [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:[1001] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1001] Max Struct:[1003]
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:55:45] [INFO ] Invariant cache hit.
[2025-06-01 10:55:45] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-01 10:55:45] [INFO ] Invariant cache hit.
[2025-06-01 10:55:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:55:45] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2025-06-01 10:55:45] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:55:45] [INFO ] Invariant cache hit.
[2025-06-01 10:55:45] [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 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 108ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 41017 steps (8 resets) in 8 ms. (4557 steps per ms) remains 2/2 properties
[2025-06-01 10:55:45] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:55:45] [INFO ] Flatten gal took : 1 ms
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
[2025-06-01 10:55:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10443359641447241227.gal : 0 ms
[2025-06-01 10:55:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10078677702040858338.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/ReachabilityCardinality10443359641447241227.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10078677702040858338.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 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/ReachabilityCardinality10078677702040858338.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 881551 steps, run timeout after 3001 ms. (steps per millisecond=293 ) properties seen :0 out of 2
Probabilistic random walk after 881551 steps, saw 355543 distinct states, run finished after 3001 ms. (steps per millisecond=293 ) properties seen :0
[2025-06-01 10:55:48] [INFO ] Invariant cache hit.
[2025-06-01 10:55:48] [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:48] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 32 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 166 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 46 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 240ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 41 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:48] [INFO ] Invariant cache hit.
[2025-06-01 10:55:48] [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 393 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 92 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 493ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 493ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 494 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40821 steps (8 resets) in 7 ms. (5102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10 ms. (3636 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3111302 steps, run timeout after 3001 ms. (steps per millisecond=1036 ) properties seen :0 out of 1
Probabilistic random walk after 3111302 steps, saw 1097680 distinct states, run finished after 3001 ms. (steps per millisecond=1036 ) properties seen :0
[2025-06-01 10:55:52] [INFO ] Invariant cache hit.
[2025-06-01 10:55:52] [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 69 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 28 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 117ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 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:55:52] [INFO ] Invariant cache hit.
[2025-06-01 10:55:52] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-01 10:55:52] [INFO ] Invariant cache hit.
[2025-06-01 10:55:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:55:52] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2025-06-01 10:55:52] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:55:52] [INFO ] Invariant cache hit.
[2025-06-01 10:55:52] [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 79 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 221 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 315ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 315ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 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:53] [INFO ] Flatten gal took : 0 ms
[2025-06-01 10:55:53] [INFO ] Applying decomposition
[2025-06-01 10:55:53] [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/graph10607331755229232335.txt' '-o' '/tmp/graph10607331755229232335.bin' '-w' '/tmp/graph10607331755229232335.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10607331755229232335.bin' '-l' '-1' '-v' '-w' '/tmp/graph10607331755229232335.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:55:53] [INFO ] Decomposing Gal with order
[2025-06-01 10:55:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:55:53] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:55:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:55:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16494872805133953428.gal : 9 ms
[2025-06-01 10:55:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3327749392279948585.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/ReachabilityCardinality16494872805133953428.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3327749392279948585.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/ReachabilityCardinality3327749392279948585.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 :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :97470 after 201492
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.04366e+09 after 1.08714e+09
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1001] Max Struct:[1003]
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-10 in 60470 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[1000] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1000] Max Struct:[1003]
// Phase 1: matrix 104 rows 65 cols
[2025-06-01 10:56:43] [INFO ] Computed 13 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 10142 steps (2 resets) in 8 ms. (1126 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:[1000] Max Struct:[1003]
[2025-06-01 10:56:43] [INFO ] Invariant cache hit.
[2025-06-01 10:56:43] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:56:43] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:56:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:56:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:56:43] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:56:43] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 10:56:43] [INFO ] [Nat]Added 13 Read/Feed constraints in 67 ms returned sat
[2025-06-01 10:56:43] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:56:43] [INFO ] Added : 45 causal constraints over 11 iterations in 115 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-01 10:56:45] [INFO ] Computed 1 invariants in 0 ms
[2025-06-01 10:56:45] [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 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 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 117 ms. Remains : 5/65 places, 8/104 transitions.
[2025-06-01 10:56:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 1000212 steps (2 resets) in 103 ms. (9617 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 144 ms. (6896 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000] Max Struct:[1003]
[2025-06-01 10:56:45] [INFO ] Invariant cache hit.
[2025-06-01 10:56:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 10:56:45] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:56:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:56:45] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 10:56:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:56:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:56:45] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:56:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:56:45] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-01 10:56:45] [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:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
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:56:45] [INFO ] Invariant cache hit.
[2025-06-01 10:56:45] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-01 10:56:45] [INFO ] Invariant cache hit.
[2025-06-01 10:56:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:56:45] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2025-06-01 10:56:45] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:56:45] [INFO ] Invariant cache hit.
[2025-06-01 10:56:45] [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 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 98ms 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 144 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-01 10:56:45] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:56:45] [INFO ] Flatten gal took : 0 ms
RANDOM walk for 40187 steps (8 resets) in 15 ms. (2511 steps per ms) remains 2/2 properties
[2025-06-01 10:56:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4328360634346083908.gal : 8 ms
[2025-06-01 10:56:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6845269484205869538.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/ReachabilityCardinality4328360634346083908.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6845269484205869538.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 13 ms. (2857 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/ReachabilityCardinality6845269484205869538.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 1307509 steps, run timeout after 3001 ms. (steps per millisecond=435 ) properties seen :0 out of 2
Probabilistic random walk after 1307509 steps, saw 452552 distinct states, run finished after 3001 ms. (steps per millisecond=435 ) properties seen :0
[2025-06-01 10:56:48] [INFO ] Invariant cache hit.
[2025-06-01 10:56:48] [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:49] [INFO ] Deduced a trap composed of 3 places in 110 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 189 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 47 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 238ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 7 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:49] [INFO ] Invariant cache hit.
[2025-06-01 10:56:49] [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 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 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 103 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40598 steps (8 resets) in 12 ms. (3122 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 4314394 steps, run timeout after 3001 ms. (steps per millisecond=1437 ) properties seen :0 out of 1
Probabilistic random walk after 4314394 steps, saw 1518471 distinct states, run finished after 3001 ms. (steps per millisecond=1437 ) properties seen :0
[2025-06-01 10:56:52] [INFO ] Invariant cache hit.
[2025-06-01 10:56:52] [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 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]
After SMT, in 76ms 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 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:52] [INFO ] Invariant cache hit.
[2025-06-01 10:56:52] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-01 10:56:52] [INFO ] Invariant cache hit.
[2025-06-01 10:56:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:56:52] [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:56:52] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:56:52] [INFO ] Invariant cache hit.
[2025-06-01 10:56:52] [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 151 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:52] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:56:52] [INFO ] Applying decomposition
[2025-06-01 10:56:52] [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/graph3739480581756218609.txt' '-o' '/tmp/graph3739480581756218609.bin' '-w' '/tmp/graph3739480581756218609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3739480581756218609.bin' '-l' '-1' '-v' '-w' '/tmp/graph3739480581756218609.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:56:52] [INFO ] Decomposing Gal with order
[2025-06-01 10:56:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:56:52] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:56:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-01 10:56:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17328483335724815271.gal : 1 ms
[2025-06-01 10:56:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17453134549065887871.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/ReachabilityCardinality17328483335724815271.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17453134549065887871.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/ReachabilityCardinality17453134549065887871.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 :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :36884 after 76604
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :76604 after 194609
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :194609 after 202546
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :202546 after 343948
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :343948 after 367736
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :367736 after 579945
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :579945 after 924725
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.3022e+06 after 1.91597e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1000] Max Struct:[1003]
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-11 in 59372 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[1000] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1000] Max Struct:[1003]
// Phase 1: matrix 104 rows 65 cols
[2025-06-01 10:57:42] [INFO ] Computed 13 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 10614 steps (2 resets) in 8 ms. (1179 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:[1000] Max Struct:[1003]
[2025-06-01 10:57:42] [INFO ] Invariant cache hit.
[2025-06-01 10:57:42] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-01 10:57:42] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:57:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:57:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:57:42] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:57:42] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 10:57:42] [INFO ] [Nat]Added 13 Read/Feed constraints in 25 ms returned sat
[2025-06-01 10:57:42] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:57:42] [INFO ] Added : 47 causal constraints over 10 iterations in 71 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-01 10:57:44] [INFO ] Computed 1 invariants in 0 ms
[2025-06-01 10:57:44] [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 65 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 116ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 116ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 5/65 places, 8/104 transitions.
[2025-06-01 10:57:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1003]
RANDOM walk for 1000147 steps (2 resets) in 105 ms. (9435 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 145 ms. (6849 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1000] Max Struct:[1003]
[2025-06-01 10:57:44] [INFO ] Invariant cache hit.
[2025-06-01 10:57:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:57:44] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-01 10:57:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:57:44] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 10:57:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:57:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:57:44] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-01 10:57:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:57:44] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:57:44] [INFO ] Added : 5 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1000] Max Struct:[1003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1003]
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:57:44] [INFO ] Invariant cache hit.
[2025-06-01 10:57:44] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-01 10:57:44] [INFO ] Invariant cache hit.
[2025-06-01 10:57:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:57:45] [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:57:45] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:57:45] [INFO ] Invariant cache hit.
[2025-06-01 10:57:45] [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 58 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 98ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-01 10:57:45] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 40512 steps (8 resets) in 13 ms. (2893 steps per ms) remains 2/2 properties
[2025-06-01 10:57:45] [INFO ] Flatten gal took : 2 ms
[2025-06-01 10:57:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12840598021862213671.gal : 2 ms
[2025-06-01 10:57:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14732088443992628941.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/ReachabilityCardinality12840598021862213671.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14732088443992628941.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 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/ReachabilityCardinality14732088443992628941.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 32 ms. (1212 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 905098 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :0 out of 2
Probabilistic random walk after 905098 steps, saw 364723 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
[2025-06-01 10:57:48] [INFO ] Invariant cache hit.
[2025-06-01 10:57:48] [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:57:48] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 30 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 192 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 26 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 226ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 8 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:57:48] [INFO ] Invariant cache hit.
[2025-06-01 10:57:48] [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 87 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 64 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 155ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 155ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40538 steps (8 resets) in 9 ms. (4053 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2727270 steps, run timeout after 3002 ms. (steps per millisecond=908 ) properties seen :0 out of 1
Probabilistic random walk after 2727270 steps, saw 962709 distinct states, run finished after 3002 ms. (steps per millisecond=908 ) properties seen :0
[2025-06-01 10:57:51] [INFO ] Invariant cache hit.
[2025-06-01 10:57:51] [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 97 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 104 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 207ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 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:57:51] [INFO ] Invariant cache hit.
[2025-06-01 10:57:51] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-01 10:57:51] [INFO ] Invariant cache hit.
[2025-06-01 10:57:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:57:51] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2025-06-01 10:57:51] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:57:51] [INFO ] Invariant cache hit.
[2025-06-01 10:57:51] [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 1843 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 1913ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 1913ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1980 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:57:53] [INFO ] Flatten gal took : 0 ms
[2025-06-01 10:57:53] [INFO ] Applying decomposition
[2025-06-01 10:57:53] [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/graph8199809559104067330.txt' '-o' '/tmp/graph8199809559104067330.bin' '-w' '/tmp/graph8199809559104067330.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8199809559104067330.bin' '-l' '-1' '-v' '-w' '/tmp/graph8199809559104067330.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:57:53] [INFO ] Decomposing Gal with order
[2025-06-01 10:57:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:57:53] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:57:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:57:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12295944228401620013.gal : 1 ms
[2025-06-01 10:57:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13829194303831140155.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/ReachabilityCardinality12295944228401620013.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13829194303831140155.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/ReachabilityCardinality13829194303831140155.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 :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :76607 after 84548
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :84548 after 170787
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :170787 after 328106
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :328106 after 365775
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :365775 after 579975
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :579975 after 619494
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :619494 after 922831
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1000] Max Struct:[1003]
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-15 in 61346 ms.
[2025-06-01 10:58:43] [INFO ] Flatten gal took : 5 ms
[2025-06-01 10:58:43] [INFO ] Applying decomposition
[2025-06-01 10:58:43] [INFO ] Flatten gal took : 4 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/graph12457570393229295276.txt' '-o' '/tmp/graph12457570393229295276.bin' '-w' '/tmp/graph12457570393229295276.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12457570393229295276.bin' '-l' '-1' '-v' '-w' '/tmp/graph12457570393229295276.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:58:43] [INFO ] Decomposing Gal with order
[2025-06-01 10:58:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:58:43] [INFO ] Flatten gal took : 3 ms
[2025-06-01 10:58:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:58:43] [INFO ] Time to serialize gal into /tmp/UpperBounds7456538999874103589.gal : 2 ms
[2025-06-01 10:58:43] [INFO ] Time to serialize properties into /tmp/UpperBounds8406921879123033297.prop : 5 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/UpperBounds7456538999874103589.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8406921879123033297.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 ...283
Loading property file /tmp/UpperBounds8406921879123033297.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.51742e+138,1143.13,7445892,15,7019,43,7.89631e+06,52,0,63,9.39558e+06,0
Total reachable state count : 1.517415354667586716497277144290710959349e+138

Verifying 6 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1000
Bounds property JoinFreeModules-PT-1000-UpperBounds-02 :0 <= u5.p3603 <= 1000
FORMULA JoinFreeModules-PT-1000-UpperBounds-02 1000 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-1000-UpperBounds-02,0,1152.35,7445892,1,0,78,7.89631e+06,130,14,1078,9.39558e+06,158
Min sum of variable value : 0
Maximum sum along a path : 1000
Bounds property JoinFreeModules-PT-1000-UpperBounds-04 :0 <= u7.p4208 <= 1000
FORMULA JoinFreeModules-PT-1000-UpperBounds-04 1000 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-1000-UpperBounds-04,0,1152.35,7445892,1,0,86,7.89631e+06,155,14,1078,9.39558e+06,176
Min sum of variable value : 0
Maximum sum along a path : 1001
Bounds property JoinFreeModules-PT-1000-UpperBounds-06 :0 <= u1.p1807 <= 1001
FORMULA JoinFreeModules-PT-1000-UpperBounds-06 1001 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-1000-UpperBounds-06,0,1171.43,7445892,1,0,100,7.89631e+06,180,14,2090,9.39558e+06,202
Min sum of variable value : 0
Maximum sum along a path : 1001
Bounds property JoinFreeModules-PT-1000-UpperBounds-10 :0 <= u12.p4997 <= 1001
FORMULA JoinFreeModules-PT-1000-UpperBounds-10 1001 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-1000-UpperBounds-10,0,1171.43,7445892,1,0,102,7.89631e+06,210,14,2090,9.39558e+06,215
Min sum of variable value : 0
Maximum sum along a path : 1000
Bounds property JoinFreeModules-PT-1000-UpperBounds-11 :0 <= u4.p3298 <= 1000
FORMULA JoinFreeModules-PT-1000-UpperBounds-11 1000 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-1000-UpperBounds-11,0,1171.43,7445892,1,0,112,7.89631e+06,229,14,2090,9.39558e+06,234
Min sum of variable value : 0
Maximum sum along a path : 1000
Bounds property JoinFreeModules-PT-1000-UpperBounds-15 :0 <= u0.p1538 <= 1000
FORMULA JoinFreeModules-PT-1000-UpperBounds-15 1000 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-1000-UpperBounds-15,0,1171.43,7445892,1,0,125,7.89631e+06,245,14,2090,9.39558e+06,259
Total runtime 2034690 ms.

BK_STOP 1748776696164

--------------------
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-1000"
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-1000, 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-174876435800059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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