MCC'2025- Execution of r125-tall-174876435700057

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

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15687.270	405026.00	520562.00	1417.40	201 201 201 202 203 200 200 201 201 202 202 201 203 200 200 202	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r125-tall-174876435700057.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-0200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r125-tall-174876435700057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K 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 3.8K 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 613K 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-0200-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748774432044

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-0200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 10:40:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 10:40:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 10:40:33] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2025-06-01 10:40:33] [INFO ] Transformed 1001 places.
[2025-06-01 10:40:33] [INFO ] Transformed 1601 transitions.
[2025-06-01 10:40:33] [INFO ] Parsed PT model containing 1001 places and 1601 transitions and 4602 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[1, 1, 1, 2, 0, 200, 200, 1, 1, 2, 0, 1, 0, 200, 200, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 1, 1, 2, 0, 200, 200, 1, 1, 2, 0, 1, 0, 200, 200, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 1601 rows 1000 cols
[2025-06-01 10:40:33] [INFO ] Computed 200 invariants in 41 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 2, 0, 200, 200, 1, 1, 2, 0, 1, 0, 200, 200, 0] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 10024 steps (2 resets) in 124 ms. (80 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 1697 ms. (94 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10, 201, 2, 12, 200, 200, 10, 10, 2, 9, 10, 12, 200, 200, 9] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
[2025-06-01 10:40:35] [INFO ] Invariant cache hit.
[2025-06-01 10:40:35] [INFO ] [Real]Absence check using 200 positive place invariants in 51 ms returned sat
[2025-06-01 10:40:36] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2025-06-01 10:40:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:36] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2025-06-01 10:40:36] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2025-06-01 10:40:36] [INFO ] State equation strengthened by 200 read => feed constraints.
[2025-06-01 10:40:37] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-01 10:40:37] [INFO ] [Nat]Added 200 Read/Feed constraints in 550 ms returned sat
[2025-06-01 10:40:37] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 156 ms.
[2025-06-01 10:40:41] [INFO ] Added : 245 causal constraints over 49 iterations in 3826 ms. Result :unknown
[2025-06-01 10:40:41] [INFO ] [Real]Absence check using 200 positive place invariants in 37 ms returned sat
[2025-06-01 10:40:41] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2025-06-01 10:40:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:42] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2025-06-01 10:40:42] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2025-06-01 10:40:42] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-01 10:40:42] [INFO ] [Nat]Added 200 Read/Feed constraints in 534 ms returned sat
[2025-06-01 10:40:43] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 77 ms.
[2025-06-01 10:40:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-01 10:40:47] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2025-06-01 10:40:47] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2025-06-01 10:40:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:47] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2025-06-01 10:40:48] [INFO ] [Nat]Absence check using state equation in 1011 ms returned sat
[2025-06-01 10:40:48] [INFO ] [Nat]Added 200 Read/Feed constraints in 155 ms returned sat
[2025-06-01 10:40:48] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 8 ms to minimize.
[2025-06-01 10:40:49] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
[2025-06-01 10:40:49] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 3 ms to minimize.
[2025-06-01 10:40:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2025-06-01 10:40:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2025-06-01 10:40:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 489 ms
[2025-06-01 10:40:49] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 80 ms.
[2025-06-01 10:40:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-01 10:40:52] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2025-06-01 10:40:53] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2025-06-01 10:40:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:53] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2025-06-01 10:40:53] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2025-06-01 10:40:54] [INFO ] [Nat]Added 200 Read/Feed constraints in 469 ms returned sat
[2025-06-01 10:40:54] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 75 ms.
[2025-06-01 10:40:58] [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: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-01 10:40:58] [INFO ] [Real]Absence check using 200 positive place invariants in 36 ms returned sat
[2025-06-01 10:40:58] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2025-06-01 10:40:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:58] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2025-06-01 10:40:59] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2025-06-01 10:40:59] [INFO ] [Nat]Added 200 Read/Feed constraints in 23 ms returned sat
[2025-06-01 10:40:59] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 75 ms.
[2025-06-01 10:41:01] [INFO ] Added : 125 causal constraints over 25 iterations in 2325 ms. Result :sat
Minimization took 512 ms.
[2025-06-01 10:41:02] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2025-06-01 10:41:02] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2025-06-01 10:41:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:41:02] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2025-06-01 10:41:03] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2025-06-01 10:41:03] [INFO ] [Nat]Added 200 Read/Feed constraints in 495 ms returned sat
[2025-06-01 10:41:03] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 71 ms.
[2025-06-01 10:41:07] [INFO ] Added : 265 causal constraints over 53 iterations in 3885 ms. Result :unknown
[2025-06-01 10:41:07] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2025-06-01 10:41:08] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2025-06-01 10:41:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:41:08] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2025-06-01 10:41:08] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2025-06-01 10:41:09] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-01 10:41:09] [INFO ] [Nat]Added 200 Read/Feed constraints in 555 ms returned sat
[2025-06-01 10:41:09] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 73 ms.
[2025-06-01 10:41:13] [INFO ] Added : 270 causal constraints over 54 iterations in 3900 ms. Result :unknown
[2025-06-01 10:41:13] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2025-06-01 10:41:13] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2025-06-01 10:41:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:41:13] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2025-06-01 10:41:14] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2025-06-01 10:41:14] [INFO ] [Nat]Added 200 Read/Feed constraints in 438 ms returned sat
[2025-06-01 10:41:14] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 70 ms.
[2025-06-01 10:41:18] [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 7
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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-01 10:41:18] [INFO ] [Real]Absence check using 200 positive place invariants in 31 ms returned sat
[2025-06-01 10:41:19] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2025-06-01 10:41:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:41:19] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2025-06-01 10:41:19] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2025-06-01 10:41:20] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-01 10:41:20] [INFO ] [Nat]Added 200 Read/Feed constraints in 586 ms returned sat
[2025-06-01 10:41:20] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 69 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-06-01 10:41:24] [INFO ] [Real]Absence check using 200 positive place invariants in 31 ms returned sat
[2025-06-01 10:41:24] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2025-06-01 10:41:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:41:24] [INFO ] [Nat]Absence check using 200 positive place invariants in 31 ms returned sat
[2025-06-01 10:41:25] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2025-06-01 10:41:25] [INFO ] [Nat]Added 200 Read/Feed constraints in 380 ms returned sat
[2025-06-01 10:41:25] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 85 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-06-01 10:41:29] [INFO ] [Real]Absence check using 200 positive place invariants in 31 ms returned sat
[2025-06-01 10:41:30] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2025-06-01 10:41:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:41:30] [INFO ] [Nat]Absence check using 200 positive place invariants in 39 ms returned sat
[2025-06-01 10:41:31] [INFO ] [Nat]Absence check using state equation in 949 ms returned sat
[2025-06-01 10:41:31] [INFO ] [Nat]Added 200 Read/Feed constraints in 307 ms returned sat
[2025-06-01 10:41:31] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2025-06-01 10:41:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2025-06-01 10:41:32] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2025-06-01 10:41:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2025-06-01 10:41:32] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2025-06-01 10:41:32] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2025-06-01 10:41:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 569 ms
[2025-06-01 10:41:32] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 74 ms.
[2025-06-01 10:41:35] [INFO ] Added : 210 causal constraints over 42 iterations in 3023 ms. Result :unknown
[2025-06-01 10:41:35] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2025-06-01 10:41:35] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2025-06-01 10:41:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:41:36] [INFO ] [Nat]Absence check using 200 positive place invariants in 31 ms returned sat
[2025-06-01 10:41:36] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2025-06-01 10:41:36] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-01 10:41:36] [INFO ] [Nat]Added 200 Read/Feed constraints in 538 ms returned sat
[2025-06-01 10:41:37] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 69 ms.
[2025-06-01 10:41:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-01 10:41:41] [INFO ] [Real]Absence check using 200 positive place invariants in 30 ms returned sat
[2025-06-01 10:41:41] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2025-06-01 10:41:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:41:41] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2025-06-01 10:41:41] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2025-06-01 10:41:42] [INFO ] [Nat]Added 200 Read/Feed constraints in 488 ms returned sat
[2025-06-01 10:41:42] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 64 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-06-01 10:41:46] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2025-06-01 10:41:46] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2025-06-01 10:41:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:41:47] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2025-06-01 10:41:47] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2025-06-01 10:41:47] [INFO ] [Nat]Added 200 Read/Feed constraints in 433 ms returned sat
[2025-06-01 10:41:48] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 70 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-06-01 10:41:52] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2025-06-01 10:41:52] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2025-06-01 10:41:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:41:52] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2025-06-01 10:41:53] [INFO ] [Nat]Absence check using state equation in 891 ms returned sat
[2025-06-01 10:41:53] [INFO ] [Nat]Added 200 Read/Feed constraints in 236 ms returned sat
[2025-06-01 10:41:53] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 66 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-06-01 10:41:57] [INFO ] [Real]Absence check using 200 positive place invariants in 31 ms returned sat
[2025-06-01 10:41:58] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2025-06-01 10:41:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:41:58] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2025-06-01 10:41:58] [INFO ] [Nat]Absence check using state equation in 368 ms returned sat
[2025-06-01 10:41:59] [INFO ] [Nat]Added 200 Read/Feed constraints in 503 ms returned sat
[2025-06-01 10:41:59] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 69 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10, 201, 2, 12, 200, 200, 10, 10, 2, 9, 10, 12, 200, 200, 9] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11, 17, 201, 2, 104, 200, 200, 13, 17, 33, 15, 21, 108, 200, 200, 9] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Support contains 16 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Graph (complete) has 2400 edges and 1000 vertex of which 80 are kept as prefixes of interest. Removing 920 places using SCC suffix rule.3 ms
Discarding 920 places :
Also discarding 1472 output transitions
Drop transitions (Output transitions of discarded places.) removed 1472 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 34 ms. Remains 80 /1000 variables (removed 920) and now considering 128/1601 (removed 1473) transitions.
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 128 rows 80 cols
[2025-06-01 10:44:01] [INFO ] Computed 16 invariants in 1 ms
[2025-06-01 10:44:01] [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 1923 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:44:04] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2025-06-01 10:44:04] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2025-06-01 10:44:04] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2025-06-01 10:44:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2025-06-01 10:44:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/208 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 7056 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: 5/5 constraints]
After SMT, in 9030ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 9048ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9105 ms. Remains : 80/1000 places, 128/1601 transitions.
[2025-06-01 10:44:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[11, 17, 201, 2, 104, 200, 200, 13, 17, 33, 15, 21, 108, 200, 200, 9] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 1000012 steps (2 resets) in 1162 ms. (859 steps per ms)
FORMULA JoinFreeModules-PT-0200-UpperBounds-12 203 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-04 203 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 14000014 steps (28 resets) in 17078 ms. (819 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201, 201, 201, 197, 200, 200, 201, 201, 197, 198, 201, 200, 200, 200] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
[2025-06-01 10:44:28] [INFO ] Invariant cache hit.
[2025-06-01 10:44:28] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:28] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:44:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:28] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:28] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2025-06-01 10:44:28] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-01 10:44:28] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2025-06-01 10:44:28] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:44:28] [INFO ] Added : 39 causal constraints over 8 iterations in 91 ms. Result :sat
Minimization took 28 ms.
[2025-06-01 10:44:28] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:28] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:44:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:28] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:28] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:44:28] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:44:28] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:44:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2025-06-01 10:44:28] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2025-06-01 10:44:28] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2025-06-01 10:44:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 98 ms
[2025-06-01 10:44:28] [INFO ] Added : 78 causal constraints over 16 iterations in 276 ms. Result :sat
Minimization took 40 ms.
[2025-06-01 10:44:29] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:29] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:44:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:29] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-06-01 10:44:29] [INFO ] [Nat]Added 16 Read/Feed constraints in 25 ms returned sat
[2025-06-01 10:44:29] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:44:29] [INFO ] Added : 53 causal constraints over 12 iterations in 116 ms. Result :sat
Minimization took 32 ms.
[2025-06-01 10:44:29] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:29] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:44:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-01 10:44:29] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:44:29] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2025-06-01 10:44:29] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:44:29] [INFO ] Added : 65 causal constraints over 15 iterations in 187 ms. Result :sat
Minimization took 42 ms.
[2025-06-01 10:44:29] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:29] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:44:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:29] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-06-01 10:44:29] [INFO ] [Nat]Added 16 Read/Feed constraints in 24 ms returned sat
[2025-06-01 10:44:29] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:44:29] [INFO ] Added : 54 causal constraints over 11 iterations in 96 ms. Result :sat
Minimization took 46 ms.
[2025-06-01 10:44:30] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:30] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:44:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:30] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:30] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-06-01 10:44:30] [INFO ] [Nat]Added 16 Read/Feed constraints in 59 ms returned sat
[2025-06-01 10:44:30] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:44:30] [INFO ] Added : 72 causal constraints over 16 iterations in 141 ms. Result :sat
Minimization took 34 ms.
[2025-06-01 10:44:30] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:30] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:44:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:30] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:30] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:44:30] [INFO ] [Nat]Added 16 Read/Feed constraints in 59 ms returned sat
[2025-06-01 10:44:30] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:44:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2025-06-01 10:44:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2025-06-01 10:44:30] [INFO ] Added : 62 causal constraints over 14 iterations in 162 ms. Result :sat
Minimization took 34 ms.
[2025-06-01 10:44:30] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-01 10:44:30] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:44:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:30] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:30] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:44:30] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:44:30] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:44:31] [INFO ] Added : 63 causal constraints over 13 iterations in 173 ms. Result :sat
Minimization took 34 ms.
[2025-06-01 10:44:31] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:31] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:44:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:31] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-01 10:44:31] [INFO ] [Nat]Added 16 Read/Feed constraints in 41 ms returned sat
[2025-06-01 10:44:31] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:44:31] [INFO ] Added : 49 causal constraints over 11 iterations in 127 ms. Result :sat
Minimization took 43 ms.
[2025-06-01 10:44:31] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:31] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:44:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:31] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-01 10:44:31] [INFO ] [Nat]Added 16 Read/Feed constraints in 46 ms returned sat
[2025-06-01 10:44:31] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:44:31] [INFO ] Added : 77 causal constraints over 16 iterations in 139 ms. Result :sat
Minimization took 41 ms.
[2025-06-01 10:44:31] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:31] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:44:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:31] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:44:31] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:44:31] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:44:32] [INFO ] Added : 66 causal constraints over 14 iterations in 202 ms. Result :sat
Minimization took 37 ms.
[2025-06-01 10:44:32] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:32] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:44:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:32] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:32] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:44:32] [INFO ] [Nat]Added 16 Read/Feed constraints in 66 ms returned sat
[2025-06-01 10:44:32] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:44:32] [INFO ] Added : 67 causal constraints over 14 iterations in 116 ms. Result :sat
Minimization took 33 ms.
[2025-06-01 10:44:32] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:32] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:44:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:32] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:32] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-01 10:44:32] [INFO ] [Nat]Added 16 Read/Feed constraints in 41 ms returned sat
[2025-06-01 10:44:32] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:44:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2025-06-01 10:44:32] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2025-06-01 10:44:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67 ms
[2025-06-01 10:44:32] [INFO ] Added : 74 causal constraints over 15 iterations in 253 ms. Result :sat
Minimization took 42 ms.
[2025-06-01 10:44:32] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:32] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:44:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:32] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:33] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:44:33] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:44:33] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:44:33] [INFO ] Added : 61 causal constraints over 13 iterations in 155 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201, 201, 201, 197, 200, 200, 201, 201, 197, 198, 201, 200, 200, 200] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201, 201, 201, 202, 200, 200, 201, 201, 202, 201, 201, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Support contains 14 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 70 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 4 ms. Remains 70 /80 variables (removed 10) and now considering 112/128 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 70/80 places, 112/128 transitions.
// Phase 1: matrix 112 rows 70 cols
[2025-06-01 10:44:42] [INFO ] Computed 14 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[201, 201, 201, 202, 200, 200, 201, 201, 202, 201, 201, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 1000019 steps (2 resets) in 1000 ms. (999 steps per ms)
BEST_FIRST walk for 14000014 steps (28 resets) in 15315 ms. (914 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201, 201, 201, 202, 200, 200, 201, 201, 202, 201, 201, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
[2025-06-01 10:44:58] [INFO ] Invariant cache hit.
[2025-06-01 10:44:58] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:58] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:44:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:58] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:44:58] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:44:58] [INFO ] [Nat]Added 14 Read/Feed constraints in 23 ms returned sat
[2025-06-01 10:44:58] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-01 10:44:58] [INFO ] Added : 36 causal constraints over 8 iterations in 116 ms. Result :sat
Minimization took 26 ms.
[2025-06-01 10:44:58] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:58] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:44:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:58] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:44:58] [INFO ] [Nat]Added 14 Read/Feed constraints in 64 ms returned sat
[2025-06-01 10:44:58] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:44:58] [INFO ] Added : 51 causal constraints over 11 iterations in 89 ms. Result :sat
Minimization took 29 ms.
[2025-06-01 10:44:58] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:58] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:44:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:58] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-01 10:44:58] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:44:58] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:44:59] [INFO ] Added : 39 causal constraints over 9 iterations in 63 ms. Result :sat
Minimization took 20 ms.
[2025-06-01 10:44:59] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:59] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:44:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:59] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2025-06-01 10:44:59] [INFO ] [Nat]Added 14 Read/Feed constraints in 5 ms returned sat
[2025-06-01 10:44:59] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:44:59] [INFO ] Added : 46 causal constraints over 10 iterations in 72 ms. Result :sat
Minimization took 21 ms.
[2025-06-01 10:44:59] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:59] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:44:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:59] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2025-06-01 10:44:59] [INFO ] [Nat]Added 14 Read/Feed constraints in 45 ms returned sat
[2025-06-01 10:44:59] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:44:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2025-06-01 10:44:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2025-06-01 10:44:59] [INFO ] Added : 31 causal constraints over 7 iterations in 126 ms. Result :sat
Minimization took 24 ms.
[2025-06-01 10:44:59] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:59] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:44:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:59] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:44:59] [INFO ] [Nat]Added 14 Read/Feed constraints in 23 ms returned sat
[2025-06-01 10:44:59] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:44:59] [INFO ] Added : 18 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 21 ms.
[2025-06-01 10:44:59] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:59] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:44:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:59] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:44:59] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:44:59] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:45:00] [INFO ] Added : 39 causal constraints over 9 iterations in 136 ms. Result :sat
Minimization took 29 ms.
[2025-06-01 10:45:00] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:00] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:45:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:00] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:45:00] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:45:00] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:45:00] [INFO ] Added : 35 causal constraints over 7 iterations in 50 ms. Result :sat
Minimization took 25 ms.
[2025-06-01 10:45:00] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:45:00] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:45:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:00] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:45:00] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:45:00] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:45:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2025-06-01 10:45:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
Minimization took 16 ms.
[2025-06-01 10:45:00] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:45:00] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:45:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2025-06-01 10:45:00] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-01 10:45:00] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:45:00] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:45:00] [INFO ] Added : 44 causal constraints over 10 iterations in 93 ms. Result :sat
Minimization took 29 ms.
[2025-06-01 10:45:00] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:45:00] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:45:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:00] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:45:00] [INFO ] [Nat]Added 14 Read/Feed constraints in 64 ms returned sat
[2025-06-01 10:45:00] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:45:00] [INFO ] Added : 35 causal constraints over 7 iterations in 58 ms. Result :sat
Minimization took 27 ms.
[2025-06-01 10:45:01] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:01] [INFO ] [Real]Absence check using state equation in 20 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 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:45:01] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:45:01] [INFO ] [Nat]Added 14 Read/Feed constraints in 67 ms returned sat
[2025-06-01 10:45:01] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:45:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2025-06-01 10:45:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2025-06-01 10:45:01] [INFO ] Added : 37 causal constraints over 8 iterations in 108 ms. Result :sat
Minimization took 25 ms.
[2025-06-01 10:45:01] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:01] [INFO ] [Real]Absence check using state equation in 20 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 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:45:01] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2025-06-01 10:45:01] [INFO ] [Nat]Added 14 Read/Feed constraints in 5 ms returned sat
[2025-06-01 10:45:01] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:45:01] [INFO ] Added : 27 causal constraints over 9 iterations in 61 ms. Result :sat
Minimization took 24 ms.
[2025-06-01 10:45:01] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:45:01] [INFO ] [Real]Absence check using state equation in 21 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 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:01] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2025-06-01 10:45:01] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:45:01] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:45:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2025-06-01 10:45:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2025-06-01 10:45:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 68 ms
[2025-06-01 10:45:01] [INFO ] Added : 33 causal constraints over 9 iterations in 142 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201, 201, 201, 202, 200, 200, 201, 201, 202, 201, 201, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 202, 203, 203, 203, 203, 203]
FORMULA JoinFreeModules-PT-0200-UpperBounds-09 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201, 201, 201, 202, 200, 200, 201, 201, 201, 201, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Support contains 13 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 65 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 3 ms. Remains 65 /70 variables (removed 5) and now considering 104/112 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 65/70 places, 104/112 transitions.
// Phase 1: matrix 104 rows 65 cols
[2025-06-01 10:45:07] [INFO ] Computed 13 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[201, 201, 201, 202, 200, 200, 201, 201, 201, 201, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
RANDOM walk for 1000015 steps (2 resets) in 929 ms. (1075 steps per ms)
BEST_FIRST walk for 13000013 steps (26 resets) in 13460 ms. (965 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201, 201, 201, 202, 200, 200, 201, 201, 201, 201, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
[2025-06-01 10:45:22] [INFO ] Invariant cache hit.
[2025-06-01 10:45:22] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-01 10:45:22] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:45:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-01 10:45:22] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2025-06-01 10:45:22] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 10:45:22] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:45:22] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:45:22] [INFO ] Added : 64 causal constraints over 14 iterations in 105 ms. Result :sat
Minimization took 31 ms.
[2025-06-01 10:45:22] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-01 10:45:22] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-01 10:45:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:22] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:45:22] [INFO ] [Nat]Added 13 Read/Feed constraints in 44 ms returned sat
[2025-06-01 10:45:22] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:45:22] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2025-06-01 10:45:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2025-06-01 10:45:22] [INFO ] Added : 70 causal constraints over 16 iterations in 153 ms. Result :sat
Minimization took 36 ms.
[2025-06-01 10:45:22] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:22] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:45:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:22] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2025-06-01 10:45:22] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:45:22] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:45:22] [INFO ] Added : 36 causal constraints over 8 iterations in 89 ms. Result :sat
Minimization took 26 ms.
[2025-06-01 10:45:22] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:22] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:45:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:23] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:45:23] [INFO ] [Nat]Added 13 Read/Feed constraints in 48 ms returned sat
[2025-06-01 10:45:23] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:45:23] [INFO ] Added : 58 causal constraints over 12 iterations in 94 ms. Result :sat
Minimization took 21 ms.
[2025-06-01 10:45:23] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:45:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-01 10:45:23] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2025-06-01 10:45:23] [INFO ] [Nat]Added 13 Read/Feed constraints in 26 ms returned sat
[2025-06-01 10:45:23] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:45:23] [INFO ] Added : 39 causal constraints over 10 iterations in 98 ms. Result :sat
Minimization took 29 ms.
[2025-06-01 10:45:23] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:45:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:23] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:45:23] [INFO ] [Nat]Added 13 Read/Feed constraints in 66 ms returned sat
[2025-06-01 10:45:23] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:45:23] [INFO ] Added : 51 causal constraints over 11 iterations in 80 ms. Result :sat
Minimization took 28 ms.
[2025-06-01 10:45:23] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:23] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:45:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:23] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2025-06-01 10:45:23] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2025-06-01 10:45:23] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:45:23] [INFO ] Added : 53 causal constraints over 12 iterations in 83 ms. Result :sat
Minimization took 30 ms.
[2025-06-01 10:45:24] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:24] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:45:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:24] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:45:24] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:45:24] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:45:24] [INFO ] Added : 77 causal constraints over 18 iterations in 123 ms. Result :sat
Minimization took 34 ms.
[2025-06-01 10:45:24] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-01 10:45:24] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:45:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-01 10:45:24] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:45:24] [INFO ] [Nat]Added 13 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:45:24] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:45:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2025-06-01 10:45:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2025-06-01 10:45:24] [INFO ] Added : 73 causal constraints over 16 iterations in 149 ms. Result :sat
Minimization took 35 ms.
[2025-06-01 10:45:24] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:24] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-01 10:45:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:24] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:45:24] [INFO ] [Nat]Added 13 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:45:24] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:45:24] [INFO ] Added : 71 causal constraints over 16 iterations in 113 ms. Result :sat
Minimization took 33 ms.
[2025-06-01 10:45:24] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:24] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:45:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:24] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:45:24] [INFO ] [Nat]Added 13 Read/Feed constraints in 66 ms returned sat
[2025-06-01 10:45:24] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:45:25] [INFO ] Added : 63 causal constraints over 14 iterations in 111 ms. Result :sat
Minimization took 31 ms.
[2025-06-01 10:45:25] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:25] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:45:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-01 10:45:25] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:45:25] [INFO ] [Nat]Added 13 Read/Feed constraints in 68 ms returned sat
[2025-06-01 10:45:25] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:45:25] [INFO ] Added : 62 causal constraints over 15 iterations in 124 ms. Result :sat
Minimization took 30 ms.
[2025-06-01 10:45:25] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:25] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:45:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:45:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:45:25] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:45:25] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:45:25] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:45:25] [INFO ] Added : 70 causal constraints over 15 iterations in 95 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201, 201, 201, 202, 200, 200, 201, 201, 201, 201, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201, 201, 201, 202, 200, 200, 201, 201, 201, 201, 200, 200, 201] Max Struct:[203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203]
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 3 ms. Remains 65 /65 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2025-06-01 10:45:31] [INFO ] Invariant cache hit.
[2025-06-01 10:45:31] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-01 10:45:31] [INFO ] Invariant cache hit.
[2025-06-01 10:45:31] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 10:45:31] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2025-06-01 10:45:31] [INFO ] Redundant transitions in 2 ms returned []
Running 78 sub problems to find dead transitions.
[2025-06-01 10:45:31] [INFO ] Invariant cache hit.
[2025-06-01 10:45:31] [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 1210 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 2069 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 3294ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3295ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3370 ms. Remains : 65/65 places, 104/104 transitions.
RANDOM walk for 40176 steps (8 resets) in 259 ms. (154 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 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 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 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 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 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 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 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 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 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 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 21 ms. (182 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 13 ms. (286 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 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 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
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 17 ms. (222 steps per ms) remains 26/26 properties
[2025-06-01 10:45:35] [INFO ] Flatten gal took : 39 ms
[2025-06-01 10:45:35] [INFO ] Flatten gal took : 12 ms
[2025-06-01 10:45:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10079146051922211737.gal : 7 ms
[2025-06-01 10:45:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6278045789526378925.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/ReachabilityCardinality10079146051922211737.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6278045789526378925.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/ReachabilityCardinality6278045789526378925.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 10755
Interrupted probabilistic random walk after 100499 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 26
Probabilistic random walk after 100499 steps, saw 93475 distinct states, run finished after 3006 ms. (steps per millisecond=33 ) properties seen :0
[2025-06-01 10:45:38] [INFO ] Invariant cache hit.
[2025-06-01 10:45:38] [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:45:38] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2025-06-01 10:45:38] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
[2025-06-01 10:45:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2025-06-01 10:45:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2025-06-01 10:45:38] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2025-06-01 10:45:38] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2025-06-01 10:45:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2025-06-01 10:45:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2025-06-01 10:45:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2025-06-01 10:45:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2025-06-01 10:45:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2025-06-01 10:45:38] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2025-06-01 10:45:38] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MIN3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
Problem MAX9 is UNSAT
Problem MAX10 is UNSAT
Problem MAX11 is UNSAT
Problem MAX12 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 13/26 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/26 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 104/169 variables, 65/91 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 13/104 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/104 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/104 constraints. Problems are: Problem set: 14 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 104 constraints, problems are : Problem set: 14 solved, 12 unsolved in 602 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: 13/13 constraints]
Escalating to Integer solving :Problem set: 14 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 48/60 variables, 12/12 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 12/24 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/24 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 96/156 variables, 60/84 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 12/96 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 12/108 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/108 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/156 variables, 0/108 constraints. Problems are: Problem set: 14 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/169 variables, and 108 constraints, problems are : Problem set: 14 solved, 12 unsolved in 1003 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, State Equation: 60/65 constraints, ReadFeed: 12/13 constraints, PredecessorRefiner: 12/26 constraints, Known Traps: 12/13 constraints]
After SMT, in 1618ms 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 :10755 after 19900
SDD proceeding with computation,26 properties remain. new max is 1024
SDD size :19900 after 4.87563e+06
SDD proceeding with computation,26 properties remain. new max is 2048
SDD size :4.87563e+06 after 1.45683e+07
Parikh walk visited 1 properties in 6713 ms.
Support contains 11 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 55 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 3 ms. Remains 55 /65 variables (removed 10) and now considering 88/104 (removed 16) transitions.
Running 66 sub problems to find dead transitions.
// Phase 1: matrix 88 rows 55 cols
[2025-06-01 10:45:46] [INFO ] Computed 11 invariants in 1 ms
[2025-06-01 10:45:46] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 11/55 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 88/143 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/143 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 77 constraints, problems are : Problem set: 0 solved, 66 unsolved in 961 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 55/55 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 11/55 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 88/143 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 66/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2025-06-01 10:45:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/143 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 144 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2057 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 55/55 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 1/1 constraints]
After SMT, in 3032ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 3034ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3038 ms. Remains : 55/65 places, 88/104 transitions.
RANDOM walk for 40194 steps (8 resets) in 44 ms. (893 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 11/11 properties
Invariant property MIN8 does not hold.
SDD proceeding with computation,25 properties remain. new max is 2048
SDD size :1.45683e+07 after 3.62124e+14
SDD proceeding with computation,25 properties remain. new max is 4096
SDD size :3.62124e+14 after 1.43107e+15
Interrupted probabilistic random walk after 121966 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 11
Probabilistic random walk after 121966 steps, saw 112199 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :0
[2025-06-01 10:45:52] [INFO ] Invariant cache hit.
[2025-06-01 10:45:52] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 80/130 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/143 variables, and 70 constraints, problems are : Problem set: 0 solved, 10 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, State Equation: 50/55 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-06-01 10:45:52] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2025-06-01 10:45:53] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2025-06-01 10:45:53] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 80/130 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-06-01 10:45:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2025-06-01 10:45:53] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2025-06-01 10:45:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-06-01 10:45:53] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/143 variables, and 87 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1253 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, State Equation: 50/55 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 7/7 constraints]
After SMT, in 1401ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7616 ms.
Support contains 10 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 50 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 3 ms. Remains 50 /55 variables (removed 5) and now considering 80/88 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 50/55 places, 80/88 transitions.
RANDOM walk for 40145 steps (8 resets) in 75 ms. (528 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 126099 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 10
Probabilistic random walk after 126099 steps, saw 114887 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
// Phase 1: matrix 80 rows 50 cols
[2025-06-01 10:46:05] [INFO ] Computed 10 invariants in 0 ms
[2025-06-01 10:46:05] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 80/130 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 70 constraints, problems are : Problem set: 0 solved, 10 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-06-01 10:46:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
[2025-06-01 10:46:05] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 80/130 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-06-01 10:46:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2025-06-01 10:46:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/130 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 84 constraints, problems are : Problem set: 0 solved, 10 unsolved in 845 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 4/4 constraints]
After SMT, in 986ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
SDD proceeding with computation,25 properties remain. new max is 8192
SDD size :1.43107e+15 after 1.99722e+30
Parikh walk visited 0 properties in 4277 ms.
Support contains 10 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 50/50 places, 80/80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2025-06-01 10:46:10] [INFO ] Invariant cache hit.
[2025-06-01 10:46:10] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-01 10:46:10] [INFO ] Invariant cache hit.
[2025-06-01 10:46:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 10:46:10] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2025-06-01 10:46:10] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-01 10:46:10] [INFO ] Invariant cache hit.
[2025-06-01 10:46:10] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 10/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 80/130 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 70 constraints, problems are : Problem set: 0 solved, 60 unsolved in 752 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 10/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 80/130 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 60/130 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 130 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1244 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2007ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2009ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2101 ms. Remains : 50/50 places, 80/80 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 10:46:12] [INFO ] Flatten gal took : 23 ms
[2025-06-01 10:46:12] [INFO ] Applying decomposition
[2025-06-01 10:46:12] [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/graph17704899005389648041.txt' '-o' '/tmp/graph17704899005389648041.bin' '-w' '/tmp/graph17704899005389648041.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17704899005389648041.bin' '-l' '-1' '-v' '-w' '/tmp/graph17704899005389648041.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:46:12] [INFO ] Decomposing Gal with order
[2025-06-01 10:46:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:46:12] [INFO ] Flatten gal took : 7 ms
[2025-06-01 10:46:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:46:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14126446376576169099.gal : 2 ms
[2025-06-01 10:46:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13172935476435995062.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/ReachabilityCardinality14126446376576169099.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13172935476435995062.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/ReachabilityCardinality13172935476435995062.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :3104 after 10755
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :10755 after 19900
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :19900 after 4.87563e+06
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :4.87563e+06 after 1.45683e+07
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :1.45683e+07 after 2.30135e+27
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,2.10258e+102,7.60872,118884,15,1419,194,339652,67,0,67,399420,0
Total reachable state count : 2.10257557806848344300596919806658484489e+102

Verifying 10 reachability properties.
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,7.61322,118884,1,0,194,339652,69,0,69,399420,0
Invariant property MIN1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,0,7.6134,118884,1,0,194,339652,70,0,69,399420,0
Invariant property MIN2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,0,7.61349,118884,1,0,194,339652,71,0,69,399420,0
Invariant property MIN4 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,0,7.61876,118884,1,0,194,339652,73,0,70,399420,0
Invariant property MIN5 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN5,0,7.61889,118884,1,0,194,339652,74,0,70,399420,0
Invariant property MIN6 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN6,0,7.61898,118884,1,0,194,339652,75,0,70,399420,0
Invariant property MIN7 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN7,0,7.61906,118884,1,0,194,339652,76,0,70,399420,0
Invariant property MIN9 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN9,0,7.61913,118884,1,0,194,339652,77,0,70,399420,0
Invariant property MIN10 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN10,0,7.61921,118884,1,0,194,339652,78,0,70,399420,0
Invariant property MIN11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN11,0,7.61929,118884,1,0,194,339652,79,0,70,399420,0
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA JoinFreeModules-PT-0200-UpperBounds-14 200 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-13 200 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-11 201 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-08 201 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-07 201 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-06 200 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-05 200 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-03 202 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-02 201 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-01 201 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0200-UpperBounds-00 201 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 11 queries.) : Max Seen:[201, 201] Max Struct:[203, 203]
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[203]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[203]
// Phase 1: matrix 104 rows 65 cols
[2025-06-01 10:46:20] [INFO ] Computed 13 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[203]
RANDOM walk for 10008 steps (2 resets) in 9 ms. (1000 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:[104] Max Struct:[203]
[2025-06-01 10:46:20] [INFO ] Invariant cache hit.
[2025-06-01 10:46:20] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:46:20] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:46:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:46:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:46:20] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2025-06-01 10:46:20] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 10:46:20] [INFO ] [Nat]Added 13 Read/Feed constraints in 26 ms returned sat
[2025-06-01 10:46:20] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-01 10:46:20] [INFO ] Added : 54 causal constraints over 12 iterations in 98 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[104] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
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:46:21] [INFO ] Computed 1 invariants in 0 ms
[2025-06-01 10:46:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 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 97 ms. Remains : 5/65 places, 8/104 transitions.
[2025-06-01 10:46:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[201] Max Struct:[203]
RANDOM walk for 1000005 steps (2 resets) in 132 ms. (7518 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 137 ms. (7246 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201] Max Struct:[203]
[2025-06-01 10:46:21] [INFO ] Invariant cache hit.
[2025-06-01 10:46:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 10:46:21] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:46:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:46:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:46:21] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-01 10:46:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:46:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 10:46:21] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:46:21] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
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:46:21] [INFO ] Invariant cache hit.
[2025-06-01 10:46:21] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-01 10:46:21] [INFO ] Invariant cache hit.
[2025-06-01 10:46:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:46:21] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2025-06-01 10:46:21] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:46:21] [INFO ] Invariant cache hit.
[2025-06-01 10:46:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 92ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 92ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-01 10:46:21] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 40161 steps (8 resets) in 13 ms. (2868 steps per ms) remains 2/2 properties
[2025-06-01 10:46:21] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:46:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7890848050732848511.gal : 1 ms
[2025-06-01 10:46:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10236802281580783612.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/ReachabilityCardinality7890848050732848511.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10236802281580783612.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (8 resets) in 19 ms. (2000 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10236802281580783612.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40003 steps (8 resets) in 20 ms. (1904 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 10755
Interrupted probabilistic random walk after 897034 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :0 out of 2
Probabilistic random walk after 897034 steps, saw 347337 distinct states, run finished after 3001 ms. (steps per millisecond=298 ) properties seen :0
[2025-06-01 10:46:24] [INFO ] Invariant cache hit.
[2025-06-01 10:46:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 10:46:24] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 51 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 29 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 83ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 17 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:46:24] [INFO ] Invariant cache hit.
[2025-06-01 10:46:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 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 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 89ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40073 steps (8 resets) in 11 ms. (3339 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 13 ms. (2857 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :10755 after 19900
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.85781e+06 after 4.87563e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.06236e+07 after 1.06334e+07
Interrupted probabilistic random walk after 4236728 steps, run timeout after 3001 ms. (steps per millisecond=1411 ) properties seen :0 out of 1
Probabilistic random walk after 4236728 steps, saw 1463210 distinct states, run finished after 3001 ms. (steps per millisecond=1411 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[201] Max Struct:[203]
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-10 in 7702 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[203]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[203]
// Phase 1: matrix 104 rows 65 cols
[2025-06-01 10:46:27] [INFO ] Computed 13 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[203]
RANDOM walk for 10054 steps (2 resets) in 10 ms. (914 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:[142] Max Struct:[203]
[2025-06-01 10:46:28] [INFO ] Invariant cache hit.
[2025-06-01 10:46:28] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:46:28] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-01 10:46:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:46:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 10:46:28] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:46:28] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 10:46:28] [INFO ] [Nat]Added 13 Read/Feed constraints in 66 ms returned sat
[2025-06-01 10:46:28] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:46:28] [INFO ] Added : 58 causal constraints over 12 iterations in 97 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[142] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
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 3 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:46:28] [INFO ] Computed 1 invariants in 1 ms
[2025-06-01 10:46:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 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 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 132ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 133ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 5/65 places, 8/104 transitions.
[2025-06-01 10:46:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[201] Max Struct:[203]
RANDOM walk for 1000000 steps (2 resets) in 144 ms. (6896 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 142 ms. (6993 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201] Max Struct:[203]
[2025-06-01 10:46:29] [INFO ] Invariant cache hit.
[2025-06-01 10:46:29] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:46:29] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:46:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:46:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:46:29] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-01 10:46:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:46:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:46:29] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:46:29] [INFO ] Added : 5 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[203]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[203]
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:46:29] [INFO ] Invariant cache hit.
[2025-06-01 10:46:29] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-01 10:46:29] [INFO ] Invariant cache hit.
[2025-06-01 10:46:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:46:29] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2025-06-01 10:46:29] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:46:29] [INFO ] Invariant cache hit.
[2025-06-01 10:46:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 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 103ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40074 steps (8 resets) in 12 ms. (3082 steps per ms) remains 2/2 properties
[2025-06-01 10:46:29] [INFO ] Flatten gal took : 3 ms
[2025-06-01 10:46:29] [INFO ] Flatten gal took : 2 ms
[2025-06-01 10:46:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15361351947866335174.gal : 1 ms
[2025-06-01 10:46:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12386632061637827574.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/ReachabilityCardinality15361351947866335174.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12386632061637827574.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/ReachabilityCardinality12386632061637827574.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
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 41 ms. (952 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 10755
Interrupted probabilistic random walk after 817903 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :0 out of 2
Probabilistic random walk after 817903 steps, saw 318734 distinct states, run finished after 3001 ms. (steps per millisecond=272 ) properties seen :0
[2025-06-01 10:46:32] [INFO ] Invariant cache hit.
[2025-06-01 10:46:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-01 10:46:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 12 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 56 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 89ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-01 10:46:32] [INFO ] Invariant cache hit.
[2025-06-01 10:46:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 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 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 79ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 79ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40103 steps (8 resets) in 11 ms. (3341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 13 ms. (2857 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :10755 after 19900
Interrupted probabilistic random walk after 4150668 steps, run timeout after 3001 ms. (steps per millisecond=1383 ) properties seen :0 out of 1
Probabilistic random walk after 4150668 steps, saw 1432577 distinct states, run finished after 3001 ms. (steps per millisecond=1383 ) properties seen :0
[2025-06-01 10:46:35] [INFO ] Invariant cache hit.
[2025-06-01 10:46:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 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]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 51ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 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:46:35] [INFO ] Invariant cache hit.
[2025-06-01 10:46:35] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-01 10:46:35] [INFO ] Invariant cache hit.
[2025-06-01 10:46:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:46:35] [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:46:35] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:46:35] [INFO ] Invariant cache hit.
[2025-06-01 10:46:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 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 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 92ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 92ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 10:46:36] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:46:36] [INFO ] Applying decomposition
[2025-06-01 10:46:36] [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/graph4062971148420131244.txt' '-o' '/tmp/graph4062971148420131244.bin' '-w' '/tmp/graph4062971148420131244.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4062971148420131244.bin' '-l' '-1' '-v' '-w' '/tmp/graph4062971148420131244.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:46:36] [INFO ] Decomposing Gal with order
[2025-06-01 10:46:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:46:36] [INFO ] Flatten gal took : 98 ms
[2025-06-01 10:46:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:46:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9269040161859213727.gal : 1 ms
[2025-06-01 10:46:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1413917817527940821.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/ReachabilityCardinality9269040161859213727.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1413917817527940821.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/ReachabilityCardinality1413917817527940821.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 :40044 after 71924
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.40838e+06 after 5.40841e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5.56369e+07 after 5.71975e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.32114e+07 after 7.34421e+07
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,7.42986e+07,33.235,440620,623,627,488744,386613,42,872528,42,1.13318e+06,0
Total reachable state count : 74298645

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,3,33.2555,440620,5,7,488744,386613,44,872528,45,1.13318e+06,0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[201] Max Struct:[203]
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-15 in 41505 ms.
[2025-06-01 10:47:09] [INFO ] Flatten gal took : 5 ms
[2025-06-01 10:47:09] [INFO ] Applying decomposition
[2025-06-01 10:47:09] [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/graph13132658499549369291.txt' '-o' '/tmp/graph13132658499549369291.bin' '-w' '/tmp/graph13132658499549369291.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13132658499549369291.bin' '-l' '-1' '-v' '-w' '/tmp/graph13132658499549369291.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:47:09] [INFO ] Decomposing Gal with order
[2025-06-01 10:47:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:47:09] [INFO ] Flatten gal took : 4 ms
[2025-06-01 10:47:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:47:09] [INFO ] Time to serialize gal into /tmp/UpperBounds14911905749397849629.gal : 1 ms
[2025-06-01 10:47:09] [INFO ] Time to serialize properties into /tmp/UpperBounds15777811503317000203.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/UpperBounds14911905749397849629.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15777811503317000203.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 ...285
Loading property file /tmp/UpperBounds15777811503317000203.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,2.10258e+102,7.42069,118068,15,1419,43,339629,55,0,65,399420,0
Total reachable state count : 2.10257557806848344300596919806658484489e+102

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property JoinFreeModules-PT-0200-UpperBounds-10 :0 <= u1.p84 <= 202
FORMULA JoinFreeModules-PT-0200-UpperBounds-10 202 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-0200-UpperBounds-10,0,7.44976,118068,1,0,82,339629,133,14,280,399420,158
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property JoinFreeModules-PT-0200-UpperBounds-15 :0 <= u7.p654 <= 202
FORMULA JoinFreeModules-PT-0200-UpperBounds-15 202 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-0200-UpperBounds-15,0,7.4503,118068,1,0,90,339629,162,14,280,399420,184
Total runtime 403761 ms.

BK_STOP 1748774837070

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

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