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.r153-tall-174876824800073.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 Peterson-COL-6, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-174876824800073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 46K 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 Peterson-COL-6-UpperBounds-00
FORMULA_NAME Peterson-COL-6-UpperBounds-01
FORMULA_NAME Peterson-COL-6-UpperBounds-02
FORMULA_NAME Peterson-COL-6-UpperBounds-03
FORMULA_NAME Peterson-COL-6-UpperBounds-04
FORMULA_NAME Peterson-COL-6-UpperBounds-05
FORMULA_NAME Peterson-COL-6-UpperBounds-06
FORMULA_NAME Peterson-COL-6-UpperBounds-07
FORMULA_NAME Peterson-COL-6-UpperBounds-08
FORMULA_NAME Peterson-COL-6-UpperBounds-09
FORMULA_NAME Peterson-COL-6-UpperBounds-10
FORMULA_NAME Peterson-COL-6-UpperBounds-11
FORMULA_NAME Peterson-COL-6-UpperBounds-12
FORMULA_NAME Peterson-COL-6-UpperBounds-13
FORMULA_NAME Peterson-COL-6-UpperBounds-14
FORMULA_NAME Peterson-COL-6-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748841534181

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-6
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 05:18:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 05:18:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:18:55] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 05:18:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 05:18:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 558 ms
[2025-06-02 05:18:56] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 1372 PT places and 2247.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Reduction of identical properties reduced properties to check from 16 to 8
[2025-06-02 05:18:56] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 3 ms.
[2025-06-02 05:18:56] [INFO ] Skeletonized 8 HLPN properties in 1 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2025-06-02 05:18:56] [INFO ] Computed 1 invariants in 7 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 7, 0, 0, 0] Max Struct:[7, 7, 7, 7, 7, 7, 7, 7]
FORMULA Peterson-COL-6-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-6-UpperBounds-10 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-6-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-6-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 05:18:56] [INFO ] Invariant cache hit.
[2025-06-02 05:18:56] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-02 05:18:56] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-02 05:18:56] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 05:18:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-02 05:18:56] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 05:18:56] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 05:18:56] [INFO ] Added : 11 causal constraints over 4 iterations in 27 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 05:18:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:56] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 05:18:56] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:18:56] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:18:56] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:56] [INFO ] Added : 11 causal constraints over 4 iterations in 20 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:18:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:56] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 05:18:56] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:18:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:56] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:18:56] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:18:56] [INFO ] Added : 11 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:18:56] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:18:56] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 05:18:56] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:18:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:18:56] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:18:56] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:18:56] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2025-06-02 05:18:56] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:18:56] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:18:56] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:56] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:18:56] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:18:56] [INFO ] Added : 11 causal constraints over 5 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:18:56] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:18:56] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:18:56] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:18:56] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:18:56] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:18:56] [INFO ] Added : 12 causal constraints over 4 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:18:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:57] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:18:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:18:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:18:57] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:18:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:57] [INFO ] Added : 11 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 7, 7, 7, 7, 7]
Domain [Process(7), Tour(6), Process(7)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 6)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-02 05:18:57] [INFO ] Unfolded HLPN to a Petri net with 1372 places and 2114 transitions 6608 arcs in 51 ms.
[2025-06-02 05:18:57] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Deduced a syphon composed of 42 places in 17 ms
Reduce places removed 42 places and 84 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 7, 7, 7, 7, 7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 7, 7, 7, 7, 7]
[2025-06-02 05:18:57] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2025-06-02 05:18:57] [INFO ] Computed 27 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 7, 7, 7, 7, 7, 7]
RANDOM walk for 10000 steps (2 resets) in 223 ms. (44 steps per ms)
FORMULA Peterson-COL-6-UpperBounds-13 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 6, 1, 3] Max Struct:[7, 7, 7, 7]
[2025-06-02 05:18:57] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2025-06-02 05:18:57] [INFO ] Invariant cache hit.
[2025-06-02 05:18:57] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2025-06-02 05:18:57] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 10 ms returned sat
[2025-06-02 05:18:58] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2025-06-02 05:18:58] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-02 05:18:58] [INFO ] [Real]Added 330 Read/Feed constraints in 235 ms returned sat
[2025-06-02 05:18:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 23 ms returned sat
[2025-06-02 05:18:58] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 10 ms returned sat
[2025-06-02 05:18:59] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2025-06-02 05:18:59] [INFO ] [Nat]Added 330 Read/Feed constraints in 368 ms returned sat
[2025-06-02 05:19:00] [INFO ] Deduced a trap composed of 17 places in 548 ms of which 63 ms to minimize.
[2025-06-02 05:19:00] [INFO ] Deduced a trap composed of 31 places in 470 ms of which 8 ms to minimize.
[2025-06-02 05:19:01] [INFO ] Deduced a trap composed of 31 places in 511 ms of which 7 ms to minimize.
[2025-06-02 05:19:01] [INFO ] Deduced a trap composed of 31 places in 465 ms of which 7 ms to minimize.
[2025-06-02 05:19:02] [INFO ] Deduced a trap composed of 32 places in 470 ms of which 7 ms to minimize.
[2025-06-02 05:19:02] [INFO ] Deduced a trap composed of 31 places in 465 ms of which 7 ms to minimize.
[2025-06-02 05:19:03] [INFO ] Deduced a trap composed of 35 places in 468 ms of which 7 ms to minimize.
[2025-06-02 05:19:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 3859 ms
[2025-06-02 05:19:03] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2025-06-02 05:19:03] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 15 ms returned sat
[2025-06-02 05:19:04] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2025-06-02 05:19:04] [INFO ] [Real]Added 330 Read/Feed constraints in 98 ms returned sat
[2025-06-02 05:19:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 23 ms returned sat
[2025-06-02 05:19:04] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 13 ms returned sat
[2025-06-02 05:19:05] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2025-06-02 05:19:05] [INFO ] [Nat]Added 330 Read/Feed constraints in 352 ms returned sat
[2025-06-02 05:19:05] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 113 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2025-06-02 05:19:09] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2025-06-02 05:19:09] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 9 ms returned sat
[2025-06-02 05:19:10] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2025-06-02 05:19:10] [INFO ] [Real]Added 330 Read/Feed constraints in 52 ms returned sat
[2025-06-02 05:19:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 22 ms returned sat
[2025-06-02 05:19:10] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 9 ms returned sat
[2025-06-02 05:19:11] [INFO ] [Nat]Absence check using state equation in 486 ms returned sat
[2025-06-02 05:19:11] [INFO ] [Nat]Added 330 Read/Feed constraints in 376 ms returned sat
[2025-06-02 05:19:11] [INFO ] Deduced a trap composed of 16 places in 420 ms of which 7 ms to minimize.
[2025-06-02 05:19:12] [INFO ] Deduced a trap composed of 29 places in 444 ms of which 7 ms to minimize.
[2025-06-02 05:19:12] [INFO ] Deduced a trap composed of 108 places in 482 ms of which 7 ms to minimize.
[2025-06-02 05:19:13] [INFO ] Deduced a trap composed of 62 places in 482 ms of which 6 ms to minimize.
[2025-06-02 05:19:14] [INFO ] Deduced a trap composed of 106 places in 429 ms of which 6 ms to minimize.
[2025-06-02 05:19:14] [INFO ] Deduced a trap composed of 129 places in 501 ms of which 6 ms to minimize.
[2025-06-02 05:19:15] [INFO ] Deduced a trap composed of 145 places in 471 ms of which 7 ms to minimize.
[2025-06-02 05:19:15] [INFO ] Deduced a trap composed of 19 places in 421 ms of which 7 ms to minimize.
[2025-06-02 05:19:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 05:19:15] [INFO ] [Real]Absence check using 20 positive place invariants in 23 ms returned sat
[2025-06-02 05:19:15] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 14 ms returned sat
[2025-06-02 05:19:16] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2025-06-02 05:19:16] [INFO ] [Real]Added 330 Read/Feed constraints in 47 ms returned sat
[2025-06-02 05:19:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:16] [INFO ] [Nat]Absence check using 20 positive place invariants in 23 ms returned sat
[2025-06-02 05:19:16] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 15 ms returned sat
[2025-06-02 05:19:17] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2025-06-02 05:19:17] [INFO ] [Nat]Added 330 Read/Feed constraints in 232 ms returned sat
[2025-06-02 05:19:17] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 104 ms.
[2025-06-02 05:19:21] [INFO ] Added : 152 causal constraints over 31 iterations in 3798 ms. Result :sat
Minimization took 247 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 6, 1, 3] Max Struct:[6, 7, 7, 7]
FORMULA Peterson-COL-6-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 1, 3] Max Struct:[7, 7, 7]
Support contains 343 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1330 transition count 1778
Reduce places removed 252 places and 0 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Iterating post reduction 1 with 504 rules applied. Total rules applied 756 place count 1078 transition count 1526
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 2 with 252 rules applied. Total rules applied 1008 place count 826 transition count 1526
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 1008 place count 826 transition count 1449
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 1162 place count 749 transition count 1449
Applied a total of 1162 rules in 261 ms. Remains 749 /1330 variables (removed 581) and now considering 1449/2030 (removed 581) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 749/1330 places, 1449/2030 transitions.
[2025-06-02 05:19:21] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
// Phase 1: matrix 1239 rows 749 cols
[2025-06-02 05:19:21] [INFO ] Computed 27 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6, 1, 3] Max Struct:[7, 7, 7]
RANDOM walk for 1000000 steps (2 resets) in 6733 ms. (148 steps per ms)
FORMULA Peterson-COL-6-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1928603 steps (4 resets) in 6565 ms. (293 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 6] Max Struct:[7, 7]
[2025-06-02 05:19:35] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2025-06-02 05:19:35] [INFO ] Invariant cache hit.
[2025-06-02 05:19:35] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-06-02 05:19:35] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2025-06-02 05:19:35] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2025-06-02 05:19:35] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-02 05:19:35] [INFO ] [Real]Added 330 Read/Feed constraints in 44 ms returned sat
[2025-06-02 05:19:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:35] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2025-06-02 05:19:35] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2025-06-02 05:19:35] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2025-06-02 05:19:36] [INFO ] [Nat]Added 330 Read/Feed constraints in 150 ms returned sat
[2025-06-02 05:19:36] [INFO ] Deduced a trap composed of 27 places in 234 ms of which 4 ms to minimize.
[2025-06-02 05:19:36] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 4 ms to minimize.
[2025-06-02 05:19:36] [INFO ] Deduced a trap composed of 53 places in 241 ms of which 4 ms to minimize.
[2025-06-02 05:19:37] [INFO ] Deduced a trap composed of 59 places in 250 ms of which 4 ms to minimize.
[2025-06-02 05:19:37] [INFO ] Deduced a trap composed of 40 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:19:37] [INFO ] Deduced a trap composed of 26 places in 237 ms of which 4 ms to minimize.
[2025-06-02 05:19:38] [INFO ] Deduced a trap composed of 105 places in 235 ms of which 4 ms to minimize.
[2025-06-02 05:19:38] [INFO ] Deduced a trap composed of 61 places in 238 ms of which 4 ms to minimize.
[2025-06-02 05:19:38] [INFO ] Deduced a trap composed of 51 places in 235 ms of which 4 ms to minimize.
[2025-06-02 05:19:38] [INFO ] Deduced a trap composed of 76 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:19:39] [INFO ] Deduced a trap composed of 55 places in 221 ms of which 4 ms to minimize.
[2025-06-02 05:19:39] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:19:39] [INFO ] Deduced a trap composed of 51 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:19:40] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 6 ms to minimize.
[2025-06-02 05:19:40] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:19:40] [INFO ] Deduced a trap composed of 38 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:19:40] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 4 ms to minimize.
[2025-06-02 05:19:41] [INFO ] Deduced a trap composed of 22 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:19:41] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:19:41] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 5 ms to minimize.
[2025-06-02 05:19:42] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:19:42] [INFO ] Deduced a trap composed of 14 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:19:43] [INFO ] Deduced a trap composed of 56 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:19:43] [INFO ] Deduced a trap composed of 92 places in 228 ms of which 4 ms to minimize.
[2025-06-02 05:19:43] [INFO ] Deduced a trap composed of 76 places in 217 ms of which 4 ms to minimize.
[2025-06-02 05:19:43] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:19:44] [INFO ] Deduced a trap composed of 108 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:19:44] [INFO ] Deduced a trap composed of 36 places in 221 ms of which 4 ms to minimize.
[2025-06-02 05:19:44] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 4 ms to minimize.
[2025-06-02 05:19:45] [INFO ] Deduced a trap composed of 74 places in 321 ms of which 4 ms to minimize.
[2025-06-02 05:19:45] [INFO ] Deduced a trap composed of 56 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:19:45] [INFO ] Deduced a trap composed of 22 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:19:46] [INFO ] Deduced a trap composed of 47 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:19:46] [INFO ] Deduced a trap composed of 100 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:19:46] [INFO ] Deduced a trap composed of 62 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:19:46] [INFO ] Deduced a trap composed of 100 places in 206 ms of which 4 ms to minimize.
[2025-06-02 05:19:47] [INFO ] Deduced a trap composed of 81 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:19:47] [INFO ] Deduced a trap composed of 28 places in 210 ms of which 4 ms to minimize.
[2025-06-02 05:19:47] [INFO ] Deduced a trap composed of 68 places in 249 ms of which 3 ms to minimize.
[2025-06-02 05:19:48] [INFO ] Deduced a trap composed of 98 places in 248 ms of which 3 ms to minimize.
[2025-06-02 05:19:48] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 6 ms to minimize.
[2025-06-02 05:19:48] [INFO ] Deduced a trap composed of 116 places in 297 ms of which 4 ms to minimize.
[2025-06-02 05:19:49] [INFO ] Deduced a trap composed of 78 places in 211 ms of which 4 ms to minimize.
[2025-06-02 05:19:49] [INFO ] Deduced a trap composed of 28 places in 211 ms of which 4 ms to minimize.
[2025-06-02 05:19:49] [INFO ] Deduced a trap composed of 100 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:19:53] [INFO ] Deduced a trap composed of 58 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:19:53] [INFO ] Deduced a trap composed of 22 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:19:53] [INFO ] Deduced a trap composed of 56 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:19:53] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:19:54] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 3 ms to minimize.
[2025-06-02 05:19:54] [INFO ] Deduced a trap composed of 67 places in 209 ms of which 4 ms to minimize.
[2025-06-02 05:19:55] [INFO ] Deduced a trap composed of 38 places in 211 ms of which 4 ms to minimize.
[2025-06-02 05:19:55] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 4 ms to minimize.
[2025-06-02 05:19:59] [INFO ] Deduced a trap composed of 52 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:19:59] [INFO ] Deduced a trap composed of 76 places in 205 ms of which 4 ms to minimize.
[2025-06-02 05:20:00] [INFO ] Deduced a trap composed of 56 places in 208 ms of which 4 ms to minimize.
[2025-06-02 05:20:00] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:20:00] [INFO ] Deduced a trap composed of 55 places in 200 ms of which 4 ms to minimize.
[2025-06-02 05:20:01] [INFO ] Deduced a trap composed of 100 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:20:01] [INFO ] Deduced a trap composed of 68 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:20:01] [INFO ] Deduced a trap composed of 72 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:20:02] [INFO ] Deduced a trap composed of 28 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:20:02] [INFO ] Deduced a trap composed of 79 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:20:02] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:20:04] [INFO ] Deduced a trap composed of 62 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:20:05] [INFO ] Deduced a trap composed of 78 places in 216 ms of which 4 ms to minimize.
[2025-06-02 05:20:06] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 4 ms to minimize.
[2025-06-02 05:20:06] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:20:07] [INFO ] Deduced a trap composed of 52 places in 206 ms of which 5 ms to minimize.
[2025-06-02 05:20:07] [INFO ] Deduced a trap composed of 84 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:20:07] [INFO ] Deduced a trap composed of 68 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:20:07] [INFO ] Deduced a trap composed of 60 places in 193 ms of which 4 ms to minimize.
[2025-06-02 05:20:08] [INFO ] Deduced a trap composed of 108 places in 190 ms of which 4 ms to minimize.
[2025-06-02 05:20:09] [INFO ] Deduced a trap composed of 36 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:20:10] [INFO ] Deduced a trap composed of 94 places in 201 ms of which 4 ms to minimize.
[2025-06-02 05:20:11] [INFO ] Deduced a trap composed of 118 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:20:11] [INFO ] Deduced a trap composed of 106 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:20:11] [INFO ] Deduced a trap composed of 86 places in 199 ms of which 4 ms to minimize.
[2025-06-02 05:20:11] [INFO ] Deduced a trap composed of 67 places in 204 ms of which 4 ms to minimize.
[2025-06-02 05:20:12] [INFO ] Deduced a trap composed of 87 places in 192 ms of which 4 ms to minimize.
[2025-06-02 05:20:12] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:20:12] [INFO ] Deduced a trap composed of 52 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:20:12] [INFO ] Deduced a trap composed of 82 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:20:13] [INFO ] Deduced a trap composed of 50 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:20:13] [INFO ] Deduced a trap composed of 121 places in 188 ms of which 4 ms to minimize.
[2025-06-02 05:20:13] [INFO ] Deduced a trap composed of 184 places in 195 ms of which 4 ms to minimize.
[2025-06-02 05:20:14] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 4 ms to minimize.
[2025-06-02 05:20:14] [INFO ] Deduced a trap composed of 87 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:20:14] [INFO ] Deduced a trap composed of 66 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:20:15] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:20:15] [INFO ] Deduced a trap composed of 44 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:20:19] [INFO ] Trap strengthening (SAT) tested/added 91/91 trap constraints in 43868 ms
[2025-06-02 05:20:20] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2025-06-02 05:20:20] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2025-06-02 05:20:20] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2025-06-02 05:20:20] [INFO ] [Real]Added 330 Read/Feed constraints in 51 ms returned sat
[2025-06-02 05:20:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:20:20] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-06-02 05:20:20] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2025-06-02 05:20:20] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2025-06-02 05:20:20] [INFO ] [Nat]Added 330 Read/Feed constraints in 84 ms returned sat
[2025-06-02 05:20:21] [INFO ] Computed and/alt/rep : 1148/3171/1148 causal constraints (skipped 84 transitions) in 84 ms.
[2025-06-02 05:20:23] [INFO ] Deduced a trap composed of 115 places in 263 ms of which 5 ms to minimize.
[2025-06-02 05:20:24] [INFO ] Deduced a trap composed of 73 places in 263 ms of which 5 ms to minimize.
[2025-06-02 05:20:24] [INFO ] Deduced a trap composed of 72 places in 274 ms of which 5 ms to minimize.
[2025-06-02 05:20:25] [INFO ] Deduced a trap composed of 18 places in 262 ms of which 4 ms to minimize.
[2025-06-02 05:20:25] [INFO ] Deduced a trap composed of 55 places in 266 ms of which 4 ms to minimize.
[2025-06-02 05:20:25] [INFO ] Deduced a trap composed of 68 places in 257 ms of which 4 ms to minimize.
[2025-06-02 05:20:25] [INFO ] Deduced a trap composed of 67 places in 271 ms of which 4 ms to minimize.
[2025-06-02 05:20:26] [INFO ] Deduced a trap composed of 69 places in 268 ms of which 4 ms to minimize.
[2025-06-02 05:20:26] [INFO ] Deduced a trap composed of 106 places in 258 ms of which 4 ms to minimize.
[2025-06-02 05:20:26] [INFO ] Deduced a trap composed of 186 places in 259 ms of which 4 ms to minimize.
[2025-06-02 05:20:27] [INFO ] Deduced a trap composed of 126 places in 258 ms of which 5 ms to minimize.
[2025-06-02 05:20:27] [INFO ] Deduced a trap composed of 22 places in 258 ms of which 4 ms to minimize.
[2025-06-02 05:20:28] [INFO ] Deduced a trap composed of 74 places in 273 ms of which 4 ms to minimize.
[2025-06-02 05:20:28] [INFO ] Deduced a trap composed of 30 places in 264 ms of which 4 ms to minimize.
[2025-06-02 05:20:28] [INFO ] Deduced a trap composed of 35 places in 264 ms of which 5 ms to minimize.
[2025-06-02 05:20:29] [INFO ] Deduced a trap composed of 88 places in 270 ms of which 4 ms to minimize.
[2025-06-02 05:20:29] [INFO ] Deduced a trap composed of 48 places in 279 ms of which 4 ms to minimize.
[2025-06-02 05:20:30] [INFO ] Deduced a trap composed of 83 places in 264 ms of which 4 ms to minimize.
[2025-06-02 05:20:30] [INFO ] Deduced a trap composed of 59 places in 262 ms of which 4 ms to minimize.
[2025-06-02 05:20:30] [INFO ] Deduced a trap composed of 143 places in 262 ms of which 4 ms to minimize.
[2025-06-02 05:20:31] [INFO ] Deduced a trap composed of 43 places in 260 ms of which 4 ms to minimize.
[2025-06-02 05:20:31] [INFO ] Deduced a trap composed of 47 places in 250 ms of which 4 ms to minimize.
[2025-06-02 05:20:32] [INFO ] Deduced a trap composed of 49 places in 264 ms of which 4 ms to minimize.
[2025-06-02 05:20:32] [INFO ] Deduced a trap composed of 61 places in 263 ms of which 4 ms to minimize.
[2025-06-02 05:20:32] [INFO ] Deduced a trap composed of 87 places in 258 ms of which 4 ms to minimize.
[2025-06-02 05:20:37] [INFO ] Trap strengthening (SAT) tested/added 25/25 trap constraints in 13735 ms
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 6] Max Struct:[7, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 6] Max Struct:[7, 7]
Support contains 301 out of 749 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 1449/1449 transitions.
Applied a total of 0 rules in 42 ms. Remains 749 /749 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 749/749 places, 1449/1449 transitions.
[2025-06-02 05:21:05] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2025-06-02 05:21:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 6] Max Struct:[7, 7]
RANDOM walk for 1000000 steps (2 resets) in 6269 ms. (159 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 6052 ms. (330 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 6] Max Struct:[7, 7]
[2025-06-02 05:21:18] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2025-06-02 05:21:18] [INFO ] Invariant cache hit.
[2025-06-02 05:21:18] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2025-06-02 05:21:18] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2025-06-02 05:21:18] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2025-06-02 05:21:18] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-02 05:21:18] [INFO ] [Real]Added 330 Read/Feed constraints in 41 ms returned sat
[2025-06-02 05:21:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-06-02 05:21:18] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2025-06-02 05:21:18] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2025-06-02 05:21:18] [INFO ] [Nat]Added 330 Read/Feed constraints in 136 ms returned sat
[2025-06-02 05:21:19] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:21:19] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:21:19] [INFO ] Deduced a trap composed of 53 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:21:20] [INFO ] Deduced a trap composed of 59 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:21:20] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:21:20] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:21:20] [INFO ] Deduced a trap composed of 105 places in 219 ms of which 4 ms to minimize.
[2025-06-02 05:21:21] [INFO ] Deduced a trap composed of 61 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:21:21] [INFO ] Deduced a trap composed of 51 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:21:21] [INFO ] Deduced a trap composed of 76 places in 218 ms of which 4 ms to minimize.
[2025-06-02 05:21:21] [INFO ] Deduced a trap composed of 55 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:21:22] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 4 ms to minimize.
[2025-06-02 05:21:22] [INFO ] Deduced a trap composed of 51 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:21:22] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:21:22] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:21:23] [INFO ] Deduced a trap composed of 38 places in 238 ms of which 4 ms to minimize.
[2025-06-02 05:21:23] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:21:23] [INFO ] Deduced a trap composed of 22 places in 217 ms of which 4 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 4 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 38 places in 229 ms of which 4 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 5 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 56 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 92 places in 222 ms of which 4 ms to minimize.
[2025-06-02 05:21:26] [INFO ] Deduced a trap composed of 76 places in 222 ms of which 4 ms to minimize.
[2025-06-02 05:21:26] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 4 ms to minimize.
[2025-06-02 05:21:26] [INFO ] Deduced a trap composed of 108 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:21:26] [INFO ] Deduced a trap composed of 36 places in 219 ms of which 4 ms to minimize.
[2025-06-02 05:21:27] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:21:27] [INFO ] Deduced a trap composed of 74 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:21:27] [INFO ] Deduced a trap composed of 56 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:21:28] [INFO ] Deduced a trap composed of 22 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:21:28] [INFO ] Deduced a trap composed of 47 places in 213 ms of which 4 ms to minimize.
[2025-06-02 05:21:28] [INFO ] Deduced a trap composed of 100 places in 216 ms of which 4 ms to minimize.
[2025-06-02 05:21:29] [INFO ] Deduced a trap composed of 62 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:21:29] [INFO ] Deduced a trap composed of 100 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:21:29] [INFO ] Deduced a trap composed of 81 places in 218 ms of which 4 ms to minimize.
[2025-06-02 05:21:29] [INFO ] Deduced a trap composed of 28 places in 210 ms of which 4 ms to minimize.
[2025-06-02 05:21:30] [INFO ] Deduced a trap composed of 68 places in 200 ms of which 4 ms to minimize.
[2025-06-02 05:21:30] [INFO ] Deduced a trap composed of 98 places in 216 ms of which 4 ms to minimize.
[2025-06-02 05:21:30] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:21:31] [INFO ] Deduced a trap composed of 116 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:21:31] [INFO ] Deduced a trap composed of 78 places in 211 ms of which 4 ms to minimize.
[2025-06-02 05:21:31] [INFO ] Deduced a trap composed of 28 places in 210 ms of which 4 ms to minimize.
[2025-06-02 05:21:32] [INFO ] Deduced a trap composed of 100 places in 209 ms of which 4 ms to minimize.
[2025-06-02 05:21:35] [INFO ] Deduced a trap composed of 58 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:21:35] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:21:35] [INFO ] Deduced a trap composed of 56 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:21:35] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:21:36] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:21:36] [INFO ] Deduced a trap composed of 67 places in 209 ms of which 4 ms to minimize.
[2025-06-02 05:21:37] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:21:37] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 4 ms to minimize.
[2025-06-02 05:21:40] [INFO ] Deduced a trap composed of 52 places in 201 ms of which 4 ms to minimize.
[2025-06-02 05:21:41] [INFO ] Deduced a trap composed of 76 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:21:41] [INFO ] Deduced a trap composed of 56 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:21:42] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:21:42] [INFO ] Deduced a trap composed of 55 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:21:43] [INFO ] Deduced a trap composed of 100 places in 211 ms of which 4 ms to minimize.
[2025-06-02 05:21:43] [INFO ] Deduced a trap composed of 68 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:21:43] [INFO ] Deduced a trap composed of 72 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:21:43] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 4 ms to minimize.
[2025-06-02 05:21:44] [INFO ] Deduced a trap composed of 79 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:21:44] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 4 ms to minimize.
[2025-06-02 05:21:46] [INFO ] Deduced a trap composed of 62 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:21:47] [INFO ] Deduced a trap composed of 78 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:21:47] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:21:48] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:21:48] [INFO ] Deduced a trap composed of 52 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:21:49] [INFO ] Deduced a trap composed of 84 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:21:49] [INFO ] Deduced a trap composed of 68 places in 189 ms of which 4 ms to minimize.
[2025-06-02 05:21:49] [INFO ] Deduced a trap composed of 60 places in 191 ms of which 4 ms to minimize.
[2025-06-02 05:21:50] [INFO ] Deduced a trap composed of 108 places in 188 ms of which 4 ms to minimize.
[2025-06-02 05:21:51] [INFO ] Deduced a trap composed of 36 places in 217 ms of which 4 ms to minimize.
[2025-06-02 05:21:52] [INFO ] Deduced a trap composed of 94 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:21:52] [INFO ] Deduced a trap composed of 118 places in 206 ms of which 4 ms to minimize.
[2025-06-02 05:21:53] [INFO ] Deduced a trap composed of 106 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:21:53] [INFO ] Deduced a trap composed of 86 places in 203 ms of which 4 ms to minimize.
[2025-06-02 05:21:53] [INFO ] Deduced a trap composed of 67 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:21:53] [INFO ] Deduced a trap composed of 87 places in 197 ms of which 4 ms to minimize.
[2025-06-02 05:21:54] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 4 ms to minimize.
[2025-06-02 05:21:54] [INFO ] Deduced a trap composed of 52 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:21:54] [INFO ] Deduced a trap composed of 82 places in 197 ms of which 4 ms to minimize.
[2025-06-02 05:21:54] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 4 ms to minimize.
[2025-06-02 05:21:55] [INFO ] Deduced a trap composed of 121 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:21:55] [INFO ] Deduced a trap composed of 184 places in 192 ms of which 4 ms to minimize.
[2025-06-02 05:21:55] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:21:56] [INFO ] Deduced a trap composed of 87 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:21:56] [INFO ] Deduced a trap composed of 66 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:21:56] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:21:57] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:22:01] [INFO ] Trap strengthening (SAT) tested/added 91/91 trap constraints in 42723 ms
[2025-06-02 05:22:01] [INFO ] [Real]Absence check using 20 positive place invariants in 15 ms returned sat
[2025-06-02 05:22:01] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2025-06-02 05:22:02] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2025-06-02 05:22:02] [INFO ] [Real]Added 330 Read/Feed constraints in 50 ms returned sat
[2025-06-02 05:22:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2025-06-02 05:22:02] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2025-06-02 05:22:02] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2025-06-02 05:22:02] [INFO ] [Nat]Added 330 Read/Feed constraints in 81 ms returned sat
[2025-06-02 05:22:02] [INFO ] Computed and/alt/rep : 1148/3171/1148 causal constraints (skipped 84 transitions) in 67 ms.
[2025-06-02 05:22:05] [INFO ] Deduced a trap composed of 115 places in 254 ms of which 5 ms to minimize.
[2025-06-02 05:22:05] [INFO ] Deduced a trap composed of 73 places in 261 ms of which 4 ms to minimize.
[2025-06-02 05:22:06] [INFO ] Deduced a trap composed of 72 places in 276 ms of which 4 ms to minimize.
[2025-06-02 05:22:06] [INFO ] Deduced a trap composed of 18 places in 272 ms of which 4 ms to minimize.
[2025-06-02 05:22:07] [INFO ] Deduced a trap composed of 55 places in 257 ms of which 4 ms to minimize.
[2025-06-02 05:22:07] [INFO ] Deduced a trap composed of 68 places in 270 ms of which 4 ms to minimize.
[2025-06-02 05:22:07] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 4 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 69 places in 263 ms of which 4 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 106 places in 263 ms of which 4 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 186 places in 254 ms of which 4 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 126 places in 266 ms of which 5 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 22 places in 252 ms of which 5 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 74 places in 270 ms of which 5 ms to minimize.
[2025-06-02 05:22:10] [INFO ] Deduced a trap composed of 30 places in 271 ms of which 4 ms to minimize.
[2025-06-02 05:22:10] [INFO ] Deduced a trap composed of 35 places in 259 ms of which 5 ms to minimize.
[2025-06-02 05:22:10] [INFO ] Deduced a trap composed of 88 places in 258 ms of which 4 ms to minimize.
[2025-06-02 05:22:11] [INFO ] Deduced a trap composed of 48 places in 267 ms of which 4 ms to minimize.
[2025-06-02 05:22:11] [INFO ] Deduced a trap composed of 83 places in 253 ms of which 4 ms to minimize.
[2025-06-02 05:22:12] [INFO ] Deduced a trap composed of 59 places in 265 ms of which 4 ms to minimize.
[2025-06-02 05:22:12] [INFO ] Deduced a trap composed of 143 places in 270 ms of which 5 ms to minimize.
[2025-06-02 05:22:12] [INFO ] Deduced a trap composed of 43 places in 255 ms of which 4 ms to minimize.
[2025-06-02 05:22:13] [INFO ] Deduced a trap composed of 47 places in 268 ms of which 4 ms to minimize.
[2025-06-02 05:22:13] [INFO ] Deduced a trap composed of 49 places in 264 ms of which 4 ms to minimize.
[2025-06-02 05:22:14] [INFO ] Deduced a trap composed of 61 places in 266 ms of which 5 ms to minimize.
[2025-06-02 05:22:14] [INFO ] Deduced a trap composed of 87 places in 265 ms of which 5 ms to minimize.
[2025-06-02 05:22:19] [INFO ] Trap strengthening (SAT) tested/added 25/25 trap constraints in 13655 ms
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 6] Max Struct:[7, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 6] Max Struct:[7, 7]
Support contains 301 out of 749 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 1449/1449 transitions.
Applied a total of 0 rules in 25 ms. Remains 749 /749 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 749/749 places, 1449/1449 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 1449/1449 transitions.
Applied a total of 0 rules in 31 ms. Remains 749 /749 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
[2025-06-02 05:22:47] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2025-06-02 05:22:47] [INFO ] Invariant cache hit.
[2025-06-02 05:22:47] [INFO ] Implicit Places using invariants in 320 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 325 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 742/749 places, 1449/1449 transitions.
Applied a total of 0 rules in 24 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 382 ms. Remains : 742/749 places, 1449/1449 transitions.
[2025-06-02 05:22:47] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
// Phase 1: matrix 1239 rows 742 cols
[2025-06-02 05:22:47] [INFO ] Computed 20 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 6] Max Struct:[7, 7]
RANDOM walk for 1000000 steps (2 resets) in 5887 ms. (169 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 5861 ms. (341 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 6] Max Struct:[7, 7]
[2025-06-02 05:22:59] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2025-06-02 05:22:59] [INFO ] Invariant cache hit.
[2025-06-02 05:22:59] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2025-06-02 05:22:59] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2025-06-02 05:22:59] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-02 05:22:59] [INFO ] [Real]Added 330 Read/Feed constraints in 40 ms returned sat
[2025-06-02 05:22:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:23:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2025-06-02 05:23:00] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2025-06-02 05:23:00] [INFO ] [Nat]Added 330 Read/Feed constraints in 139 ms returned sat
[2025-06-02 05:23:00] [INFO ] Deduced a trap composed of 66 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:23:00] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:23:01] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 4 ms to minimize.
[2025-06-02 05:23:01] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 4 ms to minimize.
[2025-06-02 05:23:01] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 4 ms to minimize.
[2025-06-02 05:23:02] [INFO ] Deduced a trap composed of 60 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:23:02] [INFO ] Deduced a trap composed of 22 places in 217 ms of which 4 ms to minimize.
[2025-06-02 05:23:02] [INFO ] Deduced a trap composed of 44 places in 211 ms of which 4 ms to minimize.
[2025-06-02 05:23:02] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 6 ms to minimize.
[2025-06-02 05:23:03] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:23:03] [INFO ] Deduced a trap composed of 28 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:23:03] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:23:03] [INFO ] Deduced a trap composed of 64 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:23:04] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 4 ms to minimize.
[2025-06-02 05:23:04] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:23:04] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:23:04] [INFO ] Deduced a trap composed of 81 places in 205 ms of which 4 ms to minimize.
[2025-06-02 05:23:05] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:23:05] [INFO ] Deduced a trap composed of 28 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:23:05] [INFO ] Deduced a trap composed of 100 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:23:05] [INFO ] Deduced a trap composed of 63 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:23:06] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:23:06] [INFO ] Deduced a trap composed of 71 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:23:06] [INFO ] Deduced a trap composed of 74 places in 208 ms of which 4 ms to minimize.
[2025-06-02 05:23:06] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 4 ms to minimize.
[2025-06-02 05:23:07] [INFO ] Deduced a trap composed of 83 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:23:07] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:23:07] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 4 ms to minimize.
[2025-06-02 05:23:08] [INFO ] Deduced a trap composed of 59 places in 222 ms of which 5 ms to minimize.
[2025-06-02 05:23:08] [INFO ] Deduced a trap composed of 80 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:23:08] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:23:08] [INFO ] Deduced a trap composed of 85 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:23:09] [INFO ] Deduced a trap composed of 64 places in 218 ms of which 4 ms to minimize.
[2025-06-02 05:23:09] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:23:09] [INFO ] Deduced a trap composed of 51 places in 217 ms of which 4 ms to minimize.
[2025-06-02 05:23:09] [INFO ] Deduced a trap composed of 16 places in 211 ms of which 4 ms to minimize.
[2025-06-02 05:23:10] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 4 ms to minimize.
[2025-06-02 05:23:10] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:23:10] [INFO ] Deduced a trap composed of 61 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:23:10] [INFO ] Deduced a trap composed of 112 places in 210 ms of which 4 ms to minimize.
[2025-06-02 05:23:11] [INFO ] Deduced a trap composed of 74 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:23:11] [INFO ] Deduced a trap composed of 48 places in 206 ms of which 4 ms to minimize.
[2025-06-02 05:23:11] [INFO ] Deduced a trap composed of 94 places in 219 ms of which 4 ms to minimize.
[2025-06-02 05:23:12] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 4 ms to minimize.
[2025-06-02 05:23:12] [INFO ] Deduced a trap composed of 56 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:23:12] [INFO ] Deduced a trap composed of 86 places in 216 ms of which 4 ms to minimize.
[2025-06-02 05:23:12] [INFO ] Deduced a trap composed of 97 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:23:13] [INFO ] Deduced a trap composed of 102 places in 204 ms of which 4 ms to minimize.
[2025-06-02 05:23:13] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 4 ms to minimize.
[2025-06-02 05:23:13] [INFO ] Deduced a trap composed of 46 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:23:14] [INFO ] Deduced a trap composed of 73 places in 201 ms of which 4 ms to minimize.
[2025-06-02 05:23:14] [INFO ] Deduced a trap composed of 105 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:23:14] [INFO ] Deduced a trap composed of 109 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:23:17] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:23:17] [INFO ] Deduced a trap composed of 54 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:23:17] [INFO ] Deduced a trap composed of 54 places in 194 ms of which 4 ms to minimize.
[2025-06-02 05:23:17] [INFO ] Deduced a trap composed of 50 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:23:18] [INFO ] Deduced a trap composed of 76 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:23:18] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:23:18] [INFO ] Deduced a trap composed of 83 places in 210 ms of which 4 ms to minimize.
[2025-06-02 05:23:18] [INFO ] Deduced a trap composed of 50 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:23:19] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:23:19] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:23:19] [INFO ] Deduced a trap composed of 54 places in 189 ms of which 3 ms to minimize.
[2025-06-02 05:23:19] [INFO ] Deduced a trap composed of 78 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:23:20] [INFO ] Deduced a trap composed of 104 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:23:20] [INFO ] Deduced a trap composed of 109 places in 201 ms of which 4 ms to minimize.
[2025-06-02 05:23:20] [INFO ] Deduced a trap composed of 92 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:23:20] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:23:21] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:23:21] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:23:21] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:23:21] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 4 ms to minimize.
[2025-06-02 05:23:22] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 4 ms to minimize.
[2025-06-02 05:23:22] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 4 ms to minimize.
[2025-06-02 05:23:22] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:23:23] [INFO ] Deduced a trap composed of 54 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:23:23] [INFO ] Deduced a trap composed of 54 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:23:23] [INFO ] Deduced a trap composed of 104 places in 199 ms of which 4 ms to minimize.
[2025-06-02 05:23:24] [INFO ] Deduced a trap composed of 54 places in 189 ms of which 4 ms to minimize.
[2025-06-02 05:23:24] [INFO ] Deduced a trap composed of 40 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:23:24] [INFO ] Deduced a trap composed of 30 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:23:24] [INFO ] Deduced a trap composed of 50 places in 193 ms of which 4 ms to minimize.
[2025-06-02 05:23:25] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 4 ms to minimize.
[2025-06-02 05:23:25] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 4 ms to minimize.
[2025-06-02 05:23:25] [INFO ] Deduced a trap composed of 73 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:23:26] [INFO ] Deduced a trap composed of 43 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:23:26] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 4 ms to minimize.
[2025-06-02 05:23:26] [INFO ] Deduced a trap composed of 98 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:23:26] [INFO ] Deduced a trap composed of 79 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:23:27] [INFO ] Deduced a trap composed of 60 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:23:27] [INFO ] Deduced a trap composed of 78 places in 196 ms of which 4 ms to minimize.
[2025-06-02 05:23:27] [INFO ] Deduced a trap composed of 65 places in 190 ms of which 4 ms to minimize.
[2025-06-02 05:23:28] [INFO ] Deduced a trap composed of 109 places in 206 ms of which 4 ms to minimize.
[2025-06-02 05:23:28] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:23:28] [INFO ] Deduced a trap composed of 67 places in 201 ms of which 4 ms to minimize.
[2025-06-02 05:23:28] [INFO ] Deduced a trap composed of 48 places in 194 ms of which 4 ms to minimize.
[2025-06-02 05:23:29] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:23:29] [INFO ] Deduced a trap composed of 103 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:23:29] [INFO ] Deduced a trap composed of 48 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:23:34] [INFO ] Trap strengthening (SAT) tested/added 100/100 trap constraints in 33829 ms
[2025-06-02 05:23:34] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2025-06-02 05:23:34] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2025-06-02 05:23:34] [INFO ] [Real]Added 330 Read/Feed constraints in 48 ms returned sat
[2025-06-02 05:23:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:23:34] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2025-06-02 05:23:35] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2025-06-02 05:23:35] [INFO ] [Nat]Added 330 Read/Feed constraints in 94 ms returned sat
[2025-06-02 05:23:35] [INFO ] Deduced a trap composed of 12 places in 251 ms of which 5 ms to minimize.
[2025-06-02 05:23:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2025-06-02 05:23:35] [INFO ] Computed and/alt/rep : 1148/3171/1148 causal constraints (skipped 84 transitions) in 68 ms.
[2025-06-02 05:23:37] [INFO ] Deduced a trap composed of 48 places in 259 ms of which 4 ms to minimize.
[2025-06-02 05:23:38] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 4 ms to minimize.
[2025-06-02 05:23:38] [INFO ] Deduced a trap composed of 44 places in 264 ms of which 5 ms to minimize.
[2025-06-02 05:23:38] [INFO ] Deduced a trap composed of 45 places in 266 ms of which 4 ms to minimize.
[2025-06-02 05:23:39] [INFO ] Deduced a trap composed of 30 places in 264 ms of which 5 ms to minimize.
[2025-06-02 05:23:39] [INFO ] Deduced a trap composed of 71 places in 273 ms of which 4 ms to minimize.
[2025-06-02 05:23:40] [INFO ] Deduced a trap composed of 10 places in 240 ms of which 4 ms to minimize.
[2025-06-02 05:23:40] [INFO ] Deduced a trap composed of 30 places in 250 ms of which 4 ms to minimize.
[2025-06-02 05:23:40] [INFO ] Deduced a trap composed of 22 places in 257 ms of which 4 ms to minimize.
[2025-06-02 05:23:41] [INFO ] Deduced a trap composed of 36 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:23:41] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 4 ms to minimize.
[2025-06-02 05:23:41] [INFO ] Deduced a trap composed of 26 places in 252 ms of which 5 ms to minimize.
[2025-06-02 05:23:42] [INFO ] Deduced a trap composed of 14 places in 254 ms of which 4 ms to minimize.
[2025-06-02 05:23:42] [INFO ] Deduced a trap composed of 58 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:23:42] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:23:42] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5090 ms
[2025-06-02 05:23:42] [INFO ] Added : 165 causal constraints over 34 iterations in 7415 ms. Result :sat
Minimization took 381 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 6] Max Struct:[7, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 6] Max Struct:[7, 7]
Support contains 301 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Applied a total of 0 rules in 20 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 742/742 places, 1449/1449 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Applied a total of 0 rules in 16 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
[2025-06-02 05:23:44] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2025-06-02 05:23:44] [INFO ] Invariant cache hit.
[2025-06-02 05:23:44] [INFO ] Implicit Places using invariants in 281 ms returned []
[2025-06-02 05:23:44] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2025-06-02 05:23:44] [INFO ] Invariant cache hit.
[2025-06-02 05:23:44] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-02 05:23:46] [INFO ] Implicit Places using invariants and state equation in 1959 ms returned []
Implicit Place search using SMT with State Equation took 2242 ms to find 0 implicit places.
[2025-06-02 05:23:46] [INFO ] Redundant transitions in 91 ms returned []
Running 1442 sub problems to find dead transitions.
[2025-06-02 05:23:46] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2025-06-02 05:23:46] [INFO ] Invariant cache hit.
[2025-06-02 05:23:46] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2025-06-02 05:24:02] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:24:02] [INFO ] Deduced a trap composed of 36 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:24:02] [INFO ] Deduced a trap composed of 94 places in 210 ms of which 4 ms to minimize.
[2025-06-02 05:24:02] [INFO ] Deduced a trap composed of 56 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:24:03] [INFO ] Deduced a trap composed of 76 places in 234 ms of which 4 ms to minimize.
[2025-06-02 05:24:03] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 4 ms to minimize.
[2025-06-02 05:24:03] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:24:03] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 3 ms to minimize.
[2025-06-02 05:24:04] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 3 ms to minimize.
[2025-06-02 05:24:04] [INFO ] Deduced a trap composed of 54 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:24:04] [INFO ] Deduced a trap composed of 54 places in 236 ms of which 4 ms to minimize.
[2025-06-02 05:24:04] [INFO ] Deduced a trap composed of 26 places in 246 ms of which 5 ms to minimize.
[2025-06-02 05:24:05] [INFO ] Deduced a trap composed of 63 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:24:05] [INFO ] Deduced a trap composed of 37 places in 222 ms of which 4 ms to minimize.
[2025-06-02 05:24:05] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:24:05] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 4 ms to minimize.
[2025-06-02 05:24:05] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:24:06] [INFO ] Deduced a trap composed of 34 places in 235 ms of which 4 ms to minimize.
[2025-06-02 05:24:06] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 3 ms to minimize.
[2025-06-02 05:24:06] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/742 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2025-06-02 05:24:07] [INFO ] Deduced a trap composed of 30 places in 249 ms of which 5 ms to minimize.
[2025-06-02 05:24:07] [INFO ] Deduced a trap composed of 61 places in 239 ms of which 3 ms to minimize.
[2025-06-02 05:24:07] [INFO ] Deduced a trap composed of 34 places in 246 ms of which 4 ms to minimize.
[2025-06-02 05:24:08] [INFO ] Deduced a trap composed of 63 places in 237 ms of which 4 ms to minimize.
[2025-06-02 05:24:08] [INFO ] Deduced a trap composed of 49 places in 238 ms of which 4 ms to minimize.
[2025-06-02 05:24:08] [INFO ] Deduced a trap composed of 98 places in 242 ms of which 4 ms to minimize.
[2025-06-02 05:24:08] [INFO ] Deduced a trap composed of 85 places in 245 ms of which 4 ms to minimize.
[2025-06-02 05:24:09] [INFO ] Deduced a trap composed of 85 places in 249 ms of which 4 ms to minimize.
[2025-06-02 05:24:09] [INFO ] Deduced a trap composed of 78 places in 251 ms of which 4 ms to minimize.
[2025-06-02 05:24:09] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 4 ms to minimize.
[2025-06-02 05:24:09] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:24:10] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:24:10] [INFO ] Deduced a trap composed of 14 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:24:10] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:24:10] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:24:11] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 4 ms to minimize.
[2025-06-02 05:24:11] [INFO ] Deduced a trap composed of 84 places in 218 ms of which 4 ms to minimize.
[2025-06-02 05:24:11] [INFO ] Deduced a trap composed of 20 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:24:11] [INFO ] Deduced a trap composed of 52 places in 265 ms of which 5 ms to minimize.
[2025-06-02 05:24:12] [INFO ] Deduced a trap composed of 48 places in 248 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/742 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2025-06-02 05:24:12] [INFO ] Deduced a trap composed of 77 places in 249 ms of which 4 ms to minimize.
[2025-06-02 05:24:12] [INFO ] Deduced a trap composed of 91 places in 246 ms of which 4 ms to minimize.
[2025-06-02 05:24:13] [INFO ] Deduced a trap composed of 99 places in 257 ms of which 4 ms to minimize.
[2025-06-02 05:24:13] [INFO ] Deduced a trap composed of 129 places in 240 ms of which 4 ms to minimize.
[2025-06-02 05:24:13] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 4 ms to minimize.
[2025-06-02 05:24:13] [INFO ] Deduced a trap composed of 71 places in 238 ms of which 4 ms to minimize.
[2025-06-02 05:24:14] [INFO ] Deduced a trap composed of 63 places in 239 ms of which 4 ms to minimize.
[2025-06-02 05:24:14] [INFO ] Deduced a trap composed of 109 places in 243 ms of which 4 ms to minimize.
[2025-06-02 05:24:14] [INFO ] Deduced a trap composed of 93 places in 240 ms of which 4 ms to minimize.
[2025-06-02 05:24:14] [INFO ] Deduced a trap composed of 43 places in 235 ms of which 5 ms to minimize.
[2025-06-02 05:24:15] [INFO ] Deduced a trap composed of 42 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:24:15] [INFO ] Deduced a trap composed of 48 places in 249 ms of which 4 ms to minimize.
[2025-06-02 05:24:15] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 4 ms to minimize.
[2025-06-02 05:24:15] [INFO ] Deduced a trap composed of 102 places in 232 ms of which 4 ms to minimize.
[2025-06-02 05:24:16] [INFO ] Deduced a trap composed of 59 places in 242 ms of which 4 ms to minimize.
[2025-06-02 05:24:16] [INFO ] Deduced a trap composed of 52 places in 248 ms of which 4 ms to minimize.
[2025-06-02 05:24:16] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 4 ms to minimize.
[2025-06-02 05:24:16] [INFO ] Deduced a trap composed of 48 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:24:17] [INFO ] Deduced a trap composed of 45 places in 232 ms of which 4 ms to minimize.
[2025-06-02 05:24:17] [INFO ] Deduced a trap composed of 27 places in 247 ms of which 4 ms to minimize.
SMT process timed out in 30856ms, After SMT, problems are : Problem set: 0 solved, 1442 unsolved
Search for dead transitions found 0 dead transitions in 30884ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33252 ms. Remains : 742/742 places, 1449/1449 transitions.
[2025-06-02 05:24:17] [INFO ] Flatten gal took : 198 ms
[2025-06-02 05:24:17] [INFO ] Flatten gal took : 113 ms
[2025-06-02 05:24:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17053452573444961880.gal : 54 ms
RANDOM walk for 40000 steps (8 resets) in 1887 ms. (21 steps per ms) remains 4/4 properties
[2025-06-02 05:24:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17060423521620993648.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17053452573444961880.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17060423521620993648.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
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality17060423521620993648.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 564 ms. (70 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 720 ms. (55 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 10
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :10 after 11
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :11 after 17
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :17 after 43
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :43 after 60
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :60 after 203
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :203 after 618
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :618 after 860
Interrupted probabilistic random walk after 267104 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 4
Probabilistic random walk after 267104 steps, saw 50490 distinct states, run finished after 3005 ms. (steps per millisecond=88 ) properties seen :0
[2025-06-02 05:24:21] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2025-06-02 05:24:21] [INFO ] Invariant cache hit.
[2025-06-02 05:24:21] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 392/693 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 05:24:22] [INFO ] Deduced a trap composed of 66 places in 257 ms of which 5 ms to minimize.
[2025-06-02 05:24:22] [INFO ] Deduced a trap composed of 177 places in 113 ms of which 2 ms to minimize.
[2025-06-02 05:24:22] [INFO ] Deduced a trap composed of 171 places in 73 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 05:24:22] [INFO ] Deduced a trap composed of 102 places in 250 ms of which 5 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :860 after 5212
[2025-06-02 05:24:22] [INFO ] Deduced a trap composed of 78 places in 257 ms of which 4 ms to minimize.
[2025-06-02 05:24:23] [INFO ] Deduced a trap composed of 54 places in 295 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 7/700 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/700 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1239/1939 variables, 700/720 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1939 variables, 330/1050 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1939 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 42/1981 variables, 42/1092 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1981 variables, 6/1098 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1981 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1981 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1981/1981 variables, and 1098 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3027 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 742/742 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 392/693 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 7/700 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/700 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1239/1939 variables, 700/720 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1939 variables, 330/1050 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1939 variables, 4/1054 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :5212 after 11994
At refinement iteration 9 (INCLUDED_ONLY) 0/1939 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 42/1981 variables, 42/1096 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1981 variables, 6/1102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 05:24:28] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:24:28] [INFO ] Deduced a trap composed of 83 places in 228 ms of which 4 ms to minimize.
[2025-06-02 05:24:28] [INFO ] Deduced a trap composed of 78 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:24:28] [INFO ] Deduced a trap composed of 78 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:24:29] [INFO ] Deduced a trap composed of 120 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:24:29] [INFO ] Deduced a trap composed of 55 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:24:29] [INFO ] Deduced a trap composed of 53 places in 225 ms of which 4 ms to minimize.
SMT process timed out in 8190ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 301 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Applied a total of 0 rules in 38 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 742/742 places, 1449/1449 transitions.
RANDOM walk for 40000 steps (8 resets) in 1344 ms. (29 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 550 ms. (72 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 630 ms. (63 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :11994 after 24068
Interrupted probabilistic random walk after 255048 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 4
Probabilistic random walk after 255048 steps, saw 48987 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2025-06-02 05:24:33] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2025-06-02 05:24:33] [INFO ] Invariant cache hit.
[2025-06-02 05:24:33] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 392/693 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 05:24:34] [INFO ] Deduced a trap composed of 66 places in 274 ms of which 4 ms to minimize.
[2025-06-02 05:24:34] [INFO ] Deduced a trap composed of 177 places in 105 ms of which 2 ms to minimize.
[2025-06-02 05:24:34] [INFO ] Deduced a trap composed of 171 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 05:24:34] [INFO ] Deduced a trap composed of 102 places in 237 ms of which 4 ms to minimize.
[2025-06-02 05:24:34] [INFO ] Deduced a trap composed of 78 places in 230 ms of which 4 ms to minimize.
[2025-06-02 05:24:35] [INFO ] Deduced a trap composed of 54 places in 229 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 7/700 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/700 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1239/1939 variables, 700/720 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1939 variables, 330/1050 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1939 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 42/1981 variables, 42/1092 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1981 variables, 6/1098 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1981 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1981 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1981/1981 variables, and 1098 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2851 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 742/742 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 392/693 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 7/700 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/700 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1239/1939 variables, 700/720 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1939 variables, 330/1050 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1939 variables, 4/1054 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1939 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 42/1981 variables, 42/1096 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1981 variables, 6/1102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 05:24:40] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 4 ms to minimize.
[2025-06-02 05:24:40] [INFO ] Deduced a trap composed of 83 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:24:40] [INFO ] Deduced a trap composed of 78 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:24:40] [INFO ] Deduced a trap composed of 78 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:24:41] [INFO ] Deduced a trap composed of 120 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:24:41] [INFO ] Deduced a trap composed of 55 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:24:41] [INFO ] Deduced a trap composed of 53 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:24:41] [INFO ] Deduced a trap composed of 64 places in 240 ms of which 4 ms to minimize.
[2025-06-02 05:24:42] [INFO ] Deduced a trap composed of 46 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:24:42] [INFO ] Deduced a trap composed of 43 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:24:42] [INFO ] Deduced a trap composed of 54 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:24:43] [INFO ] Deduced a trap composed of 86 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:24:43] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:24:43] [INFO ] Deduced a trap composed of 46 places in 221 ms of which 4 ms to minimize.
[2025-06-02 05:24:43] [INFO ] Deduced a trap composed of 38 places in 221 ms of which 4 ms to minimize.
[2025-06-02 05:24:44] [INFO ] Deduced a trap composed of 138 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:24:44] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:24:44] [INFO ] Deduced a trap composed of 50 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:24:44] [INFO ] Deduced a trap composed of 60 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:24:45] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 4 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/1981 variables, 20/1122 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2025-06-02 05:24:46] [INFO ] Deduced a trap composed of 51 places in 252 ms of which 4 ms to minimize.
[2025-06-02 05:24:46] [INFO ] Deduced a trap composed of 48 places in 240 ms of which 4 ms to minimize.
[2025-06-02 05:24:46] [INFO ] Deduced a trap composed of 87 places in 247 ms of which 4 ms to minimize.
[2025-06-02 05:24:47] [INFO ] Deduced a trap composed of 76 places in 258 ms of which 4 ms to minimize.
[2025-06-02 05:24:47] [INFO ] Deduced a trap composed of 68 places in 257 ms of which 4 ms to minimize.
[2025-06-02 05:24:47] [INFO ] Deduced a trap composed of 14 places in 247 ms of which 4 ms to minimize.
[2025-06-02 05:24:48] [INFO ] Deduced a trap composed of 22 places in 244 ms of which 4 ms to minimize.
[2025-06-02 05:24:48] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 4 ms to minimize.
[2025-06-02 05:24:48] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 4 ms to minimize.
[2025-06-02 05:24:48] [INFO ] Deduced a trap composed of 37 places in 256 ms of which 4 ms to minimize.
[2025-06-02 05:24:49] [INFO ] Deduced a trap composed of 37 places in 250 ms of which 4 ms to minimize.
[2025-06-02 05:24:49] [INFO ] Deduced a trap composed of 47 places in 244 ms of which 4 ms to minimize.
[2025-06-02 05:24:49] [INFO ] Deduced a trap composed of 48 places in 253 ms of which 4 ms to minimize.
[2025-06-02 05:24:50] [INFO ] Deduced a trap composed of 45 places in 245 ms of which 4 ms to minimize.
[2025-06-02 05:24:50] [INFO ] Deduced a trap composed of 37 places in 251 ms of which 4 ms to minimize.
[2025-06-02 05:24:50] [INFO ] Deduced a trap composed of 79 places in 251 ms of which 4 ms to minimize.
[2025-06-02 05:24:50] [INFO ] Deduced a trap composed of 70 places in 245 ms of which 4 ms to minimize.
[2025-06-02 05:24:51] [INFO ] Deduced a trap composed of 86 places in 249 ms of which 4 ms to minimize.
[2025-06-02 05:24:51] [INFO ] Deduced a trap composed of 74 places in 253 ms of which 4 ms to minimize.
[2025-06-02 05:24:51] [INFO ] Deduced a trap composed of 55 places in 248 ms of which 4 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :24068 after 130496
At refinement iteration 13 (INCLUDED_ONLY) 0/1981 variables, 20/1142 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2025-06-02 05:24:53] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 3 ms to minimize.
[2025-06-02 05:24:53] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 4 ms to minimize.
[2025-06-02 05:24:53] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:24:54] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:24:54] [INFO ] Deduced a trap composed of 76 places in 222 ms of which 4 ms to minimize.
[2025-06-02 05:24:54] [INFO ] Deduced a trap composed of 135 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:24:54] [INFO ] Deduced a trap composed of 70 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:24:55] [INFO ] Deduced a trap composed of 79 places in 236 ms of which 4 ms to minimize.
[2025-06-02 05:24:55] [INFO ] Deduced a trap composed of 102 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:24:55] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:24:55] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:24:56] [INFO ] Deduced a trap composed of 63 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:24:56] [INFO ] Deduced a trap composed of 42 places in 230 ms of which 4 ms to minimize.
[2025-06-02 05:24:56] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 4 ms to minimize.
[2025-06-02 05:24:57] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 4 ms to minimize.
[2025-06-02 05:24:57] [INFO ] Deduced a trap composed of 26 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:24:57] [INFO ] Deduced a trap composed of 78 places in 229 ms of which 4 ms to minimize.
[2025-06-02 05:24:58] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 3 ms to minimize.
[2025-06-02 05:24:58] [INFO ] Deduced a trap composed of 93 places in 209 ms of which 4 ms to minimize.
[2025-06-02 05:24:58] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1981 variables, 20/1162 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2025-06-02 05:24:59] [INFO ] Deduced a trap composed of 71 places in 255 ms of which 4 ms to minimize.
[2025-06-02 05:24:59] [INFO ] Deduced a trap composed of 31 places in 248 ms of which 4 ms to minimize.
[2025-06-02 05:25:00] [INFO ] Deduced a trap composed of 73 places in 244 ms of which 4 ms to minimize.
[2025-06-02 05:25:00] [INFO ] Deduced a trap composed of 54 places in 248 ms of which 4 ms to minimize.
[2025-06-02 05:25:00] [INFO ] Deduced a trap composed of 54 places in 248 ms of which 5 ms to minimize.
[2025-06-02 05:25:01] [INFO ] Deduced a trap composed of 41 places in 245 ms of which 4 ms to minimize.
[2025-06-02 05:25:01] [INFO ] Deduced a trap composed of 63 places in 250 ms of which 4 ms to minimize.
[2025-06-02 05:25:01] [INFO ] Deduced a trap composed of 88 places in 257 ms of which 9 ms to minimize.
[2025-06-02 05:25:01] [INFO ] Deduced a trap composed of 26 places in 269 ms of which 4 ms to minimize.
[2025-06-02 05:25:02] [INFO ] Deduced a trap composed of 63 places in 241 ms of which 4 ms to minimize.
[2025-06-02 05:25:02] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 4 ms to minimize.
[2025-06-02 05:25:02] [INFO ] Deduced a trap composed of 28 places in 254 ms of which 4 ms to minimize.
[2025-06-02 05:25:03] [INFO ] Deduced a trap composed of 50 places in 245 ms of which 4 ms to minimize.
[2025-06-02 05:25:03] [INFO ] Deduced a trap composed of 136 places in 230 ms of which 4 ms to minimize.
[2025-06-02 05:25:03] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:25:03] [INFO ] Deduced a trap composed of 56 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:25:04] [INFO ] Deduced a trap composed of 105 places in 232 ms of which 3 ms to minimize.
[2025-06-02 05:25:04] [INFO ] Deduced a trap composed of 64 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:25:04] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 4 ms to minimize.
[2025-06-02 05:25:05] [INFO ] Deduced a trap composed of 22 places in 232 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1981 variables, 20/1182 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2025-06-02 05:25:06] [INFO ] Deduced a trap composed of 14 places in 258 ms of which 4 ms to minimize.
[2025-06-02 05:25:06] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 4 ms to minimize.
[2025-06-02 05:25:06] [INFO ] Deduced a trap composed of 42 places in 255 ms of which 4 ms to minimize.
[2025-06-02 05:25:07] [INFO ] Deduced a trap composed of 69 places in 254 ms of which 4 ms to minimize.
[2025-06-02 05:25:07] [INFO ] Deduced a trap composed of 98 places in 253 ms of which 4 ms to minimize.
[2025-06-02 05:25:07] [INFO ] Deduced a trap composed of 62 places in 259 ms of which 4 ms to minimize.
[2025-06-02 05:25:07] [INFO ] Deduced a trap composed of 70 places in 229 ms of which 3 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 05:25:08] [INFO ] Flatten gal took : 66 ms
[2025-06-02 05:25:08] [INFO ] Applying decomposition
[2025-06-02 05:25:08] [INFO ] Flatten gal took : 58 ms
[2025-06-02 05:25:08] [INFO ] Deduced a trap composed of 65 places in 287 ms of which 4 ms to minimize.
[2025-06-02 05:25:08] [INFO ] Deduced a trap composed of 68 places in 255 ms of which 4 ms to minimize.
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/graph893043709049394907.txt' '-o' '/tmp/graph893043709049394907.bin' '-w' '/tmp/graph893043709049394907.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph893043709049394907.bin' '-l' '-1' '-v' '-w' '/tmp/graph893043709049394907.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:25:08] [INFO ] Decomposing Gal with order
[2025-06-02 05:25:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:25:09] [INFO ] Removed a total of 1575 redundant transitions.
[2025-06-02 05:25:09] [INFO ] Deduced a trap composed of 85 places in 637 ms of which 4 ms to minimize.
[2025-06-02 05:25:09] [INFO ] Flatten gal took : 699 ms
[2025-06-02 05:25:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 39 ms.
[2025-06-02 05:25:09] [INFO ] Deduced a trap composed of 82 places in 254 ms of which 4 ms to minimize.
[2025-06-02 05:25:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15391293658233640782.gal : 24 ms
[2025-06-02 05:25:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1352954933285235055.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/ReachabilityCardinality15391293658233640782.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1352954933285235055.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/ReachabilityCardinality1352954933285235055.prop.
[2025-06-02 05:25:10] [INFO ] Deduced a trap composed of 108 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:25:10] [INFO ] Deduced a trap composed of 81 places in 239 ms of which 3 ms to minimize.
[2025-06-02 05:25:10] [INFO ] Deduced a trap composed of 48 places in 220 ms of which 4 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :12 after 18
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :18 after 28
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :28 after 51
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :51 after 55
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :55 after 66
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :66 after 439
[2025-06-02 05:25:11] [INFO ] Deduced a trap composed of 73 places in 271 ms of which 4 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :439 after 788
[2025-06-02 05:25:11] [INFO ] Deduced a trap composed of 68 places in 263 ms of which 4 ms to minimize.
[2025-06-02 05:25:12] [INFO ] Deduced a trap composed of 53 places in 256 ms of which 4 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :788 after 4117
[2025-06-02 05:25:12] [INFO ] Deduced a trap composed of 92 places in 261 ms of which 4 ms to minimize.
[2025-06-02 05:25:12] [INFO ] Deduced a trap composed of 62 places in 254 ms of which 4 ms to minimize.
[2025-06-02 05:25:13] [INFO ] Deduced a trap composed of 71 places in 250 ms of which 4 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :4117 after 10110
At refinement iteration 16 (INCLUDED_ONLY) 0/1981 variables, 20/1202 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2025-06-02 05:25:15] [INFO ] Deduced a trap composed of 131 places in 206 ms of which 4 ms to minimize.
[2025-06-02 05:25:15] [INFO ] Deduced a trap composed of 73 places in 237 ms of which 4 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :10110 after 21026
[2025-06-02 05:25:16] [INFO ] Deduced a trap composed of 70 places in 234 ms of which 4 ms to minimize.
[2025-06-02 05:25:16] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 4 ms to minimize.
[2025-06-02 05:25:16] [INFO ] Deduced a trap composed of 70 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:25:16] [INFO ] Deduced a trap composed of 62 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:25:17] [INFO ] Deduced a trap composed of 33 places in 237 ms of which 5 ms to minimize.
[2025-06-02 05:25:17] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 4 ms to minimize.
[2025-06-02 05:25:17] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:25:17] [INFO ] Deduced a trap composed of 95 places in 195 ms of which 4 ms to minimize.
[2025-06-02 05:25:18] [INFO ] Deduced a trap composed of 90 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:25:18] [INFO ] Deduced a trap composed of 48 places in 236 ms of which 4 ms to minimize.
[2025-06-02 05:25:18] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 101 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 75 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 52 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:25:20] [INFO ] Deduced a trap composed of 35 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:25:20] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:25:21] [INFO ] Deduced a trap composed of 70 places in 197 ms of which 4 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :21026 after 38547
At refinement iteration 17 (INCLUDED_ONLY) 0/1981 variables, 20/1222 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1981/1981 variables, and 1222 constraints, problems are : Problem set: 1 solved, 3 unsolved in 45009 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 742/742 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 126/126 constraints]
After SMT, in 47952ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 301 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Applied a total of 0 rules in 22 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 742/742 places, 1449/1449 transitions.
RANDOM walk for 40000 steps (8 resets) in 1436 ms. (27 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 460 ms. (86 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 516 ms. (77 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 357264 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 3
Probabilistic random walk after 357264 steps, saw 62076 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
[2025-06-02 05:25:25] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2025-06-02 05:25:25] [INFO ] Invariant cache hit.
[2025-06-02 05:25:25] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 392/693 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 7/700 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/700 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1239/1939 variables, 700/714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1939 variables, 330/1044 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1939 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 42/1981 variables, 42/1086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1981 variables, 6/1092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1981 variables, 0/1092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1981 variables, 0/1092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1981/1981 variables, and 1092 constraints, problems are : Problem set: 0 solved, 3 unsolved in 830 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 742/742 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 392/693 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-02 05:25:26] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 7/700 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/700 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1239/1939 variables, 700/715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1939 variables, 330/1045 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1939 variables, 3/1048 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1939 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 42/1981 variables, 42/1090 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1981 variables, 6/1096 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-02 05:25:29] [INFO ] Deduced a trap composed of 54 places in 269 ms of which 5 ms to minimize.
[2025-06-02 05:25:29] [INFO ] Deduced a trap composed of 54 places in 282 ms of which 4 ms to minimize.
[2025-06-02 05:25:29] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 5 ms to minimize.
[2025-06-02 05:25:30] [INFO ] Deduced a trap composed of 36 places in 269 ms of which 5 ms to minimize.
[2025-06-02 05:25:30] [INFO ] Deduced a trap composed of 34 places in 273 ms of which 5 ms to minimize.
[2025-06-02 05:25:30] [INFO ] Deduced a trap composed of 52 places in 264 ms of which 4 ms to minimize.
[2025-06-02 05:25:30] [INFO ] Deduced a trap composed of 51 places in 262 ms of which 4 ms to minimize.
[2025-06-02 05:25:31] [INFO ] Deduced a trap composed of 34 places in 264 ms of which 4 ms to minimize.
[2025-06-02 05:25:31] [INFO ] Deduced a trap composed of 35 places in 267 ms of which 4 ms to minimize.
[2025-06-02 05:25:31] [INFO ] Deduced a trap composed of 28 places in 263 ms of which 4 ms to minimize.
[2025-06-02 05:25:32] [INFO ] Deduced a trap composed of 123 places in 267 ms of which 5 ms to minimize.
[2025-06-02 05:25:32] [INFO ] Deduced a trap composed of 71 places in 258 ms of which 4 ms to minimize.
[2025-06-02 05:25:32] [INFO ] Deduced a trap composed of 40 places in 268 ms of which 4 ms to minimize.
[2025-06-02 05:25:33] [INFO ] Deduced a trap composed of 20 places in 291 ms of which 4 ms to minimize.
[2025-06-02 05:25:33] [INFO ] Deduced a trap composed of 57 places in 269 ms of which 4 ms to minimize.
[2025-06-02 05:25:33] [INFO ] Deduced a trap composed of 57 places in 263 ms of which 4 ms to minimize.
[2025-06-02 05:25:33] [INFO ] Deduced a trap composed of 124 places in 266 ms of which 4 ms to minimize.
[2025-06-02 05:25:34] [INFO ] Deduced a trap composed of 47 places in 260 ms of which 4 ms to minimize.
[2025-06-02 05:25:34] [INFO ] Deduced a trap composed of 36 places in 260 ms of which 4 ms to minimize.
[2025-06-02 05:25:34] [INFO ] Deduced a trap composed of 37 places in 268 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1981 variables, 20/1116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-02 05:25:35] [INFO ] Deduced a trap composed of 37 places in 265 ms of which 4 ms to minimize.
[2025-06-02 05:25:36] [INFO ] Deduced a trap composed of 62 places in 257 ms of which 4 ms to minimize.
[2025-06-02 05:25:36] [INFO ] Deduced a trap composed of 52 places in 252 ms of which 4 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :38547 after 274647
[2025-06-02 05:25:36] [INFO ] Deduced a trap composed of 16 places in 249 ms of which 4 ms to minimize.
[2025-06-02 05:25:37] [INFO ] Deduced a trap composed of 68 places in 248 ms of which 4 ms to minimize.
[2025-06-02 05:25:37] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 4 ms to minimize.
[2025-06-02 05:25:37] [INFO ] Deduced a trap composed of 27 places in 233 ms of which 3 ms to minimize.
[2025-06-02 05:25:37] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 4 ms to minimize.
[2025-06-02 05:25:38] [INFO ] Deduced a trap composed of 44 places in 238 ms of which 3 ms to minimize.
[2025-06-02 05:25:38] [INFO ] Deduced a trap composed of 18 places in 232 ms of which 4 ms to minimize.
[2025-06-02 05:25:38] [INFO ] Deduced a trap composed of 40 places in 236 ms of which 4 ms to minimize.
[2025-06-02 05:25:39] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 4 ms to minimize.
[2025-06-02 05:25:39] [INFO ] Deduced a trap composed of 106 places in 234 ms of which 4 ms to minimize.
[2025-06-02 05:25:39] [INFO ] Deduced a trap composed of 46 places in 229 ms of which 4 ms to minimize.
[2025-06-02 05:25:39] [INFO ] Deduced a trap composed of 52 places in 232 ms of which 4 ms to minimize.
[2025-06-02 05:25:40] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 4 ms to minimize.
[2025-06-02 05:25:40] [INFO ] Deduced a trap composed of 52 places in 230 ms of which 4 ms to minimize.
[2025-06-02 05:25:40] [INFO ] Deduced a trap composed of 34 places in 256 ms of which 4 ms to minimize.
[2025-06-02 05:25:41] [INFO ] Deduced a trap composed of 27 places in 243 ms of which 4 ms to minimize.
[2025-06-02 05:25:41] [INFO ] Deduced a trap composed of 12 places in 261 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1981 variables, 20/1136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-02 05:25:42] [INFO ] Deduced a trap composed of 106 places in 254 ms of which 4 ms to minimize.
[2025-06-02 05:25:42] [INFO ] Deduced a trap composed of 121 places in 248 ms of which 4 ms to minimize.
[2025-06-02 05:25:43] [INFO ] Deduced a trap composed of 121 places in 248 ms of which 4 ms to minimize.
[2025-06-02 05:25:43] [INFO ] Deduced a trap composed of 54 places in 257 ms of which 4 ms to minimize.
[2025-06-02 05:25:43] [INFO ] Deduced a trap composed of 100 places in 254 ms of which 4 ms to minimize.
[2025-06-02 05:25:43] [INFO ] Deduced a trap composed of 58 places in 251 ms of which 5 ms to minimize.
[2025-06-02 05:25:44] [INFO ] Deduced a trap composed of 88 places in 254 ms of which 5 ms to minimize.
[2025-06-02 05:25:44] [INFO ] Deduced a trap composed of 67 places in 258 ms of which 4 ms to minimize.
[2025-06-02 05:25:45] [INFO ] Deduced a trap composed of 82 places in 252 ms of which 4 ms to minimize.
[2025-06-02 05:25:45] [INFO ] Deduced a trap composed of 81 places in 248 ms of which 4 ms to minimize.
[2025-06-02 05:25:45] [INFO ] Deduced a trap composed of 64 places in 250 ms of which 4 ms to minimize.
[2025-06-02 05:25:45] [INFO ] Deduced a trap composed of 98 places in 248 ms of which 3 ms to minimize.
[2025-06-02 05:25:46] [INFO ] Deduced a trap composed of 70 places in 247 ms of which 4 ms to minimize.
[2025-06-02 05:25:46] [INFO ] Deduced a trap composed of 126 places in 249 ms of which 4 ms to minimize.
[2025-06-02 05:25:46] [INFO ] Deduced a trap composed of 102 places in 245 ms of which 4 ms to minimize.
[2025-06-02 05:25:47] [INFO ] Deduced a trap composed of 66 places in 246 ms of which 4 ms to minimize.
[2025-06-02 05:25:47] [INFO ] Deduced a trap composed of 67 places in 253 ms of which 4 ms to minimize.
[2025-06-02 05:25:47] [INFO ] Deduced a trap composed of 53 places in 250 ms of which 5 ms to minimize.
[2025-06-02 05:25:47] [INFO ] Deduced a trap composed of 34 places in 240 ms of which 3 ms to minimize.
[2025-06-02 05:25:48] [INFO ] Deduced a trap composed of 94 places in 248 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1981 variables, 20/1156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-02 05:25:49] [INFO ] Deduced a trap composed of 57 places in 268 ms of which 5 ms to minimize.
[2025-06-02 05:25:49] [INFO ] Deduced a trap composed of 12 places in 258 ms of which 4 ms to minimize.
[2025-06-02 05:25:49] [INFO ] Deduced a trap composed of 34 places in 255 ms of which 4 ms to minimize.
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 38 places in 258 ms of which 4 ms to minimize.
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 39 places in 257 ms of which 4 ms to minimize.
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 22 places in 239 ms of which 4 ms to minimize.
[2025-06-02 05:25:51] [INFO ] Deduced a trap composed of 22 places in 244 ms of which 4 ms to minimize.
[2025-06-02 05:25:51] [INFO ] Deduced a trap composed of 105 places in 239 ms of which 5 ms to minimize.
[2025-06-02 05:25:51] [INFO ] Deduced a trap composed of 121 places in 239 ms of which 4 ms to minimize.
[2025-06-02 05:25:52] [INFO ] Deduced a trap composed of 50 places in 246 ms of which 4 ms to minimize.
[2025-06-02 05:25:52] [INFO ] Deduced a trap composed of 39 places in 246 ms of which 4 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 39 places in 233 ms of which 3 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 4 ms to minimize.
[2025-06-02 05:25:54] [INFO ] Deduced a trap composed of 50 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:25:54] [INFO ] Deduced a trap composed of 69 places in 228 ms of which 4 ms to minimize.
[2025-06-02 05:25:54] [INFO ] Deduced a trap composed of 14 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:25:55] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 4 ms to minimize.
[2025-06-02 05:25:55] [INFO ] Deduced a trap composed of 93 places in 241 ms of which 4 ms to minimize.
[2025-06-02 05:25:55] [INFO ] Deduced a trap composed of 154 places in 236 ms of which 4 ms to minimize.
[2025-06-02 05:25:56] [INFO ] Deduced a trap composed of 99 places in 237 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1981 variables, 20/1176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-02 05:25:57] [INFO ] Deduced a trap composed of 28 places in 243 ms of which 4 ms to minimize.
[2025-06-02 05:25:57] [INFO ] Deduced a trap composed of 67 places in 249 ms of which 4 ms to minimize.
[2025-06-02 05:25:57] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 3 ms to minimize.
[2025-06-02 05:25:58] [INFO ] Deduced a trap composed of 46 places in 248 ms of which 4 ms to minimize.
[2025-06-02 05:25:58] [INFO ] Deduced a trap composed of 54 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:25:58] [INFO ] Deduced a trap composed of 102 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:25:59] [INFO ] Deduced a trap composed of 114 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:25:59] [INFO ] Deduced a trap composed of 102 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:25:59] [INFO ] Deduced a trap composed of 50 places in 228 ms of which 4 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 05:26:00] [INFO ] Deduced a trap composed of 71 places in 252 ms of which 4 ms to minimize.
[2025-06-02 05:26:00] [INFO ] Deduced a trap composed of 43 places in 235 ms of which 4 ms to minimize.
[2025-06-02 05:26:00] [INFO ] Deduced a trap composed of 55 places in 252 ms of which 4 ms to minimize.
[2025-06-02 05:26:01] [INFO ] Deduced a trap composed of 88 places in 246 ms of which 4 ms to minimize.
[2025-06-02 05:26:01] [INFO ] Deduced a trap composed of 54 places in 247 ms of which 4 ms to minimize.
[2025-06-02 05:26:01] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 4 ms to minimize.
[2025-06-02 05:26:02] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:26:02] [INFO ] Deduced a trap composed of 122 places in 151 ms of which 3 ms to minimize.
[2025-06-02 05:26:02] [INFO ] Deduced a trap composed of 82 places in 149 ms of which 3 ms to minimize.
[2025-06-02 05:26:02] [INFO ] Deduced a trap composed of 58 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:26:03] [INFO ] Deduced a trap composed of 110 places in 142 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1981 variables, 20/1196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-02 05:26:04] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 4 ms to minimize.
[2025-06-02 05:26:04] [INFO ] Deduced a trap composed of 50 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:26:05] [INFO ] Deduced a trap composed of 56 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:26:05] [INFO ] Deduced a trap composed of 99 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:26:05] [INFO ] Deduced a trap composed of 67 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:26:06] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:26:06] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:26:06] [INFO ] Deduced a trap composed of 104 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:26:06] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 4 ms to minimize.
[2025-06-02 05:26:07] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:26:07] [INFO ] Deduced a trap composed of 80 places in 146 ms of which 3 ms to minimize.
[2025-06-02 05:26:07] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 2 ms to minimize.
[2025-06-02 05:26:07] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 3 ms to minimize.
[2025-06-02 05:26:08] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
[2025-06-02 05:26:08] [INFO ] Deduced a trap composed of 80 places in 149 ms of which 3 ms to minimize.
[2025-06-02 05:26:08] [INFO ] Deduced a trap composed of 80 places in 146 ms of which 3 ms to minimize.
[2025-06-02 05:26:08] [INFO ] Deduced a trap composed of 96 places in 184 ms of which 3 ms to minimize.
[2025-06-02 05:26:09] [INFO ] Deduced a trap composed of 50 places in 179 ms of which 3 ms to minimize.
[2025-06-02 05:26:09] [INFO ] Deduced a trap composed of 18 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:26:09] [INFO ] Deduced a trap composed of 94 places in 147 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1981 variables, 20/1216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-02 05:26:11] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 4 ms to minimize.
[2025-06-02 05:26:11] [INFO ] Deduced a trap composed of 52 places in 204 ms of which 4 ms to minimize.
[2025-06-02 05:26:11] [INFO ] Deduced a trap composed of 36 places in 203 ms of which 4 ms to minimize.
[2025-06-02 05:26:12] [INFO ] Deduced a trap composed of 98 places in 203 ms of which 4 ms to minimize.
[2025-06-02 05:26:12] [INFO ] Deduced a trap composed of 85 places in 209 ms of which 4 ms to minimize.
[2025-06-02 05:26:12] [INFO ] Deduced a trap composed of 120 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:26:13] [INFO ] Deduced a trap composed of 55 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:26:13] [INFO ] Deduced a trap composed of 103 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:26:16] [INFO ] Deduced a trap composed of 69 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:26:17] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:26:17] [INFO ] Deduced a trap composed of 87 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:26:17] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:26:18] [INFO ] Deduced a trap composed of 105 places in 222 ms of which 4 ms to minimize.
[2025-06-02 05:26:18] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 4 ms to minimize.
[2025-06-02 05:26:18] [INFO ] Deduced a trap composed of 38 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:26:18] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:26:19] [INFO ] Deduced a trap composed of 76 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:26:19] [INFO ] Deduced a trap composed of 117 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:26:19] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 4 ms to minimize.
[2025-06-02 05:26:19] [INFO ] Deduced a trap composed of 36 places in 220 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1981 variables, 20/1236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-02 05:26:21] [INFO ] Deduced a trap composed of 42 places in 246 ms of which 4 ms to minimize.
[2025-06-02 05:26:21] [INFO ] Deduced a trap composed of 121 places in 235 ms of which 4 ms to minimize.
[2025-06-02 05:26:22] [INFO ] Deduced a trap composed of 52 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:26:22] [INFO ] Deduced a trap composed of 60 places in 228 ms of which 4 ms to minimize.
[2025-06-02 05:26:22] [INFO ] Deduced a trap composed of 68 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:26:22] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:26:23] [INFO ] Deduced a trap composed of 102 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:26:23] [INFO ] Deduced a trap composed of 76 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:26:23] [INFO ] Deduced a trap composed of 76 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:26:24] [INFO ] Deduced a trap composed of 111 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:26:24] [INFO ] Deduced a trap composed of 80 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:26:24] [INFO ] Deduced a trap composed of 76 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:26:25] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 3 ms to minimize.
[2025-06-02 05:26:26] [INFO ] Deduced a trap composed of 99 places in 182 ms of which 3 ms to minimize.
[2025-06-02 05:26:26] [INFO ] Deduced a trap composed of 64 places in 178 ms of which 3 ms to minimize.
[2025-06-02 05:26:26] [INFO ] Deduced a trap composed of 58 places in 178 ms of which 3 ms to minimize.
[2025-06-02 05:26:26] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 3 ms to minimize.
[2025-06-02 05:26:26] [INFO ] Deduced a trap composed of 60 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:26:27] [INFO ] Deduced a trap composed of 92 places in 180 ms of which 2 ms to minimize.
[2025-06-02 05:26:27] [INFO ] Deduced a trap composed of 75 places in 178 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1981 variables, 20/1256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-02 05:26:28] [INFO ] Deduced a trap composed of 104 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:26:29] [INFO ] Deduced a trap composed of 70 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:26:29] [INFO ] Deduced a trap composed of 100 places in 187 ms of which 4 ms to minimize.
[2025-06-02 05:26:29] [INFO ] Deduced a trap composed of 71 places in 182 ms of which 3 ms to minimize.
[2025-06-02 05:26:30] [INFO ] Deduced a trap composed of 112 places in 189 ms of which 3 ms to minimize.
[2025-06-02 05:26:32] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 3 ms to minimize.
[2025-06-02 05:26:32] [INFO ] Deduced a trap composed of 84 places in 169 ms of which 3 ms to minimize.
[2025-06-02 05:26:33] [INFO ] Deduced a trap composed of 84 places in 155 ms of which 3 ms to minimize.
[2025-06-02 05:26:33] [INFO ] Deduced a trap composed of 100 places in 158 ms of which 3 ms to minimize.
[2025-06-02 05:26:33] [INFO ] Deduced a trap composed of 100 places in 159 ms of which 2 ms to minimize.
[2025-06-02 05:26:33] [INFO ] Deduced a trap composed of 83 places in 162 ms of which 3 ms to minimize.
[2025-06-02 05:26:33] [INFO ] Deduced a trap composed of 90 places in 160 ms of which 2 ms to minimize.
[2025-06-02 05:26:34] [INFO ] Deduced a trap composed of 72 places in 158 ms of which 3 ms to minimize.
[2025-06-02 05:26:34] [INFO ] Deduced a trap composed of 62 places in 146 ms of which 2 ms to minimize.
[2025-06-02 05:26:34] [INFO ] Deduced a trap composed of 79 places in 152 ms of which 2 ms to minimize.
[2025-06-02 05:26:35] [INFO ] Deduced a trap composed of 60 places in 152 ms of which 2 ms to minimize.
[2025-06-02 05:26:35] [INFO ] Deduced a trap composed of 68 places in 154 ms of which 3 ms to minimize.
[2025-06-02 05:26:35] [INFO ] Deduced a trap composed of 54 places in 164 ms of which 3 ms to minimize.
[2025-06-02 05:26:36] [INFO ] Deduced a trap composed of 82 places in 149 ms of which 3 ms to minimize.
[2025-06-02 05:26:36] [INFO ] Deduced a trap composed of 70 places in 155 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1981 variables, 20/1276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-02 05:26:39] [INFO ] Deduced a trap composed of 60 places in 234 ms of which 4 ms to minimize.
[2025-06-02 05:26:40] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:26:40] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:26:41] [INFO ] Deduced a trap composed of 85 places in 208 ms of which 4 ms to minimize.
[2025-06-02 05:26:41] [INFO ] Deduced a trap composed of 101 places in 212 ms of which 4 ms to minimize.
SMT process timed out in 76126ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 484 ms.
Support contains 301 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Applied a total of 0 rules in 16 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 742/742 places, 1449/1449 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Applied a total of 0 rules in 16 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
[2025-06-02 05:26:41] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2025-06-02 05:26:41] [INFO ] Invariant cache hit.
[2025-06-02 05:26:42] [INFO ] Implicit Places using invariants in 265 ms returned []
[2025-06-02 05:26:42] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2025-06-02 05:26:42] [INFO ] Invariant cache hit.
[2025-06-02 05:26:42] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-02 05:26:44] [INFO ] Implicit Places using invariants and state equation in 2068 ms returned []
Implicit Place search using SMT with State Equation took 2334 ms to find 0 implicit places.
[2025-06-02 05:26:44] [INFO ] Redundant transitions in 23 ms returned []
Running 1442 sub problems to find dead transitions.
[2025-06-02 05:26:44] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2025-06-02 05:26:44] [INFO ] Invariant cache hit.
[2025-06-02 05:26:44] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2025-06-02 05:26:59] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:26:59] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 4 ms to minimize.
[2025-06-02 05:27:00] [INFO ] Deduced a trap composed of 94 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:27:00] [INFO ] Deduced a trap composed of 56 places in 202 ms of which 4 ms to minimize.
[2025-06-02 05:27:00] [INFO ] Deduced a trap composed of 76 places in 205 ms of which 4 ms to minimize.
[2025-06-02 05:27:00] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:27:00] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 4 ms to minimize.
[2025-06-02 05:27:01] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 3 ms to minimize.
[2025-06-02 05:27:01] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 3 ms to minimize.
[2025-06-02 05:27:01] [INFO ] Deduced a trap composed of 54 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:27:01] [INFO ] Deduced a trap composed of 54 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:27:02] [INFO ] Deduced a trap composed of 26 places in 221 ms of which 4 ms to minimize.
[2025-06-02 05:27:02] [INFO ] Deduced a trap composed of 63 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:27:02] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 4 ms to minimize.
[2025-06-02 05:27:02] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 34 places in 216 ms of which 4 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/742 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2025-06-02 05:27:04] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 4 ms to minimize.
[2025-06-02 05:27:04] [INFO ] Deduced a trap composed of 61 places in 246 ms of which 4 ms to minimize.
[2025-06-02 05:27:04] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:27:05] [INFO ] Deduced a trap composed of 63 places in 219 ms of which 4 ms to minimize.
[2025-06-02 05:27:05] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:27:05] [INFO ] Deduced a trap composed of 98 places in 234 ms of which 4 ms to minimize.
[2025-06-02 05:27:05] [INFO ] Deduced a trap composed of 85 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 85 places in 239 ms of which 4 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 78 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 31 places in 235 ms of which 4 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 4 ms to minimize.
[2025-06-02 05:27:07] [INFO ] Deduced a trap composed of 34 places in 228 ms of which 4 ms to minimize.
[2025-06-02 05:27:07] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:27:07] [INFO ] Deduced a trap composed of 42 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:27:07] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 4 ms to minimize.
[2025-06-02 05:27:08] [INFO ] Deduced a trap composed of 22 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:27:08] [INFO ] Deduced a trap composed of 84 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:27:08] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 4 ms to minimize.
[2025-06-02 05:27:08] [INFO ] Deduced a trap composed of 52 places in 246 ms of which 4 ms to minimize.
[2025-06-02 05:27:09] [INFO ] Deduced a trap composed of 48 places in 266 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/742 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2025-06-02 05:27:09] [INFO ] Deduced a trap composed of 77 places in 250 ms of which 3 ms to minimize.
[2025-06-02 05:27:09] [INFO ] Deduced a trap composed of 91 places in 240 ms of which 4 ms to minimize.
[2025-06-02 05:27:10] [INFO ] Deduced a trap composed of 99 places in 240 ms of which 5 ms to minimize.
[2025-06-02 05:27:10] [INFO ] Deduced a trap composed of 129 places in 244 ms of which 4 ms to minimize.
[2025-06-02 05:27:10] [INFO ] Deduced a trap composed of 64 places in 268 ms of which 4 ms to minimize.
[2025-06-02 05:27:10] [INFO ] Deduced a trap composed of 71 places in 244 ms of which 4 ms to minimize.
[2025-06-02 05:27:11] [INFO ] Deduced a trap composed of 63 places in 234 ms of which 4 ms to minimize.
[2025-06-02 05:27:11] [INFO ] Deduced a trap composed of 109 places in 229 ms of which 4 ms to minimize.
[2025-06-02 05:27:11] [INFO ] Deduced a trap composed of 93 places in 238 ms of which 4 ms to minimize.
[2025-06-02 05:27:11] [INFO ] Deduced a trap composed of 43 places in 239 ms of which 4 ms to minimize.
[2025-06-02 05:27:12] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 4 ms to minimize.
[2025-06-02 05:27:12] [INFO ] Deduced a trap composed of 48 places in 242 ms of which 4 ms to minimize.
[2025-06-02 05:27:12] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 4 ms to minimize.
[2025-06-02 05:27:12] [INFO ] Deduced a trap composed of 102 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:27:13] [INFO ] Deduced a trap composed of 59 places in 241 ms of which 4 ms to minimize.
[2025-06-02 05:27:13] [INFO ] Deduced a trap composed of 52 places in 230 ms of which 4 ms to minimize.
[2025-06-02 05:27:13] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 4 ms to minimize.
[2025-06-02 05:27:13] [INFO ] Deduced a trap composed of 48 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:27:14] [INFO ] Deduced a trap composed of 45 places in 241 ms of which 4 ms to minimize.
[2025-06-02 05:27:14] [INFO ] Deduced a trap composed of 27 places in 235 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/742 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 742/1981 variables, and 80 constraints, problems are : Problem set: 0 solved, 1442 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/742 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1442/1442 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1442 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/742 variables, 60/80 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2025-06-02 05:27:15] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 4 ms to minimize.
[2025-06-02 05:27:16] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:27:16] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 4 ms to minimize.
[2025-06-02 05:27:16] [INFO ] Deduced a trap composed of 74 places in 196 ms of which 4 ms to minimize.
[2025-06-02 05:27:16] [INFO ] Deduced a trap composed of 71 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:27:17] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:27:17] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 4 ms to minimize.
[2025-06-02 05:27:17] [INFO ] Deduced a trap composed of 68 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:27:17] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 2 ms to minimize.
[2025-06-02 05:27:17] [INFO ] Deduced a trap composed of 85 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:27:18] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:27:18] [INFO ] Deduced a trap composed of 111 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:27:18] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 4 ms to minimize.
[2025-06-02 05:27:18] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:27:19] [INFO ] Deduced a trap composed of 69 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:27:19] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:27:19] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 4 ms to minimize.
[2025-06-02 05:27:19] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:27:19] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:27:20] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/742 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2025-06-02 05:27:20] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 4 ms to minimize.
[2025-06-02 05:27:20] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 3 ms to minimize.
[2025-06-02 05:27:21] [INFO ] Deduced a trap composed of 52 places in 198 ms of which 4 ms to minimize.
[2025-06-02 05:27:21] [INFO ] Deduced a trap composed of 68 places in 226 ms of which 3 ms to minimize.
[2025-06-02 05:27:21] [INFO ] Deduced a trap composed of 78 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:27:21] [INFO ] Deduced a trap composed of 50 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:27:22] [INFO ] Deduced a trap composed of 46 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:27:22] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
[2025-06-02 05:27:22] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2025-06-02 05:27:22] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 1 ms to minimize.
[2025-06-02 05:27:22] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 1 ms to minimize.
[2025-06-02 05:27:22] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 1 ms to minimize.
[2025-06-02 05:27:22] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2025-06-02 05:27:22] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 3 ms to minimize.
[2025-06-02 05:27:23] [INFO ] Deduced a trap composed of 98 places in 169 ms of which 3 ms to minimize.
[2025-06-02 05:27:23] [INFO ] Deduced a trap composed of 72 places in 160 ms of which 3 ms to minimize.
[2025-06-02 05:27:23] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 3 ms to minimize.
[2025-06-02 05:27:23] [INFO ] Deduced a trap composed of 46 places in 247 ms of which 4 ms to minimize.
[2025-06-02 05:27:23] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:27:24] [INFO ] Deduced a trap composed of 38 places in 245 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/742 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2025-06-02 05:27:24] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:27:25] [INFO ] Deduced a trap composed of 72 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:27:25] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 2 ms to minimize.
[2025-06-02 05:27:25] [INFO ] Deduced a trap composed of 150 places in 162 ms of which 3 ms to minimize.
[2025-06-02 05:27:25] [INFO ] Deduced a trap composed of 134 places in 160 ms of which 3 ms to minimize.
[2025-06-02 05:27:25] [INFO ] Deduced a trap composed of 103 places in 161 ms of which 3 ms to minimize.
[2025-06-02 05:27:25] [INFO ] Deduced a trap composed of 71 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:27:26] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:27:26] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:27:26] [INFO ] Deduced a trap composed of 70 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:27:26] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:27:27] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 4 ms to minimize.
[2025-06-02 05:27:27] [INFO ] Deduced a trap composed of 108 places in 217 ms of which 4 ms to minimize.
[2025-06-02 05:27:27] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:27:27] [INFO ] Deduced a trap composed of 106 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:27:27] [INFO ] Deduced a trap composed of 84 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:27:28] [INFO ] Deduced a trap composed of 75 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:27:28] [INFO ] Deduced a trap composed of 102 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:27:28] [INFO ] Deduced a trap composed of 62 places in 174 ms of which 3 ms to minimize.
[2025-06-02 05:27:28] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/742 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2025-06-02 05:27:29] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 3 ms to minimize.
[2025-06-02 05:27:29] [INFO ] Deduced a trap composed of 108 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:27:29] [INFO ] Deduced a trap composed of 84 places in 177 ms of which 3 ms to minimize.
[2025-06-02 05:27:30] [INFO ] Deduced a trap composed of 96 places in 170 ms of which 3 ms to minimize.
[2025-06-02 05:27:30] [INFO ] Deduced a trap composed of 79 places in 172 ms of which 3 ms to minimize.
[2025-06-02 05:27:30] [INFO ] Deduced a trap composed of 66 places in 143 ms of which 2 ms to minimize.
[2025-06-02 05:27:30] [INFO ] Deduced a trap composed of 62 places in 146 ms of which 3 ms to minimize.
[2025-06-02 05:27:30] [INFO ] Deduced a trap composed of 82 places in 154 ms of which 3 ms to minimize.
[2025-06-02 05:27:30] [INFO ] Deduced a trap composed of 86 places in 149 ms of which 3 ms to minimize.
[2025-06-02 05:27:31] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 3 ms to minimize.
[2025-06-02 05:27:31] [INFO ] Deduced a trap composed of 114 places in 153 ms of which 2 ms to minimize.
[2025-06-02 05:27:31] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 3 ms to minimize.
[2025-06-02 05:27:31] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 3 ms to minimize.
[2025-06-02 05:27:31] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 3 ms to minimize.
[2025-06-02 05:27:31] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2025-06-02 05:27:32] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 1 ms to minimize.
[2025-06-02 05:27:32] [INFO ] Deduced a trap composed of 48 places in 155 ms of which 5 ms to minimize.
[2025-06-02 05:27:32] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 2 ms to minimize.
[2025-06-02 05:27:32] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 2 ms to minimize.
[2025-06-02 05:27:32] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/742 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2025-06-02 05:27:33] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 3 ms to minimize.
[2025-06-02 05:27:33] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 3 ms to minimize.
[2025-06-02 05:27:33] [INFO ] Deduced a trap composed of 78 places in 160 ms of which 2 ms to minimize.
[2025-06-02 05:27:33] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 3 ms to minimize.
[2025-06-02 05:27:34] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 3 ms to minimize.
[2025-06-02 05:27:34] [INFO ] Deduced a trap composed of 51 places in 172 ms of which 3 ms to minimize.
[2025-06-02 05:27:34] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 3 ms to minimize.
[2025-06-02 05:27:34] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 2 ms to minimize.
[2025-06-02 05:27:34] [INFO ] Deduced a trap composed of 112 places in 222 ms of which 4 ms to minimize.
[2025-06-02 05:27:35] [INFO ] Deduced a trap composed of 58 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:27:35] [INFO ] Deduced a trap composed of 58 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:27:35] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 4 ms to minimize.
[2025-06-02 05:27:35] [INFO ] Deduced a trap composed of 62 places in 158 ms of which 2 ms to minimize.
[2025-06-02 05:27:35] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 3 ms to minimize.
[2025-06-02 05:27:36] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 3 ms to minimize.
[2025-06-02 05:27:36] [INFO ] Deduced a trap composed of 72 places in 162 ms of which 3 ms to minimize.
[2025-06-02 05:27:36] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:27:36] [INFO ] Deduced a trap composed of 46 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:27:37] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 3 ms to minimize.
[2025-06-02 05:27:37] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/742 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2025-06-02 05:27:38] [INFO ] Deduced a trap composed of 61 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:27:38] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:27:38] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 4 ms to minimize.
[2025-06-02 05:27:38] [INFO ] Deduced a trap composed of 72 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:27:39] [INFO ] Deduced a trap composed of 72 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:27:39] [INFO ] Deduced a trap composed of 68 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:27:39] [INFO ] Deduced a trap composed of 48 places in 191 ms of which 4 ms to minimize.
[2025-06-02 05:27:39] [INFO ] Deduced a trap composed of 80 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:27:39] [INFO ] Deduced a trap composed of 70 places in 184 ms of which 3 ms to minimize.
[2025-06-02 05:27:40] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 6 ms to minimize.
[2025-06-02 05:27:40] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:27:40] [INFO ] Deduced a trap composed of 60 places in 213 ms of which 4 ms to minimize.
[2025-06-02 05:27:40] [INFO ] Deduced a trap composed of 52 places in 183 ms of which 3 ms to minimize.
[2025-06-02 05:27:41] [INFO ] Deduced a trap composed of 54 places in 235 ms of which 4 ms to minimize.
[2025-06-02 05:27:41] [INFO ] Deduced a trap composed of 160 places in 234 ms of which 4 ms to minimize.
[2025-06-02 05:27:41] [INFO ] Deduced a trap composed of 155 places in 229 ms of which 4 ms to minimize.
[2025-06-02 05:27:41] [INFO ] Deduced a trap composed of 121 places in 232 ms of which 4 ms to minimize.
[2025-06-02 05:27:42] [INFO ] Deduced a trap composed of 124 places in 236 ms of which 4 ms to minimize.
[2025-06-02 05:27:42] [INFO ] Deduced a trap composed of 68 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:27:42] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/742 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 1442 unsolved
[2025-06-02 05:27:43] [INFO ] Deduced a trap composed of 109 places in 171 ms of which 2 ms to minimize.
[2025-06-02 05:27:43] [INFO ] Deduced a trap composed of 68 places in 165 ms of which 3 ms to minimize.
[2025-06-02 05:27:44] [INFO ] Deduced a trap composed of 54 places in 151 ms of which 3 ms to minimize.
[2025-06-02 05:27:44] [INFO ] Deduced a trap composed of 86 places in 169 ms of which 3 ms to minimize.
[2025-06-02 05:27:44] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:27:44] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:27:44] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:27:44] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 4 ms to minimize.
SMT process timed out in 60561ms, After SMT, problems are : Problem set: 0 solved, 1442 unsolved
Search for dead transitions found 0 dead transitions in 60574ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62960 ms. Remains : 742/742 places, 1449/1449 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 6] Max Struct:[7, 7]
Starting property specific reduction for Peterson-COL-6-UpperBounds-08
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:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
[2025-06-02 05:27:44] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2025-06-02 05:27:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[7]
[2025-06-02 05:27:44] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2025-06-02 05:27:44] [INFO ] Invariant cache hit.
[2025-06-02 05:27:45] [INFO ] [Real]Absence check using 20 positive place invariants in 20 ms returned sat
[2025-06-02 05:27:45] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2025-06-02 05:27:45] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-02 05:27:45] [INFO ] [Real]Added 330 Read/Feed constraints in 42 ms returned sat
[2025-06-02 05:27:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:27:45] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2025-06-02 05:27:45] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2025-06-02 05:27:45] [INFO ] [Nat]Added 330 Read/Feed constraints in 140 ms returned sat
[2025-06-02 05:27:46] [INFO ] Deduced a trap composed of 66 places in 232 ms of which 4 ms to minimize.
[2025-06-02 05:27:46] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:27:46] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 4 ms to minimize.
[2025-06-02 05:27:47] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 4 ms to minimize.
[2025-06-02 05:27:47] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 4 ms to minimize.
[2025-06-02 05:27:47] [INFO ] Deduced a trap composed of 60 places in 213 ms of which 4 ms to minimize.
[2025-06-02 05:27:47] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 4 ms to minimize.
[2025-06-02 05:27:48] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 3 ms to minimize.
[2025-06-02 05:27:48] [INFO ] Deduced a trap composed of 43 places in 236 ms of which 3 ms to minimize.
[2025-06-02 05:27:48] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:27:49] [INFO ] Deduced a trap composed of 28 places in 235 ms of which 3 ms to minimize.
[2025-06-02 05:27:49] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 3 ms to minimize.
[2025-06-02 05:27:49] [INFO ] Deduced a trap composed of 64 places in 231 ms of which 3 ms to minimize.
[2025-06-02 05:27:49] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 4 ms to minimize.
[2025-06-02 05:27:50] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 4 ms to minimize.
[2025-06-02 05:27:50] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:27:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
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:[1] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[7]
Support contains 7 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 742 transition count 1371
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 664 transition count 1371
Performed 216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 216 Pre rules applied. Total rules applied 156 place count 664 transition count 1155
Deduced a syphon composed of 216 places in 1 ms
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 2 with 432 rules applied. Total rules applied 588 place count 448 transition count 1155
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 672 place count 406 transition count 1113
Applied a total of 672 rules in 43 ms. Remains 406 /742 variables (removed 336) and now considering 1113/1449 (removed 336) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 406/742 places, 1113/1449 transitions.
[2025-06-02 05:27:50] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
// Phase 1: matrix 903 rows 406 cols
[2025-06-02 05:27:50] [INFO ] Computed 20 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[7]
RANDOM walk for 1000000 steps (2 resets) in 1679 ms. (595 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 577 ms. (1730 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[7]
[2025-06-02 05:27:52] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2025-06-02 05:27:52] [INFO ] Invariant cache hit.
[2025-06-02 05:27:52] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2025-06-02 05:27:53] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2025-06-02 05:27:53] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-02 05:27:53] [INFO ] [Real]Added 330 Read/Feed constraints in 26 ms returned sat
[2025-06-02 05:27:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:27:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2025-06-02 05:27:53] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2025-06-02 05:27:53] [INFO ] [Nat]Added 330 Read/Feed constraints in 61 ms returned sat
[2025-06-02 05:27:53] [INFO ] Deduced a trap composed of 56 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:27:53] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:27:53] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 3 ms to minimize.
[2025-06-02 05:27:54] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:27:54] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:27:54] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:27:54] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:27:54] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:27:54] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:27:54] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:27:55] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:27:55] [INFO ] Deduced a trap composed of 66 places in 133 ms of which 3 ms to minimize.
[2025-06-02 05:27:55] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:27:55] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
[2025-06-02 05:27:55] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 2 ms to minimize.
[2025-06-02 05:27:55] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 3 ms to minimize.
[2025-06-02 05:27:56] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:27:56] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:27:56] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:27:56] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 3 ms to minimize.
[2025-06-02 05:27:56] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:27:56] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 3 ms to minimize.
[2025-06-02 05:27:57] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:27:57] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:27:57] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2025-06-02 05:27:57] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:27:57] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:27:57] [INFO ] Deduced a trap composed of 67 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:27:58] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:27:58] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 3 ms to minimize.
[2025-06-02 05:27:58] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:27:58] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:27:58] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:27:59] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 1 ms to minimize.
[2025-06-02 05:27:59] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:27:59] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 2 ms to minimize.
[2025-06-02 05:27:59] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 2 ms to minimize.
[2025-06-02 05:27:59] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:27:59] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 2 ms to minimize.
[2025-06-02 05:28:00] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 2 ms to minimize.
[2025-06-02 05:28:00] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:28:00] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:28:01] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 1 ms to minimize.
[2025-06-02 05:28:01] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:28:01] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:28:01] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 2 ms to minimize.
[2025-06-02 05:28:02] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:28:02] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:28:02] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:28:03] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:28:03] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:28:03] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2025-06-02 05:28:04] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2025-06-02 05:28:04] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2025-06-02 05:28:04] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2025-06-02 05:28:04] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 2 ms to minimize.
[2025-06-02 05:28:04] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:28:05] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 2 ms to minimize.
[2025-06-02 05:28:05] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:28:05] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:28:05] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:28:05] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:28:09] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:28:09] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2025-06-02 05:28:10] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 2 ms to minimize.
[2025-06-02 05:28:10] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:28:10] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:28:10] [INFO ] Deduced a trap composed of 66 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:28:10] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2025-06-02 05:28:10] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:28:11] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2025-06-02 05:28:11] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:28:15] [INFO ] Trap strengthening (SAT) tested/added 72/72 trap constraints in 22330 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[7]
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 12 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 406/406 places, 1113/1113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 12 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2025-06-02 05:28:15] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2025-06-02 05:28:15] [INFO ] Invariant cache hit.
[2025-06-02 05:28:16] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-06-02 05:28:16] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2025-06-02 05:28:16] [INFO ] Invariant cache hit.
[2025-06-02 05:28:16] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-02 05:28:17] [INFO ] Implicit Places using invariants and state equation in 1292 ms returned []
Implicit Place search using SMT with State Equation took 1534 ms to find 0 implicit places.
[2025-06-02 05:28:17] [INFO ] Redundant transitions in 15 ms returned []
Running 1106 sub problems to find dead transitions.
[2025-06-02 05:28:17] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2025-06-02 05:28:17] [INFO ] Invariant cache hit.
[2025-06-02 05:28:17] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2025-06-02 05:28:24] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 2 ms to minimize.
[2025-06-02 05:28:24] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 3 ms to minimize.
[2025-06-02 05:28:24] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:28:24] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 2 ms to minimize.
[2025-06-02 05:28:24] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 2 ms to minimize.
[2025-06-02 05:28:25] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 2 ms to minimize.
[2025-06-02 05:28:25] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:28:25] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
[2025-06-02 05:28:25] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:28:25] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 3 ms to minimize.
[2025-06-02 05:28:25] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 3 ms to minimize.
[2025-06-02 05:28:25] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:28:26] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:28:26] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 3 ms to minimize.
[2025-06-02 05:28:26] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:28:26] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:28:26] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:28:26] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 3 ms to minimize.
[2025-06-02 05:28:26] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:28:27] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2025-06-02 05:28:27] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:28:27] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:28:27] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 3 ms to minimize.
[2025-06-02 05:28:27] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:28:27] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:28:27] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 3 ms to minimize.
[2025-06-02 05:28:28] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:28:28] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:28:28] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:28:28] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:28:28] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:28:28] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:28:28] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2025-06-02 05:28:29] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 3 ms to minimize.
[2025-06-02 05:28:29] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2025-06-02 05:28:29] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2025-06-02 05:28:29] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:28:29] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:28:29] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:28:29] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2025-06-02 05:28:30] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:28:30] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:28:30] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:28:30] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:28:30] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:28:30] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:28:30] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:28:31] [INFO ] Deduced a trap composed of 75 places in 119 ms of which 2 ms to minimize.
[2025-06-02 05:28:31] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:28:31] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 3 ms to minimize.
[2025-06-02 05:28:31] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 3 ms to minimize.
[2025-06-02 05:28:31] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 3 ms to minimize.
[2025-06-02 05:28:31] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:28:31] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:28:32] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2025-06-02 05:28:32] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 2 ms to minimize.
[2025-06-02 05:28:32] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 3 ms to minimize.
[2025-06-02 05:28:32] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:28:32] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:28:32] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2025-06-02 05:28:39] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:28:39] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:28:39] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 3 ms to minimize.
[2025-06-02 05:28:40] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 3 ms to minimize.
[2025-06-02 05:28:40] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 2 ms to minimize.
[2025-06-02 05:28:40] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:28:40] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:28:40] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:28:40] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:28:40] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
[2025-06-02 05:28:40] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 2 ms to minimize.
[2025-06-02 05:28:41] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:28:41] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:28:41] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 3 ms to minimize.
[2025-06-02 05:28:41] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 1 ms to minimize.
[2025-06-02 05:28:41] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 2 ms to minimize.
[2025-06-02 05:28:41] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:28:41] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:28:41] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 1 ms to minimize.
[2025-06-02 05:28:42] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2025-06-02 05:28:42] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 3 ms to minimize.
[2025-06-02 05:28:42] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:28:42] [INFO ] Deduced a trap composed of 64 places in 124 ms of which 3 ms to minimize.
[2025-06-02 05:28:42] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 3 ms to minimize.
[2025-06-02 05:28:42] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:28:43] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:28:43] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 2 ms to minimize.
[2025-06-02 05:28:43] [INFO ] Deduced a trap composed of 67 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:28:43] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 3 ms to minimize.
[2025-06-02 05:28:43] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 3 ms to minimize.
[2025-06-02 05:28:43] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 3 ms to minimize.
[2025-06-02 05:28:43] [INFO ] Deduced a trap composed of 52 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:28:44] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:28:44] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:28:44] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:28:44] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:28:44] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 3 ms to minimize.
[2025-06-02 05:28:44] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:28:44] [INFO ] Deduced a trap composed of 70 places in 127 ms of which 2 ms to minimize.
[2025-06-02 05:28:45] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2025-06-02 05:28:45] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:28:45] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:28:45] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:28:45] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 2 ms to minimize.
[2025-06-02 05:28:45] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:28:46] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2025-06-02 05:28:46] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2025-06-02 05:28:46] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 2 ms to minimize.
[2025-06-02 05:28:46] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
[2025-06-02 05:28:46] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 3 ms to minimize.
[2025-06-02 05:28:46] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:28:46] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:28:47] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 3 ms to minimize.
[2025-06-02 05:28:47] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:28:47] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:28:47] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:28:47] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 3 ms to minimize.
[2025-06-02 05:28:47] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:28:47] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
SMT process timed out in 30392ms, After SMT, problems are : Problem set: 0 solved, 1106 unsolved
Search for dead transitions found 0 dead transitions in 30403ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31970 ms. Remains : 406/406 places, 1113/1113 transitions.
[2025-06-02 05:28:47] [INFO ] Flatten gal took : 56 ms
RANDOM walk for 40000 steps (8 resets) in 304 ms. (131 steps per ms) remains 2/2 properties
[2025-06-02 05:28:47] [INFO ] Flatten gal took : 57 ms
[2025-06-02 05:28:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13282438272742417797.gal : 22 ms
[2025-06-02 05:28:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15804170353397247456.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/ReachabilityCardinality13282438272742417797.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15804170353397247456.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality15804170353397247456.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 21
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :21 after 31
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :31 after 105
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :105 after 219
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :219 after 364
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :364 after 501
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :501 after 2927
Interrupted probabilistic random walk after 501504 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 2
Probabilistic random walk after 501504 steps, saw 71096 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
[2025-06-02 05:28:51] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2025-06-02 05:28:51] [INFO ] Invariant cache hit.
[2025-06-02 05:28:51] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 350/357 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/364 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 903/1267 variables, 364/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1267 variables, 330/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1267 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 42/1309 variables, 42/750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1309 variables, 6/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1309 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1309 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 756 constraints, problems are : Problem set: 0 solved, 2 unsolved in 528 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 350/357 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/364 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 903/1267 variables, 364/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1267 variables, 330/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1267 variables, 2/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2927 after 6419
At refinement iteration 8 (INCLUDED_ONLY) 0/1267 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 42/1309 variables, 42/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1309 variables, 6/758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:28:52] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 3 ms to minimize.
[2025-06-02 05:28:52] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 2 ms to minimize.
[2025-06-02 05:28:52] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 2 ms to minimize.
[2025-06-02 05:28:52] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 3 ms to minimize.
[2025-06-02 05:28:52] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 2 ms to minimize.
[2025-06-02 05:28:52] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 3 ms to minimize.
[2025-06-02 05:28:53] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:28:53] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:28:53] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:28:53] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :6419 after 9778
[2025-06-02 05:28:53] [INFO ] Deduced a trap composed of 60 places in 153 ms of which 2 ms to minimize.
[2025-06-02 05:28:53] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:28:54] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 2 ms to minimize.
[2025-06-02 05:28:54] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:28:54] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 2 ms to minimize.
[2025-06-02 05:28:54] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 2 ms to minimize.
[2025-06-02 05:28:54] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:28:54] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 2 ms to minimize.
[2025-06-02 05:28:54] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:28:55] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1309 variables, 20/778 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:28:55] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:28:55] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 2 ms to minimize.
[2025-06-02 05:28:55] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 2 ms to minimize.
[2025-06-02 05:28:55] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
[2025-06-02 05:28:55] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
[2025-06-02 05:28:56] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 2 ms to minimize.
[2025-06-02 05:28:56] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 2 ms to minimize.
[2025-06-02 05:28:56] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 2 ms to minimize.
[2025-06-02 05:28:56] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
[2025-06-02 05:28:56] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 2 ms to minimize.
SMT process timed out in 5691ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 12 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 406/406 places, 1113/1113 transitions.
RANDOM walk for 40000 steps (8 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 745872 steps, run timeout after 3001 ms. (steps per millisecond=248 ) properties seen :0 out of 1
Probabilistic random walk after 745872 steps, saw 101575 distinct states, run finished after 3002 ms. (steps per millisecond=248 ) properties seen :0
[2025-06-02 05:28:59] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2025-06-02 05:28:59] [INFO ] Invariant cache hit.
[2025-06-02 05:28:59] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 350/357 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 7/364 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 903/1267 variables, 364/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1267 variables, 330/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1267 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 42/1309 variables, 42/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1309 variables, 6/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1309 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1309 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 756 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 350/357 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/364 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 903/1267 variables, 364/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1267 variables, 330/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1267 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1267 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 42/1309 variables, 42/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1309 variables, 6/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:29:00] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:29:00] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 3 ms to minimize.
[2025-06-02 05:29:00] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 2 ms to minimize.
[2025-06-02 05:29:01] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:29:01] [INFO ] Deduced a trap composed of 64 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:29:01] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:29:01] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:29:01] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:29:01] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:29:01] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 2 ms to minimize.
[2025-06-02 05:29:02] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:29:02] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:29:02] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:29:02] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:29:02] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:29:02] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:29:02] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:29:03] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:29:03] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:29:03] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1309 variables, 20/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:29:03] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:29:03] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:29:03] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:29:04] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:29:04] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:29:04] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 2 ms to minimize.
[2025-06-02 05:29:04] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 2 ms to minimize.
[2025-06-02 05:29:04] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:29:04] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:29:04] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:29:05] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :9778 after 59948
[2025-06-02 05:29:05] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:29:05] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 1 ms to minimize.
[2025-06-02 05:29:05] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:29:05] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:29:05] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 2 ms to minimize.
[2025-06-02 05:29:06] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:29:06] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:29:06] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:29:06] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1309 variables, 20/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:29:06] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:29:06] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 1 ms to minimize.
[2025-06-02 05:29:07] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2025-06-02 05:29:07] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:29:07] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 1 ms to minimize.
[2025-06-02 05:29:07] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
[2025-06-02 05:29:07] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:29:07] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 2 ms to minimize.
[2025-06-02 05:29:08] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:29:08] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2025-06-02 05:29:08] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 2 ms to minimize.
[2025-06-02 05:29:08] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:29:08] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:29:08] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 1 ms to minimize.
[2025-06-02 05:29:08] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2025-06-02 05:29:09] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:29:09] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:29:09] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:29:09] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:29:09] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1309 variables, 20/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:29:10] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:29:10] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:29:10] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:29:10] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:29:10] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:29:10] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:29:10] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 1 ms to minimize.
[2025-06-02 05:29:11] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 2 ms to minimize.
[2025-06-02 05:29:11] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2025-06-02 05:29:11] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
[2025-06-02 05:29:11] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:29:11] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:29:11] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:29:11] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:29:12] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:29:12] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 2 ms to minimize.
[2025-06-02 05:29:12] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:29:12] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2025-06-02 05:29:12] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:29:12] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1309 variables, 20/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:29:13] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 2 ms to minimize.
[2025-06-02 05:29:13] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:29:13] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 1 ms to minimize.
[2025-06-02 05:29:13] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 1 ms to minimize.
[2025-06-02 05:29:13] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 1 ms to minimize.
[2025-06-02 05:29:13] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 2 ms to minimize.
[2025-06-02 05:29:14] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 4 ms to minimize.
[2025-06-02 05:29:14] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:29:14] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2025-06-02 05:29:14] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 1 ms to minimize.
[2025-06-02 05:29:16] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 2 ms to minimize.
[2025-06-02 05:29:16] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2025-06-02 05:29:16] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2025-06-02 05:29:17] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 1 ms to minimize.
[2025-06-02 05:29:18] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
[2025-06-02 05:29:18] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 2 ms to minimize.
[2025-06-02 05:29:18] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:29:18] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 2 ms to minimize.
[2025-06-02 05:29:18] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
[2025-06-02 05:29:19] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1309 variables, 20/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:29:19] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 2 ms to minimize.
[2025-06-02 05:29:19] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 1 ms to minimize.
[2025-06-02 05:29:19] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2025-06-02 05:29:19] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2025-06-02 05:29:20] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:29:20] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:29:20] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:29:20] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 2 ms to minimize.
[2025-06-02 05:29:20] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 1 ms to minimize.
[2025-06-02 05:29:21] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2025-06-02 05:29:21] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:29:22] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2025-06-02 05:29:22] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2025-06-02 05:29:23] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:29:23] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:29:23] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
[2025-06-02 05:29:23] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2025-06-02 05:29:23] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2025-06-02 05:29:24] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2025-06-02 05:29:24] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1309 variables, 20/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :59948 after 143717
[2025-06-02 05:29:24] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:29:24] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 2 ms to minimize.
[2025-06-02 05:29:24] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
[2025-06-02 05:29:24] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:29:24] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 1 ms to minimize.
[2025-06-02 05:29:25] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2025-06-02 05:29:25] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:29:25] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1309/1309 variables, and 885 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30712 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 406/406 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 128/128 constraints]
After SMT, in 31002ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 7 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 12 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 406/406 places, 1113/1113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 1113/1113 transitions.
Applied a total of 0 rules in 12 ms. Remains 406 /406 variables (removed 0) and now considering 1113/1113 (removed 0) transitions.
[2025-06-02 05:29:30] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2025-06-02 05:29:30] [INFO ] Invariant cache hit.
[2025-06-02 05:29:31] [INFO ] Implicit Places using invariants in 295 ms returned []
[2025-06-02 05:29:31] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2025-06-02 05:29:31] [INFO ] Invariant cache hit.
[2025-06-02 05:29:31] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-02 05:29:32] [INFO ] Implicit Places using invariants and state equation in 1305 ms returned []
Implicit Place search using SMT with State Equation took 1612 ms to find 0 implicit places.
[2025-06-02 05:29:32] [INFO ] Redundant transitions in 11 ms returned []
Running 1106 sub problems to find dead transitions.
[2025-06-02 05:29:32] [INFO ] Flow matrix only has 903 transitions (discarded 210 similar events)
[2025-06-02 05:29:32] [INFO ] Invariant cache hit.
[2025-06-02 05:29:32] [INFO ] State equation strengthened by 330 read => feed constraints.
Detected timeout of ITS tools.
[2025-06-02 05:29:38] [INFO ] Flatten gal took : 33 ms
[2025-06-02 05:29:38] [INFO ] Applying decomposition
[2025-06-02 05:29:38] [INFO ] Flatten gal took : 32 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/graph11347871880716332212.txt' '-o' '/tmp/graph11347871880716332212.bin' '-w' '/tmp/graph11347871880716332212.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11347871880716332212.bin' '-l' '-1' '-v' '-w' '/tmp/graph11347871880716332212.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:29:38] [INFO ] Decomposing Gal with order
[2025-06-02 05:29:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:29:38] [INFO ] Removed a total of 1620 redundant transitions.
[2025-06-02 05:29:38] [INFO ] Flatten gal took : 146 ms
[2025-06-02 05:29:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2025-06-02 05:29:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6819386227005207421.gal : 23 ms
[2025-06-02 05:29:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3722530876918552280.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/ReachabilityCardinality6819386227005207421.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3722530876918552280.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/ReachabilityCardinality3722530876918552280.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 17
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :17 after 26
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :26 after 33
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :33 after 130
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :130 after 307
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :307 after 517
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2025-06-02 05:29:39] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 2 ms to minimize.
[2025-06-02 05:29:39] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :517 after 3242
[2025-06-02 05:29:40] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 2 ms to minimize.
[2025-06-02 05:29:40] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 2 ms to minimize.
[2025-06-02 05:29:40] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 2 ms to minimize.
[2025-06-02 05:29:40] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 2 ms to minimize.
[2025-06-02 05:29:40] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 3 ms to minimize.
[2025-06-02 05:29:40] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3242 after 8568
[2025-06-02 05:29:40] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
[2025-06-02 05:29:41] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:29:41] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 3 ms to minimize.
[2025-06-02 05:29:41] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
[2025-06-02 05:29:41] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 2 ms to minimize.
[2025-06-02 05:29:41] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:29:41] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 2 ms to minimize.
[2025-06-02 05:29:41] [INFO ] Deduced a trap composed of 67 places in 145 ms of which 3 ms to minimize.
[2025-06-02 05:29:42] [INFO ] Deduced a trap composed of 81 places in 171 ms of which 2 ms to minimize.
[2025-06-02 05:29:42] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 2 ms to minimize.
[2025-06-02 05:29:42] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:29:42] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8568 after 12830
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2025-06-02 05:29:42] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:29:43] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 2 ms to minimize.
[2025-06-02 05:29:43] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 2 ms to minimize.
[2025-06-02 05:29:43] [INFO ] Deduced a trap composed of 46 places in 148 ms of which 2 ms to minimize.
[2025-06-02 05:29:43] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 2 ms to minimize.
[2025-06-02 05:29:43] [INFO ] Deduced a trap composed of 52 places in 152 ms of which 2 ms to minimize.
[2025-06-02 05:29:43] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 2 ms to minimize.
[2025-06-02 05:29:43] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 2 ms to minimize.
[2025-06-02 05:29:44] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 2 ms to minimize.
[2025-06-02 05:29:44] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:29:44] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:29:44] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:29:44] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 2 ms to minimize.
[2025-06-02 05:29:44] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:29:45] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:29:45] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 2 ms to minimize.
[2025-06-02 05:29:45] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 2 ms to minimize.
[2025-06-02 05:29:45] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 2 ms to minimize.
[2025-06-02 05:29:45] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 2 ms to minimize.
[2025-06-02 05:29:45] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2025-06-02 05:29:46] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 3 ms to minimize.
[2025-06-02 05:29:46] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 2 ms to minimize.
[2025-06-02 05:29:46] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 2 ms to minimize.
[2025-06-02 05:29:46] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 2 ms to minimize.
[2025-06-02 05:29:46] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:29:47] [INFO ] Deduced a trap composed of 31 places in 218 ms of which 2 ms to minimize.
[2025-06-02 05:29:47] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:29:47] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 3 ms to minimize.
[2025-06-02 05:29:47] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :12830 after 80097
[2025-06-02 05:29:47] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 2 ms to minimize.
[2025-06-02 05:29:47] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 3 ms to minimize.
[2025-06-02 05:29:47] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 2 ms to minimize.
[2025-06-02 05:29:48] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 2 ms to minimize.
[2025-06-02 05:29:48] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:29:48] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2025-06-02 05:29:48] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 3 ms to minimize.
[2025-06-02 05:29:48] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 2 ms to minimize.
[2025-06-02 05:29:48] [INFO ] Deduced a trap composed of 58 places in 148 ms of which 2 ms to minimize.
[2025-06-02 05:29:49] [INFO ] Deduced a trap composed of 54 places in 158 ms of which 2 ms to minimize.
[2025-06-02 05:29:49] [INFO ] Deduced a trap composed of 52 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2025-06-02 05:29:55] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 2 ms to minimize.
[2025-06-02 05:29:56] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :80097 after 229490
[2025-06-02 05:29:56] [INFO ] Deduced a trap composed of 75 places in 144 ms of which 2 ms to minimize.
[2025-06-02 05:29:56] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 3 ms to minimize.
[2025-06-02 05:29:56] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:29:56] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 2 ms to minimize.
[2025-06-02 05:29:56] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:29:56] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:29:57] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 4 ms to minimize.
[2025-06-02 05:29:57] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2025-06-02 05:29:57] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 2 ms to minimize.
[2025-06-02 05:29:57] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:29:57] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:29:57] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:29:57] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:29:58] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:29:58] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 3 ms to minimize.
[2025-06-02 05:29:58] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:29:58] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:29:58] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2025-06-02 05:29:59] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 2 ms to minimize.
[2025-06-02 05:29:59] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 3 ms to minimize.
[2025-06-02 05:29:59] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 2 ms to minimize.
[2025-06-02 05:29:59] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:29:59] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:29:59] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 3 ms to minimize.
[2025-06-02 05:29:59] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 3 ms to minimize.
[2025-06-02 05:30:00] [INFO ] Deduced a trap composed of 67 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:30:00] [INFO ] Deduced a trap composed of 53 places in 142 ms of which 2 ms to minimize.
[2025-06-02 05:30:00] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 2 ms to minimize.
[2025-06-02 05:30:00] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 3 ms to minimize.
[2025-06-02 05:30:00] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 3 ms to minimize.
[2025-06-02 05:30:00] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:30:00] [INFO ] Deduced a trap composed of 72 places in 151 ms of which 2 ms to minimize.
[2025-06-02 05:30:01] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:30:01] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:30:01] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 2 ms to minimize.
[2025-06-02 05:30:01] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:30:01] [INFO ] Deduced a trap composed of 70 places in 160 ms of which 2 ms to minimize.
[2025-06-02 05:30:01] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2025-06-02 05:30:02] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:30:02] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:30:02] [INFO ] Deduced a trap composed of 53 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:30:02] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:30:02] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:30:02] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.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 1.0)
(s34 0.0)
(s35 1.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 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.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)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.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 1.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 0.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 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 406/1309 variables, and 126 constraints, problems are : Problem set: 0 solved, 1106 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/406 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1106/1106 constraints, Known Traps: 106/106 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 106/126 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2025-06-02 05:30:03] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 3 ms to minimize.
[2025-06-02 05:30:04] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 2 ms to minimize.
[2025-06-02 05:30:04] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 2 ms to minimize.
[2025-06-02 05:30:04] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 2 ms to minimize.
[2025-06-02 05:30:04] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:30:04] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:30:04] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 2 ms to minimize.
[2025-06-02 05:30:04] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 3 ms to minimize.
[2025-06-02 05:30:05] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 2 ms to minimize.
[2025-06-02 05:30:05] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 2 ms to minimize.
[2025-06-02 05:30:05] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:30:05] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 2 ms to minimize.
[2025-06-02 05:30:05] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:30:05] [INFO ] Deduced a trap composed of 57 places in 127 ms of which 2 ms to minimize.
[2025-06-02 05:30:05] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:30:06] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:30:06] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:30:06] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:30:06] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:30:06] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2025-06-02 05:30:06] [INFO ] Deduced a trap composed of 54 places in 143 ms of which 2 ms to minimize.
[2025-06-02 05:30:07] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 2 ms to minimize.
[2025-06-02 05:30:07] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 2 ms to minimize.
[2025-06-02 05:30:07] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:30:07] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:30:07] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 3 ms to minimize.
[2025-06-02 05:30:07] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 2 ms to minimize.
[2025-06-02 05:30:08] [INFO ] Deduced a trap composed of 73 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:30:08] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:30:08] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:30:08] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:30:08] [INFO ] Deduced a trap composed of 119 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:30:08] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 1 ms to minimize.
[2025-06-02 05:30:08] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:30:08] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:30:09] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:30:09] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:30:09] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 2 ms to minimize.
[2025-06-02 05:30:09] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2025-06-02 05:30:09] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :229490 after 315535
[2025-06-02 05:30:10] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:30:10] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:30:10] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:30:10] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 1 ms to minimize.
[2025-06-02 05:30:10] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 1 ms to minimize.
[2025-06-02 05:30:10] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 2 ms to minimize.
[2025-06-02 05:30:10] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2025-06-02 05:30:10] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 2 ms to minimize.
[2025-06-02 05:30:11] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 1 ms to minimize.
[2025-06-02 05:30:11] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:30:11] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 2 ms to minimize.
[2025-06-02 05:30:11] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 2 ms to minimize.
[2025-06-02 05:30:11] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 2 ms to minimize.
[2025-06-02 05:30:11] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 2 ms to minimize.
[2025-06-02 05:30:11] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 2 ms to minimize.
[2025-06-02 05:30:12] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 2 ms to minimize.
[2025-06-02 05:30:12] [INFO ] Deduced a trap composed of 77 places in 145 ms of which 2 ms to minimize.
[2025-06-02 05:30:12] [INFO ] Deduced a trap composed of 77 places in 169 ms of which 8 ms to minimize.
[2025-06-02 05:30:12] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 3 ms to minimize.
[2025-06-02 05:30:12] [INFO ] Deduced a trap composed of 68 places in 124 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 20/186 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2025-06-02 05:30:13] [INFO ] Deduced a trap composed of 72 places in 144 ms of which 2 ms to minimize.
[2025-06-02 05:30:13] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:30:13] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 2 ms to minimize.
[2025-06-02 05:30:13] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:30:13] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 2 ms to minimize.
[2025-06-02 05:30:13] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 2 ms to minimize.
[2025-06-02 05:30:13] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:30:14] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:30:14] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 2 ms to minimize.
[2025-06-02 05:30:14] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:30:14] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:30:14] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 2 ms to minimize.
[2025-06-02 05:30:14] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:30:14] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 2 ms to minimize.
[2025-06-02 05:30:15] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:30:15] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:30:15] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 2 ms to minimize.
[2025-06-02 05:30:15] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:30:15] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 1 ms to minimize.
[2025-06-02 05:30:15] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 20/206 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2025-06-02 05:30:16] [INFO ] Deduced a trap composed of 78 places in 144 ms of which 2 ms to minimize.
[2025-06-02 05:30:16] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:30:16] [INFO ] Deduced a trap composed of 60 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:30:16] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2025-06-02 05:30:16] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:30:17] [INFO ] Deduced a trap composed of 72 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:30:17] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 2 ms to minimize.
[2025-06-02 05:30:17] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:30:17] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:30:17] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:30:17] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:30:17] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:30:17] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:30:18] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:30:18] [INFO ] Deduced a trap composed of 72 places in 143 ms of which 2 ms to minimize.
[2025-06-02 05:30:18] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 2 ms to minimize.
[2025-06-02 05:30:18] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 2 ms to minimize.
[2025-06-02 05:30:18] [INFO ] Deduced a trap composed of 62 places in 145 ms of which 2 ms to minimize.
[2025-06-02 05:30:18] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:30:19] [INFO ] Deduced a trap composed of 91 places in 141 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 20/226 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2025-06-02 05:30:19] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 2 ms to minimize.
[2025-06-02 05:30:19] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 3 ms to minimize.
[2025-06-02 05:30:20] [INFO ] Deduced a trap composed of 67 places in 158 ms of which 3 ms to minimize.
[2025-06-02 05:30:20] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 3 ms to minimize.
[2025-06-02 05:30:20] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 2 ms to minimize.
[2025-06-02 05:30:20] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 3 ms to minimize.
[2025-06-02 05:30:20] [INFO ] Deduced a trap composed of 68 places in 140 ms of which 2 ms to minimize.
[2025-06-02 05:30:20] [INFO ] Deduced a trap composed of 58 places in 140 ms of which 2 ms to minimize.
[2025-06-02 05:30:20] [INFO ] Deduced a trap composed of 73 places in 141 ms of which 2 ms to minimize.
[2025-06-02 05:30:21] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:30:21] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 2 ms to minimize.
[2025-06-02 05:30:21] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 2 ms to minimize.
[2025-06-02 05:30:21] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2025-06-02 05:30:21] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:30:21] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:30:21] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:30:22] [INFO ] Deduced a trap composed of 60 places in 141 ms of which 2 ms to minimize.
[2025-06-02 05:30:22] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 2 ms to minimize.
[2025-06-02 05:30:22] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 3 ms to minimize.
[2025-06-02 05:30:22] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 20/246 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2025-06-02 05:30:23] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 2 ms to minimize.
[2025-06-02 05:30:23] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 2 ms to minimize.
[2025-06-02 05:30:23] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:30:23] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:30:23] [INFO ] Deduced a trap composed of 116 places in 161 ms of which 2 ms to minimize.
[2025-06-02 05:30:23] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:30:24] [INFO ] Deduced a trap composed of 65 places in 140 ms of which 2 ms to minimize.
[2025-06-02 05:30:24] [INFO ] Deduced a trap composed of 60 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:30:24] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 3 ms to minimize.
[2025-06-02 05:30:24] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 1 ms to minimize.
[2025-06-02 05:30:24] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 2 ms to minimize.
[2025-06-02 05:30:24] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 2 ms to minimize.
[2025-06-02 05:30:24] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:30:24] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:30:25] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2025-06-02 05:30:25] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
[2025-06-02 05:30:25] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:30:25] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
[2025-06-02 05:30:25] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 2 ms to minimize.
[2025-06-02 05:30:25] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 20/266 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2025-06-02 05:30:26] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2025-06-02 05:30:26] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:30:26] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 2 ms to minimize.
[2025-06-02 05:30:26] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:30:27] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 2 ms to minimize.
[2025-06-02 05:30:27] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 2 ms to minimize.
[2025-06-02 05:30:27] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 2 ms to minimize.
[2025-06-02 05:30:27] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:30:27] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 2 ms to minimize.
[2025-06-02 05:30:27] [INFO ] Deduced a trap composed of 71 places in 144 ms of which 2 ms to minimize.
[2025-06-02 05:30:27] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 2 ms to minimize.
[2025-06-02 05:30:28] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 2 ms to minimize.
[2025-06-02 05:30:28] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 3 ms to minimize.
[2025-06-02 05:30:28] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 2 ms to minimize.
[2025-06-02 05:30:28] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 05:30:28] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 3 ms to minimize.
[2025-06-02 05:30:28] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:30:28] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2025-06-02 05:30:29] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:30:29] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 20/286 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2025-06-02 05:30:29] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 2 ms to minimize.
[2025-06-02 05:30:30] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:30:30] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:30:30] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 2 ms to minimize.
[2025-06-02 05:30:30] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:30:30] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:30:30] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:30:30] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:30:30] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
[2025-06-02 05:30:31] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2025-06-02 05:30:31] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2025-06-02 05:30:31] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2025-06-02 05:30:31] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2025-06-02 05:30:31] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2025-06-02 05:30:31] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2025-06-02 05:30:31] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:30:31] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:30:32] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 2 ms to minimize.
[2025-06-02 05:30:32] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 3 ms to minimize.
[2025-06-02 05:30:32] [INFO ] Deduced a trap composed of 51 places in 145 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 20/306 constraints. Problems are: Problem set: 0 solved, 1106 unsolved
[2025-06-02 05:30:33] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 2 ms to minimize.
SMT process timed out in 60514ms, After SMT, problems are : Problem set: 0 solved, 1106 unsolved
Search for dead transitions found 0 dead transitions in 60525ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62166 ms. Remains : 406/406 places, 1113/1113 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[7]
Ending property specific reduction for Peterson-COL-6-UpperBounds-08 in 168120 ms.
Starting property specific reduction for Peterson-COL-6-UpperBounds-11
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:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
[2025-06-02 05:30:33] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
// Phase 1: matrix 1239 rows 742 cols
[2025-06-02 05:30:33] [INFO ] Computed 20 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2 resets) in 59 ms. (166 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 53 ms. (185 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[7]
[2025-06-02 05:30:33] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2025-06-02 05:30:33] [INFO ] Invariant cache hit.
[2025-06-02 05:30:33] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2025-06-02 05:30:33] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2025-06-02 05:30:33] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-02 05:30:33] [INFO ] [Real]Added 330 Read/Feed constraints in 38 ms returned sat
[2025-06-02 05:30:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:30:33] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2025-06-02 05:30:33] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2025-06-02 05:30:34] [INFO ] [Nat]Added 330 Read/Feed constraints in 81 ms returned sat
[2025-06-02 05:30:34] [INFO ] Computed and/alt/rep : 1148/3171/1148 causal constraints (skipped 84 transitions) in 64 ms.
[2025-06-02 05:30:35] [INFO ] Added : 70 causal constraints over 14 iterations in 1202 ms. Result :sat
Minimization took 456 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[7]
Support contains 294 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 742 transition count 1442
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 735 transition count 1442
Applied a total of 14 rules in 21 ms. Remains 735 /742 variables (removed 7) and now considering 1442/1449 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 735/742 places, 1442/1449 transitions.
[2025-06-02 05:30:36] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2025-06-02 05:30:36] [INFO ] Computed 20 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[7]
RANDOM walk for 1000000 steps (2 resets) in 5737 ms. (174 steps per ms)
BEST_FIRST walk for 958914 steps (2 resets) in 5001 ms. (191 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[7]
[2025-06-02 05:30:46] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2025-06-02 05:30:46] [INFO ] Invariant cache hit.
[2025-06-02 05:30:46] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2025-06-02 05:30:47] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2025-06-02 05:30:47] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-02 05:30:47] [INFO ] [Real]Added 330 Read/Feed constraints in 55 ms returned sat
[2025-06-02 05:30:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:30:47] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2025-06-02 05:30:47] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2025-06-02 05:30:47] [INFO ] [Nat]Added 330 Read/Feed constraints in 92 ms returned sat
[2025-06-02 05:30:48] [INFO ] Deduced a trap composed of 51 places in 262 ms of which 4 ms to minimize.
[2025-06-02 05:30:48] [INFO ] Deduced a trap composed of 18 places in 256 ms of which 4 ms to minimize.
[2025-06-02 05:30:48] [INFO ] Deduced a trap composed of 12 places in 258 ms of which 5 ms to minimize.
[2025-06-02 05:30:48] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 4 ms to minimize.
[2025-06-02 05:30:49] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 4 ms to minimize.
[2025-06-02 05:30:49] [INFO ] Deduced a trap composed of 51 places in 277 ms of which 4 ms to minimize.
[2025-06-02 05:30:49] [INFO ] Deduced a trap composed of 28 places in 261 ms of which 4 ms to minimize.
[2025-06-02 05:30:50] [INFO ] Deduced a trap composed of 16 places in 261 ms of which 4 ms to minimize.
[2025-06-02 05:30:50] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 4 ms to minimize.
[2025-06-02 05:30:50] [INFO ] Deduced a trap composed of 70 places in 239 ms of which 4 ms to minimize.
[2025-06-02 05:30:50] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 3 ms to minimize.
[2025-06-02 05:30:50] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3245 ms
[2025-06-02 05:30:51] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 62 ms.
[2025-06-02 05:30:52] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 3 ms to minimize.
[2025-06-02 05:30:53] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 4 ms to minimize.
[2025-06-02 05:30:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 574 ms
[2025-06-02 05:30:53] [INFO ] Added : 119 causal constraints over 24 iterations in 2335 ms. Result :sat
Minimization took 352 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[7]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 20 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 19 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2025-06-02 05:30:53] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2025-06-02 05:30:53] [INFO ] Invariant cache hit.
[2025-06-02 05:30:54] [INFO ] Implicit Places using invariants in 242 ms returned []
[2025-06-02 05:30:54] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2025-06-02 05:30:54] [INFO ] Invariant cache hit.
[2025-06-02 05:30:54] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-02 05:30:56] [INFO ] Implicit Places using invariants and state equation in 1940 ms returned []
Implicit Place search using SMT with State Equation took 2184 ms to find 0 implicit places.
[2025-06-02 05:30:56] [INFO ] Redundant transitions in 22 ms returned []
Running 1435 sub problems to find dead transitions.
[2025-06-02 05:30:56] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2025-06-02 05:30:56] [INFO ] Invariant cache hit.
[2025-06-02 05:30:56] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/735 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:31:11] [INFO ] Deduced a trap composed of 77 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:31:11] [INFO ] Deduced a trap composed of 63 places in 228 ms of which 4 ms to minimize.
[2025-06-02 05:31:11] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:31:12] [INFO ] Deduced a trap composed of 87 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:31:12] [INFO ] Deduced a trap composed of 78 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:31:12] [INFO ] Deduced a trap composed of 82 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:31:12] [INFO ] Deduced a trap composed of 84 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:31:12] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:31:13] [INFO ] Deduced a trap composed of 50 places in 219 ms of which 4 ms to minimize.
[2025-06-02 05:31:13] [INFO ] Deduced a trap composed of 74 places in 239 ms of which 4 ms to minimize.
[2025-06-02 05:31:13] [INFO ] Deduced a trap composed of 28 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:31:13] [INFO ] Deduced a trap composed of 45 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:31:14] [INFO ] Deduced a trap composed of 83 places in 235 ms of which 4 ms to minimize.
[2025-06-02 05:31:14] [INFO ] Deduced a trap composed of 94 places in 235 ms of which 4 ms to minimize.
[2025-06-02 05:31:14] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:31:14] [INFO ] Deduced a trap composed of 16 places in 257 ms of which 4 ms to minimize.
[2025-06-02 05:31:15] [INFO ] Deduced a trap composed of 22 places in 226 ms of which 3 ms to minimize.
[2025-06-02 05:31:15] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:31:15] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:31:15] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/735 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:31:16] [INFO ] Deduced a trap composed of 46 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:31:16] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:31:16] [INFO ] Deduced a trap composed of 123 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:31:17] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 4 ms to minimize.
[2025-06-02 05:31:17] [INFO ] Deduced a trap composed of 54 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:31:17] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:31:17] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:31:17] [INFO ] Deduced a trap composed of 115 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:31:18] [INFO ] Deduced a trap composed of 48 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:31:18] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:31:18] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 4 ms to minimize.
[2025-06-02 05:31:18] [INFO ] Deduced a trap composed of 114 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:31:19] [INFO ] Deduced a trap composed of 46 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:31:19] [INFO ] Deduced a trap composed of 59 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:31:19] [INFO ] Deduced a trap composed of 94 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:31:19] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:31:19] [INFO ] Deduced a trap composed of 38 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:31:20] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:31:20] [INFO ] Deduced a trap composed of 48 places in 247 ms of which 4 ms to minimize.
[2025-06-02 05:31:20] [INFO ] Deduced a trap composed of 82 places in 227 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/735 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:31:21] [INFO ] Deduced a trap composed of 48 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:31:21] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 4 ms to minimize.
[2025-06-02 05:31:21] [INFO ] Deduced a trap composed of 45 places in 208 ms of which 4 ms to minimize.
[2025-06-02 05:31:21] [INFO ] Deduced a trap composed of 63 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:31:22] [INFO ] Deduced a trap composed of 58 places in 235 ms of which 4 ms to minimize.
[2025-06-02 05:31:22] [INFO ] Deduced a trap composed of 87 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:31:22] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:31:22] [INFO ] Deduced a trap composed of 28 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:31:22] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 3 ms to minimize.
[2025-06-02 05:31:23] [INFO ] Deduced a trap composed of 75 places in 232 ms of which 4 ms to minimize.
[2025-06-02 05:31:23] [INFO ] Deduced a trap composed of 46 places in 188 ms of which 4 ms to minimize.
[2025-06-02 05:31:23] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:31:23] [INFO ] Deduced a trap composed of 54 places in 193 ms of which 4 ms to minimize.
[2025-06-02 05:31:24] [INFO ] Deduced a trap composed of 36 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:31:24] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 3 ms to minimize.
[2025-06-02 05:31:24] [INFO ] Deduced a trap composed of 71 places in 169 ms of which 3 ms to minimize.
[2025-06-02 05:31:24] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:31:24] [INFO ] Deduced a trap composed of 38 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:31:24] [INFO ] Deduced a trap composed of 88 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:31:25] [INFO ] Deduced a trap composed of 42 places in 230 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.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 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.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 1.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 0.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 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/735 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 735/1967 variables, and 80 constraints, problems are : Problem set: 0 solved, 1435 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/735 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1435/1435 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1435 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/735 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/735 variables, 60/80 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:31:27] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:31:27] [INFO ] Deduced a trap composed of 60 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:31:28] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:31:28] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 4 ms to minimize.
[2025-06-02 05:31:28] [INFO ] Deduced a trap composed of 98 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:31:28] [INFO ] Deduced a trap composed of 68 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:31:29] [INFO ] Deduced a trap composed of 93 places in 201 ms of which 4 ms to minimize.
[2025-06-02 05:31:29] [INFO ] Deduced a trap composed of 82 places in 218 ms of which 4 ms to minimize.
[2025-06-02 05:31:29] [INFO ] Deduced a trap composed of 78 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:31:29] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 2 ms to minimize.
[2025-06-02 05:31:29] [INFO ] Deduced a trap composed of 64 places in 232 ms of which 4 ms to minimize.
[2025-06-02 05:31:30] [INFO ] Deduced a trap composed of 144 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:31:30] [INFO ] Deduced a trap composed of 167 places in 239 ms of which 4 ms to minimize.
[2025-06-02 05:31:30] [INFO ] Deduced a trap composed of 115 places in 237 ms of which 4 ms to minimize.
[2025-06-02 05:31:30] [INFO ] Deduced a trap composed of 62 places in 239 ms of which 4 ms to minimize.
[2025-06-02 05:31:31] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:31:31] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:31:31] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:31:31] [INFO ] Deduced a trap composed of 16 places in 235 ms of which 3 ms to minimize.
[2025-06-02 05:31:32] [INFO ] Deduced a trap composed of 56 places in 226 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/735 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:31:32] [INFO ] Deduced a trap composed of 109 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:31:32] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:31:33] [INFO ] Deduced a trap composed of 60 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:31:33] [INFO ] Deduced a trap composed of 59 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:31:33] [INFO ] Deduced a trap composed of 52 places in 217 ms of which 4 ms to minimize.
[2025-06-02 05:31:33] [INFO ] Deduced a trap composed of 44 places in 221 ms of which 4 ms to minimize.
[2025-06-02 05:31:34] [INFO ] Deduced a trap composed of 52 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:31:34] [INFO ] Deduced a trap composed of 63 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:31:34] [INFO ] Deduced a trap composed of 71 places in 218 ms of which 4 ms to minimize.
[2025-06-02 05:31:34] [INFO ] Deduced a trap composed of 172 places in 208 ms of which 4 ms to minimize.
[2025-06-02 05:31:35] [INFO ] Deduced a trap composed of 66 places in 203 ms of which 4 ms to minimize.
[2025-06-02 05:31:35] [INFO ] Deduced a trap composed of 74 places in 200 ms of which 4 ms to minimize.
[2025-06-02 05:31:35] [INFO ] Deduced a trap composed of 98 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:31:35] [INFO ] Deduced a trap composed of 110 places in 198 ms of which 4 ms to minimize.
[2025-06-02 05:31:35] [INFO ] Deduced a trap composed of 70 places in 198 ms of which 4 ms to minimize.
[2025-06-02 05:31:36] [INFO ] Deduced a trap composed of 68 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:31:36] [INFO ] Deduced a trap composed of 68 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:31:36] [INFO ] Deduced a trap composed of 68 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:31:36] [INFO ] Deduced a trap composed of 69 places in 203 ms of which 4 ms to minimize.
[2025-06-02 05:31:36] [INFO ] Deduced a trap composed of 113 places in 172 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/735 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:31:37] [INFO ] Deduced a trap composed of 72 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:31:37] [INFO ] Deduced a trap composed of 61 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:31:38] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:31:38] [INFO ] Deduced a trap composed of 82 places in 228 ms of which 4 ms to minimize.
[2025-06-02 05:31:38] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 4 ms to minimize.
[2025-06-02 05:31:38] [INFO ] Deduced a trap composed of 48 places in 239 ms of which 4 ms to minimize.
[2025-06-02 05:31:39] [INFO ] Deduced a trap composed of 46 places in 241 ms of which 3 ms to minimize.
[2025-06-02 05:31:39] [INFO ] Deduced a trap composed of 44 places in 243 ms of which 4 ms to minimize.
[2025-06-02 05:31:39] [INFO ] Deduced a trap composed of 66 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:31:39] [INFO ] Deduced a trap composed of 51 places in 177 ms of which 3 ms to minimize.
[2025-06-02 05:31:39] [INFO ] Deduced a trap composed of 92 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:31:40] [INFO ] Deduced a trap composed of 123 places in 205 ms of which 4 ms to minimize.
[2025-06-02 05:31:40] [INFO ] Deduced a trap composed of 74 places in 221 ms of which 4 ms to minimize.
[2025-06-02 05:31:40] [INFO ] Deduced a trap composed of 115 places in 205 ms of which 4 ms to minimize.
[2025-06-02 05:31:40] [INFO ] Deduced a trap composed of 107 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:31:41] [INFO ] Deduced a trap composed of 100 places in 205 ms of which 4 ms to minimize.
[2025-06-02 05:31:41] [INFO ] Deduced a trap composed of 54 places in 200 ms of which 4 ms to minimize.
[2025-06-02 05:31:41] [INFO ] Deduced a trap composed of 114 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:31:41] [INFO ] Deduced a trap composed of 68 places in 195 ms of which 4 ms to minimize.
[2025-06-02 05:31:41] [INFO ] Deduced a trap composed of 166 places in 152 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/735 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:31:42] [INFO ] Deduced a trap composed of 34 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:31:42] [INFO ] Deduced a trap composed of 66 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:31:43] [INFO ] Deduced a trap composed of 82 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:31:43] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 4 ms to minimize.
[2025-06-02 05:31:43] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:31:43] [INFO ] Deduced a trap composed of 82 places in 211 ms of which 4 ms to minimize.
[2025-06-02 05:31:43] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:31:44] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 3 ms to minimize.
[2025-06-02 05:31:44] [INFO ] Deduced a trap composed of 86 places in 156 ms of which 3 ms to minimize.
[2025-06-02 05:31:44] [INFO ] Deduced a trap composed of 86 places in 153 ms of which 3 ms to minimize.
[2025-06-02 05:31:44] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 3 ms to minimize.
[2025-06-02 05:31:44] [INFO ] Deduced a trap composed of 107 places in 183 ms of which 3 ms to minimize.
[2025-06-02 05:31:45] [INFO ] Deduced a trap composed of 62 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:31:45] [INFO ] Deduced a trap composed of 66 places in 176 ms of which 3 ms to minimize.
[2025-06-02 05:31:45] [INFO ] Deduced a trap composed of 62 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:31:45] [INFO ] Deduced a trap composed of 89 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:31:45] [INFO ] Deduced a trap composed of 63 places in 178 ms of which 3 ms to minimize.
[2025-06-02 05:31:46] [INFO ] Deduced a trap composed of 62 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:31:46] [INFO ] Deduced a trap composed of 58 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:31:46] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/735 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:31:47] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 4 ms to minimize.
[2025-06-02 05:31:47] [INFO ] Deduced a trap composed of 50 places in 216 ms of which 4 ms to minimize.
[2025-06-02 05:31:47] [INFO ] Deduced a trap composed of 61 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:31:47] [INFO ] Deduced a trap composed of 71 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:31:48] [INFO ] Deduced a trap composed of 50 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:31:48] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:31:48] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 3 ms to minimize.
[2025-06-02 05:31:48] [INFO ] Deduced a trap composed of 60 places in 195 ms of which 4 ms to minimize.
[2025-06-02 05:31:48] [INFO ] Deduced a trap composed of 50 places in 179 ms of which 4 ms to minimize.
[2025-06-02 05:31:49] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:31:49] [INFO ] Deduced a trap composed of 103 places in 175 ms of which 3 ms to minimize.
[2025-06-02 05:31:49] [INFO ] Deduced a trap composed of 70 places in 173 ms of which 3 ms to minimize.
[2025-06-02 05:31:49] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 2 ms to minimize.
[2025-06-02 05:31:49] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 3 ms to minimize.
[2025-06-02 05:31:49] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2025-06-02 05:31:50] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2025-06-02 05:31:50] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:31:50] [INFO ] Deduced a trap composed of 64 places in 188 ms of which 3 ms to minimize.
[2025-06-02 05:31:50] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 2 ms to minimize.
[2025-06-02 05:31:50] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/735 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:31:51] [INFO ] Deduced a trap composed of 66 places in 151 ms of which 3 ms to minimize.
[2025-06-02 05:31:52] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 4 ms to minimize.
[2025-06-02 05:31:52] [INFO ] Deduced a trap composed of 74 places in 245 ms of which 4 ms to minimize.
[2025-06-02 05:31:52] [INFO ] Deduced a trap composed of 46 places in 256 ms of which 5 ms to minimize.
[2025-06-02 05:31:52] [INFO ] Deduced a trap composed of 104 places in 242 ms of which 4 ms to minimize.
[2025-06-02 05:31:53] [INFO ] Deduced a trap composed of 28 places in 228 ms of which 4 ms to minimize.
[2025-06-02 05:31:53] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 3 ms to minimize.
[2025-06-02 05:31:53] [INFO ] Deduced a trap composed of 46 places in 228 ms of which 4 ms to minimize.
[2025-06-02 05:31:53] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 4 ms to minimize.
[2025-06-02 05:31:53] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:31:54] [INFO ] Deduced a trap composed of 142 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:31:54] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:31:54] [INFO ] Deduced a trap composed of 68 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:31:54] [INFO ] Deduced a trap composed of 76 places in 173 ms of which 3 ms to minimize.
[2025-06-02 05:31:54] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 3 ms to minimize.
[2025-06-02 05:31:55] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:31:55] [INFO ] Deduced a trap composed of 75 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:31:55] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 4 ms to minimize.
[2025-06-02 05:31:55] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 4 ms to minimize.
[2025-06-02 05:31:56] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/735 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 735/1967 variables, and 200 constraints, problems are : Problem set: 0 solved, 1435 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/735 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/1435 constraints, Known Traps: 180/180 constraints]
After SMT, in 60487ms problems are : Problem set: 0 solved, 1435 unsolved
Search for dead transitions found 0 dead transitions in 60500ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62731 ms. Remains : 735/735 places, 1442/1442 transitions.
[2025-06-02 05:31:56] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2025-06-02 05:31:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[7]
RANDOM walk for 1000000 steps (2 resets) in 5700 ms. (175 steps per ms)
BEST_FIRST walk for 968466 steps (2 resets) in 5001 ms. (193 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[7]
[2025-06-02 05:32:07] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2025-06-02 05:32:07] [INFO ] Invariant cache hit.
[2025-06-02 05:32:07] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2025-06-02 05:32:07] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2025-06-02 05:32:07] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-02 05:32:07] [INFO ] [Real]Added 330 Read/Feed constraints in 53 ms returned sat
[2025-06-02 05:32:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:07] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2025-06-02 05:32:08] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2025-06-02 05:32:08] [INFO ] [Nat]Added 330 Read/Feed constraints in 91 ms returned sat
[2025-06-02 05:32:08] [INFO ] Deduced a trap composed of 51 places in 266 ms of which 4 ms to minimize.
[2025-06-02 05:32:08] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 4 ms to minimize.
[2025-06-02 05:32:09] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 5 ms to minimize.
[2025-06-02 05:32:09] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 4 ms to minimize.
[2025-06-02 05:32:09] [INFO ] Deduced a trap composed of 18 places in 265 ms of which 5 ms to minimize.
[2025-06-02 05:32:10] [INFO ] Deduced a trap composed of 51 places in 254 ms of which 5 ms to minimize.
[2025-06-02 05:32:10] [INFO ] Deduced a trap composed of 28 places in 259 ms of which 4 ms to minimize.
[2025-06-02 05:32:10] [INFO ] Deduced a trap composed of 16 places in 265 ms of which 4 ms to minimize.
[2025-06-02 05:32:10] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 4 ms to minimize.
[2025-06-02 05:32:11] [INFO ] Deduced a trap composed of 70 places in 244 ms of which 4 ms to minimize.
[2025-06-02 05:32:11] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 4 ms to minimize.
[2025-06-02 05:32:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3260 ms
[2025-06-02 05:32:11] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 62 ms.
[2025-06-02 05:32:13] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 3 ms to minimize.
[2025-06-02 05:32:13] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 4 ms to minimize.
[2025-06-02 05:32:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 569 ms
[2025-06-02 05:32:13] [INFO ] Added : 119 causal constraints over 24 iterations in 2312 ms. Result :sat
Minimization took 355 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[7]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 33 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 17 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2025-06-02 05:32:14] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2025-06-02 05:32:14] [INFO ] Invariant cache hit.
[2025-06-02 05:32:14] [INFO ] Implicit Places using invariants in 249 ms returned []
[2025-06-02 05:32:14] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2025-06-02 05:32:14] [INFO ] Invariant cache hit.
[2025-06-02 05:32:15] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-02 05:32:16] [INFO ] Implicit Places using invariants and state equation in 1964 ms returned []
Implicit Place search using SMT with State Equation took 2215 ms to find 0 implicit places.
[2025-06-02 05:32:16] [INFO ] Redundant transitions in 22 ms returned []
Running 1435 sub problems to find dead transitions.
[2025-06-02 05:32:16] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2025-06-02 05:32:16] [INFO ] Invariant cache hit.
[2025-06-02 05:32:16] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/735 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:32:32] [INFO ] Deduced a trap composed of 77 places in 229 ms of which 4 ms to minimize.
[2025-06-02 05:32:32] [INFO ] Deduced a trap composed of 63 places in 235 ms of which 3 ms to minimize.
[2025-06-02 05:32:32] [INFO ] Deduced a trap composed of 16 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:32:33] [INFO ] Deduced a trap composed of 87 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:32:33] [INFO ] Deduced a trap composed of 78 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:32:33] [INFO ] Deduced a trap composed of 82 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:32:33] [INFO ] Deduced a trap composed of 84 places in 204 ms of which 4 ms to minimize.
[2025-06-02 05:32:34] [INFO ] Deduced a trap composed of 42 places in 242 ms of which 4 ms to minimize.
[2025-06-02 05:32:34] [INFO ] Deduced a trap composed of 50 places in 238 ms of which 3 ms to minimize.
[2025-06-02 05:32:34] [INFO ] Deduced a trap composed of 74 places in 242 ms of which 4 ms to minimize.
[2025-06-02 05:32:34] [INFO ] Deduced a trap composed of 28 places in 253 ms of which 4 ms to minimize.
[2025-06-02 05:32:35] [INFO ] Deduced a trap composed of 45 places in 252 ms of which 4 ms to minimize.
[2025-06-02 05:32:35] [INFO ] Deduced a trap composed of 83 places in 253 ms of which 4 ms to minimize.
[2025-06-02 05:32:35] [INFO ] Deduced a trap composed of 94 places in 251 ms of which 4 ms to minimize.
[2025-06-02 05:32:35] [INFO ] Deduced a trap composed of 36 places in 248 ms of which 4 ms to minimize.
[2025-06-02 05:32:36] [INFO ] Deduced a trap composed of 16 places in 252 ms of which 4 ms to minimize.
[2025-06-02 05:32:36] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 4 ms to minimize.
[2025-06-02 05:32:36] [INFO ] Deduced a trap composed of 26 places in 237 ms of which 4 ms to minimize.
[2025-06-02 05:32:36] [INFO ] Deduced a trap composed of 26 places in 239 ms of which 4 ms to minimize.
[2025-06-02 05:32:37] [INFO ] Deduced a trap composed of 26 places in 234 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/735 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:32:37] [INFO ] Deduced a trap composed of 46 places in 217 ms of which 4 ms to minimize.
[2025-06-02 05:32:37] [INFO ] Deduced a trap composed of 16 places in 235 ms of which 4 ms to minimize.
[2025-06-02 05:32:38] [INFO ] Deduced a trap composed of 123 places in 218 ms of which 4 ms to minimize.
[2025-06-02 05:32:38] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:32:38] [INFO ] Deduced a trap composed of 54 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:32:38] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:32:39] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:32:39] [INFO ] Deduced a trap composed of 115 places in 222 ms of which 4 ms to minimize.
[2025-06-02 05:32:39] [INFO ] Deduced a trap composed of 48 places in 237 ms of which 4 ms to minimize.
[2025-06-02 05:32:39] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:32:40] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:32:40] [INFO ] Deduced a trap composed of 114 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:32:40] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:32:40] [INFO ] Deduced a trap composed of 59 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:32:40] [INFO ] Deduced a trap composed of 94 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:32:41] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:32:41] [INFO ] Deduced a trap composed of 38 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:32:41] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:32:41] [INFO ] Deduced a trap composed of 48 places in 238 ms of which 4 ms to minimize.
[2025-06-02 05:32:42] [INFO ] Deduced a trap composed of 82 places in 229 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/735 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:32:42] [INFO ] Deduced a trap composed of 48 places in 199 ms of which 4 ms to minimize.
[2025-06-02 05:32:42] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:32:43] [INFO ] Deduced a trap composed of 45 places in 203 ms of which 4 ms to minimize.
[2025-06-02 05:32:43] [INFO ] Deduced a trap composed of 63 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:32:43] [INFO ] Deduced a trap composed of 58 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:32:43] [INFO ] Deduced a trap composed of 87 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:32:43] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 4 ms to minimize.
[2025-06-02 05:32:44] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 4 ms to minimize.
[2025-06-02 05:32:44] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 3 ms to minimize.
[2025-06-02 05:32:44] [INFO ] Deduced a trap composed of 75 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:32:44] [INFO ] Deduced a trap composed of 46 places in 182 ms of which 3 ms to minimize.
[2025-06-02 05:32:44] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:32:45] [INFO ] Deduced a trap composed of 54 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:32:45] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:32:45] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 3 ms to minimize.
[2025-06-02 05:32:45] [INFO ] Deduced a trap composed of 71 places in 174 ms of which 3 ms to minimize.
[2025-06-02 05:32:45] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:32:46] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:32:46] [INFO ] Deduced a trap composed of 88 places in 229 ms of which 4 ms to minimize.
[2025-06-02 05:32:46] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/735 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 735/1967 variables, and 80 constraints, problems are : Problem set: 0 solved, 1435 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/735 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1435/1435 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1435 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/735 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/735 variables, 60/80 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:32:48] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 4 ms to minimize.
[2025-06-02 05:32:48] [INFO ] Deduced a trap composed of 60 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:32:48] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:32:48] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:32:49] [INFO ] Deduced a trap composed of 98 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:32:49] [INFO ] Deduced a trap composed of 68 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:32:49] [INFO ] Deduced a trap composed of 93 places in 221 ms of which 4 ms to minimize.
[2025-06-02 05:32:49] [INFO ] Deduced a trap composed of 82 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:32:50] [INFO ] Deduced a trap composed of 78 places in 226 ms of which 3 ms to minimize.
[2025-06-02 05:32:50] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 3 ms to minimize.
[2025-06-02 05:32:50] [INFO ] Deduced a trap composed of 64 places in 242 ms of which 4 ms to minimize.
[2025-06-02 05:32:50] [INFO ] Deduced a trap composed of 144 places in 250 ms of which 4 ms to minimize.
[2025-06-02 05:32:51] [INFO ] Deduced a trap composed of 167 places in 253 ms of which 4 ms to minimize.
[2025-06-02 05:32:51] [INFO ] Deduced a trap composed of 115 places in 247 ms of which 4 ms to minimize.
[2025-06-02 05:32:51] [INFO ] Deduced a trap composed of 62 places in 239 ms of which 4 ms to minimize.
[2025-06-02 05:32:51] [INFO ] Deduced a trap composed of 46 places in 254 ms of which 4 ms to minimize.
[2025-06-02 05:32:52] [INFO ] Deduced a trap composed of 22 places in 249 ms of which 4 ms to minimize.
[2025-06-02 05:32:52] [INFO ] Deduced a trap composed of 64 places in 237 ms of which 4 ms to minimize.
[2025-06-02 05:32:52] [INFO ] Deduced a trap composed of 16 places in 252 ms of which 4 ms to minimize.
[2025-06-02 05:32:52] [INFO ] Deduced a trap composed of 56 places in 245 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/735 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:32:53] [INFO ] Deduced a trap composed of 109 places in 230 ms of which 4 ms to minimize.
[2025-06-02 05:32:53] [INFO ] Deduced a trap composed of 41 places in 250 ms of which 4 ms to minimize.
[2025-06-02 05:32:54] [INFO ] Deduced a trap composed of 60 places in 246 ms of which 4 ms to minimize.
[2025-06-02 05:32:54] [INFO ] Deduced a trap composed of 59 places in 244 ms of which 3 ms to minimize.
[2025-06-02 05:32:54] [INFO ] Deduced a trap composed of 52 places in 249 ms of which 4 ms to minimize.
[2025-06-02 05:32:54] [INFO ] Deduced a trap composed of 44 places in 245 ms of which 3 ms to minimize.
[2025-06-02 05:32:55] [INFO ] Deduced a trap composed of 52 places in 234 ms of which 4 ms to minimize.
[2025-06-02 05:32:55] [INFO ] Deduced a trap composed of 63 places in 228 ms of which 4 ms to minimize.
[2025-06-02 05:32:55] [INFO ] Deduced a trap composed of 71 places in 222 ms of which 4 ms to minimize.
[2025-06-02 05:32:55] [INFO ] Deduced a trap composed of 172 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:32:56] [INFO ] Deduced a trap composed of 66 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:32:56] [INFO ] Deduced a trap composed of 74 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:32:56] [INFO ] Deduced a trap composed of 98 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:32:56] [INFO ] Deduced a trap composed of 110 places in 218 ms of which 4 ms to minimize.
[2025-06-02 05:32:56] [INFO ] Deduced a trap composed of 70 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:32:57] [INFO ] Deduced a trap composed of 68 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:32:57] [INFO ] Deduced a trap composed of 68 places in 228 ms of which 4 ms to minimize.
[2025-06-02 05:32:57] [INFO ] Deduced a trap composed of 68 places in 205 ms of which 4 ms to minimize.
[2025-06-02 05:32:57] [INFO ] Deduced a trap composed of 69 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:32:58] [INFO ] Deduced a trap composed of 113 places in 193 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/735 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:32:58] [INFO ] Deduced a trap composed of 72 places in 238 ms of which 3 ms to minimize.
[2025-06-02 05:32:59] [INFO ] Deduced a trap composed of 61 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:32:59] [INFO ] Deduced a trap composed of 44 places in 246 ms of which 4 ms to minimize.
[2025-06-02 05:32:59] [INFO ] Deduced a trap composed of 82 places in 229 ms of which 4 ms to minimize.
[2025-06-02 05:32:59] [INFO ] Deduced a trap composed of 66 places in 257 ms of which 4 ms to minimize.
[2025-06-02 05:33:00] [INFO ] Deduced a trap composed of 48 places in 240 ms of which 4 ms to minimize.
[2025-06-02 05:33:00] [INFO ] Deduced a trap composed of 46 places in 263 ms of which 4 ms to minimize.
[2025-06-02 05:33:00] [INFO ] Deduced a trap composed of 44 places in 259 ms of which 4 ms to minimize.
[2025-06-02 05:33:00] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:33:01] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:33:01] [INFO ] Deduced a trap composed of 92 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:33:01] [INFO ] Deduced a trap composed of 123 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:33:01] [INFO ] Deduced a trap composed of 74 places in 234 ms of which 3 ms to minimize.
[2025-06-02 05:33:02] [INFO ] Deduced a trap composed of 115 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:33:02] [INFO ] Deduced a trap composed of 107 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:33:02] [INFO ] Deduced a trap composed of 100 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:33:02] [INFO ] Deduced a trap composed of 54 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:33:02] [INFO ] Deduced a trap composed of 114 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:33:03] [INFO ] Deduced a trap composed of 68 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:33:03] [INFO ] Deduced a trap composed of 166 places in 164 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/735 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:33:04] [INFO ] Deduced a trap composed of 34 places in 248 ms of which 4 ms to minimize.
[2025-06-02 05:33:04] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 4 ms to minimize.
[2025-06-02 05:33:04] [INFO ] Deduced a trap composed of 82 places in 235 ms of which 3 ms to minimize.
[2025-06-02 05:33:04] [INFO ] Deduced a trap composed of 50 places in 242 ms of which 4 ms to minimize.
[2025-06-02 05:33:05] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:33:05] [INFO ] Deduced a trap composed of 82 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:33:05] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:33:05] [INFO ] Deduced a trap composed of 94 places in 152 ms of which 3 ms to minimize.
[2025-06-02 05:33:05] [INFO ] Deduced a trap composed of 86 places in 150 ms of which 2 ms to minimize.
[2025-06-02 05:33:06] [INFO ] Deduced a trap composed of 86 places in 164 ms of which 2 ms to minimize.
[2025-06-02 05:33:06] [INFO ] Deduced a trap composed of 102 places in 198 ms of which 4 ms to minimize.
[2025-06-02 05:33:06] [INFO ] Deduced a trap composed of 107 places in 193 ms of which 4 ms to minimize.
[2025-06-02 05:33:06] [INFO ] Deduced a trap composed of 62 places in 152 ms of which 3 ms to minimize.
[2025-06-02 05:33:06] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 4 ms to minimize.
[2025-06-02 05:33:07] [INFO ] Deduced a trap composed of 62 places in 183 ms of which 3 ms to minimize.
[2025-06-02 05:33:07] [INFO ] Deduced a trap composed of 89 places in 194 ms of which 4 ms to minimize.
[2025-06-02 05:33:07] [INFO ] Deduced a trap composed of 63 places in 166 ms of which 3 ms to minimize.
[2025-06-02 05:33:07] [INFO ] Deduced a trap composed of 62 places in 188 ms of which 4 ms to minimize.
[2025-06-02 05:33:07] [INFO ] Deduced a trap composed of 58 places in 189 ms of which 4 ms to minimize.
[2025-06-02 05:33:08] [INFO ] Deduced a trap composed of 58 places in 154 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/735 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:33:08] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 4 ms to minimize.
[2025-06-02 05:33:09] [INFO ] Deduced a trap composed of 50 places in 221 ms of which 4 ms to minimize.
[2025-06-02 05:33:09] [INFO ] Deduced a trap composed of 61 places in 219 ms of which 4 ms to minimize.
[2025-06-02 05:33:09] [INFO ] Deduced a trap composed of 71 places in 206 ms of which 4 ms to minimize.
[2025-06-02 05:33:09] [INFO ] Deduced a trap composed of 50 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:33:09] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 4 ms to minimize.
[2025-06-02 05:33:10] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 4 ms to minimize.
[2025-06-02 05:33:10] [INFO ] Deduced a trap composed of 60 places in 195 ms of which 4 ms to minimize.
[2025-06-02 05:33:10] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 4 ms to minimize.
[2025-06-02 05:33:10] [INFO ] Deduced a trap composed of 46 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:33:10] [INFO ] Deduced a trap composed of 103 places in 169 ms of which 3 ms to minimize.
[2025-06-02 05:33:11] [INFO ] Deduced a trap composed of 70 places in 172 ms of which 3 ms to minimize.
[2025-06-02 05:33:11] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:33:11] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:33:11] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 2 ms to minimize.
[2025-06-02 05:33:11] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 2 ms to minimize.
[2025-06-02 05:33:11] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2025-06-02 05:33:11] [INFO ] Deduced a trap composed of 64 places in 183 ms of which 3 ms to minimize.
[2025-06-02 05:33:12] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 3 ms to minimize.
[2025-06-02 05:33:12] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/735 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:33:13] [INFO ] Deduced a trap composed of 66 places in 149 ms of which 3 ms to minimize.
[2025-06-02 05:33:13] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 4 ms to minimize.
[2025-06-02 05:33:13] [INFO ] Deduced a trap composed of 74 places in 241 ms of which 5 ms to minimize.
[2025-06-02 05:33:14] [INFO ] Deduced a trap composed of 46 places in 240 ms of which 4 ms to minimize.
[2025-06-02 05:33:14] [INFO ] Deduced a trap composed of 104 places in 237 ms of which 4 ms to minimize.
[2025-06-02 05:33:14] [INFO ] Deduced a trap composed of 28 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:33:14] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 3 ms to minimize.
[2025-06-02 05:33:15] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:33:15] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 4 ms to minimize.
[2025-06-02 05:33:15] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 3 ms to minimize.
[2025-06-02 05:33:15] [INFO ] Deduced a trap composed of 142 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:33:15] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 3 ms to minimize.
[2025-06-02 05:33:16] [INFO ] Deduced a trap composed of 68 places in 190 ms of which 4 ms to minimize.
[2025-06-02 05:33:16] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 3 ms to minimize.
[2025-06-02 05:33:16] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 3 ms to minimize.
[2025-06-02 05:33:16] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:33:16] [INFO ] Deduced a trap composed of 75 places in 217 ms of which 4 ms to minimize.
[2025-06-02 05:33:17] [INFO ] Deduced a trap composed of 22 places in 219 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 735/1967 variables, and 198 constraints, problems are : Problem set: 0 solved, 1435 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/735 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/1435 constraints, Known Traps: 178/178 constraints]
After SMT, in 60456ms problems are : Problem set: 0 solved, 1435 unsolved
Search for dead transitions found 0 dead transitions in 60468ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62729 ms. Remains : 735/735 places, 1442/1442 transitions.
[2025-06-02 05:33:17] [INFO ] Flatten gal took : 67 ms
[2025-06-02 05:33:17] [INFO ] Flatten gal took : 65 ms
[2025-06-02 05:33:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14530524320308394938.gal : 6 ms
[2025-06-02 05:33:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9900622789697075647.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/ReachabilityCardinality14530524320308394938.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9900622789697075647.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/ReachabilityCardinality9900622789697075647.prop.
RANDOM walk for 40000 steps (8 resets) in 1364 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 415 ms. (96 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 443 ms. (90 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 10
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :10 after 11
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :11 after 17
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :17 after 43
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :43 after 60
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :60 after 194
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :194 after 618
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :618 after 938
Interrupted probabilistic random walk after 383704 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 2
Probabilistic random walk after 383704 steps, saw 65027 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
[2025-06-02 05:33:20] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2025-06-02 05:33:20] [INFO ] Invariant cache hit.
[2025-06-02 05:33:20] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 392/686 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:33:21] [INFO ] Deduced a trap composed of 99 places in 173 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/686 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/693 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/693 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :938 after 5055
At refinement iteration 6 (OVERLAPS) 1232/1925 variables, 693/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1925 variables, 330/1038 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1925 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 42/1967 variables, 42/1080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1967 variables, 6/1086 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1967 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1967 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1967/1967 variables, and 1086 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1065 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 735/735 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 392/686 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:33:22] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 3 ms to minimize.
[2025-06-02 05:33:22] [INFO ] Deduced a trap composed of 175 places in 100 ms of which 2 ms to minimize.
[2025-06-02 05:33:22] [INFO ] Deduced a trap composed of 112 places in 97 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/686 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/686 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/693 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/693 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1232/1925 variables, 693/711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1925 variables, 330/1041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1925 variables, 2/1043 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1925 variables, 0/1043 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 42/1967 variables, 42/1085 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1967 variables, 6/1091 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:33:24] [INFO ] Deduced a trap composed of 32 places in 277 ms of which 4 ms to minimize.
[2025-06-02 05:33:25] [INFO ] Deduced a trap composed of 38 places in 313 ms of which 4 ms to minimize.
[2025-06-02 05:33:25] [INFO ] Deduced a trap composed of 101 places in 283 ms of which 4 ms to minimize.
[2025-06-02 05:33:25] [INFO ] Deduced a trap composed of 45 places in 280 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5055 after 11764
[2025-06-02 05:33:26] [INFO ] Deduced a trap composed of 22 places in 284 ms of which 4 ms to minimize.
[2025-06-02 05:33:26] [INFO ] Deduced a trap composed of 51 places in 278 ms of which 4 ms to minimize.
[2025-06-02 05:33:26] [INFO ] Deduced a trap composed of 32 places in 278 ms of which 4 ms to minimize.
[2025-06-02 05:33:27] [INFO ] Deduced a trap composed of 28 places in 279 ms of which 5 ms to minimize.
SMT process timed out in 6366ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 37 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 735/735 places, 1442/1442 transitions.
RANDOM walk for 40000 steps (8 resets) in 1547 ms. (25 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 467 ms. (85 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 413 ms. (96 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :11764 after 24237
Interrupted probabilistic random walk after 368296 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 2
Probabilistic random walk after 368296 steps, saw 62945 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
[2025-06-02 05:33:31] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2025-06-02 05:33:31] [INFO ] Invariant cache hit.
[2025-06-02 05:33:31] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 392/686 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:33:31] [INFO ] Deduced a trap composed of 99 places in 159 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/686 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/693 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/693 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1232/1925 variables, 693/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1925 variables, 330/1038 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1925 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 42/1967 variables, 42/1080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1967 variables, 6/1086 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1967 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1967 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1967/1967 variables, and 1086 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 735/735 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 392/686 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:33:32] [INFO ] Deduced a trap composed of 100 places in 140 ms of which 3 ms to minimize.
[2025-06-02 05:33:32] [INFO ] Deduced a trap composed of 175 places in 97 ms of which 2 ms to minimize.
[2025-06-02 05:33:32] [INFO ] Deduced a trap composed of 112 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/686 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/686 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/693 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/693 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1232/1925 variables, 693/711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1925 variables, 330/1041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1925 variables, 2/1043 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1925 variables, 0/1043 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 42/1967 variables, 42/1085 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1967 variables, 6/1091 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:33:34] [INFO ] Deduced a trap composed of 32 places in 279 ms of which 4 ms to minimize.
[2025-06-02 05:33:35] [INFO ] Deduced a trap composed of 38 places in 280 ms of which 4 ms to minimize.
[2025-06-02 05:33:35] [INFO ] Deduced a trap composed of 101 places in 274 ms of which 5 ms to minimize.
[2025-06-02 05:33:35] [INFO ] Deduced a trap composed of 45 places in 276 ms of which 4 ms to minimize.
[2025-06-02 05:33:36] [INFO ] Deduced a trap composed of 22 places in 275 ms of which 4 ms to minimize.
[2025-06-02 05:33:36] [INFO ] Deduced a trap composed of 51 places in 275 ms of which 4 ms to minimize.
[2025-06-02 05:33:36] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 4 ms to minimize.
[2025-06-02 05:33:37] [INFO ] Deduced a trap composed of 28 places in 276 ms of which 4 ms to minimize.
[2025-06-02 05:33:37] [INFO ] Deduced a trap composed of 36 places in 276 ms of which 4 ms to minimize.
[2025-06-02 05:33:37] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 4 ms to minimize.
[2025-06-02 05:33:38] [INFO ] Deduced a trap composed of 34 places in 280 ms of which 4 ms to minimize.
[2025-06-02 05:33:38] [INFO ] Deduced a trap composed of 50 places in 274 ms of which 4 ms to minimize.
[2025-06-02 05:33:39] [INFO ] Deduced a trap composed of 44 places in 273 ms of which 4 ms to minimize.
[2025-06-02 05:33:39] [INFO ] Deduced a trap composed of 26 places in 299 ms of which 4 ms to minimize.
[2025-06-02 05:33:39] [INFO ] Deduced a trap composed of 52 places in 277 ms of which 4 ms to minimize.
[2025-06-02 05:33:40] [INFO ] Deduced a trap composed of 56 places in 278 ms of which 5 ms to minimize.
[2025-06-02 05:33:40] [INFO ] Deduced a trap composed of 70 places in 274 ms of which 5 ms to minimize.
[2025-06-02 05:33:40] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 5 ms to minimize.
[2025-06-02 05:33:41] [INFO ] Deduced a trap composed of 110 places in 275 ms of which 4 ms to minimize.
[2025-06-02 05:33:41] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1967 variables, 20/1111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:33:42] [INFO ] Deduced a trap composed of 82 places in 263 ms of which 4 ms to minimize.
[2025-06-02 05:33:42] [INFO ] Deduced a trap composed of 96 places in 258 ms of which 4 ms to minimize.
[2025-06-02 05:33:43] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 4 ms to minimize.
[2025-06-02 05:33:43] [INFO ] Deduced a trap composed of 50 places in 261 ms of which 4 ms to minimize.
[2025-06-02 05:33:43] [INFO ] Deduced a trap composed of 55 places in 260 ms of which 4 ms to minimize.
[2025-06-02 05:33:44] [INFO ] Deduced a trap composed of 20 places in 259 ms of which 4 ms to minimize.
[2025-06-02 05:33:44] [INFO ] Deduced a trap composed of 68 places in 165 ms of which 2 ms to minimize.
[2025-06-02 05:33:44] [INFO ] Deduced a trap composed of 95 places in 174 ms of which 3 ms to minimize.
[2025-06-02 05:33:44] [INFO ] Deduced a trap composed of 64 places in 179 ms of which 2 ms to minimize.
[2025-06-02 05:33:45] [INFO ] Deduced a trap composed of 90 places in 217 ms of which 4 ms to minimize.
[2025-06-02 05:33:45] [INFO ] Deduced a trap composed of 80 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:33:45] [INFO ] Deduced a trap composed of 60 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:33:46] [INFO ] Deduced a trap composed of 85 places in 213 ms of which 4 ms to minimize.
[2025-06-02 05:33:46] [INFO ] Deduced a trap composed of 62 places in 174 ms of which 3 ms to minimize.
[2025-06-02 05:33:47] [INFO ] Deduced a trap composed of 84 places in 175 ms of which 3 ms to minimize.
[2025-06-02 05:33:47] [INFO ] Deduced a trap composed of 62 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:33:47] [INFO ] Deduced a trap composed of 84 places in 172 ms of which 3 ms to minimize.
[2025-06-02 05:33:47] [INFO ] Deduced a trap composed of 92 places in 169 ms of which 2 ms to minimize.
[2025-06-02 05:33:48] [INFO ] Deduced a trap composed of 82 places in 177 ms of which 3 ms to minimize.
[2025-06-02 05:33:48] [INFO ] Deduced a trap composed of 98 places in 176 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1967 variables, 20/1131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:33:49] [INFO ] Deduced a trap composed of 84 places in 179 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :24237 after 134949
[2025-06-02 05:33:49] [INFO ] Deduced a trap composed of 14 places in 263 ms of which 4 ms to minimize.
[2025-06-02 05:33:50] [INFO ] Deduced a trap composed of 28 places in 260 ms of which 4 ms to minimize.
[2025-06-02 05:33:50] [INFO ] Deduced a trap composed of 26 places in 271 ms of which 4 ms to minimize.
[2025-06-02 05:33:51] [INFO ] Deduced a trap composed of 74 places in 276 ms of which 4 ms to minimize.
[2025-06-02 05:33:51] [INFO ] Deduced a trap composed of 60 places in 280 ms of which 4 ms to minimize.
[2025-06-02 05:33:52] [INFO ] Deduced a trap composed of 86 places in 274 ms of which 4 ms to minimize.
[2025-06-02 05:33:52] [INFO ] Deduced a trap composed of 53 places in 277 ms of which 4 ms to minimize.
[2025-06-02 05:33:52] [INFO ] Deduced a trap composed of 57 places in 274 ms of which 4 ms to minimize.
[2025-06-02 05:33:53] [INFO ] Deduced a trap composed of 87 places in 275 ms of which 4 ms to minimize.
[2025-06-02 05:33:53] [INFO ] Deduced a trap composed of 40 places in 274 ms of which 4 ms to minimize.
[2025-06-02 05:33:53] [INFO ] Deduced a trap composed of 38 places in 279 ms of which 4 ms to minimize.
[2025-06-02 05:33:54] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 2 ms to minimize.
[2025-06-02 05:33:55] [INFO ] Deduced a trap composed of 38 places in 278 ms of which 5 ms to minimize.
[2025-06-02 05:33:55] [INFO ] Deduced a trap composed of 12 places in 273 ms of which 5 ms to minimize.
[2025-06-02 05:33:55] [INFO ] Deduced a trap composed of 56 places in 276 ms of which 4 ms to minimize.
[2025-06-02 05:33:56] [INFO ] Deduced a trap composed of 48 places in 276 ms of which 4 ms to minimize.
[2025-06-02 05:33:56] [INFO ] Deduced a trap composed of 39 places in 282 ms of which 5 ms to minimize.
[2025-06-02 05:33:56] [INFO ] Deduced a trap composed of 75 places in 277 ms of which 5 ms to minimize.
[2025-06-02 05:33:57] [INFO ] Deduced a trap composed of 51 places in 290 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1967 variables, 20/1151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:33:58] [INFO ] Deduced a trap composed of 52 places in 259 ms of which 4 ms to minimize.
[2025-06-02 05:33:58] [INFO ] Deduced a trap composed of 74 places in 260 ms of which 4 ms to minimize.
[2025-06-02 05:33:58] [INFO ] Deduced a trap composed of 44 places in 251 ms of which 4 ms to minimize.
[2025-06-02 05:33:59] [INFO ] Deduced a trap composed of 38 places in 259 ms of which 4 ms to minimize.
[2025-06-02 05:33:59] [INFO ] Deduced a trap composed of 16 places in 256 ms of which 4 ms to minimize.
[2025-06-02 05:33:59] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 4 ms to minimize.
[2025-06-02 05:34:00] [INFO ] Deduced a trap composed of 14 places in 258 ms of which 4 ms to minimize.
[2025-06-02 05:34:01] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 4 ms to minimize.
[2025-06-02 05:34:01] [INFO ] Deduced a trap composed of 18 places in 261 ms of which 4 ms to minimize.
[2025-06-02 05:34:01] [INFO ] Deduced a trap composed of 26 places in 267 ms of which 5 ms to minimize.
[2025-06-02 05:34:02] [INFO ] Deduced a trap composed of 20 places in 258 ms of which 4 ms to minimize.
[2025-06-02 05:34:03] [INFO ] Deduced a trap composed of 74 places in 257 ms of which 4 ms to minimize.
[2025-06-02 05:34:03] [INFO ] Deduced a trap composed of 52 places in 257 ms of which 4 ms to minimize.
[2025-06-02 05:34:04] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:34:05] [INFO ] Deduced a trap composed of 55 places in 216 ms of which 4 ms to minimize.
[2025-06-02 05:34:05] [INFO ] Deduced a trap composed of 38 places in 263 ms of which 4 ms to minimize.
[2025-06-02 05:34:06] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 4 ms to minimize.
[2025-06-02 05:34:07] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 4 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 05:34:07] [INFO ] Flatten gal took : 33 ms
[2025-06-02 05:34:07] [INFO ] Applying decomposition
[2025-06-02 05:34:07] [INFO ] Flatten gal took : 40 ms
[2025-06-02 05:34:07] [INFO ] Deduced a trap composed of 43 places in 244 ms of which 3 ms to minimize.
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/graph9506662815652254332.txt' '-o' '/tmp/graph9506662815652254332.bin' '-w' '/tmp/graph9506662815652254332.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9506662815652254332.bin' '-l' '-1' '-v' '-w' '/tmp/graph9506662815652254332.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:34:07] [INFO ] Decomposing Gal with order
[2025-06-02 05:34:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:34:08] [INFO ] Removed a total of 1570 redundant transitions.
[2025-06-02 05:34:08] [INFO ] Flatten gal took : 250 ms
[2025-06-02 05:34:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 220 labels/synchronizations in 46 ms.
[2025-06-02 05:34:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality255772662395865954.gal : 128 ms
[2025-06-02 05:34:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4579516516618590388.prop : 8 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/ReachabilityCardinality255772662395865954.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4579516516618590388.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 ...327
Loading property file /tmp/ReachabilityCardinality4579516516618590388.prop.
[2025-06-02 05:34:08] [INFO ] Deduced a trap composed of 46 places in 250 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 6
At refinement iteration 16 (INCLUDED_ONLY) 0/1967 variables, 20/1171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 29
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :29 after 34
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :34 after 51
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :51 after 53
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :53 after 64
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :64 after 178
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :178 after 548
[2025-06-02 05:34:09] [INFO ] Deduced a trap composed of 12 places in 257 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :548 after 2340
[2025-06-02 05:34:10] [INFO ] Deduced a trap composed of 44 places in 256 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2340 after 4404
[2025-06-02 05:34:11] [INFO ] Deduced a trap composed of 54 places in 276 ms of which 4 ms to minimize.
[2025-06-02 05:34:12] [INFO ] Deduced a trap composed of 34 places in 262 ms of which 4 ms to minimize.
[2025-06-02 05:34:12] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 4 ms to minimize.
[2025-06-02 05:34:12] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 4 ms to minimize.
[2025-06-02 05:34:13] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 4 ms to minimize.
[2025-06-02 05:34:13] [INFO ] Deduced a trap composed of 36 places in 263 ms of which 4 ms to minimize.
[2025-06-02 05:34:14] [INFO ] Deduced a trap composed of 72 places in 262 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4404 after 16385
[2025-06-02 05:34:14] [INFO ] Deduced a trap composed of 51 places in 262 ms of which 4 ms to minimize.
[2025-06-02 05:34:15] [INFO ] Deduced a trap composed of 44 places in 264 ms of which 4 ms to minimize.
[2025-06-02 05:34:15] [INFO ] Deduced a trap composed of 71 places in 258 ms of which 4 ms to minimize.
[2025-06-02 05:34:16] [INFO ] Deduced a trap composed of 68 places in 260 ms of which 4 ms to minimize.
[2025-06-02 05:34:16] [INFO ] Deduced a trap composed of 30 places in 261 ms of which 4 ms to minimize.
[2025-06-02 05:34:17] [INFO ] Deduced a trap composed of 72 places in 262 ms of which 4 ms to minimize.
SMT process timed out in 46361ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 550 ms.
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 12 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 11 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2025-06-02 05:34:17] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2025-06-02 05:34:17] [INFO ] Invariant cache hit.
[2025-06-02 05:34:18] [INFO ] Implicit Places using invariants in 289 ms returned []
[2025-06-02 05:34:18] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2025-06-02 05:34:18] [INFO ] Invariant cache hit.
[2025-06-02 05:34:18] [INFO ] State equation strengthened by 330 read => feed constraints.
[2025-06-02 05:34:20] [INFO ] Implicit Places using invariants and state equation in 1909 ms returned []
Implicit Place search using SMT with State Equation took 2199 ms to find 0 implicit places.
[2025-06-02 05:34:20] [INFO ] Redundant transitions in 22 ms returned []
Running 1435 sub problems to find dead transitions.
[2025-06-02 05:34:20] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2025-06-02 05:34:20] [INFO ] Invariant cache hit.
[2025-06-02 05:34:20] [INFO ] State equation strengthened by 330 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :16385 after 96610
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :96610 after 164901
At refinement iteration 0 (INCLUDED_ONLY) 0/735 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:34:35] [INFO ] Deduced a trap composed of 77 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:34:36] [INFO ] Deduced a trap composed of 63 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:34:36] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:34:36] [INFO ] Deduced a trap composed of 87 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:34:36] [INFO ] Deduced a trap composed of 78 places in 203 ms of which 4 ms to minimize.
[2025-06-02 05:34:36] [INFO ] Deduced a trap composed of 82 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:34:37] [INFO ] Deduced a trap composed of 84 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:34:37] [INFO ] Deduced a trap composed of 42 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:34:37] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:34:37] [INFO ] Deduced a trap composed of 74 places in 239 ms of which 4 ms to minimize.
[2025-06-02 05:34:38] [INFO ] Deduced a trap composed of 28 places in 229 ms of which 4 ms to minimize.
[2025-06-02 05:34:38] [INFO ] Deduced a trap composed of 45 places in 248 ms of which 4 ms to minimize.
[2025-06-02 05:34:38] [INFO ] Deduced a trap composed of 83 places in 236 ms of which 4 ms to minimize.
[2025-06-02 05:34:38] [INFO ] Deduced a trap composed of 94 places in 248 ms of which 3 ms to minimize.
[2025-06-02 05:34:39] [INFO ] Deduced a trap composed of 36 places in 248 ms of which 3 ms to minimize.
[2025-06-02 05:34:39] [INFO ] Deduced a trap composed of 16 places in 247 ms of which 4 ms to minimize.
[2025-06-02 05:34:39] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 3 ms to minimize.
[2025-06-02 05:34:39] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 3 ms to minimize.
[2025-06-02 05:34:40] [INFO ] Deduced a trap composed of 26 places in 237 ms of which 4 ms to minimize.
[2025-06-02 05:34:40] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/735 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:34:40] [INFO ] Deduced a trap composed of 46 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:34:41] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:34:41] [INFO ] Deduced a trap composed of 123 places in 232 ms of which 3 ms to minimize.
[2025-06-02 05:34:41] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:34:41] [INFO ] Deduced a trap composed of 54 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:34:42] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:34:42] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 4 ms to minimize.
[2025-06-02 05:34:42] [INFO ] Deduced a trap composed of 115 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:34:42] [INFO ] Deduced a trap composed of 48 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:34:43] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:34:43] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:34:43] [INFO ] Deduced a trap composed of 114 places in 229 ms of which 4 ms to minimize.
[2025-06-02 05:34:43] [INFO ] Deduced a trap composed of 46 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:34:44] [INFO ] Deduced a trap composed of 59 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:34:44] [INFO ] Deduced a trap composed of 94 places in 234 ms of which 3 ms to minimize.
[2025-06-02 05:34:44] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:34:44] [INFO ] Deduced a trap composed of 38 places in 244 ms of which 3 ms to minimize.
[2025-06-02 05:34:45] [INFO ] Deduced a trap composed of 34 places in 233 ms of which 3 ms to minimize.
[2025-06-02 05:34:45] [INFO ] Deduced a trap composed of 48 places in 230 ms of which 4 ms to minimize.
[2025-06-02 05:34:45] [INFO ] Deduced a trap composed of 82 places in 255 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/735 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:34:46] [INFO ] Deduced a trap composed of 48 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:34:46] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:34:46] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:34:46] [INFO ] Deduced a trap composed of 63 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:34:47] [INFO ] Deduced a trap composed of 58 places in 247 ms of which 4 ms to minimize.
[2025-06-02 05:34:47] [INFO ] Deduced a trap composed of 87 places in 234 ms of which 5 ms to minimize.
[2025-06-02 05:34:47] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:34:47] [INFO ] Deduced a trap composed of 28 places in 230 ms of which 4 ms to minimize.
[2025-06-02 05:34:47] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 3 ms to minimize.
[2025-06-02 05:34:48] [INFO ] Deduced a trap composed of 75 places in 231 ms of which 3 ms to minimize.
[2025-06-02 05:34:48] [INFO ] Deduced a trap composed of 46 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:34:48] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:34:48] [INFO ] Deduced a trap composed of 54 places in 211 ms of which 4 ms to minimize.
[2025-06-02 05:34:49] [INFO ] Deduced a trap composed of 36 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:34:49] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:34:49] [INFO ] Deduced a trap composed of 71 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:34:49] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
[2025-06-02 05:34:49] [INFO ] Deduced a trap composed of 38 places in 232 ms of which 4 ms to minimize.
[2025-06-02 05:34:50] [INFO ] Deduced a trap composed of 88 places in 245 ms of which 4 ms to minimize.
[2025-06-02 05:34:50] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/735 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 735/1967 variables, and 80 constraints, problems are : Problem set: 0 solved, 1435 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/735 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1435/1435 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1435 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/735 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/735 variables, 60/80 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:34:51] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:34:51] [INFO ] Deduced a trap composed of 60 places in 232 ms of which 3 ms to minimize.
[2025-06-02 05:34:52] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:34:52] [INFO ] Deduced a trap composed of 14 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:34:52] [INFO ] Deduced a trap composed of 98 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:34:52] [INFO ] Deduced a trap composed of 68 places in 216 ms of which 4 ms to minimize.
[2025-06-02 05:34:53] [INFO ] Deduced a trap composed of 93 places in 219 ms of which 4 ms to minimize.
[2025-06-02 05:34:53] [INFO ] Deduced a trap composed of 82 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:34:53] [INFO ] Deduced a trap composed of 78 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:34:53] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 131072
[2025-06-02 05:34:54] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 4 ms to minimize.
SDD size :164901 after 457280
[2025-06-02 05:34:54] [INFO ] Deduced a trap composed of 144 places in 248 ms of which 4 ms to minimize.
[2025-06-02 05:34:54] [INFO ] Deduced a trap composed of 167 places in 251 ms of which 4 ms to minimize.
[2025-06-02 05:34:54] [INFO ] Deduced a trap composed of 115 places in 261 ms of which 4 ms to minimize.
[2025-06-02 05:34:55] [INFO ] Deduced a trap composed of 62 places in 260 ms of which 4 ms to minimize.
[2025-06-02 05:34:55] [INFO ] Deduced a trap composed of 46 places in 250 ms of which 4 ms to minimize.
[2025-06-02 05:34:55] [INFO ] Deduced a trap composed of 22 places in 238 ms of which 4 ms to minimize.
[2025-06-02 05:34:55] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 4 ms to minimize.
[2025-06-02 05:34:56] [INFO ] Deduced a trap composed of 16 places in 245 ms of which 3 ms to minimize.
[2025-06-02 05:34:56] [INFO ] Deduced a trap composed of 56 places in 243 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/735 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:34:57] [INFO ] Deduced a trap composed of 109 places in 239 ms of which 4 ms to minimize.
[2025-06-02 05:34:57] [INFO ] Deduced a trap composed of 41 places in 244 ms of which 4 ms to minimize.
[2025-06-02 05:34:57] [INFO ] Deduced a trap composed of 60 places in 242 ms of which 4 ms to minimize.
[2025-06-02 05:34:57] [INFO ] Deduced a trap composed of 59 places in 242 ms of which 4 ms to minimize.
[2025-06-02 05:34:58] [INFO ] Deduced a trap composed of 52 places in 242 ms of which 4 ms to minimize.
[2025-06-02 05:34:58] [INFO ] Deduced a trap composed of 44 places in 242 ms of which 4 ms to minimize.
[2025-06-02 05:34:58] [INFO ] Deduced a trap composed of 52 places in 236 ms of which 4 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 05:34:58] [INFO ] Deduced a trap composed of 63 places in 240 ms of which 4 ms to minimize.
[2025-06-02 05:34:59] [INFO ] Deduced a trap composed of 71 places in 243 ms of which 4 ms to minimize.
[2025-06-02 05:34:59] [INFO ] Deduced a trap composed of 172 places in 229 ms of which 4 ms to minimize.
[2025-06-02 05:34:59] [INFO ] Deduced a trap composed of 66 places in 222 ms of which 4 ms to minimize.
[2025-06-02 05:34:59] [INFO ] Deduced a trap composed of 74 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:35:00] [INFO ] Deduced a trap composed of 98 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:35:00] [INFO ] Deduced a trap composed of 110 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:35:00] [INFO ] Deduced a trap composed of 70 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:35:00] [INFO ] Deduced a trap composed of 68 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:35:00] [INFO ] Deduced a trap composed of 68 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:35:01] [INFO ] Deduced a trap composed of 68 places in 204 ms of which 4 ms to minimize.
[2025-06-02 05:35:01] [INFO ] Deduced a trap composed of 69 places in 204 ms of which 4 ms to minimize.
[2025-06-02 05:35:01] [INFO ] Deduced a trap composed of 113 places in 181 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/735 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:35:02] [INFO ] Deduced a trap composed of 72 places in 222 ms of which 4 ms to minimize.
[2025-06-02 05:35:02] [INFO ] Deduced a trap composed of 61 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:35:02] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:35:02] [INFO ] Deduced a trap composed of 82 places in 246 ms of which 3 ms to minimize.
[2025-06-02 05:35:03] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 4 ms to minimize.
[2025-06-02 05:35:03] [INFO ] Deduced a trap composed of 48 places in 245 ms of which 4 ms to minimize.
[2025-06-02 05:35:03] [INFO ] Deduced a trap composed of 46 places in 252 ms of which 4 ms to minimize.
[2025-06-02 05:35:04] [INFO ] Deduced a trap composed of 44 places in 254 ms of which 4 ms to minimize.
[2025-06-02 05:35:04] [INFO ] Deduced a trap composed of 66 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:35:04] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:35:04] [INFO ] Deduced a trap composed of 92 places in 212 ms of which 4 ms to minimize.
[2025-06-02 05:35:04] [INFO ] Deduced a trap composed of 123 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:35:05] [INFO ] Deduced a trap composed of 74 places in 208 ms of which 4 ms to minimize.
[2025-06-02 05:35:05] [INFO ] Deduced a trap composed of 115 places in 239 ms of which 3 ms to minimize.
[2025-06-02 05:35:05] [INFO ] Deduced a trap composed of 107 places in 226 ms of which 3 ms to minimize.
[2025-06-02 05:35:05] [INFO ] Deduced a trap composed of 100 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:35:06] [INFO ] Deduced a trap composed of 54 places in 199 ms of which 4 ms to minimize.
[2025-06-02 05:35:06] [INFO ] Deduced a trap composed of 114 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:35:06] [INFO ] Deduced a trap composed of 68 places in 197 ms of which 4 ms to minimize.
[2025-06-02 05:35:06] [INFO ] Deduced a trap composed of 166 places in 164 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/735 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:35:07] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 4 ms to minimize.
[2025-06-02 05:35:07] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 4 ms to minimize.
[2025-06-02 05:35:07] [INFO ] Deduced a trap composed of 82 places in 217 ms of which 4 ms to minimize.
[2025-06-02 05:35:08] [INFO ] Deduced a trap composed of 50 places in 232 ms of which 4 ms to minimize.
[2025-06-02 05:35:08] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:35:08] [INFO ] Deduced a trap composed of 82 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:35:08] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 3 ms to minimize.
[2025-06-02 05:35:09] [INFO ] Deduced a trap composed of 94 places in 157 ms of which 3 ms to minimize.
[2025-06-02 05:35:09] [INFO ] Deduced a trap composed of 86 places in 166 ms of which 2 ms to minimize.
[2025-06-02 05:35:09] [INFO ] Deduced a trap composed of 86 places in 155 ms of which 3 ms to minimize.
[2025-06-02 05:35:09] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 3 ms to minimize.
[2025-06-02 05:35:09] [INFO ] Deduced a trap composed of 107 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:35:10] [INFO ] Deduced a trap composed of 62 places in 143 ms of which 3 ms to minimize.
[2025-06-02 05:35:10] [INFO ] Deduced a trap composed of 66 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:35:10] [INFO ] Deduced a trap composed of 62 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:35:10] [INFO ] Deduced a trap composed of 89 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:35:10] [INFO ] Deduced a trap composed of 63 places in 182 ms of which 4 ms to minimize.
[2025-06-02 05:35:11] [INFO ] Deduced a trap composed of 62 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:35:11] [INFO ] Deduced a trap composed of 58 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:35:11] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/735 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:35:12] [INFO ] Deduced a trap composed of 33 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:35:12] [INFO ] Deduced a trap composed of 50 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:35:12] [INFO ] Deduced a trap composed of 61 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:35:12] [INFO ] Deduced a trap composed of 71 places in 199 ms of which 4 ms to minimize.
[2025-06-02 05:35:13] [INFO ] Deduced a trap composed of 50 places in 208 ms of which 4 ms to minimize.
[2025-06-02 05:35:13] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:35:13] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 3 ms to minimize.
[2025-06-02 05:35:13] [INFO ] Deduced a trap composed of 60 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:35:13] [INFO ] Deduced a trap composed of 50 places in 184 ms of which 3 ms to minimize.
[2025-06-02 05:35:14] [INFO ] Deduced a trap composed of 46 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:35:14] [INFO ] Deduced a trap composed of 103 places in 170 ms of which 3 ms to minimize.
[2025-06-02 05:35:14] [INFO ] Deduced a trap composed of 70 places in 168 ms of which 3 ms to minimize.
[2025-06-02 05:35:14] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
[2025-06-02 05:35:14] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:35:14] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:35:15] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2025-06-02 05:35:15] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2025-06-02 05:35:15] [INFO ] Deduced a trap composed of 64 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:35:15] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 2 ms to minimize.
[2025-06-02 05:35:15] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/735 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
[2025-06-02 05:35:16] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 3 ms to minimize.
[2025-06-02 05:35:17] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:35:17] [INFO ] Deduced a trap composed of 74 places in 258 ms of which 4 ms to minimize.
[2025-06-02 05:35:17] [INFO ] Deduced a trap composed of 46 places in 267 ms of which 5 ms to minimize.
[2025-06-02 05:35:17] [INFO ] Deduced a trap composed of 104 places in 252 ms of which 4 ms to minimize.
[2025-06-02 05:35:18] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:35:18] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 3 ms to minimize.
[2025-06-02 05:35:18] [INFO ] Deduced a trap composed of 46 places in 245 ms of which 4 ms to minimize.
[2025-06-02 05:35:18] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:35:19] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:35:19] [INFO ] Deduced a trap composed of 142 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:35:19] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:35:19] [INFO ] Deduced a trap composed of 68 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:35:20] [INFO ] Deduced a trap composed of 76 places in 180 ms of which 3 ms to minimize.
[2025-06-02 05:35:20] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 3 ms to minimize.
[2025-06-02 05:35:20] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 3 ms to minimize.
[2025-06-02 05:35:20] [INFO ] Deduced a trap composed of 75 places in 215 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 735/1967 variables, and 197 constraints, problems are : Problem set: 0 solved, 1435 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/735 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/1435 constraints, Known Traps: 177/177 constraints]
After SMT, in 60458ms problems are : Problem set: 0 solved, 1435 unsolved
Search for dead transitions found 0 dead transitions in 60470ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62710 ms. Remains : 735/735 places, 1442/1442 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[6] Max Struct:[7]
Ending property specific reduction for Peterson-COL-6-UpperBounds-11 in 287617 ms.
[2025-06-02 05:35:20] [INFO ] Flatten gal took : 41 ms
[2025-06-02 05:35:20] [INFO ] Applying decomposition
[2025-06-02 05:35:20] [INFO ] Flatten gal took : 31 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/graph10561530045638467152.txt' '-o' '/tmp/graph10561530045638467152.bin' '-w' '/tmp/graph10561530045638467152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10561530045638467152.bin' '-l' '-1' '-v' '-w' '/tmp/graph10561530045638467152.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:35:20] [INFO ] Decomposing Gal with order
[2025-06-02 05:35:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:35:20] [INFO ] Removed a total of 2000 redundant transitions.
[2025-06-02 05:35:20] [INFO ] Flatten gal took : 77 ms
[2025-06-02 05:35:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 26 ms.
[2025-06-02 05:35:21] [INFO ] Time to serialize gal into /tmp/UpperBounds18341252689355465291.gal : 9 ms
[2025-06-02 05:35:21] [INFO ] Time to serialize properties into /tmp/UpperBounds14924061772784821754.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/UpperBounds18341252689355465291.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14924061772784821754.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 ...306
Loading property file /tmp/UpperBounds14924061772784821754.prop.
ITS-tools command line returned an error code 137
[2025-06-02 05:44:25] [INFO ] Applying decomposition
[2025-06-02 05:44:25] [INFO ] Flatten gal took : 32 ms
[2025-06-02 05:44:25] [INFO ] Decomposing Gal with order
[2025-06-02 05:44:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:44:25] [INFO ] Removed a total of 2121 redundant transitions.
[2025-06-02 05:44:25] [INFO ] Flatten gal took : 59 ms
[2025-06-02 05:44:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-02 05:44:25] [INFO ] Time to serialize gal into /tmp/UpperBounds11259451047962049439.gal : 8 ms
[2025-06-02 05:44:25] [INFO ] Time to serialize properties into /tmp/UpperBounds3755934160277200804.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/UpperBounds11259451047962049439.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3755934160277200804.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 ...305
Loading property file /tmp/UpperBounds3755934160277200804.prop.
ITS-tools command line returned an error code 137
[2025-06-02 05:53:03] [INFO ] Flatten gal took : 41 ms
[2025-06-02 05:53:03] [INFO ] Input system was already deterministic with 1449 transitions.
[2025-06-02 05:53:03] [INFO ] Transformed 742 places.
[2025-06-02 05:53:03] [INFO ] Transformed 1449 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 05:53:03] [INFO ] Time to serialize gal into /tmp/UpperBounds15747680195111209316.gal : 4 ms
[2025-06-02 05:53:03] [INFO ] Time to serialize properties into /tmp/UpperBounds12185501182922942914.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/UpperBounds15747680195111209316.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12185501182922942914.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

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

BK_STOP 1748844175302

--------------------
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="Peterson-COL-6"
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 Peterson-COL-6, 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 r153-tall-174876824800073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-6.tgz
mv Peterson-COL-6 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 ;