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.r069-smll-174854075900047.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 DES-PT-60b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-174854075900047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 139K 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 DES-PT-60b-UpperBounds-00
FORMULA_NAME DES-PT-60b-UpperBounds-01
FORMULA_NAME DES-PT-60b-UpperBounds-02
FORMULA_NAME DES-PT-60b-UpperBounds-03
FORMULA_NAME DES-PT-60b-UpperBounds-04
FORMULA_NAME DES-PT-60b-UpperBounds-05
FORMULA_NAME DES-PT-60b-UpperBounds-06
FORMULA_NAME DES-PT-60b-UpperBounds-07
FORMULA_NAME DES-PT-60b-UpperBounds-08
FORMULA_NAME DES-PT-60b-UpperBounds-09
FORMULA_NAME DES-PT-60b-UpperBounds-10
FORMULA_NAME DES-PT-60b-UpperBounds-11
FORMULA_NAME DES-PT-60b-UpperBounds-12
FORMULA_NAME DES-PT-60b-UpperBounds-13
FORMULA_NAME DES-PT-60b-UpperBounds-14
FORMULA_NAME DES-PT-60b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748604759995

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 11:32:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 11:32:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:32:42] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2025-05-30 11:32:42] [INFO ] Transformed 519 places.
[2025-05-30 11:32:42] [INFO ] Transformed 470 transitions.
[2025-05-30 11:32:42] [INFO ] Found NUPN structural information;
[2025-05-30 11:32:42] [INFO ] Parsed PT model containing 519 places and 470 transitions and 1623 arcs in 345 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 470 rows 519 cols
[2025-05-30 11:32:42] [INFO ] Computed 65 invariants in 70 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (78 resets) in 79 ms. (125 steps per ms)
FORMULA DES-PT-60b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (58 resets) in 117 ms. (423 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-05-30 11:32:42] [INFO ] Invariant cache hit.
[2025-05-30 11:32:43] [INFO ] [Real]Absence check using 39 positive place invariants in 38 ms returned sat
[2025-05-30 11:32:43] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 40 ms returned sat
[2025-05-30 11:32:43] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2025-05-30 11:32:44] [INFO ] Deduced a trap composed of 19 places in 355 ms of which 56 ms to minimize.
[2025-05-30 11:32:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:32:44] [INFO ] [Nat]Absence check using 39 positive place invariants in 37 ms returned sat
[2025-05-30 11:32:44] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 41 ms returned sat
[2025-05-30 11:32:44] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2025-05-30 11:32:45] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 4 ms to minimize.
[2025-05-30 11:32:45] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 6 ms to minimize.
[2025-05-30 11:32:45] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 4 ms to minimize.
[2025-05-30 11:32:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 744 ms
[2025-05-30 11:32:45] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 58 ms.
[2025-05-30 11:32:48] [INFO ] Added : 237 causal constraints over 49 iterations in 3035 ms. Result :sat
Minimization took 502 ms.
[2025-05-30 11:32:49] [INFO ] [Real]Absence check using 39 positive place invariants in 34 ms returned sat
[2025-05-30 11:32:49] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 29 ms returned sat
[2025-05-30 11:32:50] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2025-05-30 11:32:50] [INFO ] Deduced a trap composed of 8 places in 296 ms of which 8 ms to minimize.
[2025-05-30 11:32:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:32:50] [INFO ] [Nat]Absence check using 39 positive place invariants in 43 ms returned sat
[2025-05-30 11:32:50] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 49 ms returned sat
[2025-05-30 11:32:51] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2025-05-30 11:32:51] [INFO ] Deduced a trap composed of 17 places in 268 ms of which 6 ms to minimize.
[2025-05-30 11:32:51] [INFO ] Deduced a trap composed of 38 places in 254 ms of which 5 ms to minimize.
[2025-05-30 11:32:52] [INFO ] Deduced a trap composed of 50 places in 299 ms of which 4 ms to minimize.
[2025-05-30 11:32:52] [INFO ] Deduced a trap composed of 40 places in 417 ms of which 4 ms to minimize.
[2025-05-30 11:32:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1416 ms
[2025-05-30 11:32:52] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 64 ms.
[2025-05-30 11:32: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: Broken pipe ... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-30 11:32:55] [INFO ] [Real]Absence check using 39 positive place invariants in 25 ms returned sat
[2025-05-30 11:32:55] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 29 ms returned sat
[2025-05-30 11:32:55] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2025-05-30 11:32:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:32:56] [INFO ] [Nat]Absence check using 39 positive place invariants in 25 ms returned sat
[2025-05-30 11:32:56] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 31 ms returned sat
[2025-05-30 11:32:56] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2025-05-30 11:32:56] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 4 ms to minimize.
[2025-05-30 11:32:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2025-05-30 11:32:56] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 55 ms.
[2025-05-30 11:33:00] [INFO ] Deduced a trap composed of 12 places in 274 ms of which 6 ms to minimize.
[2025-05-30 11:33:00] [INFO ] Deduced a trap composed of 18 places in 250 ms of which 6 ms to minimize.
[2025-05-30 11:33:00] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 5 ms to minimize.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-30 11:33:01] [INFO ] [Real]Absence check using 39 positive place invariants in 33 ms returned sat
[2025-05-30 11:33:01] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 44 ms returned sat
[2025-05-30 11:33:01] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2025-05-30 11:33:02] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 6 ms to minimize.
[2025-05-30 11:33:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:33:02] [INFO ] [Nat]Absence check using 39 positive place invariants in 36 ms returned sat
[2025-05-30 11:33:02] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 45 ms returned sat
[2025-05-30 11:33:03] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2025-05-30 11:33:03] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 7 ms to minimize.
[2025-05-30 11:33:03] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 4 ms to minimize.
[2025-05-30 11:33:03] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 3 ms to minimize.
[2025-05-30 11:33:03] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 3 ms to minimize.
[2025-05-30 11:33:04] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 3 ms to minimize.
[2025-05-30 11:33:04] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 3 ms to minimize.
[2025-05-30 11:33:04] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 4 ms to minimize.
[2025-05-30 11:33:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1429 ms
[2025-05-30 11:33:04] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 31 ms.
[2025-05-30 11:33:07] [INFO ] Added : 310 causal constraints over 62 iterations in 2763 ms. Result :unknown
[2025-05-30 11:33:07] [INFO ] [Real]Absence check using 39 positive place invariants in 25 ms returned sat
[2025-05-30 11:33:07] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 32 ms returned sat
[2025-05-30 11:33:07] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2025-05-30 11:33:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:33:07] [INFO ] [Nat]Absence check using 39 positive place invariants in 30 ms returned sat
[2025-05-30 11:33:07] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 33 ms returned sat
[2025-05-30 11:33:08] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2025-05-30 11:33:08] [INFO ] Deduced a trap composed of 47 places in 212 ms of which 5 ms to minimize.
[2025-05-30 11:33:08] [INFO ] Deduced a trap composed of 50 places in 202 ms of which 4 ms to minimize.
[2025-05-30 11:33:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 488 ms
[2025-05-30 11:33:08] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 36 ms.
[2025-05-30 11:33:12] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 4 ms to minimize.
[2025-05-30 11:33:12] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 4 ms to minimize.
[2025-05-30 11:33:12] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 4 ms to minimize.
[2025-05-30 11:33:12] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 4 ms to minimize.
[2025-05-30 11:33:12] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 3 ms to minimize.
[2025-05-30 11:33:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 519/519 places, 470/470 transitions.
Graph (complete) has 1218 edges and 519 vertex of which 508 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.4 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 508 transition count 442
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 487 transition count 442
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 487 transition count 433
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 478 transition count 433
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 459 transition count 414
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 459 transition count 414
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 459 transition count 413
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 458 transition count 413
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 443 transition count 398
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 443 transition count 398
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 443 transition count 383
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 441 transition count 382
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 441 transition count 379
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 438 transition count 379
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 361 transition count 302
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 359 transition count 304
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 359 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 358 transition count 303
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 358 transition count 303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 357 transition count 302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 356 transition count 302
Applied a total of 320 rules in 373 ms. Remains 356 /519 variables (removed 163) and now considering 302/470 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 388 ms. Remains : 356/519 places, 302/470 transitions.
// Phase 1: matrix 302 rows 356 cols
[2025-05-30 11:33:14] [INFO ] Computed 60 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (47724 resets) in 2672 ms. (374 steps per ms)
BEST_FIRST walk for 5000005 steps (45670 resets) in 5122 ms. (975 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-05-30 11:33:22] [INFO ] Invariant cache hit.
[2025-05-30 11:33:22] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2025-05-30 11:33:22] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2025-05-30 11:33:22] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2025-05-30 11:33:22] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 25 ms.
[2025-05-30 11:33:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:33:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2025-05-30 11:33:23] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 29 ms returned sat
[2025-05-30 11:33:23] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2025-05-30 11:33:23] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 36 ms.
[2025-05-30 11:33:24] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 4 ms to minimize.
[2025-05-30 11:33:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2025-05-30 11:33:24] [INFO ] Added : 73 causal constraints over 15 iterations in 991 ms. Result :sat
Minimization took 326 ms.
[2025-05-30 11:33:25] [INFO ] [Real]Absence check using 36 positive place invariants in 23 ms returned sat
[2025-05-30 11:33:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 34 ms returned sat
[2025-05-30 11:33:25] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2025-05-30 11:33:25] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 2 ms to minimize.
[2025-05-30 11:33:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:33:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2025-05-30 11:33:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 44 ms returned sat
[2025-05-30 11:33:25] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2025-05-30 11:33:26] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 39 ms.
[2025-05-30 11:33:27] [INFO ] Added : 165 causal constraints over 33 iterations in 1310 ms. Result :sat
Minimization took 361 ms.
[2025-05-30 11:33:27] [INFO ] [Real]Absence check using 36 positive place invariants in 21 ms returned sat
[2025-05-30 11:33:27] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 35 ms returned sat
[2025-05-30 11:33:28] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2025-05-30 11:33:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:33:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 23 ms returned sat
[2025-05-30 11:33:28] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 30 ms returned sat
[2025-05-30 11:33:28] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2025-05-30 11:33:28] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 37 ms.
[2025-05-30 11:33:29] [INFO ] Added : 86 causal constraints over 18 iterations in 884 ms. Result :sat
Minimization took 350 ms.
[2025-05-30 11:33:30] [INFO ] [Real]Absence check using 36 positive place invariants in 26 ms returned sat
[2025-05-30 11:33:30] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 37 ms returned sat
[2025-05-30 11:33:30] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2025-05-30 11:33:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:33:30] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2025-05-30 11:33:30] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 34 ms returned sat
[2025-05-30 11:33:30] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2025-05-30 11:33:30] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 37 ms.
[2025-05-30 11:33:33] [INFO ] Deduced a trap composed of 60 places in 257 ms of which 5 ms to minimize.
[2025-05-30 11:33:33] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 4 ms to minimize.
[2025-05-30 11:33:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 548 ms
[2025-05-30 11:33:33] [INFO ] Added : 224 causal constraints over 45 iterations in 2517 ms. Result :sat
Minimization took 408 ms.
[2025-05-30 11:33:33] [INFO ] [Real]Absence check using 36 positive place invariants in 22 ms returned sat
[2025-05-30 11:33:33] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 30 ms returned sat
[2025-05-30 11:33:34] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2025-05-30 11:33:34] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 36 ms.
[2025-05-30 11:33:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:33:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2025-05-30 11:33:34] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2025-05-30 11:33:34] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2025-05-30 11:33:34] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 30 ms.
[2025-05-30 11:33:36] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 3 ms to minimize.
[2025-05-30 11:33:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2025-05-30 11:33:36] [INFO ] Added : 264 causal constraints over 53 iterations in 2060 ms. Result :sat
Minimization took 437 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 25 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 18 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2025-05-30 11:33:39] [INFO ] Invariant cache hit.
[2025-05-30 11:33:39] [INFO ] Implicit Places using invariants in 485 ms returned []
[2025-05-30 11:33:39] [INFO ] Invariant cache hit.
[2025-05-30 11:33:40] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1442 ms to find 0 implicit places.
[2025-05-30 11:33:40] [INFO ] Redundant transitions in 32 ms returned []
Running 299 sub problems to find dead transitions.
[2025-05-30 11:33:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 299 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/355 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (OVERLAPS) 302/657 variables, 355/415 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2025-05-30 11:33:56] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2025-05-30 11:33:56] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 5 ms to minimize.
[2025-05-30 11:33:56] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 3 ms to minimize.
[2025-05-30 11:33:58] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 4/419 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (OVERLAPS) 1/658 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2025-05-30 11:34:09] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2025-05-30 11:34:10] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 658/658 variables, and 422 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 2/355 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 302/657 variables, 355/421 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 299/720 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 720 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 355/356 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 6/6 constraints]
After SMT, in 60731ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 60761ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62286 ms. Remains : 356/356 places, 302/302 transitions.
RANDOM walk for 40000 steps (1974 resets) in 2060 ms. (19 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (365 resets) in 410 ms. (97 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (363 resets) in 449 ms. (88 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (363 resets) in 361 ms. (110 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (361 resets) in 444 ms. (89 steps per ms) remains 10/10 properties
[2025-05-30 11:34:43] [INFO ] Flatten gal took : 282 ms
BEST_FIRST walk for 40003 steps (361 resets) in 254 ms. (156 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (358 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
[2025-05-30 11:34:43] [INFO ] Flatten gal took : 113 ms
BEST_FIRST walk for 40003 steps (384 resets) in 217 ms. (183 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (370 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
[2025-05-30 11:34:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6490610626600835409.gal : 38 ms
BEST_FIRST walk for 40003 steps (396 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
[2025-05-30 11:34:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5720755437406736531.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/ReachabilityCardinality6490610626600835409.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5720755437406736531.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40004 steps (366 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5720755437406736531.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :8 after 56
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :56 after 72
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :72 after 104
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :104 after 840
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :840 after 1144
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :1144 after 47764
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :47764 after 89716
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :89716 after 219192
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :219192 after 366192
Interrupted probabilistic random walk after 435076 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 10
Probabilistic random walk after 435076 steps, saw 61381 distinct states, run finished after 3008 ms. (steps per millisecond=144 ) properties seen :0
[2025-05-30 11:34:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 211/216 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/253 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/278 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 7/285 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 240/525 variables, 285/340 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-30 11:34:47] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :1.84298e+06 after 1.99599e+09
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/525 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 74/599 variables, 12/353 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/599 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/599 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 2/601 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/601 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/601 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 57/658 variables, 57/417 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-30 11:34:49] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 3 ms to minimize.
[2025-05-30 11:34:49] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/658 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-30 11:34:49] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/658 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/658 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-30 11:34:50] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/658 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-30 11:34:50] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/658 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/658 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 658/658 variables, and 422 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 211/216 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 37/253 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-30 11:34:51] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 25/278 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 7/285 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 240/525 variables, 285/345 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 8/353 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 32768
At refinement iteration 14 (OVERLAPS) 74/599 variables, 12/365 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD size :1.99599e+09 after 2.6652e+09
At refinement iteration 15 (INCLUDED_ONLY) 0/599 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/599 variables, 2/371 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/599 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/599 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 2/601 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/601 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/601 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/601 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 57/658 variables, 57/433 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/658 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 0/658 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 658/658 variables, and 433 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3920 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 7/7 constraints]
After SMT, in 8955ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 4 different solutions.
SDD proceeding with computation,10 properties remain. new max is 65536
SDD size :2.78051e+09 after 2.78568e+09
Parikh walk visited 0 properties in 21272 ms.
Support contains 5 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 21 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 356/356 places, 302/302 transitions.
RANDOM walk for 40000 steps (1913 resets) in 292 ms. (136 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (381 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (375 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (390 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (342 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (358 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (348 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (353 resets) in 85 ms. (465 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (397 resets) in 128 ms. (310 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (387 resets) in 120 ms. (330 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (362 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 131072
Interrupted probabilistic random walk after 496416 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 10
Probabilistic random walk after 496416 steps, saw 69343 distinct states, run finished after 3001 ms. (steps per millisecond=165 ) properties seen :0
[2025-05-30 11:35:20] [INFO ] Invariant cache hit.
SDD size :2.85325e+09 after 2.5321e+10
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 211/216 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/253 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/278 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 7/285 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 240/525 variables, 285/340 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-30 11:35:21] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/525 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 74/599 variables, 12/353 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/599 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/599 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 2/601 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/601 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/601 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 57/658 variables, 57/417 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-30 11:35:23] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 4 ms to minimize.
[2025-05-30 11:35:23] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/658 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-30 11:35:23] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/658 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/658 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-30 11:35:24] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 3 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/658 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-30 11:35:24] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/658 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/658 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 0/658 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 422 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5653 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 211/216 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 37/253 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-30 11:35:26] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 25/278 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 7/285 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 240/525 variables, 285/345 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 8/353 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 74/599 variables, 12/365 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/599 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/599 variables, 2/371 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/599 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/599 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 2/601 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/601 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/601 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/601 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 57/658 variables, 57/433 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/658 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 0/658 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 658/658 variables, and 433 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4541 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 7/7 constraints]
After SMT, in 10203ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 4 different solutions.
Detected timeout of ITS tools.
[2025-05-30 11:35:33] [INFO ] Flatten gal took : 38 ms
[2025-05-30 11:35:33] [INFO ] Applying decomposition
[2025-05-30 11:35:33] [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/graph18015029508602900802.txt' '-o' '/tmp/graph18015029508602900802.bin' '-w' '/tmp/graph18015029508602900802.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18015029508602900802.bin' '-l' '-1' '-v' '-w' '/tmp/graph18015029508602900802.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:35:33] [INFO ] Decomposing Gal with order
[2025-05-30 11:35:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:35:34] [INFO ] Removed a total of 47 redundant transitions.
[2025-05-30 11:35:34] [INFO ] Flatten gal took : 164 ms
[2025-05-30 11:35:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 32 ms.
[2025-05-30 11:35:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3699874815882338510.gal : 34 ms
[2025-05-30 11:35:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1118278311964512277.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/ReachabilityCardinality3699874815882338510.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1118278311964512277.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality1118278311964512277.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :2 after 386
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :386 after 4132
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :4132 after 34360
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :50736 after 1.20814e+09
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :1.20814e+09 after 2.39695e+09
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :2.39695e+09 after 3.58576e+09
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :3.58576e+09 after 5.28407e+09
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :5.28407e+09 after 8.34102e+09
Parikh walk visited 0 properties in 26416 ms.
Support contains 5 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 15 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 17 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2025-05-30 11:35:56] [INFO ] Invariant cache hit.
[2025-05-30 11:35:57] [INFO ] Implicit Places using invariants in 462 ms returned []
[2025-05-30 11:35:57] [INFO ] Invariant cache hit.
[2025-05-30 11:35:58] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
[2025-05-30 11:35:58] [INFO ] Redundant transitions in 5 ms returned []
Running 299 sub problems to find dead transitions.
[2025-05-30 11:35:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 299 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/355 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (OVERLAPS) 302/657 variables, 355/415 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2025-05-30 11:36:10] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 13 ms to minimize.
[2025-05-30 11:36:11] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2025-05-30 11:36:11] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 18 ms to minimize.
[2025-05-30 11:36:12] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/657 variables, 4/419 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (OVERLAPS) 1/658 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2025-05-30 11:36:23] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 3 ms to minimize.
[2025-05-30 11:36:23] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 658/658 variables, and 422 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 2/355 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 302/657 variables, 355/421 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 299/720 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/658 variables, and 720 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 355/356 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 6/6 constraints]
After SMT, in 60436ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 60441ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61592 ms. Remains : 356/356 places, 302/302 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Starting property specific reduction for DES-PT-60b-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-05-30 11:36:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (488 resets) in 38 ms. (256 steps per ms)
BEST_FIRST walk for 10001 steps (81 resets) in 19 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 11:36:58] [INFO ] Invariant cache hit.
[2025-05-30 11:36:58] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2025-05-30 11:36:58] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 25 ms returned sat
[2025-05-30 11:36:58] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2025-05-30 11:36:59] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 32 ms.
[2025-05-30 11:36:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:36:59] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2025-05-30 11:36:59] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 34 ms returned sat
[2025-05-30 11:36:59] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2025-05-30 11:36:59] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 35 ms.
[2025-05-30 11:37:00] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 4 ms to minimize.
[2025-05-30 11:37:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2025-05-30 11:37:00] [INFO ] Added : 73 causal constraints over 15 iterations in 1067 ms. Result :sat
Minimization took 327 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 356 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p61) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 355 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 354 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 353 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 352 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 351 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 350 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 349 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 348 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 347 transition count 292
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 346 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 345 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 344 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 343 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 342 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 341 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 340 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 339 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 338 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 337 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 336 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 335 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 334 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 333 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 332 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 331 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 330 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 329 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 28 place count 328 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 29 place count 327 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 30 place count 326 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 30 with 1 rules applied. Total rules applied 31 place count 325 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 31 with 1 rules applied. Total rules applied 32 place count 324 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 33 place count 323 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 33 with 1 rules applied. Total rules applied 34 place count 322 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 34 with 1 rules applied. Total rules applied 35 place count 321 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 35 with 1 rules applied. Total rules applied 36 place count 320 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 36 with 1 rules applied. Total rules applied 37 place count 319 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 37 with 1 rules applied. Total rules applied 38 place count 318 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 38 with 1 rules applied. Total rules applied 39 place count 317 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 39 with 1 rules applied. Total rules applied 40 place count 316 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 40 with 1 rules applied. Total rules applied 41 place count 315 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 41 with 1 rules applied. Total rules applied 42 place count 314 transition count 259
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 42 with 1 rules applied. Total rules applied 43 place count 313 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 43 with 1 rules applied. Total rules applied 44 place count 312 transition count 257
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 44 with 1 rules applied. Total rules applied 45 place count 311 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 45 with 1 rules applied. Total rules applied 46 place count 310 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 46 with 1 rules applied. Total rules applied 47 place count 309 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 47 with 1 rules applied. Total rules applied 48 place count 308 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 48 with 1 rules applied. Total rules applied 49 place count 307 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 49 with 1 rules applied. Total rules applied 50 place count 306 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 50 with 1 rules applied. Total rules applied 51 place count 305 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 51 with 1 rules applied. Total rules applied 52 place count 304 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 52 with 1 rules applied. Total rules applied 53 place count 303 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 53 with 1 rules applied. Total rules applied 54 place count 302 transition count 247
Applied a total of 54 rules in 207 ms. Remains 302 /356 variables (removed 54) and now considering 247/301 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 302/356 places, 247/301 transitions.
// Phase 1: matrix 247 rows 302 cols
[2025-05-30 11:37:01] [INFO ] Computed 61 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47870 resets) in 2849 ms. (350 steps per ms)
BEST_FIRST walk for 1000001 steps (9209 resets) in 1030 ms. (969 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 11:37:05] [INFO ] Invariant cache hit.
[2025-05-30 11:37:05] [INFO ] [Real]Absence check using 37 positive place invariants in 13 ms returned sat
[2025-05-30 11:37:05] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 15 ms returned sat
[2025-05-30 11:37:05] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2025-05-30 11:37:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:37:05] [INFO ] [Nat]Absence check using 37 positive place invariants in 20 ms returned sat
[2025-05-30 11:37:05] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 23 ms returned sat
[2025-05-30 11:37:05] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2025-05-30 11:37:05] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 2 ms to minimize.
[2025-05-30 11:37:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2025-05-30 11:37:06] [INFO ] Computed and/alt/rep : 233/335/233 causal constraints (skipped 11 transitions) in 29 ms.
[2025-05-30 11:37:06] [INFO ] Added : 74 causal constraints over 15 iterations in 658 ms. Result :sat
Minimization took 261 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 302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 247/247 transitions.
Applied a total of 0 rules in 16 ms. Remains 302 /302 variables (removed 0) and now considering 247/247 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 302/302 places, 247/247 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 247/247 transitions.
Applied a total of 0 rules in 14 ms. Remains 302 /302 variables (removed 0) and now considering 247/247 (removed 0) transitions.
[2025-05-30 11:37:07] [INFO ] Invariant cache hit.
[2025-05-30 11:37:07] [INFO ] Implicit Places using invariants in 537 ms returned []
[2025-05-30 11:37:07] [INFO ] Invariant cache hit.
[2025-05-30 11:37:08] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 1244 ms to find 0 implicit places.
[2025-05-30 11:37:08] [INFO ] Redundant transitions in 5 ms returned []
Running 244 sub problems to find dead transitions.
[2025-05-30 11:37:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 1/299 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2025-05-30 11:37:17] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 2/301 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
At refinement iteration 8 (OVERLAPS) 247/548 variables, 301/363 constraints. Problems are: Problem set: 104 solved, 140 unsolved
[2025-05-30 11:37:25] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2025-05-30 11:37:26] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2025-05-30 11:37:28] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 2 ms to minimize.
[2025-05-30 11:37:28] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2025-05-30 11:37:28] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
[2025-05-30 11:37:28] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 3 ms to minimize.
[2025-05-30 11:37:28] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 7/370 constraints. Problems are: Problem set: 104 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/548 variables, 0/370 constraints. Problems are: Problem set: 104 solved, 140 unsolved
At refinement iteration 11 (OVERLAPS) 1/549 variables, 1/371 constraints. Problems are: Problem set: 104 solved, 140 unsolved
[2025-05-30 11:37:34] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/549 variables, 1/372 constraints. Problems are: Problem set: 104 solved, 140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 372 constraints, problems are : Problem set: 104 solved, 140 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 104 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 36/36 constraints. Problems are: Problem set: 104 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 17/53 constraints. Problems are: Problem set: 104 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 5/58 constraints. Problems are: Problem set: 104 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/58 constraints. Problems are: Problem set: 104 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 1/195 variables, 1/59 constraints. Problems are: Problem set: 104 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 3/62 constraints. Problems are: Problem set: 104 solved, 140 unsolved
[2025-05-30 11:37:39] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 1/63 constraints. Problems are: Problem set: 104 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/63 constraints. Problems are: Problem set: 104 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 106/301 variables, 7/70 constraints. Problems are: Problem set: 104 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 1/71 constraints. Problems are: Problem set: 104 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 0/71 constraints. Problems are: Problem set: 104 solved, 140 unsolved
At refinement iteration 11 (OVERLAPS) 247/548 variables, 301/372 constraints. Problems are: Problem set: 104 solved, 140 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/548 variables, 140/512 constraints. Problems are: Problem set: 104 solved, 140 unsolved
[2025-05-30 11:37:47] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/548 variables, 1/513 constraints. Problems are: Problem set: 104 solved, 140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/549 variables, and 513 constraints, problems are : Problem set: 104 solved, 140 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 301/302 constraints, PredecessorRefiner: 140/244 constraints, Known Traps: 11/11 constraints]
After SMT, in 60419ms problems are : Problem set: 104 solved, 140 unsolved
Search for dead transitions found 104 dead transitions in 60425ms
Found 104 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 104 transitions
Dead transitions reduction (with SMT) removed 104 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 302/302 places, 143/247 transitions.
Graph (complete) has 612 edges and 302 vertex of which 198 are kept as prefixes of interest. Removing 104 places using SCC suffix rule.1 ms
Discarding 104 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 23 ms. Remains 198 /302 variables (removed 104) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 198 cols
[2025-05-30 11:38:08] [INFO ] Computed 61 invariants in 16 ms
[2025-05-30 11:38:09] [INFO ] Implicit Places using invariants in 421 ms returned []
[2025-05-30 11:38:09] [INFO ] Invariant cache hit.
[2025-05-30 11:38:09] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 198/302 places, 143/247 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62590 ms. Remains : 198/302 places, 143/247 transitions.
[2025-05-30 11:38:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47731 resets) in 2201 ms. (454 steps per ms)
BEST_FIRST walk for 1000001 steps (9066 resets) in 1204 ms. (829 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 11:38:13] [INFO ] Invariant cache hit.
[2025-05-30 11:38:13] [INFO ] [Real]Absence check using 37 positive place invariants in 17 ms returned sat
[2025-05-30 11:38:13] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 13 ms returned sat
[2025-05-30 11:38:13] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2025-05-30 11:38:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:38:13] [INFO ] [Nat]Absence check using 37 positive place invariants in 16 ms returned sat
[2025-05-30 11:38:13] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 11 ms returned sat
[2025-05-30 11:38:13] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2025-05-30 11:38:13] [INFO ] Computed and/alt/rep : 131/247/131 causal constraints (skipped 9 transitions) in 16 ms.
[2025-05-30 11:38:14] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2025-05-30 11:38:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2025-05-30 11:38:14] [INFO ] Added : 79 causal constraints over 16 iterations in 614 ms. Result :sat
Minimization took 144 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 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 143/143 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 198/198 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 143/143 transitions.
Applied a total of 0 rules in 11 ms. Remains 198 /198 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2025-05-30 11:38:14] [INFO ] Invariant cache hit.
[2025-05-30 11:38:14] [INFO ] Implicit Places using invariants in 340 ms returned []
[2025-05-30 11:38:14] [INFO ] Invariant cache hit.
[2025-05-30 11:38:15] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
[2025-05-30 11:38:15] [INFO ] Redundant transitions in 1 ms returned []
Running 140 sub problems to find dead transitions.
[2025-05-30 11:38:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/195 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2025-05-30 11:38:18] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2025-05-30 11:38:19] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 2/197 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 143/340 variables, 197/260 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2025-05-30 11:38:22] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2025-05-30 11:38:22] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2025-05-30 11:38:22] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2025-05-30 11:38:23] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (OVERLAPS) 1/341 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2025-05-30 11:38:27] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2025-05-30 11:38:29] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
[2025-05-30 11:38:29] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/341 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2025-05-30 11:38:30] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2025-05-30 11:38:32] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2025-05-30 11:38:32] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
[2025-05-30 11:38:32] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2025-05-30 11:38:32] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 4/273 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/341 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2025-05-30 11:38:36] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/341 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/341 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 19 (OVERLAPS) 0/341 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 274 constraints, problems are : Problem set: 0 solved, 140 unsolved in 24518 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 1/195 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 2/197 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 143/340 variables, 197/272 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 140/412 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 13 (OVERLAPS) 1/341 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 414 constraints, problems are : Problem set: 0 solved, 140 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 15/15 constraints]
After SMT, in 54679ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 54682ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55568 ms. Remains : 198/198 places, 143/143 transitions.
[2025-05-30 11:39:10] [INFO ] Flatten gal took : 22 ms
[2025-05-30 11:39:10] [INFO ] Flatten gal took : 20 ms
[2025-05-30 11:39:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5679924585765813745.gal : 4 ms
[2025-05-30 11:39:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2657661402823797692.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/ReachabilityCardinality5679924585765813745.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2657661402823797692.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2657661402823797692.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 38
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :38 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 1482
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1482 after 2624
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2624 after 43576
RANDOM walk for 40000 steps (1908 resets) in 481 ms. (82 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :43576 after 194120
BEST_FIRST walk for 40002 steps (359 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :194120 after 645608
BEST_FIRST walk for 40003 steps (368 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :645608 after 5.93602e+08
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.77546e+09 after 2.66703e+09
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.78051e+09 after 8.85421e+09
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.6222e+10 after 2.72058e+10
Interrupted probabilistic random walk after 683630 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :0 out of 2
Probabilistic random walk after 683630 steps, saw 96946 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
[2025-05-30 11:39:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 52/57 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/94 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/119 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/126 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 79/205 variables, 126/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/218 variables, 8/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/220 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/220 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/220 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 62/282 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/282 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/282 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 59/341 variables, 59/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/341 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/341 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 259 constraints, problems are : Problem set: 0 solved, 2 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 52/57 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/94 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/119 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/126 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 79/205 variables, 126/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 13/218 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/218 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/220 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/220 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/220 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/282 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/282 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/282 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/341 variables, 59/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/341 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/341 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 261 constraints, problems are : Problem set: 0 solved, 2 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 656ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 296 ms.
Support contains 1 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 143/143 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 198/198 places, 143/143 transitions.
RANDOM walk for 40000 steps (1895 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (377 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (337 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Interrupted probabilistic random walk after 827934 steps, run timeout after 3001 ms. (steps per millisecond=275 ) properties seen :0 out of 2
Probabilistic random walk after 827934 steps, saw 116901 distinct states, run finished after 3001 ms. (steps per millisecond=275 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA DES-PT-60b-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-60b-UpperBounds-00 in 138907 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-04
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]
// Phase 1: matrix 302 rows 356 cols
[2025-05-30 11:39:17] [INFO ] Computed 60 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (472 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (86 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 11:39:17] [INFO ] Invariant cache hit.
[2025-05-30 11:39:17] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2025-05-30 11:39:17] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2025-05-30 11:39:17] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2025-05-30 11:39:17] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2025-05-30 11:39:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:39:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2025-05-30 11:39:18] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 28 ms returned sat
[2025-05-30 11:39:18] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2025-05-30 11:39:18] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 36 ms.
[2025-05-30 11:39:19] [INFO ] Added : 165 causal constraints over 33 iterations in 1488 ms. Result :sat
Minimization took 369 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 356 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p36) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 355 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 354 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 353 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 352 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 351 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 350 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 349 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 348 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 347 transition count 292
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 346 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 345 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 344 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 343 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 342 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 341 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 340 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 339 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 338 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 337 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 336 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 335 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 334 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 333 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 332 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 331 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 330 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 329 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 28 place count 328 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 29 place count 327 transition count 272
Applied a total of 29 rules in 49 ms. Remains 327 /356 variables (removed 29) and now considering 272/301 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 327/356 places, 272/301 transitions.
// Phase 1: matrix 272 rows 327 cols
[2025-05-30 11:39:21] [INFO ] Computed 61 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47964 resets) in 2187 ms. (457 steps per ms)
BEST_FIRST walk for 1000000 steps (9107 resets) in 990 ms. (1009 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 11:39:24] [INFO ] Invariant cache hit.
[2025-05-30 11:39:24] [INFO ] [Real]Absence check using 37 positive place invariants in 18 ms returned sat
[2025-05-30 11:39:24] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 32 ms returned sat
[2025-05-30 11:39:24] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2025-05-30 11:39:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:39:24] [INFO ] [Nat]Absence check using 37 positive place invariants in 20 ms returned sat
[2025-05-30 11:39:24] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 27 ms returned sat
[2025-05-30 11:39:25] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2025-05-30 11:39:25] [INFO ] Computed and/alt/rep : 258/410/258 causal constraints (skipped 11 transitions) in 34 ms.
[2025-05-30 11:39:26] [INFO ] Added : 173 causal constraints over 35 iterations in 1446 ms. Result :sat
Minimization took 341 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 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 272/272 transitions.
Applied a total of 0 rules in 7 ms. Remains 327 /327 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 327/327 places, 272/272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 272/272 transitions.
Applied a total of 0 rules in 6 ms. Remains 327 /327 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2025-05-30 11:39:27] [INFO ] Invariant cache hit.
[2025-05-30 11:39:28] [INFO ] Implicit Places using invariants in 526 ms returned []
[2025-05-30 11:39:28] [INFO ] Invariant cache hit.
[2025-05-30 11:39:29] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
[2025-05-30 11:39:29] [INFO ] Redundant transitions in 1 ms returned []
Running 269 sub problems to find dead transitions.
[2025-05-30 11:39:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (OVERLAPS) 1/324 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2025-05-30 11:39:39] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (OVERLAPS) 2/326 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
At refinement iteration 8 (OVERLAPS) 272/598 variables, 326/388 constraints. Problems are: Problem set: 54 solved, 215 unsolved
[2025-05-30 11:39:49] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 3 ms to minimize.
[2025-05-30 11:39:50] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
[2025-05-30 11:39:50] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2025-05-30 11:39:53] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 4 ms to minimize.
[2025-05-30 11:39:54] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 5/393 constraints. Problems are: Problem set: 54 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/599 variables, and 393 constraints, problems are : Problem set: 54 solved, 215 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 326/327 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 54 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 36/36 constraints. Problems are: Problem set: 54 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 17/53 constraints. Problems are: Problem set: 54 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 3/56 constraints. Problems are: Problem set: 54 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/56 constraints. Problems are: Problem set: 54 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 1/270 variables, 1/57 constraints. Problems are: Problem set: 54 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 2/59 constraints. Problems are: Problem set: 54 solved, 215 unsolved
[2025-05-30 11:40:02] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/60 constraints. Problems are: Problem set: 54 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/60 constraints. Problems are: Problem set: 54 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 56/326 variables, 7/67 constraints. Problems are: Problem set: 54 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 1/68 constraints. Problems are: Problem set: 54 solved, 215 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 0/68 constraints. Problems are: Problem set: 54 solved, 215 unsolved
At refinement iteration 11 (OVERLAPS) 272/598 variables, 326/394 constraints. Problems are: Problem set: 54 solved, 215 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/598 variables, 215/609 constraints. Problems are: Problem set: 54 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/599 variables, and 609 constraints, problems are : Problem set: 54 solved, 215 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 326/327 constraints, PredecessorRefiner: 215/269 constraints, Known Traps: 7/7 constraints]
After SMT, in 60473ms problems are : Problem set: 54 solved, 215 unsolved
Search for dead transitions found 54 dead transitions in 60480ms
Found 54 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 54 transitions
Dead transitions reduction (with SMT) removed 54 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 327/327 places, 218/272 transitions.
Graph (complete) has 912 edges and 327 vertex of which 273 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.1 ms
Discarding 54 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 273 /327 variables (removed 54) and now considering 218/218 (removed 0) transitions.
// Phase 1: matrix 218 rows 273 cols
[2025-05-30 11:40:29] [INFO ] Computed 61 invariants in 8 ms
[2025-05-30 11:40:30] [INFO ] Implicit Places using invariants in 426 ms returned []
[2025-05-30 11:40:30] [INFO ] Invariant cache hit.
[2025-05-30 11:40:30] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 273/327 places, 218/272 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63120 ms. Remains : 273/327 places, 218/272 transitions.
[2025-05-30 11:40:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47782 resets) in 2391 ms. (418 steps per ms)
BEST_FIRST walk for 1000000 steps (9185 resets) in 1019 ms. (980 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 11:40:34] [INFO ] Invariant cache hit.
[2025-05-30 11:40:34] [INFO ] [Real]Absence check using 37 positive place invariants in 12 ms returned sat
[2025-05-30 11:40:34] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 15 ms returned sat
[2025-05-30 11:40:34] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2025-05-30 11:40:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:40:34] [INFO ] [Nat]Absence check using 37 positive place invariants in 19 ms returned sat
[2025-05-30 11:40:34] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 23 ms returned sat
[2025-05-30 11:40:34] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2025-05-30 11:40:34] [INFO ] Computed and/alt/rep : 204/356/204 causal constraints (skipped 11 transitions) in 27 ms.
[2025-05-30 11:40:36] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 3 ms to minimize.
[2025-05-30 11:40:36] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2025-05-30 11:40:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 320 ms
[2025-05-30 11:40:36] [INFO ] Added : 154 causal constraints over 31 iterations in 1412 ms. Result :sat
Minimization took 231 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 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 218/218 transitions.
Applied a total of 0 rules in 7 ms. Remains 273 /273 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 273/273 places, 218/218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 218/218 transitions.
Applied a total of 0 rules in 7 ms. Remains 273 /273 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2025-05-30 11:40:37] [INFO ] Invariant cache hit.
[2025-05-30 11:40:37] [INFO ] Implicit Places using invariants in 480 ms returned []
[2025-05-30 11:40:37] [INFO ] Invariant cache hit.
[2025-05-30 11:40:38] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
[2025-05-30 11:40:38] [INFO ] Redundant transitions in 1 ms returned []
Running 215 sub problems to find dead transitions.
[2025-05-30 11:40:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/270 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2025-05-30 11:40:45] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 2/272 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 218/490 variables, 272/334 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2025-05-30 11:40:52] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2025-05-30 11:40:54] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2025-05-30 11:40:54] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 11 (OVERLAPS) 1/491 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2025-05-30 11:40:59] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 3 ms to minimize.
[2025-05-30 11:41:00] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 4 ms to minimize.
[2025-05-30 11:41:00] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 491/491 variables, and 341 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 1/270 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 2/272 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2025-05-30 11:41:15] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 11 (OVERLAPS) 218/490 variables, 272/341 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 215/556 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2025-05-30 11:41:38] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/491 variables, and 557 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 272/273 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 9/9 constraints]
After SMT, in 60285ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61558 ms. Remains : 273/273 places, 218/218 transitions.
[2025-05-30 11:41:38] [INFO ] Flatten gal took : 32 ms
[2025-05-30 11:41:38] [INFO ] Flatten gal took : 34 ms
[2025-05-30 11:41:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5225363067578837811.gal : 5 ms
[2025-05-30 11:41:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16331800274062228828.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/ReachabilityCardinality5225363067578837811.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16331800274062228828.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
RANDOM walk for 40000 steps (1950 resets) in 359 ms. (111 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality16331800274062228828.prop.
BEST_FIRST walk for 40003 steps (373 resets) in 288 ms. (138 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 28
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :28 after 40
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :40 after 154
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :154 after 1560
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1560 after 6528
BEST_FIRST walk for 40004 steps (358 resets) in 230 ms. (173 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :6528 after 189372
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :189372 after 195400
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :195400 after 984880
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.77546e+09 after 2.66261e+09
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.78051e+09 after 2.81368e+09
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.79085e+10 after 2.53171e+10
Interrupted probabilistic random walk after 764837 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :0 out of 2
Probabilistic random walk after 764837 steps, saw 107344 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
[2025-05-30 11:41:41] [INFO ] Invariant cache hit.
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) 29/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 102/132 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/169 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/194 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/201 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 154/355 variables, 201/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/368 variables, 8/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/368 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/368 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/370 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/370 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/370 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 62/432 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/432 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/432 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 59/491 variables, 59/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/491 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/491 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 334 constraints, problems are : Problem set: 0 solved, 2 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 29/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 102/132 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/169 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-30 11:41:42] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 25/194 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/201 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 154/355 variables, 201/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-30 11:41:42] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 3 ms to minimize.
[2025-05-30 11:41:42] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2025-05-30 11:41:42] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 13/368 variables, 8/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/368 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/370 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/370 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/370 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 62/432 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/432 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/432 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 59/491 variables, 59/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/491 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/491 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 491/491 variables, and 340 constraints, problems are : Problem set: 0 solved, 2 unsolved in 811 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 1251ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :7.37836e+10 after 9.64428e+10
Parikh walk visited 0 properties in 1583 ms.
Support contains 1 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 218/218 transitions.
Applied a total of 0 rules in 6 ms. Remains 273 /273 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 273/273 places, 218/218 transitions.
RANDOM walk for 40000 steps (1913 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (356 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (371 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.94245e+11 after 2.38097e+11
Interrupted probabilistic random walk after 788256 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :0 out of 2
Probabilistic random walk after 788256 steps, saw 111289 distinct states, run finished after 3001 ms. (steps per millisecond=262 ) properties seen :0
[2025-05-30 11:41:47] [INFO ] Invariant cache hit.
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) 29/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 102/132 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/169 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/194 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/201 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 154/355 variables, 201/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/368 variables, 8/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/368 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/368 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/370 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/370 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/370 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 62/432 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/432 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/432 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 59/491 variables, 59/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/491 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/491 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 334 constraints, problems are : Problem set: 0 solved, 2 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 29/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 102/132 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/169 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-30 11:41:48] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 25/194 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/201 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 154/355 variables, 201/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-30 11:41:48] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2025-05-30 11:41:48] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2025-05-30 11:41:48] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 13/368 variables, 8/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/368 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/370 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/370 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/370 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 62/432 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/432 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/432 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 59/491 variables, 59/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/491 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/491 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 491/491 variables, and 340 constraints, problems are : Problem set: 0 solved, 2 unsolved in 849 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 1307ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1806 ms.
Support contains 1 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 218/218 transitions.
Applied a total of 0 rules in 5 ms. Remains 273 /273 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 273/273 places, 218/218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 218/218 transitions.
Applied a total of 0 rules in 23 ms. Remains 273 /273 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2025-05-30 11:41:51] [INFO ] Invariant cache hit.
[2025-05-30 11:41:51] [INFO ] Implicit Places using invariants in 240 ms returned []
[2025-05-30 11:41:51] [INFO ] Invariant cache hit.
[2025-05-30 11:41:51] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
[2025-05-30 11:41:51] [INFO ] Redundant transitions in 1 ms returned []
Running 215 sub problems to find dead transitions.
[2025-05-30 11:41:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 215 unsolved
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :4.61822e+11 after 4.68849e+11
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/270 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2025-05-30 11:41:58] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 2/272 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 218/490 variables, 272/334 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2025-05-30 11:42:03] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2025-05-30 11:42:05] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2025-05-30 11:42:05] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 215 unsolved
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :1.0948e+12 after 1.10695e+12
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 11 (OVERLAPS) 1/491 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2025-05-30 11:42:10] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2025-05-30 11:42:11] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 3 ms to minimize.
[2025-05-30 11:42:11] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 14 (OVERLAPS) 0/491 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 341 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 1/270 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 2/272 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2025-05-30 11:42:27] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Detected timeout of ITS tools.
[2025-05-30 11:42:28] [INFO ] Flatten gal took : 19 ms
[2025-05-30 11:42:28] [INFO ] Applying decomposition
[2025-05-30 11:42:28] [INFO ] Flatten gal took : 30 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/graph8928117021887592511.txt' '-o' '/tmp/graph8928117021887592511.bin' '-w' '/tmp/graph8928117021887592511.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8928117021887592511.bin' '-l' '-1' '-v' '-w' '/tmp/graph8928117021887592511.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:42:28] [INFO ] Decomposing Gal with order
[2025-05-30 11:42:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:42:28] [INFO ] Removed a total of 66 redundant transitions.
[2025-05-30 11:42:28] [INFO ] Flatten gal took : 40 ms
[2025-05-30 11:42:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 7 ms.
[2025-05-30 11:42:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17127099839482346714.gal : 8 ms
[2025-05-30 11:42:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5647627652804608312.prop : 2 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/ReachabilityCardinality17127099839482346714.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5647627652804608312.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/ReachabilityCardinality5647627652804608312.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 4
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :4 after 8108
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :50736 after 8.04788e+08
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :8.04788e+08 after 2.06153e+09
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.06153e+09 after 3.10469e+09
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.10469e+09 after 4.88919e+09
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4.88919e+09 after 7.18909e+09
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :7.18909e+09 after 1.11729e+10
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 11 (OVERLAPS) 218/490 variables, 272/341 constraints. Problems are: Problem set: 0 solved, 215 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.39601e+13 after 2.56893e+13
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.91574e+13,7.58209,139572,17204,3250,329133,18187,360,321390,448,81679,0
Total reachable state count : 49157353067152

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,1.17297e+07,7.61912,139836,275,523,329133,18187,360,321390,450,81679,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,1.17297e+07,7.6323,139836,275,523,329133,18187,363,321390,451,81679,0
ITS tools runner thread asked to quit. Dying gracefully.
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 215/556 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2025-05-30 11:42:49] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/491 variables, and 557 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 272/273 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 9/9 constraints]
After SMT, in 60277ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 60282ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61123 ms. Remains : 273/273 places, 218/218 transitions.
FORMULA DES-PT-60b-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-60b-UpperBounds-04 in 214683 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-05
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]
// Phase 1: matrix 302 rows 356 cols
[2025-05-30 11:42:52] [INFO ] Computed 60 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (459 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (79 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 11:42:52] [INFO ] Invariant cache hit.
[2025-05-30 11:42:52] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2025-05-30 11:42:52] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 32 ms returned sat
[2025-05-30 11:42:52] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2025-05-30 11:42:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:42:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2025-05-30 11:42:52] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 25 ms returned sat
[2025-05-30 11:42:52] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2025-05-30 11:42:52] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 34 ms.
[2025-05-30 11:42:53] [INFO ] Added : 86 causal constraints over 18 iterations in 876 ms. Result :sat
Minimization took 334 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 356 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p116) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 355 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 354 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 353 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 352 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 351 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 350 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 349 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 348 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 347 transition count 292
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 346 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 345 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 344 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 343 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 342 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 341 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 340 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 339 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 338 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 337 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 336 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 335 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 334 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 333 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 332 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 331 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 330 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 329 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 28 place count 328 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 29 place count 327 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 30 place count 326 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 30 with 1 rules applied. Total rules applied 31 place count 325 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 31 with 1 rules applied. Total rules applied 32 place count 324 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 33 place count 323 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 33 with 1 rules applied. Total rules applied 34 place count 322 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 34 with 1 rules applied. Total rules applied 35 place count 321 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 35 with 1 rules applied. Total rules applied 36 place count 320 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 36 with 1 rules applied. Total rules applied 37 place count 319 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 37 with 1 rules applied. Total rules applied 38 place count 318 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 38 with 1 rules applied. Total rules applied 39 place count 317 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 39 with 1 rules applied. Total rules applied 40 place count 316 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 40 with 1 rules applied. Total rules applied 41 place count 315 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 41 with 1 rules applied. Total rules applied 42 place count 314 transition count 259
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 42 with 1 rules applied. Total rules applied 43 place count 313 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 43 with 1 rules applied. Total rules applied 44 place count 312 transition count 257
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 44 with 1 rules applied. Total rules applied 45 place count 311 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 45 with 1 rules applied. Total rules applied 46 place count 310 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 46 with 1 rules applied. Total rules applied 47 place count 309 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 47 with 1 rules applied. Total rules applied 48 place count 308 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 48 with 1 rules applied. Total rules applied 49 place count 307 transition count 252
Applied a total of 49 rules in 81 ms. Remains 307 /356 variables (removed 49) and now considering 252/301 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 307/356 places, 252/301 transitions.
// Phase 1: matrix 252 rows 307 cols
[2025-05-30 11:42:54] [INFO ] Computed 61 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47682 resets) in 2418 ms. (413 steps per ms)
BEST_FIRST walk for 1000001 steps (9057 resets) in 1018 ms. (981 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 11:42:57] [INFO ] Invariant cache hit.
[2025-05-30 11:42:57] [INFO ] [Real]Absence check using 37 positive place invariants in 18 ms returned sat
[2025-05-30 11:42:57] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 21 ms returned sat
[2025-05-30 11:42:58] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2025-05-30 11:42:58] [INFO ] Computed and/alt/rep : 238/450/238 causal constraints (skipped 11 transitions) in 23 ms.
[2025-05-30 11:42:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:42:58] [INFO ] [Nat]Absence check using 37 positive place invariants in 17 ms returned sat
[2025-05-30 11:42:58] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 20 ms returned sat
[2025-05-30 11:42:58] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2025-05-30 11:42:58] [INFO ] Computed and/alt/rep : 238/450/238 causal constraints (skipped 11 transitions) in 30 ms.
[2025-05-30 11:42:59] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 3 ms to minimize.
[2025-05-30 11:42:59] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 2 ms to minimize.
[2025-05-30 11:42:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2025-05-30 11:42:59] [INFO ] Added : 84 causal constraints over 17 iterations in 780 ms. Result :sat
Minimization took 195 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 307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 307/307 places, 252/252 transitions.
Applied a total of 0 rules in 7 ms. Remains 307 /307 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 307/307 places, 252/252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 307/307 places, 252/252 transitions.
Applied a total of 0 rules in 6 ms. Remains 307 /307 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2025-05-30 11:43:00] [INFO ] Invariant cache hit.
[2025-05-30 11:43:00] [INFO ] Implicit Places using invariants in 495 ms returned []
[2025-05-30 11:43:01] [INFO ] Invariant cache hit.
[2025-05-30 11:43:01] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1362 ms to find 0 implicit places.
[2025-05-30 11:43:01] [INFO ] Redundant transitions in 1 ms returned []
Running 249 sub problems to find dead transitions.
[2025-05-30 11:43:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (OVERLAPS) 2/305 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2025-05-30 11:43:11] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 3 ms to minimize.
[2025-05-30 11:43:11] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2025-05-30 11:43:11] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 3 ms to minimize.
[2025-05-30 11:43:11] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 3 ms to minimize.
[2025-05-30 11:43:11] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 3 ms to minimize.
[2025-05-30 11:43:11] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2025-05-30 11:43:14] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (OVERLAPS) 1/306 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD207 is UNSAT
At refinement iteration 10 (OVERLAPS) 252/558 variables, 306/374 constraints. Problems are: Problem set: 96 solved, 153 unsolved
[2025-05-30 11:43:26] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 3 ms to minimize.
[2025-05-30 11:43:27] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/558 variables, 2/376 constraints. Problems are: Problem set: 96 solved, 153 unsolved
[2025-05-30 11:43:28] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 1/377 constraints. Problems are: Problem set: 96 solved, 153 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 558/559 variables, and 377 constraints, problems are : Problem set: 96 solved, 153 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 306/307 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 96 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 36/36 constraints. Problems are: Problem set: 96 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 17/53 constraints. Problems are: Problem set: 96 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 9/62 constraints. Problems are: Problem set: 96 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 0/62 constraints. Problems are: Problem set: 96 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 2/209 variables, 1/63 constraints. Problems are: Problem set: 96 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 1/64 constraints. Problems are: Problem set: 96 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/64 constraints. Problems are: Problem set: 96 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 97/306 variables, 7/71 constraints. Problems are: Problem set: 96 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/71 constraints. Problems are: Problem set: 96 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 252/558 variables, 306/377 constraints. Problems are: Problem set: 96 solved, 153 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 153/530 constraints. Problems are: Problem set: 96 solved, 153 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/558 variables, 0/530 constraints. Problems are: Problem set: 96 solved, 153 unsolved
SMT process timed out in 60366ms, After SMT, problems are : Problem set: 96 solved, 153 unsolved
Search for dead transitions found 96 dead transitions in 60372ms
Found 96 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 96 transitions
Dead transitions reduction (with SMT) removed 96 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 307/307 places, 156/252 transitions.
Graph (complete) has 666 edges and 307 vertex of which 211 are kept as prefixes of interest. Removing 96 places using SCC suffix rule.1 ms
Discarding 96 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 211 /307 variables (removed 96) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 211 cols
[2025-05-30 11:44:02] [INFO ] Computed 61 invariants in 5 ms
[2025-05-30 11:44:02] [INFO ] Implicit Places using invariants in 301 ms returned []
[2025-05-30 11:44:02] [INFO ] Invariant cache hit.
[2025-05-30 11:44:03] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 211/307 places, 156/252 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62570 ms. Remains : 211/307 places, 156/252 transitions.
[2025-05-30 11:44:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47617 resets) in 2446 ms. (408 steps per ms)
BEST_FIRST walk for 1000001 steps (9119 resets) in 1012 ms. (987 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 11:44:06] [INFO ] Invariant cache hit.
[2025-05-30 11:44:06] [INFO ] [Real]Absence check using 37 positive place invariants in 11 ms returned sat
[2025-05-30 11:44:06] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 10 ms returned sat
[2025-05-30 11:44:06] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2025-05-30 11:44:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:44:06] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2025-05-30 11:44:06] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 17 ms returned sat
[2025-05-30 11:44:06] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2025-05-30 11:44:06] [INFO ] Computed and/alt/rep : 142/256/142 causal constraints (skipped 11 transitions) in 13 ms.
[2025-05-30 11:44:07] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2025-05-30 11:44:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2025-05-30 11:44:07] [INFO ] Added : 89 causal constraints over 18 iterations in 594 ms. Result :sat
Minimization took 150 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 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 156/156 transitions.
Applied a total of 0 rules in 7 ms. Remains 211 /211 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 211/211 places, 156/156 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 211 /211 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2025-05-30 11:44:07] [INFO ] Invariant cache hit.
[2025-05-30 11:44:08] [INFO ] Implicit Places using invariants in 439 ms returned []
[2025-05-30 11:44:08] [INFO ] Invariant cache hit.
[2025-05-30 11:44:08] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
[2025-05-30 11:44:08] [INFO ] Redundant transitions in 0 ms returned []
Running 153 sub problems to find dead transitions.
[2025-05-30 11:44:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 2/209 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 1/210 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (OVERLAPS) 156/366 variables, 210/271 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2025-05-30 11:44:14] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2025-05-30 11:44:15] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
[2025-05-30 11:44:15] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2025-05-30 11:44:15] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (OVERLAPS) 1/367 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/367 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 13 (OVERLAPS) 0/367 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 276 constraints, problems are : Problem set: 0 solved, 153 unsolved in 15115 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 2/209 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2025-05-30 11:44:27] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 3 ms to minimize.
[2025-05-30 11:44:27] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2025-05-30 11:44:27] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 1/210 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (OVERLAPS) 156/366 variables, 210/278 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 153/431 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/366 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 14 (OVERLAPS) 1/367 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/367 variables, and 432 constraints, problems are : Problem set: 0 solved, 153 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 7/7 constraints]
After SMT, in 45267ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 45270ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46286 ms. Remains : 211/211 places, 156/156 transitions.
[2025-05-30 11:44:54] [INFO ] Flatten gal took : 25 ms
[2025-05-30 11:44:54] [INFO ] Flatten gal took : 60 ms
[2025-05-30 11:44:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18222384512184559299.gal : 10 ms
[2025-05-30 11:44:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16526229743544626114.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/ReachabilityCardinality18222384512184559299.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16526229743544626114.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/ReachabilityCardinality16526229743544626114.prop.
RANDOM walk for 40000 steps (1905 resets) in 382 ms. (104 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 38
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :38 after 48
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :48 after 316
BEST_FIRST walk for 40004 steps (390 resets) in 321 ms. (124 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :316 after 1800
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1800 after 68124
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :68124 after 128800
BEST_FIRST walk for 40002 steps (352 resets) in 309 ms. (129 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :128800 after 522024
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :522024 after 6.99017e+08
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.77546e+09 after 2.66937e+09
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.78051e+09 after 2.80496e+09
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.6222e+10 after 2.64825e+10
Interrupted probabilistic random walk after 660210 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :0 out of 2
Probabilistic random walk after 660210 steps, saw 94022 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
[2025-05-30 11:44:57] [INFO ] Invariant cache hit.
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) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 59/70 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/107 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/132 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/139 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 92/231 variables, 139/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/244 variables, 8/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/244 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/246 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/246 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/246 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 62/308 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/308 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/308 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 59/367 variables, 59/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/367 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/367 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 272 constraints, problems are : Problem set: 0 solved, 2 unsolved in 528 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/70 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/107 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-30 11:44:58] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 25/132 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/139 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 92/231 variables, 139/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/231 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 13/244 variables, 8/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/244 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/244 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/246 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/246 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/246 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 62/308 variables, 3/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/308 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/308 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 59/367 variables, 59/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/367 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/367 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 275 constraints, problems are : Problem set: 0 solved, 2 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 927ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 606 ms.
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 156/156 transitions.
Applied a total of 0 rules in 8 ms. Remains 211 /211 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 211/211 places, 156/156 transitions.
RANDOM walk for 40000 steps (1863 resets) in 850 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (360 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (361 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :9.91794e+10 after 1.00718e+11
Interrupted probabilistic random walk after 647660 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :0 out of 2
Probabilistic random walk after 647660 steps, saw 92348 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
[2025-05-30 11:45:02] [INFO ] Invariant cache hit.
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) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 59/70 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/107 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/132 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/139 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 92/231 variables, 139/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/244 variables, 8/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/244 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/246 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/246 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/246 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 62/308 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/308 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/308 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 59/367 variables, 59/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/367 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/367 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 272 constraints, problems are : Problem set: 0 solved, 2 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 59/70 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/107 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-30 11:45:03] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 25/132 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/139 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 92/231 variables, 139/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/231 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 13/244 variables, 8/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/244 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/244 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/246 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/246 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/246 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 62/308 variables, 3/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/308 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/308 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 59/367 variables, 59/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/367 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/367 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 275 constraints, problems are : Problem set: 0 solved, 2 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 594ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 459 ms.
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 211 /211 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 211/211 places, 156/156 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 211 /211 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2025-05-30 11:45:03] [INFO ] Invariant cache hit.
[2025-05-30 11:45:03] [INFO ] Implicit Places using invariants in 235 ms returned []
[2025-05-30 11:45:03] [INFO ] Invariant cache hit.
[2025-05-30 11:45:04] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
[2025-05-30 11:45:04] [INFO ] Redundant transitions in 0 ms returned []
Running 153 sub problems to find dead transitions.
[2025-05-30 11:45:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 153 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :4.61822e+11 after 4.67222e+11
At refinement iteration 3 (OVERLAPS) 2/209 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 1/210 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (OVERLAPS) 156/366 variables, 210/271 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2025-05-30 11:45:09] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2025-05-30 11:45:10] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 2 ms to minimize.
[2025-05-30 11:45:10] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
[2025-05-30 11:45:10] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (OVERLAPS) 1/367 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/367 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 13 (OVERLAPS) 0/367 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 276 constraints, problems are : Problem set: 0 solved, 153 unsolved in 12711 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65537 fixpoint passes
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 2/209 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2025-05-30 11:45:19] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2025-05-30 11:45:19] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2025-05-30 11:45:19] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 1/210 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 153 unsolved
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,1.8926e+12,27.1238,507664,2,111156,27,2.34322e+06,6,0,996,2.369e+06,0
Total reachable state count : 1892601400856

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,56640,27.1348,507664,2,1067,27,2.34322e+06,7,0,999,2.369e+06,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,56640,27.1428,507664,2,1067,27,2.34322e+06,8,0,1000,2.369e+06,0
ITS tools runner thread asked to quit. Dying gracefully.
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (OVERLAPS) 156/366 variables, 210/278 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 153/431 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/366 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 14 (OVERLAPS) 1/367 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/367 variables, and 432 constraints, problems are : Problem set: 0 solved, 153 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 7/7 constraints]
After SMT, in 42814ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 42816ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43594 ms. Remains : 211/211 places, 156/156 transitions.
FORMULA DES-PT-60b-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-60b-UpperBounds-05 in 175151 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-06
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]
// Phase 1: matrix 302 rows 356 cols
[2025-05-30 11:45:47] [INFO ] Computed 60 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (493 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10000 steps (76 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 11:45:47] [INFO ] Invariant cache hit.
[2025-05-30 11:45:47] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2025-05-30 11:45:47] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2025-05-30 11:45:47] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2025-05-30 11:45:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:45:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2025-05-30 11:45:47] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 33 ms returned sat
[2025-05-30 11:45:48] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2025-05-30 11:45:48] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 37 ms.
[2025-05-30 11:45:50] [INFO ] Deduced a trap composed of 60 places in 255 ms of which 5 ms to minimize.
[2025-05-30 11:45:50] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2025-05-30 11:45:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 452 ms
[2025-05-30 11:45:50] [INFO ] Added : 224 causal constraints over 45 iterations in 2386 ms. Result :sat
Minimization took 272 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 356 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p87) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 355 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 354 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 353 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 352 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 351 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 350 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 349 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 348 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 347 transition count 292
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 346 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 345 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 344 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 343 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 342 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 341 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 340 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 339 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 338 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 337 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 336 transition count 281
Applied a total of 20 rules in 39 ms. Remains 336 /356 variables (removed 20) and now considering 281/301 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 336/356 places, 281/301 transitions.
// Phase 1: matrix 281 rows 336 cols
[2025-05-30 11:45:51] [INFO ] Computed 61 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47931 resets) in 2379 ms. (420 steps per ms)
BEST_FIRST walk for 1000001 steps (9022 resets) in 981 ms. (1018 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 11:45:55] [INFO ] Invariant cache hit.
[2025-05-30 11:45:55] [INFO ] [Real]Absence check using 37 positive place invariants in 13 ms returned sat
[2025-05-30 11:45:55] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 17 ms returned sat
[2025-05-30 11:45:55] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2025-05-30 11:45:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:45:55] [INFO ] [Nat]Absence check using 37 positive place invariants in 15 ms returned sat
[2025-05-30 11:45:55] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 20 ms returned sat
[2025-05-30 11:45:55] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2025-05-30 11:45:55] [INFO ] Computed and/alt/rep : 267/479/267 causal constraints (skipped 11 transitions) in 26 ms.
[2025-05-30 11:45:57] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2025-05-30 11:45:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2025-05-30 11:45:57] [INFO ] Added : 209 causal constraints over 43 iterations in 1706 ms. Result :sat
Minimization took 321 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 336 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 336/336 places, 281/281 transitions.
Applied a total of 0 rules in 7 ms. Remains 336 /336 variables (removed 0) and now considering 281/281 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 336/336 places, 281/281 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 336/336 places, 281/281 transitions.
Applied a total of 0 rules in 5 ms. Remains 336 /336 variables (removed 0) and now considering 281/281 (removed 0) transitions.
[2025-05-30 11:45:58] [INFO ] Invariant cache hit.
[2025-05-30 11:45:59] [INFO ] Implicit Places using invariants in 635 ms returned []
[2025-05-30 11:45:59] [INFO ] Invariant cache hit.
[2025-05-30 11:46:00] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1576 ms to find 0 implicit places.
[2025-05-30 11:46:00] [INFO ] Redundant transitions in 1 ms returned []
Running 278 sub problems to find dead transitions.
[2025-05-30 11:46:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/332 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 2/334 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 278 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/335 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD207 is UNSAT
At refinement iteration 8 (OVERLAPS) 281/616 variables, 335/396 constraints. Problems are: Problem set: 38 solved, 240 unsolved
[2025-05-30 11:46:18] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/616 variables, 1/397 constraints. Problems are: Problem set: 38 solved, 240 unsolved
[2025-05-30 11:46:21] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 3 ms to minimize.
[2025-05-30 11:46:21] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2025-05-30 11:46:24] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/616 variables, 3/400 constraints. Problems are: Problem set: 38 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 616/617 variables, and 400 constraints, problems are : Problem set: 38 solved, 240 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 335/336 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 38 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 36/36 constraints. Problems are: Problem set: 38 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 17/53 constraints. Problems are: Problem set: 38 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 3/56 constraints. Problems are: Problem set: 38 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 0/56 constraints. Problems are: Problem set: 38 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 2/296 variables, 1/57 constraints. Problems are: Problem set: 38 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 1/58 constraints. Problems are: Problem set: 38 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/58 constraints. Problems are: Problem set: 38 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 39/335 variables, 7/65 constraints. Problems are: Problem set: 38 solved, 240 unsolved
[2025-05-30 11:46:37] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2025-05-30 11:46:38] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 2 ms to minimize.
[2025-05-30 11:46:38] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 3 ms to minimize.
[2025-05-30 11:46:38] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 3 ms to minimize.
[2025-05-30 11:46:38] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 5/70 constraints. Problems are: Problem set: 38 solved, 240 unsolved
[2025-05-30 11:46:40] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 1/71 constraints. Problems are: Problem set: 38 solved, 240 unsolved
[2025-05-30 11:46:43] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/335 variables, 1/72 constraints. Problems are: Problem set: 38 solved, 240 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/335 variables, 0/72 constraints. Problems are: Problem set: 38 solved, 240 unsolved
At refinement iteration 12 (OVERLAPS) 281/616 variables, 335/407 constraints. Problems are: Problem set: 38 solved, 240 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/616 variables, 240/647 constraints. Problems are: Problem set: 38 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 616/617 variables, and 647 constraints, problems are : Problem set: 38 solved, 240 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 335/336 constraints, PredecessorRefiner: 240/278 constraints, Known Traps: 11/11 constraints]
After SMT, in 60440ms problems are : Problem set: 38 solved, 240 unsolved
Search for dead transitions found 38 dead transitions in 60446ms
Found 38 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 38 transitions
Dead transitions reduction (with SMT) removed 38 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 336/336 places, 243/281 transitions.
Graph (complete) has 1014 edges and 336 vertex of which 298 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 298 /336 variables (removed 38) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 298 cols
[2025-05-30 11:47:00] [INFO ] Computed 61 invariants in 3 ms
[2025-05-30 11:47:01] [INFO ] Implicit Places using invariants in 298 ms returned []
[2025-05-30 11:47:01] [INFO ] Invariant cache hit.
[2025-05-30 11:47:01] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 900 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 298/336 places, 243/281 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62944 ms. Remains : 298/336 places, 243/281 transitions.
[2025-05-30 11:47:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47810 resets) in 2493 ms. (400 steps per ms)
BEST_FIRST walk for 1000001 steps (9318 resets) in 984 ms. (1015 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 11:47:05] [INFO ] Invariant cache hit.
[2025-05-30 11:47:05] [INFO ] [Real]Absence check using 37 positive place invariants in 13 ms returned sat
[2025-05-30 11:47:05] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 15 ms returned sat
[2025-05-30 11:47:05] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2025-05-30 11:47:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:47:05] [INFO ] [Nat]Absence check using 37 positive place invariants in 21 ms returned sat
[2025-05-30 11:47:05] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 26 ms returned sat
[2025-05-30 11:47:05] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2025-05-30 11:47:05] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
[2025-05-30 11:47:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2025-05-30 11:47:05] [INFO ] Computed and/alt/rep : 229/401/229 causal constraints (skipped 11 transitions) in 34 ms.
[2025-05-30 11:47:07] [INFO ] Added : 209 causal constraints over 42 iterations in 1484 ms. Result :sat
Minimization took 240 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 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 243/243 transitions.
Applied a total of 0 rules in 8 ms. Remains 298 /298 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 298/298 places, 243/243 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 243/243 transitions.
Applied a total of 0 rules in 9 ms. Remains 298 /298 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2025-05-30 11:47:08] [INFO ] Invariant cache hit.
[2025-05-30 11:47:08] [INFO ] Implicit Places using invariants in 507 ms returned []
[2025-05-30 11:47:08] [INFO ] Invariant cache hit.
[2025-05-30 11:47:09] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
[2025-05-30 11:47:09] [INFO ] Redundant transitions in 1 ms returned []
Running 240 sub problems to find dead transitions.
[2025-05-30 11:47:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 2/296 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 240 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/297 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 243/540 variables, 297/358 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2025-05-30 11:47:21] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2025-05-30 11:47:23] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 2 ms to minimize.
[2025-05-30 11:47:24] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (OVERLAPS) 1/541 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 13 (OVERLAPS) 0/541 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 362 constraints, problems are : Problem set: 0 solved, 240 unsolved in 27719 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 2/296 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2025-05-30 11:47:42] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 1/297 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (OVERLAPS) 243/540 variables, 297/362 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 240/602 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2025-05-30 11:48:00] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2025-05-30 11:48:00] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/541 variables, and 604 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 297/298 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 6/6 constraints]
After SMT, in 57979ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 57985ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59389 ms. Remains : 298/298 places, 243/243 transitions.
[2025-05-30 11:48:07] [INFO ] Flatten gal took : 25 ms
[2025-05-30 11:48:07] [INFO ] Flatten gal took : 23 ms
[2025-05-30 11:48:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13806246378223059973.gal : 5 ms
[2025-05-30 11:48:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15937943611257801516.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/ReachabilityCardinality13806246378223059973.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15937943611257801516.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/ReachabilityCardinality15937943611257801516.prop.
RANDOM walk for 40000 steps (1940 resets) in 377 ms. (105 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (368 resets) in 350 ms. (113 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 28
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :28 after 40
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :40 after 84
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :84 after 1180
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1180 after 7492
BEST_FIRST walk for 40003 steps (341 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :7492 after 48488
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :48488 after 190960
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :190960 after 558376
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :558376 after 7.03882e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.77546e+09 after 2.66583e+09
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.78051e+09 after 2.84056e+09
Interrupted probabilistic random walk after 669670 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :0 out of 2
Probabilistic random walk after 669670 steps, saw 95144 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :0
[2025-05-30 11:48:11] [INFO ] Invariant cache hit.
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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 117/157 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/194 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/219 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/226 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 179/405 variables, 226/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/405 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/418 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/420 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/420 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 62/482 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/482 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 59/541 variables, 59/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/541 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/541 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 359 constraints, problems are : Problem set: 0 solved, 2 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 117/157 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/194 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/219 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/226 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 179/405 variables, 226/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/405 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/405 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 13/418 variables, 8/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/420 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/482 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/541 variables, 59/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/541 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/541 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 361 constraints, problems are : Problem set: 0 solved, 2 unsolved in 708 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1379ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.6222e+10 after 2.65434e+10
Parikh walk visited 0 properties in 2183 ms.
Support contains 1 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 243/243 transitions.
Applied a total of 0 rules in 5 ms. Remains 298 /298 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 298/298 places, 243/243 transitions.
RANDOM walk for 40000 steps (1909 resets) in 561 ms. (71 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (351 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (360 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 65536
Interrupted probabilistic random walk after 685023 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :0 out of 2
Probabilistic random walk after 685023 steps, saw 97111 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
[2025-05-30 11:48:18] [INFO ] Invariant cache hit.
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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :9.91794e+10 after 1.00401e+11
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 117/157 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/194 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/219 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/226 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 179/405 variables, 226/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/405 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/418 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/420 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/420 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 62/482 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/482 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 59/541 variables, 59/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/541 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/541 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 359 constraints, problems are : Problem set: 0 solved, 2 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 117/157 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/194 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/219 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/226 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 179/405 variables, 226/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/405 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/405 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 13/418 variables, 8/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/418 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/420 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/482 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/541 variables, 59/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/541 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/541 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 361 constraints, problems are : Problem set: 0 solved, 2 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 914ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3223 ms.
Support contains 1 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 243/243 transitions.
Applied a total of 0 rules in 5 ms. Remains 298 /298 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 298/298 places, 243/243 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 243/243 transitions.
Applied a total of 0 rules in 5 ms. Remains 298 /298 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2025-05-30 11:48:22] [INFO ] Invariant cache hit.
[2025-05-30 11:48:22] [INFO ] Implicit Places using invariants in 474 ms returned []
[2025-05-30 11:48:22] [INFO ] Invariant cache hit.
[2025-05-30 11:48:23] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 1190 ms to find 0 implicit places.
[2025-05-30 11:48:23] [INFO ] Redundant transitions in 1 ms returned []
Running 240 sub problems to find dead transitions.
[2025-05-30 11:48:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 240 unsolved
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :3.88918e+11 after 4.54041e+11
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 2/296 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 240 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/297 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 243/540 variables, 297/358 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2025-05-30 11:48:36] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 3 ms to minimize.
[2025-05-30 11:48:38] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 11 ms to minimize.
[2025-05-30 11:48:39] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 240 unsolved
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :9.81219e+11 after 1.08269e+12
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (OVERLAPS) 1/541 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 541/541 variables, and 362 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 2/296 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Detected timeout of ITS tools.
[2025-05-30 11:48:58] [INFO ] Flatten gal took : 22 ms
[2025-05-30 11:48:58] [INFO ] Applying decomposition
[2025-05-30 11:48:58] [INFO ] Flatten gal took : 19 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/graph7698137195840403431.txt' '-o' '/tmp/graph7698137195840403431.bin' '-w' '/tmp/graph7698137195840403431.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7698137195840403431.bin' '-l' '-1' '-v' '-w' '/tmp/graph7698137195840403431.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:48:58] [INFO ] Decomposing Gal with order
[2025-05-30 11:48:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:48:58] [INFO ] Removed a total of 80 redundant transitions.
[2025-05-30 11:48:58] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2025-05-30 11:48:58] [INFO ] Flatten gal took : 45 ms
[2025-05-30 11:48:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 15 ms.
[2025-05-30 11:48:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17085055815890371651.gal : 6 ms
[2025-05-30 11:48:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6190181489144136758.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/ReachabilityCardinality17085055815890371651.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6190181489144136758.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/ReachabilityCardinality6190181489144136758.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 4
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :4 after 7964
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :50736 after 1.59479e+09
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.59479e+09 after 6.88948e+09
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :6.88948e+09 after 1.00371e+10
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.00371e+10 after 1.52822e+10
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.52822e+10 after 2.36743e+10
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 240 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.36743e+10 after 3.73117e+10
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 1/297 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 240 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.39601e+13 after 2.41863e+13
At refinement iteration 11 (OVERLAPS) 243/540 variables, 297/362 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.34409e+13,9.8898,173832,21487,4593,407550,19899,336,393315,461,104086,0
Total reachable state count : 63440895134104

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,2.0826e+10,9.9194,173832,711,785,407550,19899,336,393315,463,104086,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,2.0826e+10,9.92543,173832,711,785,407550,19899,338,393315,464,104086,0
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 240/602 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2025-05-30 11:49:13] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2025-05-30 11:49:13] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/541 variables, and 604 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 297/298 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 6/6 constraints]
After SMT, in 60339ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 60344ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61549 ms. Remains : 298/298 places, 243/243 transitions.
FORMULA DES-PT-60b-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-60b-UpperBounds-06 in 216421 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 302 rows 356 cols
[2025-05-30 11:49:23] [INFO ] Computed 60 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (487 resets) in 38 ms. (256 steps per ms)
BEST_FIRST walk for 10001 steps (96 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 11:49:23] [INFO ] Invariant cache hit.
[2025-05-30 11:49:23] [INFO ] [Real]Absence check using 36 positive place invariants in 23 ms returned sat
[2025-05-30 11:49:23] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 34 ms returned sat
[2025-05-30 11:49:24] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2025-05-30 11:49:24] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 38 ms.
[2025-05-30 11:49:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:49:24] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2025-05-30 11:49:24] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 35 ms returned sat
[2025-05-30 11:49:24] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2025-05-30 11:49:24] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 36 ms.
[2025-05-30 11:49:27] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 3 ms to minimize.
[2025-05-30 11:49:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2025-05-30 11:49:27] [INFO ] Added : 264 causal constraints over 53 iterations in 2490 ms. Result :sat
Minimization took 463 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 356 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p129) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 355 transition count 300
Applied a total of 1 rules in 20 ms. Remains 355 /356 variables (removed 1) and now considering 300/301 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 355/356 places, 300/301 transitions.
// Phase 1: matrix 300 rows 355 cols
[2025-05-30 11:49:28] [INFO ] Computed 61 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (47816 resets) in 2248 ms. (444 steps per ms)
BEST_FIRST walk for 1000001 steps (9204 resets) in 1024 ms. (975 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-30 11:49:32] [INFO ] Invariant cache hit.
[2025-05-30 11:49:32] [INFO ] [Real]Absence check using 37 positive place invariants in 19 ms returned sat
[2025-05-30 11:49:32] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 31 ms returned sat
[2025-05-30 11:49:32] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2025-05-30 11:49:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:49:32] [INFO ] [Nat]Absence check using 37 positive place invariants in 16 ms returned sat
[2025-05-30 11:49:32] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 24 ms returned sat
[2025-05-30 11:49:32] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2025-05-30 11:49:32] [INFO ] Computed and/alt/rep : 286/496/286 causal constraints (skipped 11 transitions) in 33 ms.
[2025-05-30 11:49:34] [INFO ] Added : 269 causal constraints over 54 iterations in 1983 ms. Result :sat
Minimization took 409 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 355 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 300/300 transitions.
Applied a total of 0 rules in 6 ms. Remains 355 /355 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 355/355 places, 300/300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 300/300 transitions.
Applied a total of 0 rules in 7 ms. Remains 355 /355 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2025-05-30 11:49:36] [INFO ] Invariant cache hit.
[2025-05-30 11:49:36] [INFO ] Implicit Places using invariants in 372 ms returned []
[2025-05-30 11:49:36] [INFO ] Invariant cache hit.
[2025-05-30 11:49:37] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 1104 ms to find 0 implicit places.
[2025-05-30 11:49:37] [INFO ] Redundant transitions in 2 ms returned []
Running 297 sub problems to find dead transitions.
[2025-05-30 11:49:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (OVERLAPS) 2/353 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 2/355 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 297 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 300/655 variables, 355/416 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2025-05-30 11:49:56] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 3 ms to minimize.
[2025-05-30 11:49:59] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
[2025-05-30 11:50:01] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2025-05-30 11:50:06] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 4 ms to minimize.
[2025-05-30 11:50:06] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 655/655 variables, and 421 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/351 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 2/353 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (OVERLAPS) 2/355 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (OVERLAPS) 300/655 variables, 355/421 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/655 variables, 297/718 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 655/655 variables, and 718 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 5/5 constraints]
After SMT, in 60368ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 60372ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61490 ms. Remains : 355/355 places, 300/300 transitions.
[2025-05-30 11:50:37] [INFO ] Flatten gal took : 31 ms
[2025-05-30 11:50:37] [INFO ] Flatten gal took : 45 ms
[2025-05-30 11:50:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16367635240403668461.gal : 3 ms
[2025-05-30 11:50:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3360148828579137943.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/ReachabilityCardinality16367635240403668461.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3360148828579137943.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/ReachabilityCardinality3360148828579137943.prop.
RANDOM walk for 40000 steps (1946 resets) in 756 ms. (52 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 56
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :56 after 76
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :76 after 104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :104 after 1112
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1112 after 1328
BEST_FIRST walk for 40004 steps (368 resets) in 299 ms. (133 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1328 after 20888
BEST_FIRST walk for 40002 steps (374 resets) in 272 ms. (146 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :20888 after 69544
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :69544 after 205552
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :205552 after 382584
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.84298e+06 after 6.5156e+08
Interrupted probabilistic random walk after 481177 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 2
Probabilistic random walk after 481177 steps, saw 67480 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
[2025-05-30 11:50:41] [INFO ] Invariant cache hit.
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) 58/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 58/117 variables, 59/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/120 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/125 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/127 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 14/141 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/141 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/141 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/143 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/147 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/147 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 195/342 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/342 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 41/383 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/383 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 31/414 variables, 22/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/414 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 9/423 variables, 9/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/423 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 232/655 variables, 284/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/655 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/655 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/655 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 655/655 variables, and 416 constraints, problems are : Problem set: 0 solved, 2 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 58/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 58/117 variables, 59/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/120 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/125 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/127 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/127 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 14/141 variables, 8/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/141 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/141 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/143 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/147 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/147 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 195/342 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/342 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 41/383 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/383 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 31/414 variables, 22/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/414 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 9/423 variables, 9/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/423 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 232/655 variables, 284/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/655 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-30 11:50:42] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 3 ms to minimize.
[2025-05-30 11:50:42] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 3 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/655 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/655 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/655 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 655/655 variables, and 420 constraints, problems are : Problem set: 0 solved, 2 unsolved in 967 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1535ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :6.5156e+08 after 2.53231e+09
Parikh walk visited 0 properties in 3338 ms.
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 300/300 transitions.
Applied a total of 0 rules in 7 ms. Remains 355 /355 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 355/355 places, 300/300 transitions.
RANDOM walk for 40000 steps (1881 resets) in 664 ms. (60 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (366 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (360 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 602002 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 2
Probabilistic random walk after 602002 steps, saw 85856 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
[2025-05-30 11:50:49] [INFO ] Invariant cache hit.
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) 58/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 58/117 variables, 59/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/120 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/125 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/127 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 14/141 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/141 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/141 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/143 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/147 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/147 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 195/342 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/342 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
At refinement iteration 21 (OVERLAPS) 41/383 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/383 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 31/414 variables, 22/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :2.53231e+09 after 2.66899e+09
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/414 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 9/423 variables, 9/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/423 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 232/655 variables, 284/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/655 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/655 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/655 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 655/655 variables, and 416 constraints, problems are : Problem set: 0 solved, 2 unsolved in 776 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 58/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 58/117 variables, 59/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/120 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/125 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/127 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/127 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 14/141 variables, 8/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/141 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/141 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/143 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/147 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/147 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 195/342 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/342 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 41/383 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/383 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 31/414 variables, 22/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/414 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 9/423 variables, 9/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/423 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 232/655 variables, 284/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/655 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-30 11:50:51] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2025-05-30 11:50:51] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 2 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/655 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/655 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/655 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 655/655 variables, and 420 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1092 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1875ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3132 ms.
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 300/300 transitions.
Applied a total of 0 rules in 6 ms. Remains 355 /355 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 355/355 places, 300/300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 300/300 transitions.
Applied a total of 0 rules in 7 ms. Remains 355 /355 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2025-05-30 11:50:54] [INFO ] Invariant cache hit.
[2025-05-30 11:50:54] [INFO ] Implicit Places using invariants in 377 ms returned []
[2025-05-30 11:50:54] [INFO ] Invariant cache hit.
[2025-05-30 11:50:55] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
[2025-05-30 11:50:55] [INFO ] Redundant transitions in 1 ms returned []
Running 297 sub problems to find dead transitions.
[2025-05-30 11:50:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (OVERLAPS) 2/353 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 297 unsolved
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :2.85325e+09 after 2.53176e+10
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 2/355 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 297 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 300/655 variables, 355/416 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2025-05-30 11:51:15] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 3 ms to minimize.
[2025-05-30 11:51:18] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 2 ms to minimize.
[2025-05-30 11:51:20] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2025-05-30 11:51:25] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 3 ms to minimize.
[2025-05-30 11:51:25] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 655/655 variables, and 421 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Detected timeout of ITS tools.
[2025-05-30 11:51:27] [INFO ] Flatten gal took : 14 ms
[2025-05-30 11:51:27] [INFO ] Applying decomposition
[2025-05-30 11:51:27] [INFO ] Flatten gal took : 13 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/graph7009630998707811357.txt' '-o' '/tmp/graph7009630998707811357.bin' '-w' '/tmp/graph7009630998707811357.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7009630998707811357.bin' '-l' '-1' '-v' '-w' '/tmp/graph7009630998707811357.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:51:27] [INFO ] Decomposing Gal with order
[2025-05-30 11:51:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:51:28] [INFO ] Removed a total of 96 redundant transitions.
[2025-05-30 11:51:28] [INFO ] Flatten gal took : 26 ms
[2025-05-30 11:51:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 4 ms.
[2025-05-30 11:51:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3399440650861968310.gal : 5 ms
[2025-05-30 11:51:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7541637400314301233.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/ReachabilityCardinality3399440650861968310.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7541637400314301233.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality7541637400314301233.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 2066
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2066 after 2066
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2066 after 34360
At refinement iteration 3 (INCLUDED_ONLY) 0/351 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 2/353 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (OVERLAPS) 2/355 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 297 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :50736 after 1.05213e+10
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.05213e+10 after 1.99626e+10
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.99626e+10 after 3.1502e+10
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3.1502e+10 after 5.03846e+10
At refinement iteration 8 (OVERLAPS) 300/655 variables, 355/421 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/655 variables, 297/718 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 655/655 variables, and 718 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 5/5 constraints]
After SMT, in 60366ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 60370ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61485 ms. Remains : 355/355 places, 300/300 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 7 ms. Remains 355 /355 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Running SMT prover for 2 properties.
[2025-05-30 11:51:55] [INFO ] Invariant cache hit.
[2025-05-30 11:51:56] [INFO ] [Real]Absence check using 37 positive place invariants in 11 ms returned sat
[2025-05-30 11:51:56] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 22 ms returned sat
[2025-05-30 11:51:56] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-30 11:51:56] [INFO ] [Nat]Absence check using 37 positive place invariants in 10 ms returned sat
[2025-05-30 11:51:56] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 22 ms returned sat
[2025-05-30 11:51:56] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-30 11:51:56] [INFO ] After 296ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-30 11:51:56] [INFO ] After 488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-30 11:51:56] [INFO ] Flatten gal took : 22 ms
[2025-05-30 11:51:56] [INFO ] Flatten gal took : 21 ms
[2025-05-30 11:51:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3906240194635319897.gal : 4 ms
[2025-05-30 11:51:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9361348269226280757.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/ReachabilityCardinality3906240194635319897.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9361348269226280757.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9361348269226280757.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 32
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :32 after 56
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :56 after 96
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :96 after 696
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :696 after 1304
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1304 after 12788
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :12788 after 43226
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :43226 after 187492
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :187492 after 298020
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :298020 after 1.94378e+06
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.77546e+09 after 2.66361e+09
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.66361e+09 after 2.66826e+09
Detected timeout of ITS tools.
[2025-05-30 11:52:11] [INFO ] Flatten gal took : 16 ms
[2025-05-30 11:52:11] [INFO ] Applying decomposition
[2025-05-30 11:52:11] [INFO ] Flatten gal took : 13 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/graph16363722586227055312.txt' '-o' '/tmp/graph16363722586227055312.bin' '-w' '/tmp/graph16363722586227055312.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16363722586227055312.bin' '-l' '-1' '-v' '-w' '/tmp/graph16363722586227055312.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:52:11] [INFO ] Decomposing Gal with order
[2025-05-30 11:52:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:52:11] [INFO ] Removed a total of 83 redundant transitions.
[2025-05-30 11:52:11] [INFO ] Flatten gal took : 28 ms
[2025-05-30 11:52:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 3 ms.
[2025-05-30 11:52:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2701466298591814113.gal : 5 ms
[2025-05-30 11:52:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7038931230770269405.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/ReachabilityCardinality2701466298591814113.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7038931230770269405.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality7038931230770269405.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 1092
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1092 after 17180
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :50736 after 3.19033e+08
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3.19033e+08 after 2.01963e+09
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.01963e+09 after 3.54182e+09
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.54182e+09 after 5.36847e+09
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5.36847e+09 after 9.02167e+09
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :9.02167e+09 after 1.51104e+10
Detected timeout of ITS tools.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 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\_mod\_flat,6.57362e+13,8.49452,170464,9210,6109,402643,26684,355,327172,547,183966,0
Total reachable state count : 65736195390482

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,39366,8.52247,170464,61,252,402643,26684,357,327172,550,183966,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,39366,8.52561,170464,61,252,402643,26684,361,327172,552,183966,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 24493 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-60b-UpperBounds-10 in 176688 ms.
[2025-05-30 11:52:20] [INFO ] Flatten gal took : 31 ms
[2025-05-30 11:52:20] [INFO ] Applying decomposition
[2025-05-30 11:52:20] [INFO ] Flatten gal took : 19 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/graph4026070061109070036.txt' '-o' '/tmp/graph4026070061109070036.bin' '-w' '/tmp/graph4026070061109070036.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4026070061109070036.bin' '-l' '-1' '-v' '-w' '/tmp/graph4026070061109070036.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:52:20] [INFO ] Decomposing Gal with order
[2025-05-30 11:52:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:52:20] [INFO ] Removed a total of 47 redundant transitions.
[2025-05-30 11:52:20] [INFO ] Flatten gal took : 24 ms
[2025-05-30 11:52:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 4 ms.
[2025-05-30 11:52:20] [INFO ] Time to serialize gal into /tmp/UpperBounds9252394088146090253.gal : 4 ms
[2025-05-30 11:52:20] [INFO ] Time to serialize properties into /tmp/UpperBounds17506622845924038350.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/UpperBounds9252394088146090253.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17506622845924038350.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/UpperBounds17506622845924038350.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,9.97064e+13,242.308,2209100,122716,12674,3.66828e+06,16753,302,2.19003e+07,536,202708,0
Total reachable state count : 99706440827392

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60b-UpperBounds-10 :0 <= u13.p129 <= 1
FORMULA DES-PT-60b-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60b-UpperBounds-10,0,306.926,2361176,1,0,3.66828e+06,147529,495,2.87446e+07,728,615453,44422
Total runtime 1486415 ms.

BK_STOP 1748606248367

--------------------
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="DES-PT-60b"
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 DES-PT-60b, 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 r069-smll-174854075900047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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