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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K 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 45K 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-5-UpperBounds-00
FORMULA_NAME Peterson-COL-5-UpperBounds-01
FORMULA_NAME Peterson-COL-5-UpperBounds-02
FORMULA_NAME Peterson-COL-5-UpperBounds-03
FORMULA_NAME Peterson-COL-5-UpperBounds-04
FORMULA_NAME Peterson-COL-5-UpperBounds-05
FORMULA_NAME Peterson-COL-5-UpperBounds-06
FORMULA_NAME Peterson-COL-5-UpperBounds-07
FORMULA_NAME Peterson-COL-5-UpperBounds-08
FORMULA_NAME Peterson-COL-5-UpperBounds-09
FORMULA_NAME Peterson-COL-5-UpperBounds-10
FORMULA_NAME Peterson-COL-5-UpperBounds-11
FORMULA_NAME Peterson-COL-5-UpperBounds-12
FORMULA_NAME Peterson-COL-5-UpperBounds-13
FORMULA_NAME Peterson-COL-5-UpperBounds-14
FORMULA_NAME Peterson-COL-5-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748841532114

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-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 05:18:53] [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:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:18:53] [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:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 05:18:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 549 ms
[2025-06-02 05:18:54] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 864 PT places and 1398.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 9
[2025-06-02 05:18:54] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 4 ms.
[2025-06-02 05:18:54] [INFO ] Skeletonized 9 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:54] [INFO ] Computed 1 invariants in 4 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[5, 6, 0, 0, 0, 0, 0, 0, 6] Max Struct:[5, 6, 6, 6, 6, 6, 6, 6, 6]
FORMULA Peterson-COL-5-UpperBounds-14 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-13 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-08 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 05:18:54] [INFO ] Invariant cache hit.
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 05:18:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:54] [INFO ] Added : 11 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:18:54] [INFO ] Added : 11 causal constraints over 5 iterations in 37 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:18:54] [INFO ] Added : 12 causal constraints over 4 iterations in 13 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 05:18:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:54] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:54] [INFO ] Added : 11 causal constraints over 4 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:18:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:54] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:18:54] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:54] [INFO ] Added : 11 causal constraints over 5 iterations in 15 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[6, 6, 6, 6, 6, 6]
Domain [Process(6), Tour(5), Process(6)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 5)]] 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:54] [INFO ] Unfolded HLPN to a Petri net with 864 places and 1302 transitions 4068 arcs in 43 ms.
[2025-06-02 05:18:54] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Deduced a syphon composed of 30 places in 11 ms
Reduce places removed 30 places and 60 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[6, 6, 6, 6, 6, 6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[6, 6, 6, 6, 6, 6]
[2025-06-02 05:18:54] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2025-06-02 05:18:54] [INFO ] Computed 23 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[6, 6, 6, 6, 6, 6]
RANDOM walk for 10000 steps (2 resets) in 102 ms. (97 steps per ms)
FORMULA Peterson-COL-5-UpperBounds-12 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-5-UpperBounds-10 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-5-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-5-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-5-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms)
FORMULA Peterson-COL-5-UpperBounds-11 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-UpperBounds-15 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-UpperBounds-09 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[3, 1] Max Struct:[6, 6]
[2025-06-02 05:18:55] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2025-06-02 05:18:55] [INFO ] Invariant cache hit.
[2025-06-02 05:18:55] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2025-06-02 05:18:55] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2025-06-02 05:18:55] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2025-06-02 05:18:55] [INFO ] State equation strengthened by 205 read => feed constraints.
[2025-06-02 05:18:55] [INFO ] [Real]Added 205 Read/Feed constraints in 48 ms returned sat
[2025-06-02 05:18:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2025-06-02 05:18:55] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2025-06-02 05:18:56] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2025-06-02 05:18:56] [INFO ] [Nat]Added 205 Read/Feed constraints in 78 ms returned sat
[2025-06-02 05:18:56] [INFO ] Deduced a trap composed of 56 places in 339 ms of which 45 ms to minimize.
[2025-06-02 05:18:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 469 ms
[2025-06-02 05:18:56] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 78 ms.
[2025-06-02 05:19:00] [INFO ] Deduced a trap composed of 11 places in 290 ms of which 5 ms to minimize.
[2025-06-02 05:19:00] [INFO ] Deduced a trap composed of 20 places in 300 ms of which 4 ms to minimize.
[2025-06-02 05:19:00] [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.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 05:19:01] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2025-06-02 05:19:01] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2025-06-02 05:19:01] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2025-06-02 05:19:01] [INFO ] [Real]Added 205 Read/Feed constraints in 37 ms returned sat
[2025-06-02 05:19:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2025-06-02 05:19:01] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2025-06-02 05:19:01] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2025-06-02 05:19:01] [INFO ] [Nat]Added 205 Read/Feed constraints in 138 ms returned sat
[2025-06-02 05:19:02] [INFO ] Deduced a trap composed of 37 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:19:02] [INFO ] Deduced a trap composed of 53 places in 229 ms of which 4 ms to minimize.
[2025-06-02 05:19:02] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 5 ms to minimize.
[2025-06-02 05:19:03] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:19:03] [INFO ] Deduced a trap composed of 71 places in 249 ms of which 4 ms to minimize.
[2025-06-02 05:19:03] [INFO ] Deduced a trap composed of 44 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:19:03] [INFO ] Deduced a trap composed of 71 places in 222 ms of which 4 ms to minimize.
[2025-06-02 05:19:04] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 4 ms to minimize.
[2025-06-02 05:19:04] [INFO ] Deduced a trap composed of 72 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:19:04] [INFO ] Deduced a trap composed of 22 places in 219 ms of which 4 ms to minimize.
[2025-06-02 05:19:05] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 6 ms to minimize.
[2025-06-02 05:19:05] [INFO ] Deduced a trap composed of 100 places in 221 ms of which 6 ms to minimize.
[2025-06-02 05:19:05] [INFO ] Deduced a trap composed of 97 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:19:05] [INFO ] Deduced a trap composed of 171 places in 216 ms of which 4 ms to minimize.
[2025-06-02 05:19:06] [INFO ] Deduced a trap composed of 51 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:19:06] [INFO ] Deduced a trap composed of 53 places in 242 ms of which 4 ms to minimize.
[2025-06-02 05:19:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.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)
Current structural bounds on expressions (after SMT) : Max Seen:[3, 1] Max Struct:[6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 1] Max Struct:[6, 6]
Support contains 186 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 834 transition count 1092
Reduce places removed 150 places and 0 transitions.
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Iterating post reduction 1 with 300 rules applied. Total rules applied 450 place count 684 transition count 942
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 600 place count 534 transition count 942
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 600 place count 534 transition count 888
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 708 place count 480 transition count 888
Applied a total of 708 rules in 113 ms. Remains 480 /834 variables (removed 354) and now considering 888/1242 (removed 354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 480/834 places, 888/1242 transitions.
[2025-06-02 05:19:06] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
// Phase 1: matrix 768 rows 480 cols
[2025-06-02 05:19:06] [INFO ] Computed 23 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 1] Max Struct:[6, 6]
RANDOM walk for 1000000 steps (2 resets) in 3503 ms. (285 steps per ms)
FORMULA Peterson-COL-5-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (4 resets) in 3548 ms. (563 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2025-06-02 05:19:13] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
[2025-06-02 05:19:13] [INFO ] Invariant cache hit.
[2025-06-02 05:19:13] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2025-06-02 05:19:13] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-02 05:19:14] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2025-06-02 05:19:14] [INFO ] State equation strengthened by 205 read => feed constraints.
[2025-06-02 05:19:14] [INFO ] [Real]Added 205 Read/Feed constraints in 20 ms returned sat
[2025-06-02 05:19:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2025-06-02 05:19:14] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-02 05:19:14] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2025-06-02 05:19:14] [INFO ] [Nat]Added 205 Read/Feed constraints in 70 ms returned sat
[2025-06-02 05:19:14] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 3 ms to minimize.
[2025-06-02 05:19:14] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:19:14] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 2 ms to minimize.
[2025-06-02 05:19:15] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:19:15] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 2 ms to minimize.
[2025-06-02 05:19:15] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 2 ms to minimize.
[2025-06-02 05:19:15] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 3 ms to minimize.
[2025-06-02 05:19:15] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:19:15] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 3 ms to minimize.
[2025-06-02 05:19:16] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 3 ms to minimize.
[2025-06-02 05:19:16] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 2 ms to minimize.
[2025-06-02 05:19:16] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:19:16] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 3 ms to minimize.
[2025-06-02 05:19:16] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:19:16] [INFO ] Deduced a trap composed of 65 places in 122 ms of which 3 ms to minimize.
[2025-06-02 05:19:17] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 5 ms to minimize.
[2025-06-02 05:19:17] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2025-06-02 05:19:17] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 2 ms to minimize.
[2025-06-02 05:19:17] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 3 ms to minimize.
[2025-06-02 05:19:17] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:19:17] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2025-06-02 05:19:18] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 2 ms to minimize.
[2025-06-02 05:19:18] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 3 ms to minimize.
[2025-06-02 05:19:18] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 3 ms to minimize.
[2025-06-02 05:19:18] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
[2025-06-02 05:19:18] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 3 ms to minimize.
[2025-06-02 05:19:18] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 3 ms to minimize.
[2025-06-02 05:19:19] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:19:19] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 3 ms to minimize.
[2025-06-02 05:19:19] [INFO ] Deduced a trap composed of 56 places in 167 ms of which 2 ms to minimize.
[2025-06-02 05:19:19] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2025-06-02 05:19:19] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 3 ms to minimize.
[2025-06-02 05:19:19] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 2 ms to minimize.
[2025-06-02 05:19:20] [INFO ] Deduced a trap composed of 48 places in 133 ms of which 3 ms to minimize.
[2025-06-02 05:19:20] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 3 ms to minimize.
[2025-06-02 05:19:20] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 3 ms to minimize.
[2025-06-02 05:19:20] [INFO ] Deduced a trap composed of 68 places in 118 ms of which 2 ms to minimize.
[2025-06-02 05:19:20] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 6 ms to minimize.
[2025-06-02 05:19:20] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:19:21] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 3 ms to minimize.
[2025-06-02 05:19:21] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 2 ms to minimize.
[2025-06-02 05:19:21] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2025-06-02 05:19:21] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 2 ms to minimize.
[2025-06-02 05:19:21] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:19:21] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:19:22] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2025-06-02 05:19:22] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
[2025-06-02 05:19:22] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 3 ms to minimize.
[2025-06-02 05:19:22] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2025-06-02 05:19:22] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 2 ms to minimize.
[2025-06-02 05:19:23] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 2 ms to minimize.
[2025-06-02 05:19:23] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 3 ms to minimize.
[2025-06-02 05:19:23] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 2 ms to minimize.
[2025-06-02 05:19:23] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2025-06-02 05:19:24] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 2 ms to minimize.
[2025-06-02 05:19:24] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:19:24] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 2 ms to minimize.
[2025-06-02 05:19:28] [INFO ] Deduced a trap composed of 71 places in 136 ms of which 3 ms to minimize.
[2025-06-02 05:19:28] [INFO ] Deduced a trap composed of 120 places in 137 ms of which 3 ms to minimize.
[2025-06-02 05:19:28] [INFO ] Deduced a trap composed of 111 places in 133 ms of which 3 ms to minimize.
[2025-06-02 05:19:28] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 2 ms to minimize.
[2025-06-02 05:19:29] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 2 ms to minimize.
[2025-06-02 05:19:29] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 2 ms to minimize.
[2025-06-02 05:19:29] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 3 ms to minimize.
[2025-06-02 05:19:29] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 3 ms to minimize.
[2025-06-02 05:19:29] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 3 ms to minimize.
[2025-06-02 05:19:30] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
[2025-06-02 05:19:30] [INFO ] Deduced a trap composed of 125 places in 94 ms of which 2 ms to minimize.
[2025-06-02 05:19:30] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 2 ms to minimize.
[2025-06-02 05:19:30] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 2 ms to minimize.
[2025-06-02 05:19:30] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:19:32] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 2 ms to minimize.
[2025-06-02 05:19:32] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 1 ms to minimize.
[2025-06-02 05:19:32] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 2 ms to minimize.
[2025-06-02 05:19:37] [INFO ] Trap strengthening (SAT) tested/added 74/74 trap constraints in 22729 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 6 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 888/888 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 480 transition count 833
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 425 transition count 833
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 125 Pre rules applied. Total rules applied 110 place count 425 transition count 708
Deduced a syphon composed of 125 places in 1 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 250 rules applied. Total rules applied 360 place count 300 transition count 708
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 420 place count 270 transition count 678
Applied a total of 420 rules in 69 ms. Remains 270 /480 variables (removed 210) and now considering 678/888 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 270/480 places, 678/888 transitions.
[2025-06-02 05:19:37] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 270 cols
[2025-06-02 05:19:37] [INFO ] Computed 23 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[6]
RANDOM walk for 1000000 steps (2 resets) in 1412 ms. (707 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 471 ms. (2118 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2025-06-02 05:19:39] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2025-06-02 05:19:39] [INFO ] Invariant cache hit.
[2025-06-02 05:19:39] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2025-06-02 05:19:39] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-02 05:19:39] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2025-06-02 05:19:39] [INFO ] State equation strengthened by 205 read => feed constraints.
[2025-06-02 05:19:39] [INFO ] [Real]Added 205 Read/Feed constraints in 19 ms returned sat
[2025-06-02 05:19:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2025-06-02 05:19:39] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-02 05:19:39] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2025-06-02 05:19:39] [INFO ] [Nat]Added 205 Read/Feed constraints in 29 ms returned sat
[2025-06-02 05:19:39] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2025-06-02 05:19:39] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2025-06-02 05:19:39] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2025-06-02 05:19:40] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2025-06-02 05:19:40] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2025-06-02 05:19:40] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2025-06-02 05:19:40] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
[2025-06-02 05:19:40] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2025-06-02 05:19:40] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2025-06-02 05:19:40] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:19:40] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 2 ms to minimize.
[2025-06-02 05:19:40] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2025-06-02 05:19:41] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2025-06-02 05:19:41] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2025-06-02 05:19:41] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2025-06-02 05:19:41] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2025-06-02 05:19:41] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2025-06-02 05:19:41] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:19:41] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
[2025-06-02 05:19:41] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:19:41] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:19:42] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:19:42] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2025-06-02 05:19:42] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2025-06-02 05:19:42] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2025-06-02 05:19:42] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2025-06-02 05:19:42] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2025-06-02 05:19:42] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2025-06-02 05:19:42] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2025-06-02 05:19:43] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2025-06-02 05:19:43] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2025-06-02 05:19:43] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2025-06-02 05:19:43] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2025-06-02 05:19:43] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2025-06-02 05:19:43] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:19:43] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2025-06-02 05:19:43] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 1 ms to minimize.
[2025-06-02 05:19:43] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 3 ms to minimize.
[2025-06-02 05:19:43] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:19:44] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2025-06-02 05:19:44] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:19:44] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2025-06-02 05:19:44] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2025-06-02 05:19:45] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:19:45] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2025-06-02 05:19:45] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2025-06-02 05:19:45] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2025-06-02 05:19:47] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2025-06-02 05:19:47] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2025-06-02 05:19:47] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2025-06-02 05:19:47] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2025-06-02 05:19:47] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2025-06-02 05:19:47] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2025-06-02 05:19:48] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:19:48] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:19:48] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:19:48] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2025-06-02 05:19:48] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2025-06-02 05:19:48] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2025-06-02 05:19:48] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:19:48] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:19:49] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:19:49] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2025-06-02 05:19:49] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:19:49] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
[2025-06-02 05:19:49] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2025-06-02 05:19:49] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2025-06-02 05:19:49] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2025-06-02 05:19:49] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:19:50] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2025-06-02 05:19:50] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2025-06-02 05:19:50] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2025-06-02 05:19:50] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:19:50] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2025-06-02 05:19:50] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:19:51] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:19:51] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:19:51] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 2 ms to minimize.
[2025-06-02 05:19:51] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 2 ms to minimize.
[2025-06-02 05:19:51] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:19:52] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2025-06-02 05:19:52] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:19:52] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:19:52] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:19:52] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2025-06-02 05:19:53] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:19:53] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:19:53] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:19:53] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:19:53] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:19:53] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:19:53] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:19:53] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:19:54] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:19:54] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:19:54] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:19:54] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:19:54] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:19:54] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:19:55] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:19:55] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:19:55] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:19:56] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:19:56] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:19:56] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2025-06-02 05:19:56] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:19:57] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:19:57] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:20:01] [INFO ] Trap strengthening (SAT) tested/added 108/108 trap constraints in 22221 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 6 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 678/678 transitions.
Applied a total of 0 rules in 22 ms. Remains 270 /270 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 270/270 places, 678/678 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 678/678 transitions.
Applied a total of 0 rules in 12 ms. Remains 270 /270 variables (removed 0) and now considering 678/678 (removed 0) transitions.
[2025-06-02 05:20:01] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2025-06-02 05:20:01] [INFO ] Invariant cache hit.
[2025-06-02 05:20:02] [INFO ] Implicit Places using invariants in 180 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 183 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 264/270 places, 678/678 transitions.
Applied a total of 0 rules in 11 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 209 ms. Remains : 264/270 places, 678/678 transitions.
[2025-06-02 05:20:02] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2025-06-02 05:20:02] [INFO ] Computed 17 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[6]
RANDOM walk for 1000000 steps (2 resets) in 1382 ms. (723 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 466 ms. (2141 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2025-06-02 05:20:03] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2025-06-02 05:20:03] [INFO ] Invariant cache hit.
[2025-06-02 05:20:04] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2025-06-02 05:20:04] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2025-06-02 05:20:04] [INFO ] State equation strengthened by 205 read => feed constraints.
[2025-06-02 05:20:04] [INFO ] [Real]Added 205 Read/Feed constraints in 18 ms returned sat
[2025-06-02 05:20:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:20:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2025-06-02 05:20:04] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2025-06-02 05:20:04] [INFO ] [Nat]Added 205 Read/Feed constraints in 29 ms returned sat
[2025-06-02 05:20:04] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2025-06-02 05:20:04] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:20:04] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2025-06-02 05:20:04] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2025-06-02 05:20:04] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:20:04] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2025-06-02 05:20:05] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2025-06-02 05:20:05] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2025-06-02 05:20:05] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:20:05] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2025-06-02 05:20:05] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2025-06-02 05:20:05] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 2 ms to minimize.
[2025-06-02 05:20:05] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2025-06-02 05:20:05] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:20:05] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2025-06-02 05:20:05] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2025-06-02 05:20:06] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:20:06] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
[2025-06-02 05:20:06] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:20:06] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2025-06-02 05:20:06] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:20:06] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2025-06-02 05:20:06] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:20:07] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:20:07] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2025-06-02 05:20:07] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:20:07] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:20:07] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2025-06-02 05:20:07] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:20:07] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 1 ms to minimize.
[2025-06-02 05:20:08] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2025-06-02 05:20:08] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2025-06-02 05:20:08] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2025-06-02 05:20:08] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:20:08] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2025-06-02 05:20:08] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2025-06-02 05:20:09] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2025-06-02 05:20:09] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:20:09] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2025-06-02 05:20:09] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:20:09] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 2 ms to minimize.
[2025-06-02 05:20:09] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2025-06-02 05:20:09] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2025-06-02 05:20:09] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:20:09] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:20:09] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:20:10] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2025-06-02 05:20:10] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2025-06-02 05:20:10] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:20:10] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:20:10] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:20:10] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:20:10] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:20:10] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
[2025-06-02 05:20:11] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:20:11] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:20:11] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 1 ms to minimize.
[2025-06-02 05:20:11] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:20:11] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:20:12] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:20:12] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2025-06-02 05:20:12] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2025-06-02 05:20:12] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:20:13] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:20:14] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:20:14] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 2 ms to minimize.
[2025-06-02 05:20:15] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2025-06-02 05:20:15] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2025-06-02 05:20:15] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:20:15] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2025-06-02 05:20:15] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:20:15] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2025-06-02 05:20:16] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2025-06-02 05:20:16] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 2 ms to minimize.
[2025-06-02 05:20:16] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
[2025-06-02 05:20:16] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:20:16] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:20:16] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:20:16] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:20:16] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2025-06-02 05:20:17] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:20:17] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:20:17] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 2 ms to minimize.
[2025-06-02 05:20:17] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2025-06-02 05:20:19] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2025-06-02 05:20:19] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:20:19] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2025-06-02 05:20:19] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:20:20] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:20:20] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:20:20] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:20:20] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:20:21] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2025-06-02 05:20:21] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2025-06-02 05:20:21] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2025-06-02 05:20:22] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:20:23] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:20:23] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:20:23] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:20:23] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:20:23] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:20:23] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:20:23] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:20:24] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:20:24] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:20:24] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 2 ms to minimize.
[2025-06-02 05:20:25] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:20:25] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:20:25] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:20:25] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:20:25] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 2 ms to minimize.
[2025-06-02 05:20:25] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:20:25] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:20:26] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:20:26] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:20:26] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:20:26] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2025-06-02 05:20:26] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:20:26] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:20:26] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:20:26] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:20:26] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:20:27] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:20:27] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:20:27] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2025-06-02 05:20:27] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:20:27] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2025-06-02 05:20:27] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:20:27] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:20:28] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:20:28] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:20:28] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2025-06-02 05:20:29] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:20:29] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:20:29] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:20:29] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:20:29] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:20:29] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:20:29] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:20:29] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:20:31] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2025-06-02 05:20:32] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:20:32] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:20:33] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2025-06-02 05:20:33] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:20:34] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:20:34] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2025-06-02 05:20:35] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 1 ms to minimize.
[2025-06-02 05:20:35] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2025-06-02 05:20:35] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2025-06-02 05:20:35] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:20:35] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:20:35] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:20:36] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:20:36] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2025-06-02 05:20:36] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:20:36] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:20:37] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:20:37] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:20:42] [INFO ] Trap strengthening (SAT) tested/added 159/159 trap constraints in 37797 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 678/678 transitions.
Applied a total of 0 rules in 10 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 264/264 places, 678/678 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 678/678 transitions.
Applied a total of 0 rules in 10 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
[2025-06-02 05:20:42] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2025-06-02 05:20:42] [INFO ] Invariant cache hit.
[2025-06-02 05:20:42] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-06-02 05:20:42] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2025-06-02 05:20:42] [INFO ] Invariant cache hit.
[2025-06-02 05:20:42] [INFO ] State equation strengthened by 205 read => feed constraints.
[2025-06-02 05:20:42] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
[2025-06-02 05:20:42] [INFO ] Redundant transitions in 40 ms returned []
Running 672 sub problems to find dead transitions.
[2025-06-02 05:20:42] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2025-06-02 05:20:42] [INFO ] Invariant cache hit.
[2025-06-02 05:20:43] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2025-06-02 05:20:46] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2025-06-02 05:20:46] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2025-06-02 05:20:46] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2025-06-02 05:20:46] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2025-06-02 05:20:46] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:20:46] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:20:46] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:20:46] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2025-06-02 05:20:48] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/264 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2025-06-02 05:20:48] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:20:48] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2025-06-02 05:20:48] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2025-06-02 05:20:48] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2025-06-02 05:20:48] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2025-06-02 05:20:48] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2025-06-02 05:20:48] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:20:48] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2025-06-02 05:20:48] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:20:49] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:20:49] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2025-06-02 05:20:49] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:20:49] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:20:49] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2025-06-02 05:20:49] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:20:49] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:20:49] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:20:49] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:20:50] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:20:50] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2025-06-02 05:20:50] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:20:50] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2025-06-02 05:20:50] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:20:50] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:20:50] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:20:51] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:20:51] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2025-06-02 05:20:51] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:20:51] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:20:51] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:20:51] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2025-06-02 05:20:51] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:20:51] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2025-06-02 05:20:51] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 2 ms to minimize.
[2025-06-02 05:20:51] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:20:51] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:20:51] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:20:51] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:20:52] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:20:52] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2025-06-02 05:20:55] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2025-06-02 05:20:55] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:20:55] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:20:55] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:20:55] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:20:55] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:20:55] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:20:56] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:20:56] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:20:56] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:20:56] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2025-06-02 05:20:56] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:20:56] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:20:56] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:20:56] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
[2025-06-02 05:20:56] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:20:56] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:20:56] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:20:56] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:20:56] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2025-06-02 05:20:57] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2025-06-02 05:20:57] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:20:57] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:20:57] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:20:57] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:20:57] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:20:57] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:20:57] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2025-06-02 05:20:57] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2025-06-02 05:20:58] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:20:58] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:20:58] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2025-06-02 05:20:58] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:20:58] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:20:58] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:20:58] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:20:58] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:20:58] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:20:59] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:20:59] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2025-06-02 05:20:59] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:20:59] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:21:00] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:21:00] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:21:00] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2025-06-02 05:21:00] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:21:00] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:21:00] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:21:00] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:21:00] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:21:00] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2025-06-02 05:21:00] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:21:00] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:21:00] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2025-06-02 05:21:00] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2025-06-02 05:21:00] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2025-06-02 05:21:00] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2025-06-02 05:21:01] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:21:01] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2025-06-02 05:21:01] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2025-06-02 05:21:04] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2025-06-02 05:21:04] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:21:05] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2025-06-02 05:21:05] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:21:05] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:21:05] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:21:05] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:21:05] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:21:05] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:21:05] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:21:06] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2025-06-02 05:21:06] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2025-06-02 05:21:06] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2025-06-02 05:21:06] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2025-06-02 05:21:06] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2025-06-02 05:21:06] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:21:07] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2025-06-02 05:21:07] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:21:07] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:21:07] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2025-06-02 05:21:09] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2025-06-02 05:21:09] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:21:09] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:21:09] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:21:09] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:21:09] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2025-06-02 05:21:09] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:21:09] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:21:10] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:21:10] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:21:10] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:21:10] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 2 ms to minimize.
[2025-06-02 05:21:10] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:21:10] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:21:10] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:21:10] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:21:10] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:21:10] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:21:10] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:21:11] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2025-06-02 05:21:12] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:21:12] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:21:12] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 0 ms to minimize.
[2025-06-02 05:21:12] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:21:12] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2025-06-02 05:21:12] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:21:12] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/822 variables, and 184 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/264 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 167/167 constraints]
Escalating to Integer solving :Problem set: 0 solved, 672 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/264 variables, 167/184 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2025-06-02 05:21:15] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2025-06-02 05:21:15] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 4 ms to minimize.
[2025-06-02 05:21:15] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 0 ms to minimize.
[2025-06-02 05:21:16] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:21:16] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:21:16] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:21:16] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:21:17] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:21:17] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:21:17] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2025-06-02 05:21:17] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:21:18] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2025-06-02 05:21:18] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2025-06-02 05:21:18] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:21:18] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:21:18] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2025-06-02 05:21:18] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:21:18] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:21:18] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:21:18] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2025-06-02 05:21:21] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2025-06-02 05:21:22] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2025-06-02 05:21:22] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:21:23] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 0 ms to minimize.
[2025-06-02 05:21:23] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:21:23] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 2 ms to minimize.
[2025-06-02 05:21:23] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2025-06-02 05:21:30] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:21:32] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:21:32] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:21:32] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:21:32] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:21:32] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 2 ms to minimize.
[2025-06-02 05:21:32] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:21:33] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:21:33] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:21:33] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:21:33] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:21:33] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:21:33] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:21:33] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:21:33] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2025-06-02 05:21:33] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:21:33] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
[2025-06-02 05:21:33] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:21:34] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 2 ms to minimize.
[2025-06-02 05:21:34] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2025-06-02 05:21:37] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:21:37] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:21:38] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:21:38] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:21:41] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2025-06-02 05:21:41] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2025-06-02 05:21:41] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:21:42] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:21:42] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:21:42] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:21:42] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:21:42] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 2 ms to minimize.
[2025-06-02 05:21:42] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:21:42] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:21:42] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:21:42] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:21:42] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:21:42] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:21:43] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:21:43] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
SMT process timed out in 60303ms, After SMT, problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 60318ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61092 ms. Remains : 264/264 places, 678/678 transitions.
RANDOM walk for 40000 steps (8 resets) in 827 ms. (48 steps per ms) remains 2/2 properties
[2025-06-02 05:21:43] [INFO ] Flatten gal took : 171 ms
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
[2025-06-02 05:21:43] [INFO ] Flatten gal took : 90 ms
[2025-06-02 05:21:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1147758329470946334.gal : 36 ms
[2025-06-02 05:21:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4714259766989364630.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/ReachabilityCardinality1147758329470946334.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4714259766989364630.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/ReachabilityCardinality4714259766989364630.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 141
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :141 after 234
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :234 after 407
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :407 after 1425
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1425 after 3762
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3762 after 7560
Interrupted probabilistic random walk after 770427 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :0 out of 2
Probabilistic random walk after 770427 steps, saw 112290 distinct states, run finished after 3004 ms. (steps per millisecond=256 ) properties seen :0
[2025-06-02 05:21:46] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2025-06-02 05:21:46] [INFO ] Invariant cache hit.
[2025-06-02 05:21:46] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 222/228 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/234 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/792 variables, 234/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/792 variables, 205/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/792 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/822 variables, 30/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/822 variables, 5/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/822 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/822 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 822/822 variables, and 486 constraints, problems are : Problem set: 0 solved, 2 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 264/264 constraints, ReadFeed: 205/205 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 222/228 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/234 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/792 variables, 234/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/792 variables, 205/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/792 variables, 2/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/792 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 30/822 variables, 30/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/822 variables, 5/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:21:47] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2025-06-02 05:21:47] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:21:47] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2025-06-02 05:21:47] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2025-06-02 05:21:47] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:21:47] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:21:47] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 2 ms to minimize.
[2025-06-02 05:21:47] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2025-06-02 05:21:48] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2025-06-02 05:21:48] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2025-06-02 05:21:48] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:21:48] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7560 after 43551
[2025-06-02 05:21:48] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2025-06-02 05:21:48] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2025-06-02 05:21:48] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 2 ms to minimize.
[2025-06-02 05:21:48] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:21:48] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2025-06-02 05:21:48] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2025-06-02 05:21:49] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:21:49] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/822 variables, 20/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:21:49] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:21:49] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2025-06-02 05:21:49] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:21:49] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2025-06-02 05:21:49] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:21:49] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:21:49] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2025-06-02 05:21:49] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
[2025-06-02 05:21:49] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 1 ms to minimize.
[2025-06-02 05:21:50] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:21:50] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:21:50] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:21:50] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:21:50] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:21:50] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2025-06-02 05:21:50] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:21:50] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2025-06-02 05:21:50] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2025-06-02 05:21:50] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:21:51] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/822 variables, 20/528 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 05:21:51] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:21:51] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:21:51] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:21:51] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:21:51] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2025-06-02 05:21:51] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:21:51] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:21:51] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:21:51] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 822/822 variables, and 537 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 264/264 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 49/49 constraints]
After SMT, in 5345ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 678/678 transitions.
Applied a total of 0 rules in 11 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 264/264 places, 678/678 transitions.
RANDOM walk for 40000 steps (8 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :43551 after 104175
Interrupted probabilistic random walk after 1003359 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :0 out of 1
Probabilistic random walk after 1003359 steps, saw 146403 distinct states, run finished after 3001 ms. (steps per millisecond=334 ) properties seen :0
[2025-06-02 05:21:55] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2025-06-02 05:21:55] [INFO ] Invariant cache hit.
[2025-06-02 05:21:55] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 222/228 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 6/234 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/792 variables, 234/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/792 variables, 205/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/792 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/822 variables, 30/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/822 variables, 5/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/822 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/822 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 822/822 variables, and 486 constraints, problems are : Problem set: 0 solved, 1 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 264/264 constraints, ReadFeed: 205/205 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 222/228 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:21:55] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:21:55] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/234 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 558/792 variables, 234/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/792 variables, 205/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/792 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/792 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 30/822 variables, 30/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/822 variables, 5/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:21:55] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2025-06-02 05:21:55] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:21:55] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2025-06-02 05:21:55] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:21:56] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:21:56] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:21:56] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2025-06-02 05:21:56] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2025-06-02 05:21:56] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 2 ms to minimize.
[2025-06-02 05:21:56] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2025-06-02 05:21:56] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:21:56] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:21:56] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2025-06-02 05:21:56] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:21:57] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:21:57] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:21:57] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2025-06-02 05:21:57] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2025-06-02 05:21:57] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2025-06-02 05:21:57] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/822 variables, 20/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:21:57] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:21:57] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:21:57] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:21:57] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2025-06-02 05:21:58] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2025-06-02 05:21:58] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2025-06-02 05:21:58] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:21:58] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2025-06-02 05:21:58] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:21:58] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2025-06-02 05:21:58] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2025-06-02 05:21:58] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:21:58] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:21:58] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:21:58] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:21:59] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:21:59] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:21:59] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:21:59] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:21:59] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/822 variables, 20/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:21:59] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:21:59] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:21:59] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:21:59] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:21:59] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:22:00] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:22:00] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2025-06-02 05:22:00] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2025-06-02 05:22:00] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2025-06-02 05:22:00] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 2 ms to minimize.
[2025-06-02 05:22:00] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 2 ms to minimize.
[2025-06-02 05:22:00] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:22:00] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 2 ms to minimize.
[2025-06-02 05:22:00] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:22:00] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:22:01] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:22:01] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2025-06-02 05:22:01] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:22:01] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:22:01] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/822 variables, 20/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:22:01] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
[2025-06-02 05:22:01] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
SDD size :104175 after 187891
[2025-06-02 05:22:01] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:22:01] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:22:01] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:22:01] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2025-06-02 05:22:02] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2025-06-02 05:22:03] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2025-06-02 05:22:03] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2025-06-02 05:22:03] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2025-06-02 05:22:03] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/822 variables, 20/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:22:03] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:22:03] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2025-06-02 05:22:03] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 2 ms to minimize.
[2025-06-02 05:22:03] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:22:03] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:22:03] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2025-06-02 05:22:03] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:22:04] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2025-06-02 05:22:04] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2025-06-02 05:22:04] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
[2025-06-02 05:22:04] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:22:04] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:22:04] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2025-06-02 05:22:04] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:22:04] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:22:04] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 2 ms to minimize.
[2025-06-02 05:22:05] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:22:05] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:22:05] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2025-06-02 05:22:05] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/822 variables, 20/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:22:05] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:22:05] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:22:06] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2025-06-02 05:22:06] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2025-06-02 05:22:06] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2025-06-02 05:22:06] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:22:06] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:22:06] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:22:06] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2025-06-02 05:22:07] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2025-06-02 05:22:07] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:22:07] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2025-06-02 05:22:07] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:22:07] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:22:07] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:22:07] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:22:07] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:22:07] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:22:07] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:22:07] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/822 variables, 20/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:22:08] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 0 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2025-06-02 05:22:09] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2025-06-02 05:22:10] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2025-06-02 05:22:10] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:22:10] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 2 ms to minimize.
[2025-06-02 05:22:10] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/822 variables, 20/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:22:10] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2025-06-02 05:22:10] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2025-06-02 05:22:11] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:22:11] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:22:13] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2025-06-02 05:22:13] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
[2025-06-02 05:22:15] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
SDD size :187891 after 260520
[2025-06-02 05:22:15] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:22:16] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:22:16] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2025-06-02 05:22:16] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:22:16] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2025-06-02 05:22:17] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:22:17] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:22:17] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:22:17] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:22:17] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:22:17] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:22:17] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2025-06-02 05:22:19] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/822 variables, 20/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:22:19] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:22:19] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2025-06-02 05:22:20] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 0 ms to minimize.
[2025-06-02 05:22:20] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:22:20] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:22:20] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:22:20] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:22:21] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:22:21] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
Problem MIN0 is UNSAT
After SMT solving in domain Int declared 822/822 variables, and 658 constraints, problems are : Problem set: 1 solved, 0 unsolved in 26454 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 264/264 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 171/171 constraints]
After SMT, in 26675ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA Peterson-COL-5-UpperBounds-06 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 208465 ms.

BK_STOP 1748841741884

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-5"
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-5, 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-174876824800072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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