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.r083-tall-174860079800099.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 EisenbergMcGuire-PT-07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-174860079800099
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 8.1K 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 8.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 EisenbergMcGuire-PT-07-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748734875200

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 23:41:16] [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-05-31 23:41:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 23:41:16] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2025-05-31 23:41:16] [INFO ] Transformed 553 places.
[2025-05-31 23:41:16] [INFO ] Transformed 1960 transitions.
[2025-05-31 23:41:16] [INFO ] Found NUPN structural information;
[2025-05-31 23:41:16] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 283 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA EisenbergMcGuire-PT-07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-31 23:41:16] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
// Phase 1: matrix 1001 rows 553 cols
[2025-05-31 23:41:16] [INFO ] Computed 22 invariants in 36 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 45 ms. (217 steps per ms)
FORMULA EisenbergMcGuire-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (18 resets) in 84 ms. (1058 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-31 23:41:17] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
[2025-05-31 23:41:17] [INFO ] Invariant cache hit.
[2025-05-31 23:41:17] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2025-05-31 23:41:17] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2025-05-31 23:41:17] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2025-05-31 23:41:17] [INFO ] State equation strengthened by 472 read => feed constraints.
[2025-05-31 23:41:17] [INFO ] [Real]Added 472 Read/Feed constraints in 59 ms returned sat
[2025-05-31 23:41:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:41:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2025-05-31 23:41:18] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2025-05-31 23:41:18] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2025-05-31 23:41:18] [INFO ] [Nat]Added 472 Read/Feed constraints in 49 ms returned sat
[2025-05-31 23:41:18] [INFO ] Deduced a trap composed of 3 places in 297 ms of which 28 ms to minimize.
[2025-05-31 23:41:18] [INFO ] Deduced a trap composed of 40 places in 223 ms of which 3 ms to minimize.
[2025-05-31 23:41:19] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 3 ms to minimize.
[2025-05-31 23:41:19] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 3 ms to minimize.
[2025-05-31 23:41:19] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 3 ms to minimize.
[2025-05-31 23:41:19] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 2 ms to minimize.
[2025-05-31 23:41:20] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 3 ms to minimize.
[2025-05-31 23:41:20] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 3 ms to minimize.
[2025-05-31 23:41:20] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 3 ms to minimize.
[2025-05-31 23:41:20] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 3 ms to minimize.
[2025-05-31 23:41:20] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 3 ms to minimize.
[2025-05-31 23:41:21] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 2 ms to minimize.
[2025-05-31 23:41:21] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 2 ms to minimize.
[2025-05-31 23:41:21] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2025-05-31 23:41:21] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 2 ms to minimize.
[2025-05-31 23:41:21] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2025-05-31 23:41:21] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 3 ms to minimize.
[2025-05-31 23:41:22] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2025-05-31 23:41:22] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:41:22] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3859 ms
[2025-05-31 23:41:22] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 80 ms.
[2025-05-31 23:41:22] [INFO ] Added : 60 causal constraints over 12 iterations in 784 ms. Result :unknown
[2025-05-31 23:41:23] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2025-05-31 23:41:23] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2025-05-31 23:41:23] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2025-05-31 23:41:23] [INFO ] [Real]Added 472 Read/Feed constraints in 61 ms returned sat
[2025-05-31 23:41:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:41:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 15 ms returned sat
[2025-05-31 23:41:23] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-05-31 23:41:23] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2025-05-31 23:41:23] [INFO ] [Nat]Added 472 Read/Feed constraints in 41 ms returned sat
[2025-05-31 23:41:23] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 3 ms to minimize.
[2025-05-31 23:41:24] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 3 ms to minimize.
[2025-05-31 23:41:24] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 4 ms to minimize.
[2025-05-31 23:41:24] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 3 ms to minimize.
[2025-05-31 23:41:24] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 3 ms to minimize.
[2025-05-31 23:41:25] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 3 ms to minimize.
[2025-05-31 23:41:25] [INFO ] Deduced a trap composed of 62 places in 149 ms of which 2 ms to minimize.
[2025-05-31 23:41:25] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 2 ms to minimize.
[2025-05-31 23:41:25] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2025-05-31 23:41:25] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2025-05-31 23:41:25] [INFO ] Deduced a trap composed of 58 places in 119 ms of which 2 ms to minimize.
[2025-05-31 23:41:25] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:41:26] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2025-05-31 23:41:26] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2025-05-31 23:41:26] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2025-05-31 23:41:26] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2695 ms
[2025-05-31 23:41:26] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 86 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-31 23:41:28] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2025-05-31 23:41:28] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-05-31 23:41:28] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2025-05-31 23:41:28] [INFO ] [Real]Added 472 Read/Feed constraints in 49 ms returned sat
[2025-05-31 23:41:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:41:28] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2025-05-31 23:41:28] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2025-05-31 23:41:29] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2025-05-31 23:41:29] [INFO ] [Nat]Added 472 Read/Feed constraints in 43 ms returned sat
[2025-05-31 23:41:29] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 4 ms to minimize.
[2025-05-31 23:41:29] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 3 ms to minimize.
[2025-05-31 23:41:29] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 3 ms to minimize.
[2025-05-31 23:41:29] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 3 ms to minimize.
[2025-05-31 23:41:30] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 3 ms to minimize.
[2025-05-31 23:41:30] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 2 ms to minimize.
[2025-05-31 23:41:30] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 3 ms to minimize.
[2025-05-31 23:41:30] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 2 ms to minimize.
[2025-05-31 23:41:30] [INFO ] Deduced a trap composed of 127 places in 144 ms of which 2 ms to minimize.
[2025-05-31 23:41:31] [INFO ] Deduced a trap composed of 62 places in 148 ms of which 3 ms to minimize.
[2025-05-31 23:41:31] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2025-05-31 23:41:31] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:41:31] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2272 ms
[2025-05-31 23:41:31] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 65 ms.
[2025-05-31 23:41:33] [INFO ] Added : 205 causal constraints over 41 iterations in 2419 ms. Result :unknown
[2025-05-31 23:41:33] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-05-31 23:41:33] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-05-31 23:41:34] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2025-05-31 23:41:34] [INFO ] [Real]Added 472 Read/Feed constraints in 49 ms returned sat
[2025-05-31 23:41:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:41:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2025-05-31 23:41:34] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-05-31 23:41:34] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2025-05-31 23:41:34] [INFO ] [Nat]Added 472 Read/Feed constraints in 50 ms returned sat
[2025-05-31 23:41:34] [INFO ] Deduced a trap composed of 60 places in 166 ms of which 3 ms to minimize.
[2025-05-31 23:41:34] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 3 ms to minimize.
[2025-05-31 23:41:35] [INFO ] Deduced a trap composed of 78 places in 175 ms of which 3 ms to minimize.
[2025-05-31 23:41:35] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 2 ms to minimize.
[2025-05-31 23:41:35] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 3 ms to minimize.
[2025-05-31 23:41:35] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 3 ms to minimize.
[2025-05-31 23:41:35] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 3 ms to minimize.
[2025-05-31 23:41:36] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 3 ms to minimize.
[2025-05-31 23:41:36] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 3 ms to minimize.
[2025-05-31 23:41:36] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 2 ms to minimize.
[2025-05-31 23:41:36] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 4 ms to minimize.
[2025-05-31 23:41:36] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
[2025-05-31 23:41:36] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:41:36] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2453 ms
[2025-05-31 23:41:37] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 61 ms.
[2025-05-31 23:41:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-05-31 23:41:39] [INFO ] [Real]Absence check using 15 positive place invariants in 18 ms returned sat
[2025-05-31 23:41:39] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2025-05-31 23:41:39] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2025-05-31 23:41:39] [INFO ] [Real]Added 472 Read/Feed constraints in 61 ms returned sat
[2025-05-31 23:41:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:41:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2025-05-31 23:41:39] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 9 ms returned sat
[2025-05-31 23:41:39] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2025-05-31 23:41:39] [INFO ] [Nat]Added 472 Read/Feed constraints in 53 ms returned sat
[2025-05-31 23:41:40] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 3 ms to minimize.
[2025-05-31 23:41:40] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 3 ms to minimize.
[2025-05-31 23:41:40] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 2 ms to minimize.
[2025-05-31 23:41:40] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 2 ms to minimize.
[2025-05-31 23:41:41] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 3 ms to minimize.
[2025-05-31 23:41:41] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 3 ms to minimize.
[2025-05-31 23:41:41] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 3 ms to minimize.
[2025-05-31 23:41:41] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 3 ms to minimize.
[2025-05-31 23:41:41] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 3 ms to minimize.
[2025-05-31 23:41:42] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 3 ms to minimize.
[2025-05-31 23:41:42] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 3 ms to minimize.
[2025-05-31 23:41:42] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 1 ms to minimize.
[2025-05-31 23:41:42] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 2 ms to minimize.
[2025-05-31 23:41:42] [INFO ] Deduced a trap composed of 69 places in 168 ms of which 3 ms to minimize.
[2025-05-31 23:41:43] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2025-05-31 23:41:43] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3115 ms
[2025-05-31 23:41:43] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 59 ms.
[2025-05-31 23:41:44] [INFO ] Added : 140 causal constraints over 28 iterations in 1546 ms. Result :unknown
[2025-05-31 23:41:44] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-05-31 23:41:44] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2025-05-31 23:41:44] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2025-05-31 23:41:45] [INFO ] [Real]Added 472 Read/Feed constraints in 52 ms returned sat
[2025-05-31 23:41:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:41:45] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2025-05-31 23:41:45] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2025-05-31 23:41:45] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2025-05-31 23:41:45] [INFO ] [Nat]Added 472 Read/Feed constraints in 40 ms returned sat
[2025-05-31 23:41:45] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 3 ms to minimize.
[2025-05-31 23:41:45] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 2 ms to minimize.
[2025-05-31 23:41:45] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 3 ms to minimize.
[2025-05-31 23:41:46] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 3 ms to minimize.
[2025-05-31 23:41:46] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 2 ms to minimize.
[2025-05-31 23:41:46] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 3 ms to minimize.
[2025-05-31 23:41:46] [INFO ] Deduced a trap composed of 62 places in 146 ms of which 3 ms to minimize.
[2025-05-31 23:41:46] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
[2025-05-31 23:41:47] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2025-05-31 23:41:47] [INFO ] Deduced a trap composed of 63 places in 118 ms of which 2 ms to minimize.
[2025-05-31 23:41:47] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2025-05-31 23:41:47] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2025-05-31 23:41:47] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:41:47] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
[2025-05-31 23:41:47] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2025-05-31 23:41:47] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2469 ms
[2025-05-31 23:41:47] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 56 ms.
[2025-05-31 23:41:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
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-05-31 23:41:50] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-05-31 23:41:50] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-05-31 23:41:50] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2025-05-31 23:41:50] [INFO ] [Real]Added 472 Read/Feed constraints in 56 ms returned sat
[2025-05-31 23:41:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:41:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2025-05-31 23:41:50] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2025-05-31 23:41:50] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2025-05-31 23:41:50] [INFO ] [Nat]Added 472 Read/Feed constraints in 48 ms returned sat
[2025-05-31 23:41:50] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 3 ms to minimize.
[2025-05-31 23:41:51] [INFO ] Deduced a trap composed of 3 places in 199 ms of which 3 ms to minimize.
[2025-05-31 23:41:51] [INFO ] Deduced a trap composed of 202 places in 191 ms of which 3 ms to minimize.
[2025-05-31 23:41:51] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 2 ms to minimize.
[2025-05-31 23:41:51] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 2 ms to minimize.
[2025-05-31 23:41:52] [INFO ] Deduced a trap composed of 142 places in 207 ms of which 3 ms to minimize.
[2025-05-31 23:41:52] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 3 ms to minimize.
[2025-05-31 23:41:52] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 3 ms to minimize.
[2025-05-31 23:41:52] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 3 ms to minimize.
[2025-05-31 23:41:52] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 2 ms to minimize.
[2025-05-31 23:41:53] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2025-05-31 23:41:53] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2025-05-31 23:41:53] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:41:53] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2511 ms
[2025-05-31 23:41:53] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 69 ms.
[2025-05-31 23:41:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.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-05-31 23:41:55] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-05-31 23:41:55] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-05-31 23:41:55] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2025-05-31 23:41:55] [INFO ] [Real]Added 472 Read/Feed constraints in 50 ms returned sat
[2025-05-31 23:41:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:41:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-05-31 23:41:55] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-05-31 23:41:56] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2025-05-31 23:41:56] [INFO ] [Nat]Added 472 Read/Feed constraints in 54 ms returned sat
[2025-05-31 23:41:56] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 3 ms to minimize.
[2025-05-31 23:41:56] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 3 ms to minimize.
[2025-05-31 23:41:56] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 3 ms to minimize.
[2025-05-31 23:41:56] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 3 ms to minimize.
[2025-05-31 23:41:57] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 3 ms to minimize.
[2025-05-31 23:41:57] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 1 ms to minimize.
[2025-05-31 23:41:57] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
[2025-05-31 23:41:57] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2025-05-31 23:41:57] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2025-05-31 23:41:57] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:41:57] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:41:57] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1732 ms
[2025-05-31 23:41:57] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 57 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA EisenbergMcGuire-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 553 transition count 1953
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 546 transition count 1953
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 14 place count 546 transition count 1803
Deduced a syphon composed of 150 places in 4 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 314 place count 396 transition count 1803
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 356 place count 354 transition count 1509
Iterating global reduction 2 with 42 rules applied. Total rules applied 398 place count 354 transition count 1509
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 482 place count 312 transition count 1467
Applied a total of 482 rules in 220 ms. Remains 312 /553 variables (removed 241) and now considering 1467/1960 (removed 493) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 312/553 places, 1467/1960 transitions.
[2025-05-31 23:42:01] [INFO ] Flow matrix only has 508 transitions (discarded 959 similar events)
// Phase 1: matrix 508 rows 312 cols
[2025-05-31 23:42:01] [INFO ] Computed 22 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1568 ms. (637 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 2863 ms. (2444 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-05-31 23:42:06] [INFO ] Flow matrix only has 508 transitions (discarded 959 similar events)
[2025-05-31 23:42:06] [INFO ] Invariant cache hit.
[2025-05-31 23:42:06] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-05-31 23:42:06] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:42:06] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2025-05-31 23:42:06] [INFO ] State equation strengthened by 220 read => feed constraints.
[2025-05-31 23:42:06] [INFO ] [Real]Added 220 Read/Feed constraints in 29 ms returned sat
[2025-05-31 23:42:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-05-31 23:42:06] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-05-31 23:42:06] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-05-31 23:42:06] [INFO ] [Nat]Added 220 Read/Feed constraints in 24 ms returned sat
[2025-05-31 23:42:06] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2025-05-31 23:42:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2025-05-31 23:42:06] [INFO ] Computed and/alt/rep : 439/1061/313 causal constraints (skipped 188 transitions) in 35 ms.
[2025-05-31 23:42:07] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2025-05-31 23:42:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2025-05-31 23:42:07] [INFO ] Added : 67 causal constraints over 14 iterations in 548 ms. Result :sat
Minimization took 123 ms.
[2025-05-31 23:42:07] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-05-31 23:42:07] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:42:07] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2025-05-31 23:42:07] [INFO ] [Real]Added 220 Read/Feed constraints in 27 ms returned sat
[2025-05-31 23:42:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-05-31 23:42:07] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:42:07] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2025-05-31 23:42:07] [INFO ] [Nat]Added 220 Read/Feed constraints in 21 ms returned sat
[2025-05-31 23:42:07] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2025-05-31 23:42:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2025-05-31 23:42:07] [INFO ] Computed and/alt/rep : 439/1061/313 causal constraints (skipped 188 transitions) in 40 ms.
[2025-05-31 23:42:08] [INFO ] Added : 55 causal constraints over 11 iterations in 368 ms. Result :sat
Minimization took 114 ms.
[2025-05-31 23:42:08] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-31 23:42:08] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-05-31 23:42:08] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2025-05-31 23:42:08] [INFO ] [Real]Added 220 Read/Feed constraints in 27 ms returned sat
[2025-05-31 23:42:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:08] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-31 23:42:08] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:42:08] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2025-05-31 23:42:08] [INFO ] [Nat]Added 220 Read/Feed constraints in 24 ms returned sat
[2025-05-31 23:42:08] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2025-05-31 23:42:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2025-05-31 23:42:08] [INFO ] Computed and/alt/rep : 439/1061/313 causal constraints (skipped 188 transitions) in 37 ms.
[2025-05-31 23:42:09] [INFO ] Added : 65 causal constraints over 13 iterations in 425 ms. Result :sat
Minimization took 119 ms.
[2025-05-31 23:42:09] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-31 23:42:09] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:42:09] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2025-05-31 23:42:09] [INFO ] [Real]Added 220 Read/Feed constraints in 30 ms returned sat
[2025-05-31 23:42:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-05-31 23:42:09] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:42:09] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2025-05-31 23:42:09] [INFO ] [Nat]Added 220 Read/Feed constraints in 28 ms returned sat
[2025-05-31 23:42:09] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2025-05-31 23:42:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2025-05-31 23:42:09] [INFO ] Computed and/alt/rep : 439/1061/313 causal constraints (skipped 188 transitions) in 37 ms.
[2025-05-31 23:42:10] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 1 ms to minimize.
[2025-05-31 23:42:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2025-05-31 23:42:10] [INFO ] Added : 102 causal constraints over 21 iterations in 854 ms. Result :sat
Minimization took 133 ms.
[2025-05-31 23:42:10] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-31 23:42:10] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-05-31 23:42:11] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2025-05-31 23:42:11] [INFO ] [Real]Added 220 Read/Feed constraints in 23 ms returned sat
[2025-05-31 23:42:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:11] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-31 23:42:11] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:42:11] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2025-05-31 23:42:11] [INFO ] [Nat]Added 220 Read/Feed constraints in 22 ms returned sat
[2025-05-31 23:42:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2025-05-31 23:42:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2025-05-31 23:42:11] [INFO ] Computed and/alt/rep : 439/1061/313 causal constraints (skipped 188 transitions) in 35 ms.
[2025-05-31 23:42:11] [INFO ] Added : 81 causal constraints over 17 iterations in 532 ms. Result :sat
Minimization took 122 ms.
[2025-05-31 23:42:12] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-05-31 23:42:12] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:42:12] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2025-05-31 23:42:12] [INFO ] [Real]Added 220 Read/Feed constraints in 26 ms returned sat
[2025-05-31 23:42:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:12] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-05-31 23:42:12] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:42:12] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2025-05-31 23:42:12] [INFO ] [Nat]Added 220 Read/Feed constraints in 23 ms returned sat
[2025-05-31 23:42:12] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:42:12] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:42:12] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:42:12] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:42:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 329 ms
[2025-05-31 23:42:12] [INFO ] Computed and/alt/rep : 439/1061/313 causal constraints (skipped 188 transitions) in 34 ms.
[2025-05-31 23:42:13] [INFO ] Added : 67 causal constraints over 14 iterations in 432 ms. Result :sat
Minimization took 122 ms.
[2025-05-31 23:42:13] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-05-31 23:42:13] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:42:13] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2025-05-31 23:42:13] [INFO ] [Real]Added 220 Read/Feed constraints in 27 ms returned sat
[2025-05-31 23:42:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:13] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-05-31 23:42:13] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:42:13] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2025-05-31 23:42:13] [INFO ] [Nat]Added 220 Read/Feed constraints in 22 ms returned sat
[2025-05-31 23:42:13] [INFO ] Computed and/alt/rep : 439/1061/313 causal constraints (skipped 188 transitions) in 36 ms.
[2025-05-31 23:42:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2025-05-31 23:42:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2025-05-31 23:42:14] [INFO ] Added : 69 causal constraints over 15 iterations in 584 ms. Result :sat
Minimization took 120 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA EisenbergMcGuire-PT-07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 1467/1467 transitions.
Applied a total of 0 rules in 47 ms. Remains 312 /312 variables (removed 0) and now considering 1467/1467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 312/312 places, 1467/1467 transitions.
[2025-05-31 23:42:14] [INFO ] Flow matrix only has 508 transitions (discarded 959 similar events)
[2025-05-31 23:42:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1511 ms. (661 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 2405 ms. (2493 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-31 23:42:18] [INFO ] Flow matrix only has 508 transitions (discarded 959 similar events)
[2025-05-31 23:42:18] [INFO ] Invariant cache hit.
[2025-05-31 23:42:18] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-05-31 23:42:18] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:42:18] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2025-05-31 23:42:18] [INFO ] State equation strengthened by 220 read => feed constraints.
[2025-05-31 23:42:18] [INFO ] [Real]Added 220 Read/Feed constraints in 25 ms returned sat
[2025-05-31 23:42:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:19] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-31 23:42:19] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-05-31 23:42:19] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2025-05-31 23:42:19] [INFO ] [Nat]Added 220 Read/Feed constraints in 21 ms returned sat
[2025-05-31 23:42:19] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2025-05-31 23:42:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2025-05-31 23:42:19] [INFO ] Computed and/alt/rep : 439/1061/313 causal constraints (skipped 188 transitions) in 35 ms.
[2025-05-31 23:42:19] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:42:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2025-05-31 23:42:19] [INFO ] Added : 67 causal constraints over 14 iterations in 564 ms. Result :sat
Minimization took 124 ms.
[2025-05-31 23:42:19] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-05-31 23:42:20] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 6 ms returned sat
[2025-05-31 23:42:20] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2025-05-31 23:42:20] [INFO ] [Real]Added 220 Read/Feed constraints in 27 ms returned sat
[2025-05-31 23:42:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-05-31 23:42:20] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:42:20] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2025-05-31 23:42:20] [INFO ] [Nat]Added 220 Read/Feed constraints in 22 ms returned sat
[2025-05-31 23:42:20] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2025-05-31 23:42:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2025-05-31 23:42:20] [INFO ] Computed and/alt/rep : 439/1061/313 causal constraints (skipped 188 transitions) in 39 ms.
[2025-05-31 23:42:20] [INFO ] Added : 55 causal constraints over 11 iterations in 358 ms. Result :sat
Minimization took 117 ms.
[2025-05-31 23:42:20] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-31 23:42:20] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-05-31 23:42:21] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2025-05-31 23:42:21] [INFO ] [Real]Added 220 Read/Feed constraints in 21 ms returned sat
[2025-05-31 23:42:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:21] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-05-31 23:42:21] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:42:21] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2025-05-31 23:42:21] [INFO ] [Nat]Added 220 Read/Feed constraints in 21 ms returned sat
[2025-05-31 23:42:21] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2025-05-31 23:42:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2025-05-31 23:42:21] [INFO ] Computed and/alt/rep : 439/1061/313 causal constraints (skipped 188 transitions) in 33 ms.
[2025-05-31 23:42:21] [INFO ] Added : 65 causal constraints over 13 iterations in 410 ms. Result :sat
Minimization took 121 ms.
[2025-05-31 23:42:21] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-31 23:42:21] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:42:22] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2025-05-31 23:42:22] [INFO ] [Real]Added 220 Read/Feed constraints in 30 ms returned sat
[2025-05-31 23:42:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-05-31 23:42:22] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:42:22] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2025-05-31 23:42:22] [INFO ] [Nat]Added 220 Read/Feed constraints in 22 ms returned sat
[2025-05-31 23:42:22] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2025-05-31 23:42:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2025-05-31 23:42:22] [INFO ] Computed and/alt/rep : 439/1061/313 causal constraints (skipped 188 transitions) in 43 ms.
[2025-05-31 23:42:23] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2025-05-31 23:42:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2025-05-31 23:42:23] [INFO ] Added : 102 causal constraints over 21 iterations in 850 ms. Result :sat
Minimization took 135 ms.
[2025-05-31 23:42:23] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-31 23:42:23] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2025-05-31 23:42:23] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2025-05-31 23:42:23] [INFO ] [Real]Added 220 Read/Feed constraints in 26 ms returned sat
[2025-05-31 23:42:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-31 23:42:23] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:42:23] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2025-05-31 23:42:23] [INFO ] [Nat]Added 220 Read/Feed constraints in 22 ms returned sat
[2025-05-31 23:42:23] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2025-05-31 23:42:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2025-05-31 23:42:23] [INFO ] Computed and/alt/rep : 439/1061/313 causal constraints (skipped 188 transitions) in 34 ms.
[2025-05-31 23:42:24] [INFO ] Added : 81 causal constraints over 17 iterations in 524 ms. Result :sat
Minimization took 127 ms.
[2025-05-31 23:42:24] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-05-31 23:42:24] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-05-31 23:42:24] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2025-05-31 23:42:24] [INFO ] [Real]Added 220 Read/Feed constraints in 26 ms returned sat
[2025-05-31 23:42:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:42:24] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-31 23:42:24] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:42:24] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2025-05-31 23:42:24] [INFO ] [Nat]Added 220 Read/Feed constraints in 23 ms returned sat
[2025-05-31 23:42:24] [INFO ] Computed and/alt/rep : 439/1061/313 causal constraints (skipped 188 transitions) in 37 ms.
[2025-05-31 23:42:25] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2025-05-31 23:42:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2025-05-31 23:42:25] [INFO ] Added : 69 causal constraints over 15 iterations in 573 ms. Result :sat
Minimization took 119 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 1467/1467 transitions.
Applied a total of 0 rules in 52 ms. Remains 312 /312 variables (removed 0) and now considering 1467/1467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 312/312 places, 1467/1467 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 1467/1467 transitions.
Applied a total of 0 rules in 42 ms. Remains 312 /312 variables (removed 0) and now considering 1467/1467 (removed 0) transitions.
[2025-05-31 23:42:26] [INFO ] Flow matrix only has 508 transitions (discarded 959 similar events)
[2025-05-31 23:42:26] [INFO ] Invariant cache hit.
[2025-05-31 23:42:26] [INFO ] Implicit Places using invariants in 433 ms returned []
[2025-05-31 23:42:26] [INFO ] Flow matrix only has 508 transitions (discarded 959 similar events)
[2025-05-31 23:42:26] [INFO ] Invariant cache hit.
[2025-05-31 23:42:26] [INFO ] State equation strengthened by 220 read => feed constraints.
[2025-05-31 23:42:27] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1416 ms to find 0 implicit places.
[2025-05-31 23:42:27] [INFO ] Redundant transitions in 63 ms returned []
Running 1460 sub problems to find dead transitions.
[2025-05-31 23:42:27] [INFO ] Flow matrix only has 508 transitions (discarded 959 similar events)
[2025-05-31 23:42:27] [INFO ] Invariant cache hit.
[2025-05-31 23:42:27] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2025-05-31 23:42:36] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2025-05-31 23:42:36] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:42:36] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2025-05-31 23:42:36] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2025-05-31 23:42:36] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2025-05-31 23:42:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2025-05-31 23:42:36] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2025-05-31 23:42:36] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 1 ms to minimize.
[2025-05-31 23:42:36] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
[2025-05-31 23:42:36] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2025-05-31 23:42:37] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 1 ms to minimize.
[2025-05-31 23:42:37] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2025-05-31 23:42:37] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 1 ms to minimize.
[2025-05-31 23:42:38] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2025-05-31 23:42:38] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 1 ms to minimize.
[2025-05-31 23:42:38] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2025-05-31 23:42:38] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2025-05-31 23:42:38] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 1 ms to minimize.
[2025-05-31 23:42:38] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 1 ms to minimize.
[2025-05-31 23:42:39] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2025-05-31 23:42:39] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 1 ms to minimize.
[2025-05-31 23:42:39] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 1 ms to minimize.
[2025-05-31 23:42:40] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2025-05-31 23:42:41] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2025-05-31 23:42:41] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:42:41] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2025-05-31 23:42:41] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2025-05-31 23:42:41] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2025-05-31 23:42:42] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2025-05-31 23:42:42] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 2 ms to minimize.
[2025-05-31 23:42:42] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 2 ms to minimize.
[2025-05-31 23:42:42] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2025-05-31 23:42:42] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 2 ms to minimize.
[2025-05-31 23:42:43] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 1 ms to minimize.
[2025-05-31 23:42:43] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2025-05-31 23:42:43] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2025-05-31 23:42:43] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:42:44] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2025-05-31 23:42:44] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 2 ms to minimize.
[2025-05-31 23:42:44] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2025-05-31 23:42:56] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 2 ms to minimize.
[2025-05-31 23:42:57] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 2 ms to minimize.
[2025-05-31 23:42:57] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 2 ms to minimize.
[2025-05-31 23:42:58] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 2 ms to minimize.
[2025-05-31 23:42:58] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 1 ms to minimize.
[2025-05-31 23:42:58] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 312/820 variables, and 68 constraints, problems are : Problem set: 0 solved, 1460 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/312 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1460/1460 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 46/68 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2025-05-31 23:43:03] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 1 ms to minimize.
[2025-05-31 23:43:04] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 2 ms to minimize.
[2025-05-31 23:43:05] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 2 ms to minimize.
[2025-05-31 23:43:05] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 1 ms to minimize.
[2025-05-31 23:43:05] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2025-05-31 23:43:05] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2025-05-31 23:43:06] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 1 ms to minimize.
[2025-05-31 23:43:06] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2025-05-31 23:43:06] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2025-05-31 23:43:06] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 2 ms to minimize.
[2025-05-31 23:43:07] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 1 ms to minimize.
[2025-05-31 23:43:07] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 1 ms to minimize.
[2025-05-31 23:43:07] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 2 ms to minimize.
[2025-05-31 23:43:07] [INFO ] Deduced a trap composed of 64 places in 124 ms of which 2 ms to minimize.
[2025-05-31 23:43:07] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 2 ms to minimize.
[2025-05-31 23:43:07] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 2 ms to minimize.
[2025-05-31 23:43:07] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 2 ms to minimize.
[2025-05-31 23:43:08] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 2 ms to minimize.
[2025-05-31 23:43:08] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
[2025-05-31 23:43:09] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2025-05-31 23:43:10] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 1 ms to minimize.
[2025-05-31 23:43:12] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 1 ms to minimize.
[2025-05-31 23:43:13] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 2 ms to minimize.
[2025-05-31 23:43:14] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 2 ms to minimize.
[2025-05-31 23:43:14] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 2 ms to minimize.
[2025-05-31 23:43:14] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 2 ms to minimize.
[2025-05-31 23:43:14] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 2 ms to minimize.
[2025-05-31 23:43:14] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 2 ms to minimize.
[2025-05-31 23:43:14] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2025-05-31 23:43:15] [INFO ] Deduced a trap composed of 63 places in 151 ms of which 2 ms to minimize.
[2025-05-31 23:43:15] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 2 ms to minimize.
[2025-05-31 23:43:15] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2025-05-31 23:43:15] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 2 ms to minimize.
[2025-05-31 23:43:15] [INFO ] Deduced a trap composed of 101 places in 132 ms of which 2 ms to minimize.
[2025-05-31 23:43:15] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 2 ms to minimize.
[2025-05-31 23:43:16] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 2 ms to minimize.
[2025-05-31 23:43:16] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 2 ms to minimize.
[2025-05-31 23:43:16] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2025-05-31 23:43:16] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 2 ms to minimize.
[2025-05-31 23:43:16] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 1460 unsolved
[2025-05-31 23:43:23] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2025-05-31 23:43:26] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 2 ms to minimize.
[2025-05-31 23:43:26] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:43:27] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2025-05-31 23:43:27] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:43:27] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:43:27] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:43:27] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2025-05-31 23:43:28] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 2 ms to minimize.
[2025-05-31 23:43:28] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 1 ms to minimize.
SMT process timed out in 60908ms, After SMT, problems are : Problem set: 0 solved, 1460 unsolved
Search for dead transitions found 0 dead transitions in 60933ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62480 ms. Remains : 312/312 places, 1467/1467 transitions.
RANDOM walk for 40000 steps (8 resets) in 1643 ms. (24 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 12/12 properties
[2025-05-31 23:43:29] [INFO ] Flatten gal took : 182 ms
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 12/12 properties
[2025-05-31 23:43:29] [INFO ] Flatten gal took : 84 ms
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 12/12 properties
[2025-05-31 23:43:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3946501498008547377.gal : 37 ms
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
[2025-05-31 23:43:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3179802343586114793.prop : 20 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/ReachabilityCardinality3946501498008547377.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3179802343586114793.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 12/12 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 12/12 properties
Loading property file /tmp/ReachabilityCardinality3179802343586114793.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :7 after 20
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :20 after 24
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :24 after 28
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :28 after 86
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :86 after 321
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :321 after 822
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :822 after 3307
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :3307 after 8771
Interrupted probabilistic random walk after 423672 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :10 out of 12
Probabilistic random walk after 423672 steps, saw 177781 distinct states, run finished after 3004 ms. (steps per millisecond=141 ) properties seen :10
[2025-05-31 23:43:32] [INFO ] Flow matrix only has 508 transitions (discarded 959 similar events)
[2025-05-31 23:43:32] [INFO ] Invariant cache hit.
[2025-05-31 23:43:32] [INFO ] State equation strengthened by 220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:43:32] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 196/510 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/510 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 12/522 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/522 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 298/820 variables, 208/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/820 variables, 188/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/820 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/820 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/820 variables, and 555 constraints, problems are : Problem set: 0 solved, 2 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 312/312 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 196/510 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/510 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 12/522 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/522 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/522 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 298/820 variables, 208/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/820 variables, 188/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:43:33] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/820 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/820 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/820 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 820/820 variables, and 558 constraints, problems are : Problem set: 0 solved, 2 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 312/312 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 821ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 156 ms.
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 1467/1467 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 312 transition count 1463
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 308 transition count 1463
Applied a total of 8 rules in 41 ms. Remains 308 /312 variables (removed 4) and now considering 1463/1467 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 308/312 places, 1463/1467 transitions.
RANDOM walk for 40000 steps (8 resets) in 253 ms. (157 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :8771 after 16168
Interrupted probabilistic random walk after 415192 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 2
Probabilistic random walk after 415192 steps, saw 170277 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
[2025-05-31 23:43:36] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2025-05-31 23:43:36] [INFO ] Computed 22 invariants in 7 ms
[2025-05-31 23:43:36] [INFO ] State equation strengthened by 220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:43:36] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 294/812 variables, 204/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 188/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 551 constraints, problems are : Problem set: 0 solved, 2 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:43:37] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/518 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 294/812 variables, 204/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 188/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:43:37] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/812 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/812 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 555 constraints, problems are : Problem set: 0 solved, 2 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 975ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 145 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 33 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 33 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2025-05-31 23:43:37] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2025-05-31 23:43:37] [INFO ] Invariant cache hit.
[2025-05-31 23:43:38] [INFO ] Implicit Places using invariants in 275 ms returned []
[2025-05-31 23:43:38] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2025-05-31 23:43:38] [INFO ] Invariant cache hit.
[2025-05-31 23:43:38] [INFO ] State equation strengthened by 220 read => feed constraints.
[2025-05-31 23:43:39] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
[2025-05-31 23:43:39] [INFO ] Redundant transitions in 74 ms returned []
Running 1456 sub problems to find dead transitions.
[2025-05-31 23:43:39] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2025-05-31 23:43:39] [INFO ] Invariant cache hit.
[2025-05-31 23:43:39] [INFO ] State equation strengthened by 220 read => feed constraints.
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :16168 after 60494
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-05-31 23:43:47] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 2 ms to minimize.
[2025-05-31 23:43:48] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:43:48] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2025-05-31 23:43:48] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 2 ms to minimize.
[2025-05-31 23:43:48] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:43:48] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2025-05-31 23:43:48] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:43:48] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2025-05-31 23:43:48] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 2 ms to minimize.
[2025-05-31 23:43:48] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2025-05-31 23:43:49] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
[2025-05-31 23:43:49] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
[2025-05-31 23:43:49] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2025-05-31 23:43:49] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2025-05-31 23:43:50] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 2 ms to minimize.
[2025-05-31 23:43:50] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 32768
SDD size :60494 after 110821
[2025-05-31 23:43:51] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 1 ms to minimize.
[2025-05-31 23:43:51] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2025-05-31 23:43:51] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 2 ms to minimize.
[2025-05-31 23:43:51] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-05-31 23:43:52] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2025-05-31 23:43:53] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 4 ms to minimize.
[2025-05-31 23:43:53] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 1 ms to minimize.
[2025-05-31 23:43:53] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 2 ms to minimize.
[2025-05-31 23:43:54] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2025-05-31 23:43:54] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 1 ms to minimize.
[2025-05-31 23:43:54] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:43:55] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2025-05-31 23:43:56] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 2 ms to minimize.
[2025-05-31 23:43:56] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2025-05-31 23:43:56] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:43:56] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2025-05-31 23:43:56] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:43:57] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 1 ms to minimize.
[2025-05-31 23:43:57] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2025-05-31 23:43:57] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 1 ms to minimize.
[2025-05-31 23:43:57] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 2 ms to minimize.
[2025-05-31 23:43:57] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 2 ms to minimize.
[2025-05-31 23:43:57] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2025-05-31 23:43:57] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
SDD proceeding with computation,12 properties remain. new max is 65536
SDD size :110821 after 417013
[2025-05-31 23:44:08] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2025-05-31 23:44:09] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 64 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 42/64 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-05-31 23:44:15] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2025-05-31 23:44:15] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 2 ms to minimize.
[2025-05-31 23:44:15] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:44:15] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:44:15] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 2 ms to minimize.
[2025-05-31 23:44:15] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2025-05-31 23:44:16] [INFO ] Deduced a trap composed of 75 places in 123 ms of which 1 ms to minimize.
[2025-05-31 23:44:16] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 1 ms to minimize.
[2025-05-31 23:44:16] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 2 ms to minimize.
[2025-05-31 23:44:16] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 2 ms to minimize.
[2025-05-31 23:44:16] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:44:16] [INFO ] Deduced a trap composed of 60 places in 124 ms of which 2 ms to minimize.
[2025-05-31 23:44:16] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 2 ms to minimize.
[2025-05-31 23:44:17] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 1 ms to minimize.
[2025-05-31 23:44:17] [INFO ] Deduced a trap composed of 69 places in 126 ms of which 1 ms to minimize.
[2025-05-31 23:44:17] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:44:17] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 1 ms to minimize.
[2025-05-31 23:44:18] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 2 ms to minimize.
[2025-05-31 23:44:18] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 2 ms to minimize.
[2025-05-31 23:44:18] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Detected timeout of ITS tools.
[2025-05-31 23:44:19] [INFO ] Flatten gal took : 64 ms
[2025-05-31 23:44:19] [INFO ] Applying decomposition
[2025-05-31 23:44:19] [INFO ] Flatten gal took : 50 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/graph4900282938377700816.txt' '-o' '/tmp/graph4900282938377700816.bin' '-w' '/tmp/graph4900282938377700816.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4900282938377700816.bin' '-l' '-1' '-v' '-w' '/tmp/graph4900282938377700816.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:44:19] [INFO ] Decomposing Gal with order
[2025-05-31 23:44:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:44:19] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 2 ms to minimize.
[2025-05-31 23:44:20] [INFO ] Removed a total of 2956 redundant transitions.
[2025-05-31 23:44:20] [INFO ] Flatten gal took : 256 ms
[2025-05-31 23:44:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 401 labels/synchronizations in 78 ms.
[2025-05-31 23:44:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12014295836389344505.gal : 28 ms
[2025-05-31 23:44:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9908733602985310479.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/ReachabilityCardinality12014295836389344505.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9908733602985310479.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality9908733602985310479.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 64
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :64 after 377
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :377 after 1277
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1277 after 5535
[2025-05-31 23:44:23] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 2 ms to minimize.
[2025-05-31 23:44:23] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 2 ms to minimize.
[2025-05-31 23:44:24] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 1 ms to minimize.
[2025-05-31 23:44:24] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 2 ms to minimize.
[2025-05-31 23:44:24] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 1 ms to minimize.
[2025-05-31 23:44:25] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 2 ms to minimize.
[2025-05-31 23:44:25] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
[2025-05-31 23:44:25] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 2 ms to minimize.
[2025-05-31 23:44:25] [INFO ] Deduced a trap composed of 71 places in 127 ms of which 1 ms to minimize.
[2025-05-31 23:44:25] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 1 ms to minimize.
[2025-05-31 23:44:25] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 2 ms to minimize.
[2025-05-31 23:44:25] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 1 ms to minimize.
[2025-05-31 23:44:26] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :5535 after 276864
[2025-05-31 23:44:27] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 1 ms to minimize.
[2025-05-31 23:44:27] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 2 ms to minimize.
[2025-05-31 23:44:27] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 2 ms to minimize.
[2025-05-31 23:44:27] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 1 ms to minimize.
[2025-05-31 23:44:28] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 2 ms to minimize.
[2025-05-31 23:44:28] [INFO ] Deduced a trap composed of 71 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-05-31 23:44:33] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 1 ms to minimize.
[2025-05-31 23:44:33] [INFO ] Deduced a trap composed of 52 places in 120 ms of which 1 ms to minimize.
[2025-05-31 23:44:33] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 1 ms to minimize.
[2025-05-31 23:44:33] [INFO ] Deduced a trap composed of 54 places in 118 ms of which 1 ms to minimize.
[2025-05-31 23:44:35] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :276864 after 1.513e+06
[2025-05-31 23:44:36] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 0 ms to minimize.
[2025-05-31 23:44:36] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:44:36] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 2 ms to minimize.
[2025-05-31 23:44:37] [INFO ] Deduced a trap composed of 57 places in 127 ms of which 2 ms to minimize.
[2025-05-31 23:44:37] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 2 ms to minimize.
[2025-05-31 23:44:37] [INFO ] Deduced a trap composed of 70 places in 149 ms of which 2 ms to minimize.
[2025-05-31 23:44:38] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:44:39] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:44:39] [INFO ] Deduced a trap composed of 67 places in 165 ms of which 1 ms to minimize.
[2025-05-31 23:44:39] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 2 ms to minimize.
[2025-05-31 23:44:39] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 120 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 98/98 constraints]
After SMT, in 60879ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 60897ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62271 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1349 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 3 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 99 transition count 218
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 370 place count 99 transition count 176
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 386 place count 91 transition count 193
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 393 place count 91 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 400 place count 91 transition count 179
Free-agglomeration rule applied 38 times.
Iterating global reduction 4 with 38 rules applied. Total rules applied 438 place count 91 transition count 141
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 4 with 38 rules applied. Total rules applied 476 place count 53 transition count 141
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 486 place count 53 transition count 141
Applied a total of 486 rules in 38 ms. Remains 53 /308 variables (removed 255) and now considering 141/1463 (removed 1322) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 141 rows 53 cols
[2025-05-31 23:44:40] [INFO ] Computed 15 invariants in 1 ms
[2025-05-31 23:44:40] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-05-31 23:44:40] [INFO ] After 180ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2025-05-31 23:44:40] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-31 23:44:40] [INFO ] After 8ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 23:44:40] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 23:44:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-05-31 23:44:40] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-05-31 23:44:40] [INFO ] After 8ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 23:44:40] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-31 23:44:40] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-31 23:44:40] [INFO ] Flatten gal took : 5 ms
[2025-05-31 23:44:40] [INFO ] Flatten gal took : 5 ms
[2025-05-31 23:44:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8098848027702816219.gal : 2 ms
[2025-05-31 23:44:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16209994080193057397.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/ReachabilityCardinality8098848027702816219.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16209994080193057397.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/ReachabilityCardinality16209994080193057397.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :12 after 48
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :48 after 220
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :220 after 271
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :271 after 334
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :334 after 1000
Invariant property MIN5 does not hold.
Reachability property MAX5 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5625,0.024115,5204,2,151,12,1633,6,0,356,1102,0
Total reachable state count : 5625

Verifying 2 reachability properties.
Reachability property MAX5 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
MAX5,375,0.024404,5204,2,119,12,1633,7,0,359,1102,0
Invariant property MIN5 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
MIN5,375,0.024767,5204,2,119,12,1633,8,0,360,1102,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 468 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA EisenbergMcGuire-PT-07-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-07-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-07-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-07-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-07-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 5 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for EisenbergMcGuire-PT-07-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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:44:40] [INFO ] Flow matrix only has 508 transitions (discarded 959 similar events)
// Phase 1: matrix 508 rows 312 cols
[2025-05-31 23:44:40] [INFO ] Computed 22 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:44:40] [INFO ] Flow matrix only has 508 transitions (discarded 959 similar events)
[2025-05-31 23:44:40] [INFO ] Invariant cache hit.
[2025-05-31 23:44:40] [INFO ] [Real]Absence check using 15 positive place invariants in 21 ms returned sat
[2025-05-31 23:44:40] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:44:40] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2025-05-31 23:44:41] [INFO ] State equation strengthened by 220 read => feed constraints.
[2025-05-31 23:44:41] [INFO ] [Real]Added 220 Read/Feed constraints in 27 ms returned sat
[2025-05-31 23:44:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:44:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-05-31 23:44:41] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 6 ms returned sat
[2025-05-31 23:44:41] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2025-05-31 23:44:41] [INFO ] [Nat]Added 220 Read/Feed constraints in 22 ms returned sat
[2025-05-31 23:44:41] [INFO ] Computed and/alt/rep : 439/1061/313 causal constraints (skipped 188 transitions) in 35 ms.
[2025-05-31 23:44:41] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2025-05-31 23:44:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2025-05-31 23:44:41] [INFO ] Added : 69 causal constraints over 15 iterations in 575 ms. Result :sat
Minimization took 120 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 312 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p37_3_0) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 1466/1466 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 312 transition count 1462
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 308 transition count 1462
Applied a total of 8 rules in 39 ms. Remains 308 /312 variables (removed 4) and now considering 1462/1466 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 308/312 places, 1462/1466 transitions.
[2025-05-31 23:44:42] [INFO ] Flow matrix only has 503 transitions (discarded 959 similar events)
// Phase 1: matrix 503 rows 308 cols
[2025-05-31 23:44:42] [INFO ] Computed 22 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1567 ms. (637 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 409 ms. (2439 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:44:44] [INFO ] Flow matrix only has 503 transitions (discarded 959 similar events)
[2025-05-31 23:44:44] [INFO ] Invariant cache hit.
[2025-05-31 23:44:44] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-05-31 23:44:44] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:44:44] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2025-05-31 23:44:44] [INFO ] State equation strengthened by 220 read => feed constraints.
[2025-05-31 23:44:44] [INFO ] [Real]Added 220 Read/Feed constraints in 27 ms returned sat
[2025-05-31 23:44:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:44:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-05-31 23:44:44] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 23:44:44] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2025-05-31 23:44:44] [INFO ] [Nat]Added 220 Read/Feed constraints in 27 ms returned sat
[2025-05-31 23:44:44] [INFO ] Computed and/alt/rep : 435/1056/309 causal constraints (skipped 187 transitions) in 34 ms.
[2025-05-31 23:44:44] [INFO ] Added : 19 causal constraints over 4 iterations in 175 ms. Result :sat
Minimization took 120 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1462/1462 transitions.
Applied a total of 0 rules in 41 ms. Remains 308 /308 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 308/308 places, 1462/1462 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1462/1462 transitions.
Applied a total of 0 rules in 29 ms. Remains 308 /308 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
[2025-05-31 23:44:44] [INFO ] Flow matrix only has 503 transitions (discarded 959 similar events)
[2025-05-31 23:44:44] [INFO ] Invariant cache hit.
[2025-05-31 23:44:45] [INFO ] Implicit Places using invariants in 258 ms returned []
[2025-05-31 23:44:45] [INFO ] Flow matrix only has 503 transitions (discarded 959 similar events)
[2025-05-31 23:44:45] [INFO ] Invariant cache hit.
[2025-05-31 23:44:45] [INFO ] State equation strengthened by 220 read => feed constraints.
[2025-05-31 23:44:46] [INFO ] Implicit Places using invariants and state equation in 1043 ms returned []
Implicit Place search using SMT with State Equation took 1320 ms to find 0 implicit places.
[2025-05-31 23:44:46] [INFO ] Redundant transitions in 32 ms returned []
Running 1455 sub problems to find dead transitions.
[2025-05-31 23:44:46] [INFO ] Flow matrix only has 503 transitions (discarded 959 similar events)
[2025-05-31 23:44:46] [INFO ] Invariant cache hit.
[2025-05-31 23:44:46] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/307 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
[2025-05-31 23:44:54] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:44:54] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2025-05-31 23:44:54] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:44:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2025-05-31 23:44:54] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:44:56] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2025-05-31 23:44:56] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2025-05-31 23:44:56] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:44:57] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2025-05-31 23:44:57] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:44:57] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:44:59] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2025-05-31 23:44:59] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:45:00] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:45:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2025-05-31 23:45:01] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:45:02] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:45:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2025-05-31 23:45:02] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 0 ms to minimize.
[2025-05-31 23:45:02] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
[2025-05-31 23:45:10] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2025-05-31 23:45:10] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2025-05-31 23:45:11] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:45:11] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:45:11] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:45:11] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 307/811 variables, and 45 constraints, problems are : Problem set: 0 solved, 1455 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1455/1455 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/307 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
[2025-05-31 23:45:21] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 1 ms to minimize.
[2025-05-31 23:45:25] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 1 ms to minimize.
[2025-05-31 23:45:29] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:45:29] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2025-05-31 23:45:29] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2025-05-31 23:45:30] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
[2025-05-31 23:45:39] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2025-05-31 23:45:39] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2025-05-31 23:45:39] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 2 ms to minimize.
[2025-05-31 23:45:39] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:45:39] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
[2025-05-31 23:45:39] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 2 ms to minimize.
[2025-05-31 23:45:39] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2025-05-31 23:45:40] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 4 ms to minimize.
[2025-05-31 23:45:40] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 2 ms to minimize.
[2025-05-31 23:45:40] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:45:40] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 2 ms to minimize.
[2025-05-31 23:45:40] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 2 ms to minimize.
[2025-05-31 23:45:40] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 2 ms to minimize.
[2025-05-31 23:45:41] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:45:41] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 2 ms to minimize.
[2025-05-31 23:45:41] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 2 ms to minimize.
[2025-05-31 23:45:41] [INFO ] Deduced a trap composed of 71 places in 142 ms of which 1 ms to minimize.
[2025-05-31 23:45:41] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 2 ms to minimize.
[2025-05-31 23:45:41] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 2 ms to minimize.
[2025-05-31 23:45:41] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 307/811 variables, and 71 constraints, problems are : Problem set: 0 solved, 1455 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1455 constraints, Known Traps: 52/52 constraints]
After SMT, in 60724ms problems are : Problem set: 0 solved, 1455 unsolved
Search for dead transitions found 0 dead transitions in 60738ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62125 ms. Remains : 308/308 places, 1462/1462 transitions.
[2025-05-31 23:45:47] [INFO ] Flatten gal took : 60 ms
RANDOM walk for 40000 steps (8 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
[2025-05-31 23:45:47] [INFO ] Flatten gal took : 43 ms
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
[2025-05-31 23:45:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7385094724533996178.gal : 11 ms
[2025-05-31 23:45:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16937879113982782130.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/ReachabilityCardinality7385094724533996178.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16937879113982782130.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 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/ReachabilityCardinality16937879113982782130.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 10
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :10 after 40
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :40 after 65
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :65 after 98
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :98 after 319
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :319 after 786
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :786 after 2892
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2892 after 4608
Interrupted probabilistic random walk after 359560 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 2
Probabilistic random walk after 359560 steps, saw 154056 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
[2025-05-31 23:45:50] [INFO ] Flow matrix only has 503 transitions (discarded 959 similar events)
[2025-05-31 23:45:50] [INFO ] Invariant cache hit.
[2025-05-31 23:45:50] [INFO ] State equation strengthened by 220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:45:50] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 71/114 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 79/193 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 120/313 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/313 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/313 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 192/505 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 12/517 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 294/811 variables, 204/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/811 variables, 188/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/811 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/811 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 811/811 variables, and 551 constraints, problems are : Problem set: 0 solved, 2 unsolved in 389 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 71/114 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 79/193 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 120/313 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/313 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/313 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 192/505 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 12/517 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:45:50] [INFO ] Deduced a trap composed of 62 places in 150 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/517 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/517 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 294/811 variables, 204/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/811 variables, 188/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:45:51] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/811 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/811 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/811 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 811/811 variables, and 555 constraints, problems are : Problem set: 0 solved, 2 unsolved in 674 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1079ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 164 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1462/1462 transitions.
Applied a total of 0 rules in 41 ms. Remains 308 /308 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 308/308 places, 1462/1462 transitions.
RANDOM walk for 40000 steps (8 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4608 after 11929
Interrupted probabilistic random walk after 402528 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 2
Probabilistic random walk after 402528 steps, saw 166913 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
[2025-05-31 23:45:54] [INFO ] Flow matrix only has 503 transitions (discarded 959 similar events)
[2025-05-31 23:45:54] [INFO ] Invariant cache hit.
[2025-05-31 23:45:54] [INFO ] State equation strengthened by 220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:45:54] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 71/114 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 79/193 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 120/313 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/313 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/313 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 192/505 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 12/517 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 294/811 variables, 204/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/811 variables, 188/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/811 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/811 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 811/811 variables, and 551 constraints, problems are : Problem set: 0 solved, 2 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 71/114 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 79/193 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 120/313 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/313 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/313 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 192/505 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 12/517 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/517 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:45:55] [INFO ] Deduced a trap composed of 62 places in 157 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/517 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/517 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 294/811 variables, 204/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/811 variables, 188/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:45:55] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/811 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/811 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/811 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 811/811 variables, and 555 constraints, problems are : Problem set: 0 solved, 2 unsolved in 655 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1069ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 136 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1462/1462 transitions.
Applied a total of 0 rules in 43 ms. Remains 308 /308 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 308/308 places, 1462/1462 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1462/1462 transitions.
Applied a total of 0 rules in 31 ms. Remains 308 /308 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
[2025-05-31 23:45:55] [INFO ] Flow matrix only has 503 transitions (discarded 959 similar events)
[2025-05-31 23:45:55] [INFO ] Invariant cache hit.
[2025-05-31 23:45:56] [INFO ] Implicit Places using invariants in 263 ms returned []
[2025-05-31 23:45:56] [INFO ] Flow matrix only has 503 transitions (discarded 959 similar events)
[2025-05-31 23:45:56] [INFO ] Invariant cache hit.
[2025-05-31 23:45:56] [INFO ] State equation strengthened by 220 read => feed constraints.
[2025-05-31 23:45:57] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1284 ms to find 0 implicit places.
[2025-05-31 23:45:57] [INFO ] Redundant transitions in 24 ms returned []
Running 1455 sub problems to find dead transitions.
[2025-05-31 23:45:57] [INFO ] Flow matrix only has 503 transitions (discarded 959 similar events)
[2025-05-31 23:45:57] [INFO ] Invariant cache hit.
[2025-05-31 23:45:57] [INFO ] State equation strengthened by 220 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :11929 after 53940
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/307 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
[2025-05-31 23:46:05] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2025-05-31 23:46:05] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2025-05-31 23:46:05] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:46:05] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2025-05-31 23:46:05] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :53940 after 97924
[2025-05-31 23:46:07] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2025-05-31 23:46:07] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2025-05-31 23:46:07] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2025-05-31 23:46:08] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2025-05-31 23:46:08] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2025-05-31 23:46:08] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2025-05-31 23:46:10] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:46:11] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:46:12] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:46:12] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2025-05-31 23:46:12] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:46:13] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2025-05-31 23:46:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2025-05-31 23:46:13] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 0 ms to minimize.
[2025-05-31 23:46:14] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
[2025-05-31 23:46:21] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2025-05-31 23:46:22] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 1 ms to minimize.
[2025-05-31 23:46:22] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:46:22] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:46:22] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:46:22] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :97924 after 327135
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 307/811 variables, and 45 constraints, problems are : Problem set: 0 solved, 1455 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1455/1455 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/307 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
[2025-05-31 23:46:32] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 1 ms to minimize.
[2025-05-31 23:46:36] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2025-05-31 23:46:37] [INFO ] Flatten gal took : 46 ms
[2025-05-31 23:46:37] [INFO ] Applying decomposition
[2025-05-31 23:46:37] [INFO ] Flatten gal took : 42 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/graph18068469739544715324.txt' '-o' '/tmp/graph18068469739544715324.bin' '-w' '/tmp/graph18068469739544715324.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18068469739544715324.bin' '-l' '-1' '-v' '-w' '/tmp/graph18068469739544715324.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:46:37] [INFO ] Decomposing Gal with order
[2025-05-31 23:46:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:46:37] [INFO ] Removed a total of 2963 redundant transitions.
[2025-05-31 23:46:37] [INFO ] Flatten gal took : 108 ms
[2025-05-31 23:46:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 366 labels/synchronizations in 52 ms.
[2025-05-31 23:46:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16373706537432286831.gal : 13 ms
[2025-05-31 23:46:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7344740025718542999.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/ReachabilityCardinality16373706537432286831.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7344740025718542999.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality7344740025718542999.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3797
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3797 after 20347
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :20347 after 80040
[2025-05-31 23:46:40] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:46:40] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2025-05-31 23:46:40] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2025-05-31 23:46:41] [INFO ] Deduced a trap composed of 70 places in 137 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :80040 after 226666
[2025-05-31 23:46:50] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:46:50] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2025-05-31 23:46:50] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 2 ms to minimize.
[2025-05-31 23:46:50] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:46:50] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 2 ms to minimize.
[2025-05-31 23:46:50] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 2 ms to minimize.
[2025-05-31 23:46:50] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2025-05-31 23:46:51] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 2 ms to minimize.
[2025-05-31 23:46:51] [INFO ] Deduced a trap composed of 62 places in 125 ms of which 3 ms to minimize.
[2025-05-31 23:46:51] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:46:51] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 2 ms to minimize.
[2025-05-31 23:46:51] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 2 ms to minimize.
[2025-05-31 23:46:51] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 1 ms to minimize.
[2025-05-31 23:46:51] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:46:52] [INFO ] Deduced a trap composed of 70 places in 127 ms of which 2 ms to minimize.
[2025-05-31 23:46:52] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 2 ms to minimize.
[2025-05-31 23:46:52] [INFO ] Deduced a trap composed of 71 places in 127 ms of which 1 ms to minimize.
[2025-05-31 23:46:52] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 2 ms to minimize.
[2025-05-31 23:46:52] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 1 ms to minimize.
[2025-05-31 23:46:52] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 1455 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 307/811 variables, and 71 constraints, problems are : Problem set: 0 solved, 1455 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1455 constraints, Known Traps: 52/52 constraints]
After SMT, in 60783ms problems are : Problem set: 0 solved, 1455 unsolved
Search for dead transitions found 0 dead transitions in 60800ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62154 ms. Remains : 308/308 places, 1462/1462 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1349 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 315
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 315
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 300
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 300
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 99 transition count 217
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 370 place count 99 transition count 175
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 386 place count 91 transition count 192
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 393 place count 91 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 400 place count 91 transition count 178
Free-agglomeration rule applied 38 times.
Iterating global reduction 4 with 38 rules applied. Total rules applied 438 place count 91 transition count 140
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 4 with 38 rules applied. Total rules applied 476 place count 53 transition count 140
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 486 place count 53 transition count 140
Applied a total of 486 rules in 21 ms. Remains 53 /308 variables (removed 255) and now considering 140/1462 (removed 1322) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 140 rows 53 cols
[2025-05-31 23:46:57] [INFO ] Computed 15 invariants in 1 ms
[2025-05-31 23:46:57] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-05-31 23:46:58] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2025-05-31 23:46:58] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-31 23:46:58] [INFO ] After 8ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 23:46:58] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 23:46:58] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-05-31 23:46:58] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-05-31 23:46:58] [INFO ] After 7ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 23:46:58] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-31 23:46:58] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-31 23:46:58] [INFO ] Flatten gal took : 4 ms
[2025-05-31 23:46:58] [INFO ] Flatten gal took : 3 ms
[2025-05-31 23:46:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15088408296413845351.gal : 2 ms
[2025-05-31 23:46:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12803986229240621347.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/ReachabilityCardinality15088408296413845351.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12803986229240621347.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/ReachabilityCardinality12803986229240621347.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :12 after 48
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :48 after 114
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :114 after 139
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :139 after 179
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :179 after 6250
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :6250 after 18125
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,984375,0.032643,5196,2,227,12,2559,8,0,354,1678,0
Total reachable state count : 984375

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,4375,0.032958,5196,2,154,12,2559,8,0,356,1678,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,4375,0.033113,5196,2,154,12,2559,8,0,356,1678,0
Over-approximation ignoring read arcs solved 0 properties in 210 ms.
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:[0] Max Struct:[1]
Ending property specific reduction for EisenbergMcGuire-PT-07-UpperBounds-15 in 137453 ms.
[2025-05-31 23:46:58] [INFO ] Flatten gal took : 36 ms
[2025-05-31 23:46:58] [INFO ] Applying decomposition
[2025-05-31 23:46:58] [INFO ] Flatten gal took : 35 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/graph15734797871744175555.txt' '-o' '/tmp/graph15734797871744175555.bin' '-w' '/tmp/graph15734797871744175555.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15734797871744175555.bin' '-l' '-1' '-v' '-w' '/tmp/graph15734797871744175555.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:46:58] [INFO ] Decomposing Gal with order
[2025-05-31 23:46:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:46:58] [INFO ] Removed a total of 2918 redundant transitions.
[2025-05-31 23:46:58] [INFO ] Flatten gal took : 96 ms
[2025-05-31 23:46:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 415 labels/synchronizations in 27 ms.
[2025-05-31 23:46:58] [INFO ] Time to serialize gal into /tmp/UpperBounds5023583227514092543.gal : 11 ms
[2025-05-31 23:46:58] [INFO ] Time to serialize properties into /tmp/UpperBounds7303501767671538748.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/UpperBounds5023583227514092543.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7303501767671538748.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds7303501767671538748.prop.
ITS-tools command line returned an error code 137
[2025-06-01 00:02:49] [INFO ] Applying decomposition
[2025-06-01 00:02:49] [INFO ] Flatten gal took : 35 ms
[2025-06-01 00:02:49] [INFO ] Decomposing Gal with order
[2025-06-01 00:02:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 00:02:49] [INFO ] Removed a total of 3363 redundant transitions.
[2025-06-01 00:02:49] [INFO ] Flatten gal took : 103 ms
[2025-06-01 00:02:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 15 ms.
[2025-06-01 00:02:49] [INFO ] Time to serialize gal into /tmp/UpperBounds4222694198977794163.gal : 8 ms
[2025-06-01 00:02:49] [INFO ] Time to serialize properties into /tmp/UpperBounds10328665726214152531.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/UpperBounds4222694198977794163.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10328665726214152531.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds10328665726214152531.prop.
ITS-tools command line returned an error code 137
[2025-06-01 00:20:04] [INFO ] Flatten gal took : 40 ms
[2025-06-01 00:20:04] [INFO ] Input system was already deterministic with 1467 transitions.
[2025-06-01 00:20:04] [INFO ] Transformed 312 places.
[2025-06-01 00:20:04] [INFO ] Transformed 1467 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-01 00:20:05] [INFO ] Time to serialize gal into /tmp/UpperBounds3665160114806047300.gal : 6 ms
[2025-06-01 00:20:05] [INFO ] Time to serialize properties into /tmp/UpperBounds18166306271774450904.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/UpperBounds3665160114806047300.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18166306271774450904.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds18166306271774450904.prop.
ITS-tools command line returned an error code 137
Total runtime 3158477 ms.

BK_STOP 1748738035164

--------------------
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="EisenbergMcGuire-PT-07"
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 EisenbergMcGuire-PT-07, 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 r083-tall-174860079800099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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