MCC'2024- Execution of r508-tall-171654350800053

About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S16C08

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
7637.607	1726158.00	1933959.00	4590.30	1 ? ? 1 1 1 1 1 1 1 1 1 1 ? 1 1	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r508-tall-171654350800053.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is MultiCrashLeafsetExtension-PT-S16C08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654350800053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 06:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 06:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.3M May 18 16:43 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

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717197271230

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:14:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 23:14:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:14:32] [INFO ] Load time of PNML (sax parser for PT used): 421 ms
[2024-05-31 23:14:32] [INFO ] Transformed 6876 places.
[2024-05-31 23:14:32] [INFO ] Transformed 9571 transitions.
[2024-05-31 23:14:32] [INFO ] Parsed PT model containing 6876 places and 9571 transitions and 35518 arcs in 585 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 23:14:33] [INFO ] Flow matrix only has 9299 transitions (discarded 272 similar events)
// Phase 1: matrix 9299 rows 6876 cols
[2024-05-31 23:14:33] [INFO ] Computed 649 invariants in 584 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[17, 51, 1, 51, 51, 17, 17, 1, 17, 51, 17, 17, 1, 1, 51, 51]
RANDOM walk for 10000 steps (120 resets) in 146 ms. (68 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 140011 steps (476 resets) in 675 ms. (207 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1] Max Struct:[17, 51, 1, 51, 51, 17, 17, 17, 51, 17, 17, 1, 51, 51]
[2024-05-31 23:14:34] [INFO ] Flow matrix only has 9299 transitions (discarded 272 similar events)
[2024-05-31 23:14:34] [INFO ] Invariant cache hit.
[2024-05-31 23:14:35] [INFO ] [Real]Absence check using 54 positive place invariants in 123 ms returned sat
[2024-05-31 23:14:35] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 175 ms returned unsat
[2024-05-31 23:14:36] [INFO ] [Real]Absence check using 54 positive place invariants in 112 ms returned sat
[2024-05-31 23:14:36] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 226 ms returned sat
[2024-05-31 23:14:40] [INFO ] [Real]Absence check using state equation in 3957 ms returned unknown
[2024-05-31 23:14:41] [INFO ] [Real]Absence check using 54 positive place invariants in 101 ms returned sat
[2024-05-31 23:14:41] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 220 ms returned sat
[2024-05-31 23:14:44] [INFO ] [Real]Absence check using state equation in 2586 ms returned sat
[2024-05-31 23:14:44] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-31 23:14:45] [INFO ] [Real]Added 2722 Read/Feed constraints in 197 ms returned sat
[2024-05-31 23:14:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:14:46] [INFO ] [Nat]Absence check using 54 positive place invariants in 104 ms returned sat
[2024-05-31 23:14:46] [INFO ] [Nat]Absence check using 54 positive and 595 generalized place invariants in 227 ms returned sat
[2024-05-31 23:14:49] [INFO ] [Nat]Absence check using state equation in 2647 ms returned sat
[2024-05-31 23:14:49] [INFO ] [Nat]Added 2722 Read/Feed constraints in 248 ms returned sat
[2024-05-31 23:14:58] [INFO ] Deduced a trap composed of 719 places in 9447 ms of which 321 ms to minimize.
[2024-05-31 23:14:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 23:14:59] [INFO ] [Real]Absence check using 54 positive place invariants in 157 ms returned sat
[2024-05-31 23:14:59] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 157 ms returned unsat
[2024-05-31 23:15:00] [INFO ] [Real]Absence check using 54 positive place invariants in 100 ms returned sat
[2024-05-31 23:15:00] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 175 ms returned unsat
[2024-05-31 23:15:01] [INFO ] [Real]Absence check using 54 positive place invariants in 101 ms returned sat
[2024-05-31 23:15:01] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 230 ms returned sat
[2024-05-31 23:15:05] [INFO ] [Real]Absence check using state equation in 3977 ms returned unknown
[2024-05-31 23:15:06] [INFO ] [Real]Absence check using 54 positive place invariants in 100 ms returned sat
[2024-05-31 23:15:06] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 167 ms returned unsat
[2024-05-31 23:15:07] [INFO ] [Real]Absence check using 54 positive place invariants in 99 ms returned sat
[2024-05-31 23:15:07] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 184 ms returned unsat
[2024-05-31 23:15:08] [INFO ] [Real]Absence check using 54 positive place invariants in 98 ms returned sat
[2024-05-31 23:15:08] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 216 ms returned sat
[2024-05-31 23:15:12] [INFO ] [Real]Absence check using state equation in 4007 ms returned unknown
[2024-05-31 23:15:13] [INFO ] [Real]Absence check using 54 positive place invariants in 98 ms returned sat
[2024-05-31 23:15:13] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 165 ms returned unsat
[2024-05-31 23:15:14] [INFO ] [Real]Absence check using 54 positive place invariants in 101 ms returned sat
[2024-05-31 23:15:14] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 169 ms returned unsat
[2024-05-31 23:15:15] [INFO ] [Real]Absence check using 54 positive place invariants in 97 ms returned sat
[2024-05-31 23:15:15] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 214 ms returned sat
[2024-05-31 23:15:18] [INFO ] [Real]Absence check using state equation in 2533 ms returned sat
[2024-05-31 23:15:18] [INFO ] [Real]Added 2722 Read/Feed constraints in 172 ms returned sat
[2024-05-31 23:15:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:15:19] [INFO ] [Nat]Absence check using 54 positive place invariants in 99 ms returned sat
[2024-05-31 23:15:19] [INFO ] [Nat]Absence check using 54 positive and 595 generalized place invariants in 216 ms returned sat
[2024-05-31 23:15:22] [INFO ] [Nat]Absence check using state equation in 2489 ms returned sat
[2024-05-31 23:15:22] [INFO ] [Nat]Added 2722 Read/Feed constraints in 198 ms returned sat
[2024-05-31 23:15:32] [INFO ] Deduced a trap composed of 86 places in 9493 ms of which 49 ms to minimize.
[2024-05-31 23:15:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.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)
[2024-05-31 23:15:33] [INFO ] [Real]Absence check using 54 positive place invariants in 98 ms returned sat
[2024-05-31 23:15:33] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 233 ms returned sat
[2024-05-31 23:15:37] [INFO ] [Real]Absence check using state equation in 4063 ms returned unknown
[2024-05-31 23:15:38] [INFO ] [Real]Absence check using 54 positive place invariants in 99 ms returned sat
[2024-05-31 23:15:38] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 170 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1] Max Struct:[1, 51, 1, 1, 1, 17, 1, 1, 51, 1, 1, 1, 51, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[51, 1, 17, 51, 1, 51]
Support contains 6 out of 6876 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6876/6876 places, 9571/9571 transitions.
Graph (complete) has 21033 edges and 6876 vertex of which 6840 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.24 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2172 transitions
Trivial Post-agglo rules discarded 2172 transitions
Performed 2172 trivial Post agglomeration. Transition count delta: 2172
Iterating post reduction 0 with 2172 rules applied. Total rules applied 2173 place count 6840 transition count 7399
Reduce places removed 2172 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 2175 rules applied. Total rules applied 4348 place count 4668 transition count 7396
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 4351 place count 4665 transition count 7396
Performed 272 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 272 Pre rules applied. Total rules applied 4351 place count 4665 transition count 7124
Deduced a syphon composed of 272 places in 6 ms
Reduce places removed 272 places and 0 transitions.
Iterating global reduction 3 with 544 rules applied. Total rules applied 4895 place count 4393 transition count 7124
Discarding 1900 places :
Symmetric choice reduction at 3 with 1900 rule applications. Total rules 6795 place count 2493 transition count 5224
Iterating global reduction 3 with 1900 rules applied. Total rules applied 8695 place count 2493 transition count 5224
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 8695 place count 2493 transition count 5212
Deduced a syphon composed of 12 places in 6 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 8719 place count 2481 transition count 5212
Discarding 234 places :
Symmetric choice reduction at 3 with 234 rule applications. Total rules 8953 place count 2247 transition count 3340
Iterating global reduction 3 with 234 rules applied. Total rules applied 9187 place count 2247 transition count 3340
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 9221 place count 2230 transition count 3323
Free-agglomeration rule (complex) applied 163 times.
Iterating global reduction 3 with 163 rules applied. Total rules applied 9384 place count 2230 transition count 4798
Reduce places removed 163 places and 0 transitions.
Iterating post reduction 3 with 163 rules applied. Total rules applied 9547 place count 2067 transition count 4798
Partial Free-agglomeration rule applied 68 times.
Drop transitions (Partial Free agglomeration) removed 68 transitions
Iterating global reduction 4 with 68 rules applied. Total rules applied 9615 place count 2067 transition count 4798
Applied a total of 9615 rules in 1822 ms. Remains 2067 /6876 variables (removed 4809) and now considering 4798/9571 (removed 4773) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1834 ms. Remains : 2067/6876 places, 4798/9571 transitions.
[2024-05-31 23:15:40] [INFO ] Flow matrix only has 4401 transitions (discarded 397 similar events)
// Phase 1: matrix 4401 rows 2067 cols
[2024-05-31 23:15:40] [INFO ] Computed 613 invariants in 83 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[2, 1, 1, 2, 1, 2]
RANDOM walk for 1000000 steps (20083 resets) in 19208 ms. (52 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000004 steps (19392 resets) in 22284 ms. (224 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 1] Max Struct:[2, 1, 2, 1, 2]
[2024-05-31 23:16:21] [INFO ] Flow matrix only has 4401 transitions (discarded 397 similar events)
[2024-05-31 23:16:21] [INFO ] Invariant cache hit.
[2024-05-31 23:16:22] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2024-05-31 23:16:22] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 92 ms returned sat
[2024-05-31 23:16:23] [INFO ] [Real]Absence check using state equation in 1231 ms returned sat
[2024-05-31 23:16:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:16:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 35 ms returned sat
[2024-05-31 23:16:23] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 97 ms returned sat
[2024-05-31 23:16:25] [INFO ] [Nat]Absence check using state equation in 1233 ms returned sat
[2024-05-31 23:16:25] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-31 23:16:26] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1093 ms returned sat
[2024-05-31 23:16:28] [INFO ] Deduced a trap composed of 224 places in 1739 ms of which 15 ms to minimize.
[2024-05-31 23:16:30] [INFO ] Deduced a trap composed of 379 places in 1652 ms of which 14 ms to minimize.
[2024-05-31 23:16:33] [INFO ] Deduced a trap composed of 376 places in 1788 ms of which 16 ms to minimize.
[2024-05-31 23:16:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 7362 ms
[2024-05-31 23:16:33] [INFO ] Computed and/alt/rep : 1683/4440/1683 causal constraints (skipped 2701 transitions) in 450 ms.
[2024-05-31 23:16:35] [INFO ] Added : 17 causal constraints over 4 iterations in 1772 ms. Result :sat
Minimization took 5060 ms.
[2024-05-31 23:16:40] [INFO ] [Real]Absence check using 33 positive place invariants in 44 ms returned sat
[2024-05-31 23:16:40] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 97 ms returned sat
[2024-05-31 23:16:42] [INFO ] [Real]Absence check using state equation in 1329 ms returned sat
[2024-05-31 23:16:42] [INFO ] [Real]Added 2722 Read/Feed constraints in 612 ms returned sat
[2024-05-31 23:16:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:16:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 39 ms returned sat
[2024-05-31 23:16:43] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 98 ms returned sat
[2024-05-31 23:16:44] [INFO ] [Nat]Absence check using state equation in 1317 ms returned sat
[2024-05-31 23:16:46] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2253 ms returned sat
[2024-05-31 23:16:48] [INFO ] Deduced a trap composed of 380 places in 1622 ms of which 13 ms to minimize.
[2024-05-31 23:16:50] [INFO ] Deduced a trap composed of 225 places in 1884 ms of which 14 ms to minimize.
[2024-05-31 23:16:52] [INFO ] Deduced a trap composed of 250 places in 1879 ms of which 14 ms to minimize.
[2024-05-31 23:16:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5912 ms
[2024-05-31 23:16:53] [INFO ] Computed and/alt/rep : 1683/4440/1683 causal constraints (skipped 2701 transitions) in 294 ms.
[2024-05-31 23:16:54] [INFO ] Added : 23 causal constraints over 5 iterations in 1639 ms. Result :sat
Minimization took 5092 ms.
[2024-05-31 23:16:59] [INFO ] [Real]Absence check using 33 positive place invariants in 38 ms returned sat
[2024-05-31 23:16:59] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 31 ms returned unsat
[2024-05-31 23:16:59] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2024-05-31 23:17:00] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 96 ms returned sat
[2024-05-31 23:17:01] [INFO ] [Real]Absence check using state equation in 1442 ms returned sat
[2024-05-31 23:17:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:17:01] [INFO ] [Nat]Absence check using 33 positive place invariants in 37 ms returned sat
[2024-05-31 23:17:01] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 98 ms returned sat
[2024-05-31 23:17:03] [INFO ] [Nat]Absence check using state equation in 1447 ms returned sat
[2024-05-31 23:17:05] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2367 ms returned sat
[2024-05-31 23:17:07] [INFO ] Deduced a trap composed of 401 places in 1659 ms of which 13 ms to minimize.
[2024-05-31 23:17:10] [INFO ] Deduced a trap composed of 445 places in 1760 ms of which 13 ms to minimize.
[2024-05-31 23:17:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4855 ms
[2024-05-31 23:17:10] [INFO ] Computed and/alt/rep : 1683/4440/1683 causal constraints (skipped 2701 transitions) in 317 ms.
[2024-05-31 23:17:12] [INFO ] Added : 23 causal constraints over 5 iterations in 1697 ms. Result :sat
Minimization took 5065 ms.
[2024-05-31 23:17:17] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2024-05-31 23:17:17] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 1] Max Struct:[2, 1, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
Support contains 3 out of 2067 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2067/2067 places, 4798/4798 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2067 transition count 4797
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2066 transition count 4797
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 2066 transition count 4794
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 8 place count 2063 transition count 4794
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 11 place count 2060 transition count 4791
Iterating global reduction 3 with 3 rules applied. Total rules applied 14 place count 2060 transition count 4791
Applied a total of 14 rules in 434 ms. Remains 2060 /2067 variables (removed 7) and now considering 4791/4798 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 434 ms. Remains : 2060/2067 places, 4791/4798 transitions.
[2024-05-31 23:17:18] [INFO ] Flow matrix only has 4394 transitions (discarded 397 similar events)
// Phase 1: matrix 4394 rows 2060 cols
[2024-05-31 23:17:18] [INFO ] Computed 613 invariants in 74 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
RANDOM walk for 1000000 steps (20078 resets) in 20380 ms. (49 steps per ms)
BEST_FIRST walk for 3000002 steps (11635 resets) in 14360 ms. (208 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
[2024-05-31 23:17:52] [INFO ] Flow matrix only has 4394 transitions (discarded 397 similar events)
[2024-05-31 23:17:52] [INFO ] Invariant cache hit.
[2024-05-31 23:17:53] [INFO ] [Real]Absence check using 33 positive place invariants in 39 ms returned sat
[2024-05-31 23:17:53] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 112 ms returned sat
[2024-05-31 23:17:54] [INFO ] [Real]Absence check using state equation in 1262 ms returned sat
[2024-05-31 23:17:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:17:54] [INFO ] [Nat]Absence check using 33 positive place invariants in 40 ms returned sat
[2024-05-31 23:17:55] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 108 ms returned sat
[2024-05-31 23:17:56] [INFO ] [Nat]Absence check using state equation in 1196 ms returned sat
[2024-05-31 23:17:56] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-31 23:17:57] [INFO ] [Nat]Added 2722 Read/Feed constraints in 883 ms returned sat
[2024-05-31 23:17:58] [INFO ] Deduced a trap composed of 222 places in 1704 ms of which 14 ms to minimize.
[2024-05-31 23:18:01] [INFO ] Deduced a trap composed of 369 places in 1715 ms of which 14 ms to minimize.
[2024-05-31 23:18:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 5288 ms
[2024-05-31 23:18:02] [INFO ] Computed and/alt/rep : 1679/4433/1679 causal constraints (skipped 2698 transitions) in 262 ms.
[2024-05-31 23:18:04] [INFO ] Added : 18 causal constraints over 4 iterations in 1573 ms. Result :sat
Minimization took 5265 ms.
[2024-05-31 23:18:09] [INFO ] [Real]Absence check using 33 positive place invariants in 38 ms returned sat
[2024-05-31 23:18:09] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 107 ms returned sat
[2024-05-31 23:18:10] [INFO ] [Real]Absence check using state equation in 1245 ms returned sat
[2024-05-31 23:18:11] [INFO ] [Real]Added 2722 Read/Feed constraints in 550 ms returned sat
[2024-05-31 23:18:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:18:11] [INFO ] [Nat]Absence check using 33 positive place invariants in 39 ms returned sat
[2024-05-31 23:18:11] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 90 ms returned sat
[2024-05-31 23:18:13] [INFO ] [Nat]Absence check using state equation in 1083 ms returned sat
[2024-05-31 23:18:14] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1478 ms returned sat
[2024-05-31 23:18:16] [INFO ] Deduced a trap composed of 392 places in 1683 ms of which 13 ms to minimize.
[2024-05-31 23:18:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1947 ms
[2024-05-31 23:18:16] [INFO ] Computed and/alt/rep : 1679/4433/1679 causal constraints (skipped 2698 transitions) in 277 ms.
[2024-05-31 23:18:18] [INFO ] Added : 23 causal constraints over 5 iterations in 1772 ms. Result :sat
Minimization took 5101 ms.
[2024-05-31 23:18:23] [INFO ] [Real]Absence check using 33 positive place invariants in 40 ms returned sat
[2024-05-31 23:18:23] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 101 ms returned sat
[2024-05-31 23:18:24] [INFO ] [Real]Absence check using state equation in 1187 ms returned sat
[2024-05-31 23:18:25] [INFO ] [Real]Added 2722 Read/Feed constraints in 282 ms returned sat
[2024-05-31 23:18:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:18:25] [INFO ] [Nat]Absence check using 33 positive place invariants in 38 ms returned sat
[2024-05-31 23:18:25] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 94 ms returned sat
[2024-05-31 23:18:26] [INFO ] [Nat]Absence check using state equation in 1140 ms returned sat
[2024-05-31 23:18:29] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2526 ms returned sat
[2024-05-31 23:18:31] [INFO ] Deduced a trap composed of 238 places in 1763 ms of which 14 ms to minimize.
[2024-05-31 23:18:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2008 ms
[2024-05-31 23:18:31] [INFO ] Computed and/alt/rep : 1679/4433/1679 causal constraints (skipped 2698 transitions) in 308 ms.
[2024-05-31 23:18:32] [INFO ] Added : 19 causal constraints over 4 iterations in 1398 ms. Result :sat
Minimization took 5034 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
Support contains 3 out of 2060 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2060/2060 places, 4791/4791 transitions.
Applied a total of 0 rules in 167 ms. Remains 2060 /2060 variables (removed 0) and now considering 4791/4791 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 2060/2060 places, 4791/4791 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2060/2060 places, 4791/4791 transitions.
Applied a total of 0 rules in 154 ms. Remains 2060 /2060 variables (removed 0) and now considering 4791/4791 (removed 0) transitions.
[2024-05-31 23:18:38] [INFO ] Flow matrix only has 4394 transitions (discarded 397 similar events)
[2024-05-31 23:18:38] [INFO ] Invariant cache hit.
[2024-05-31 23:18:42] [INFO ] Implicit Places using invariants in 4778 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 21, 27, 35, 45, 57, 71, 86, 100, 101, 102, 103, 104, 105, 106, 107, 108, 120, 130, 138, 144, 148, 150, 169, 175, 177, 178, 179, 180, 181, 182, 183, 184, 185, 187, 191, 197, 205, 215, 227, 240, 252, 253, 254, 255, 256, 257, 258, 259, 260, 270, 278, 284, 288, 290, 292, 311, 317, 319, 320, 321, 322, 323, 324, 325, 327, 330, 332, 336, 342, 350, 360, 371, 381, 382, 383, 384, 385, 386, 387, 388, 389, 397, 403, 407, 409, 411, 413, 432, 438, 440, 441, 442, 443, 444, 445, 446, 447, 448, 450, 452, 454, 458, 464, 472, 481, 489, 490, 491, 492, 493, 494, 495, 496, 497, 503, 507, 509, 511, 513, 515, 534, 540, 542, 543, 544, 545, 546, 547, 548, 549, 550, 552, 554, 556, 558, 562, 568, 575, 581, 582, 583, 584, 585, 586, 587, 588, 589, 593, 595, 597, 599, 601, 603, 622, 628, 630, 631, 632, 633, 634, 635, 636, 637, 638, 640, 642, 644, 646, 648, 652, 657, 661, 662, 663, 664, 665, 666, 667, 668, 669, 671, 673, 675, 677, 679, 681, 700, 706, 708, 709, 710, 711, 712, 713, 714, 715, 716, 718, 720, 722, 724, 726, 728, 731, 733, 734, 735, 736, 737, 738, 739, 740, 741, 743, 745, 747, 749, 751, 753, 772, 778, 780, 781, 782, 783, 784, 785, 786, 787, 788, 790, 792, 794, 796, 798, 800, 802, 804, 805, 806, 807, 808, 809, 810, 811, 812, 814, 816, 818, 820, 822, 824, 843, 845, 848, 850, 851, 852, 853, 854, 855, 856, 857, 858, 860, 862, 864, 866, 868, 870, 872, 874, 875, 876, 877, 878, 879, 880, 881, 882, 884, 886, 888, 890, 892, 894, 913, 919, 921, 922, 923, 924, 925, 926, 927, 928, 929, 931, 933, 935, 937, 939, 941, 943, 945, 946, 947, 948, 949, 950, 951, 952, 953, 955, 957, 959, 961, 963, 965, 984, 990, 992, 993, 994, 995, 996, 997, 998, 999, 1000, 1002, 1004, 1006, 1008, 1010, 1012, 1014, 1017, 1018, 1019, 1020, 1021, 1022, 1023, 1024, 1025, 1027, 1029, 1031, 1033, 1035, 1037, 1056, 1062, 1064, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1072, 1074, 1076, 1078, 1080, 1082, 1084, 1088, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1105, 1107, 1109, 1111, 1113, 1115, 1134, 1140, 1142, 1143, 1144, 1145, 1146, 1147, 1148, 1149, 1150, 1152, 1154, 1156, 1158, 1160, 1164, 1170, 1177, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1191, 1195, 1197, 1199, 1201, 1203, 1222, 1228, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1240, 1242, 1244, 1246, 1250, 1256, 1264, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1281, 1289, 1295, 1299, 1302, 1304, 1306, 1325, 1331, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1341, 1343, 1345, 1347, 1351, 1357, 1365, 1375, 1386, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1394, 1404, 1412, 1418, 1422, 1424, 1426, 1445, 1451, 1453, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1461, 1463, 1465, 1469, 1475, 1483, 1493, 1505, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1538, 1548, 1556, 1562, 1566, 1568, 1587, 1589, 1592, 1594, 1595, 1596, 1597, 1598, 1599, 1600, 1601, 1602, 1604, 1608, 1614, 1622, 1632, 1644, 1658, 1673, 1674, 1675, 1676, 1677, 1678, 1679, 1680, 1681, 1695, 1707, 1717, 1725, 1731, 1735, 1754]
[2024-05-31 23:18:42] [INFO ] Actually due to overlaps returned [169, 311, 432, 534, 622, 700, 772, 843, 913, 984, 1056, 1134, 1222, 1325, 1445, 1587, 1754, 4, 9, 10, 11, 12, 13, 14, 15, 16, 100, 101, 102, 103, 104, 105, 106, 107, 177, 178, 179, 180, 181, 182, 183, 184, 252, 253, 254, 255, 256, 257, 258, 259, 319, 320, 321, 322, 323, 324, 325, 381, 382, 383, 384, 385, 386, 387, 388, 440, 441, 442, 443, 444, 445, 446, 447, 489, 490, 491, 492, 493, 494, 495, 496, 542, 543, 544, 545, 546, 547, 548, 549, 581, 582, 583, 584, 585, 586, 587, 588, 630, 631, 632, 633, 634, 635, 636, 637, 661, 662, 663, 664, 665, 666, 667, 668, 708, 709, 710, 711, 712, 713, 714, 715, 733, 734, 735, 736, 737, 738, 739, 740, 780, 781, 782, 783, 784, 785, 786, 787, 804, 805, 806, 807, 808, 809, 810, 811, 845, 850, 851, 852, 853, 854, 855, 856, 857, 874, 875, 876, 877, 878, 879, 880, 881, 921, 922, 923, 924, 925, 926, 927, 928, 945, 946, 947, 948, 949, 950, 951, 952, 992, 993, 994, 995, 996, 997, 998, 999, 1017, 1018, 1019, 1020, 1021, 1022, 1023, 1024, 1064, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1142, 1143, 1144, 1145, 1146, 1147, 1148, 1149, 1177, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1386, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1453, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1589, 1594, 1595, 1596, 1597, 1598, 1599, 1600, 1601, 1673, 1674, 1675, 1676, 1677, 1678, 1679, 1680]
Discarding 291 places :
Implicit Place search using SMT only with invariants took 4793 ms to find 291 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1769/2060 places, 4791/4791 transitions.
Discarding 255 places :
Symmetric choice reduction at 0 with 255 rule applications. Total rules 255 place count 1514 transition count 4536
Iterating global reduction 0 with 255 rules applied. Total rules applied 510 place count 1514 transition count 4536
Discarding 255 places :
Symmetric choice reduction at 0 with 255 rule applications. Total rules 765 place count 1259 transition count 4281
Iterating global reduction 0 with 255 rules applied. Total rules applied 1020 place count 1259 transition count 4281
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 1023 place count 1259 transition count 4278
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 1026 place count 1256 transition count 4278
Applied a total of 1026 rules in 338 ms. Remains 1256 /1769 variables (removed 513) and now considering 4278/4791 (removed 513) transitions.
[2024-05-31 23:18:43] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
// Phase 1: matrix 3881 rows 1256 cols
[2024-05-31 23:18:43] [INFO ] Computed 322 invariants in 36 ms
[2024-05-31 23:18:45] [INFO ] Implicit Places using invariants in 2520 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 77, 91, 103, 113, 121, 127, 131, 133, 156, 158, 160, 164, 170, 178, 188, 200, 213, 225, 235, 243, 249, 253, 255, 257, 265, 268, 271, 273, 277, 283, 291, 301, 312, 322, 330, 336, 340, 342, 344, 346, 355, 357, 359, 361, 363, 367, 373, 381, 390, 398, 404, 408, 410, 412, 414, 416, 424, 426, 428, 430, 432, 434, 438, 444, 451, 457, 461, 463, 465, 467, 469, 471, 479, 481, 483, 485, 487, 489, 491, 495, 500, 504, 506, 508, 510, 512, 514, 516, 524, 526, 528, 530, 532, 534, 536, 538, 541, 543, 545, 547, 549, 551, 553, 555, 563, 565, 567, 569, 571, 573, 575, 577, 579, 581, 583, 585, 587, 589, 591, 593, 599, 601, 603, 605, 607, 609, 611, 613, 615, 617, 619, 621, 623, 625, 627, 629, 636, 638, 640, 642, 644, 646, 648, 650, 652, 654, 656, 658, 660, 662, 664, 666, 674, 676, 678, 680, 682, 684, 686, 688, 690, 693, 695, 697, 699, 701, 703, 705, 713, 715, 717, 719, 721, 723, 725, 727, 731, 736, 740, 742, 744, 746, 748, 750, 758, 760, 762, 764, 766, 768, 770, 774, 780, 787, 793, 797, 799, 801, 803, 805, 813, 815, 817, 819, 821, 823, 827, 833, 841, 850, 858, 864, 868, 871, 873, 875, 883, 885, 887, 889, 891, 895, 901, 909, 919, 930, 940, 948, 954, 958, 960, 962, 970, 972, 974, 976, 980, 986, 994, 1004, 1016, 1029, 1041, 1051, 1059, 1065, 1069, 1071, 1077, 1079, 1081, 1085, 1091, 1099, 1109, 1121, 1135, 1150, 1164, 1176, 1186, 1194, 1200, 1204]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 2531 ms to find 272 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 984/2060 places, 4278/4791 transitions.
Applied a total of 0 rules in 112 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 7934 ms. Remains : 984/2060 places, 4278/4791 transitions.
[2024-05-31 23:18:45] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
// Phase 1: matrix 3881 rows 984 cols
[2024-05-31 23:18:45] [INFO ] Computed 50 invariants in 39 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
RANDOM walk for 1000000 steps (21034 resets) in 18994 ms. (52 steps per ms)
BEST_FIRST walk for 3000003 steps (9053 resets) in 10390 ms. (288 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
[2024-05-31 23:19:15] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-31 23:19:15] [INFO ] Invariant cache hit.
[2024-05-31 23:19:15] [INFO ] [Real]Absence check using 31 positive place invariants in 25 ms returned sat
[2024-05-31 23:19:15] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 7 ms returned sat
[2024-05-31 23:19:16] [INFO ] [Real]Absence check using state equation in 834 ms returned sat
[2024-05-31 23:19:16] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-31 23:19:16] [INFO ] [Real]Added 2722 Read/Feed constraints in 251 ms returned sat
[2024-05-31 23:19:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:19:16] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-31 23:19:16] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 7 ms returned sat
[2024-05-31 23:19:17] [INFO ] [Nat]Absence check using state equation in 895 ms returned sat
[2024-05-31 23:19:18] [INFO ] [Nat]Added 2722 Read/Feed constraints in 626 ms returned sat
[2024-05-31 23:19:19] [INFO ] Deduced a trap composed of 171 places in 502 ms of which 6 ms to minimize.
[2024-05-31 23:19:20] [INFO ] Deduced a trap composed of 174 places in 529 ms of which 6 ms to minimize.
[2024-05-31 23:19:20] [INFO ] Deduced a trap composed of 185 places in 542 ms of which 6 ms to minimize.
[2024-05-31 23:19:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2584 ms
[2024-05-31 23:19:21] [INFO ] Computed and/alt/rep : 1344/1952/1344 causal constraints (skipped 2475 transitions) in 260 ms.
[2024-05-31 23:19:21] [INFO ] Added : 15 causal constraints over 3 iterations in 861 ms. Result :sat
Minimization took 5171 ms.
[2024-05-31 23:19:27] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-31 23:19:27] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-31 23:19:28] [INFO ] [Real]Absence check using state equation in 777 ms returned sat
[2024-05-31 23:19:28] [INFO ] [Real]Added 2722 Read/Feed constraints in 282 ms returned sat
[2024-05-31 23:19:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:19:28] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-31 23:19:28] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-31 23:19:29] [INFO ] [Nat]Absence check using state equation in 814 ms returned sat
[2024-05-31 23:19:30] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1340 ms returned sat
[2024-05-31 23:19:31] [INFO ] Deduced a trap composed of 197 places in 512 ms of which 5 ms to minimize.
[2024-05-31 23:19:32] [INFO ] Deduced a trap composed of 69 places in 589 ms of which 5 ms to minimize.
[2024-05-31 23:19:32] [INFO ] Deduced a trap composed of 80 places in 638 ms of which 6 ms to minimize.
[2024-05-31 23:19:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2127 ms
[2024-05-31 23:19:33] [INFO ] Computed and/alt/rep : 1344/1952/1344 causal constraints (skipped 2475 transitions) in 248 ms.
[2024-05-31 23:19:34] [INFO ] Added : 21 causal constraints over 5 iterations in 1151 ms. Result :sat
Minimization took 6886 ms.
[2024-05-31 23:19:41] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-31 23:19:41] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-31 23:19:41] [INFO ] [Real]Absence check using state equation in 851 ms returned sat
[2024-05-31 23:19:42] [INFO ] [Real]Added 2722 Read/Feed constraints in 249 ms returned sat
[2024-05-31 23:19:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:19:42] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-31 23:19:42] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 20 ms returned sat
[2024-05-31 23:19:43] [INFO ] [Nat]Absence check using state equation in 846 ms returned sat
[2024-05-31 23:19:44] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1110 ms returned sat
[2024-05-31 23:19:44] [INFO ] Deduced a trap composed of 164 places in 489 ms of which 6 ms to minimize.
[2024-05-31 23:19:45] [INFO ] Deduced a trap composed of 83 places in 640 ms of which 6 ms to minimize.
[2024-05-31 23:19:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1420 ms
[2024-05-31 23:19:46] [INFO ] Computed and/alt/rep : 1344/1952/1344 causal constraints (skipped 2475 transitions) in 226 ms.
[2024-05-31 23:19:46] [INFO ] Added : 13 causal constraints over 4 iterations in 1041 ms. Result :sat
Minimization took 6890 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
Support contains 3 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Applied a total of 0 rules in 125 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 984/984 places, 4278/4278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Applied a total of 0 rules in 116 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
[2024-05-31 23:19:54] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-31 23:19:54] [INFO ] Invariant cache hit.
[2024-05-31 23:19:55] [INFO ] Implicit Places using invariants in 1249 ms returned []
[2024-05-31 23:19:55] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-31 23:19:55] [INFO ] Invariant cache hit.
[2024-05-31 23:19:56] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-31 23:20:26] [INFO ] Performed 718/984 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:20:36] [INFO ] Implicit Places using invariants and state equation in 40956 ms returned []
Implicit Place search using SMT with State Equation took 42219 ms to find 0 implicit places.
[2024-05-31 23:20:36] [INFO ] Redundant transitions in 262 ms returned []
Running 4216 sub problems to find dead transitions.
[2024-05-31 23:20:36] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-31 23:20:36] [INFO ] Invariant cache hit.
[2024-05-31 23:20:36] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/982 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4216 unsolved
SMT process timed out in 56677ms, After SMT, problems are : Problem set: 0 solved, 4216 unsolved
Search for dead transitions found 0 dead transitions in 56738ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99383 ms. Remains : 984/984 places, 4278/4278 transitions.
RANDOM walk for 40000 steps (840 resets) in 1392 ms. (28 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (118 resets) in 312 ms. (127 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (119 resets) in 402 ms. (99 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (118 resets) in 373 ms. (106 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (118 resets) in 284 ms. (140 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (119 resets) in 286 ms. (139 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (118 resets) in 308 ms. (129 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 58512 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 6
Probabilistic random walk after 58512 steps, saw 24700 distinct states, run finished after 3004 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-31 23:21:37] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-31 23:21:37] [INFO ] Invariant cache hit.
[2024-05-31 23:21:37] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 884/887 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/905 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 23:21:38] [INFO ] Deduced a trap composed of 100 places in 550 ms of which 6 ms to minimize.
[2024-05-31 23:21:38] [INFO ] Deduced a trap composed of 90 places in 611 ms of which 6 ms to minimize.
[2024-05-31 23:21:39] [INFO ] Deduced a trap composed of 232 places in 619 ms of which 5 ms to minimize.
[2024-05-31 23:21:40] [INFO ] Deduced a trap composed of 83 places in 605 ms of which 6 ms to minimize.
[2024-05-31 23:21:40] [INFO ] Deduced a trap composed of 221 places in 601 ms of which 6 ms to minimize.
[2024-05-31 23:21:41] [INFO ] Deduced a trap composed of 132 places in 595 ms of which 5 ms to minimize.
[2024-05-31 23:21:42] [INFO ] Deduced a trap composed of 83 places in 598 ms of which 6 ms to minimize.
[2024-05-31 23:21:42] [INFO ] Deduced a trap composed of 84 places in 586 ms of which 6 ms to minimize.
SMT process timed out in 5359ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Applied a total of 0 rules in 114 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 984/984 places, 4278/4278 transitions.
RANDOM walk for 40000 steps (840 resets) in 1828 ms. (21 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (119 resets) in 305 ms. (130 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (120 resets) in 335 ms. (119 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (119 resets) in 360 ms. (110 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (120 resets) in 291 ms. (137 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (119 resets) in 316 ms. (126 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (119 resets) in 320 ms. (124 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 57645 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 6
Probabilistic random walk after 57645 steps, saw 24337 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-31 23:21:47] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-31 23:21:47] [INFO ] Invariant cache hit.
[2024-05-31 23:21:47] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 884/887 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/905 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 23:21:48] [INFO ] Deduced a trap composed of 100 places in 625 ms of which 5 ms to minimize.
[2024-05-31 23:21:48] [INFO ] Deduced a trap composed of 90 places in 595 ms of which 5 ms to minimize.
[2024-05-31 23:21:49] [INFO ] Deduced a trap composed of 232 places in 558 ms of which 5 ms to minimize.
[2024-05-31 23:21:49] [INFO ] Deduced a trap composed of 83 places in 554 ms of which 6 ms to minimize.
[2024-05-31 23:21:50] [INFO ] Deduced a trap composed of 221 places in 610 ms of which 7 ms to minimize.
[2024-05-31 23:21:51] [INFO ] Deduced a trap composed of 132 places in 561 ms of which 6 ms to minimize.
[2024-05-31 23:21:51] [INFO ] Deduced a trap composed of 83 places in 578 ms of which 6 ms to minimize.
[2024-05-31 23:21:52] [INFO ] Deduced a trap composed of 84 places in 548 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/905 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem MAX0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 35/940 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/940 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 28/968 variables, 28/42 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/968 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 16/984 variables, 16/58 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/984 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 3881/4865 variables, 984/1042 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4865 variables, 2722/3764 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4865 variables, 0/3764 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/4865 variables, 0/3764 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4865/4865 variables, and 3764 constraints, problems are : Problem set: 1 solved, 5 unsolved in 7883 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 984/984 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 884/887 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/905 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-31 23:21:55] [INFO ] Deduced a trap composed of 257 places in 586 ms of which 6 ms to minimize.
[2024-05-31 23:21:56] [INFO ] Deduced a trap composed of 90 places in 590 ms of which 5 ms to minimize.
[2024-05-31 23:21:57] [INFO ] Deduced a trap composed of 115 places in 603 ms of which 6 ms to minimize.
[2024-05-31 23:21:57] [INFO ] Deduced a trap composed of 84 places in 581 ms of which 5 ms to minimize.
[2024-05-31 23:21:58] [INFO ] Deduced a trap composed of 224 places in 560 ms of which 6 ms to minimize.
[2024-05-31 23:21:58] [INFO ] Deduced a trap composed of 83 places in 621 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/905 variables, 6/17 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 35/940 variables, 3/20 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-31 23:21:59] [INFO ] Deduced a trap composed of 5 places in 599 ms of which 6 ms to minimize.
[2024-05-31 23:22:00] [INFO ] Deduced a trap composed of 74 places in 655 ms of which 6 ms to minimize.
[2024-05-31 23:22:01] [INFO ] Deduced a trap composed of 68 places in 669 ms of which 6 ms to minimize.
[2024-05-31 23:22:01] [INFO ] Deduced a trap composed of 62 places in 635 ms of which 6 ms to minimize.
[2024-05-31 23:22:02] [INFO ] Deduced a trap composed of 64 places in 595 ms of which 5 ms to minimize.
[2024-05-31 23:22:02] [INFO ] Deduced a trap composed of 67 places in 593 ms of which 6 ms to minimize.
[2024-05-31 23:22:03] [INFO ] Deduced a trap composed of 93 places in 601 ms of which 6 ms to minimize.
[2024-05-31 23:22:04] [INFO ] Deduced a trap composed of 60 places in 640 ms of which 6 ms to minimize.
[2024-05-31 23:22:04] [INFO ] Deduced a trap composed of 57 places in 614 ms of which 6 ms to minimize.
[2024-05-31 23:22:05] [INFO ] Deduced a trap composed of 61 places in 602 ms of which 5 ms to minimize.
[2024-05-31 23:22:06] [INFO ] Deduced a trap composed of 76 places in 577 ms of which 5 ms to minimize.
[2024-05-31 23:22:06] [INFO ] Deduced a trap composed of 61 places in 602 ms of which 6 ms to minimize.
[2024-05-31 23:22:07] [INFO ] Deduced a trap composed of 73 places in 583 ms of which 6 ms to minimize.
[2024-05-31 23:22:07] [INFO ] Deduced a trap composed of 70 places in 566 ms of which 6 ms to minimize.
[2024-05-31 23:22:08] [INFO ] Deduced a trap composed of 78 places in 614 ms of which 6 ms to minimize.
[2024-05-31 23:22:09] [INFO ] Deduced a trap composed of 76 places in 594 ms of which 6 ms to minimize.
[2024-05-31 23:22:09] [INFO ] Deduced a trap composed of 153 places in 629 ms of which 6 ms to minimize.
[2024-05-31 23:22:10] [INFO ] Deduced a trap composed of 65 places in 638 ms of which 6 ms to minimize.
[2024-05-31 23:22:11] [INFO ] Deduced a trap composed of 59 places in 618 ms of which 6 ms to minimize.
[2024-05-31 23:22:11] [INFO ] Deduced a trap composed of 27 places in 615 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/940 variables, 20/40 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-31 23:22:12] [INFO ] Deduced a trap composed of 60 places in 634 ms of which 6 ms to minimize.
[2024-05-31 23:22:12] [INFO ] Deduced a trap composed of 81 places in 585 ms of which 6 ms to minimize.
[2024-05-31 23:22:13] [INFO ] Deduced a trap composed of 74 places in 636 ms of which 6 ms to minimize.
[2024-05-31 23:22:14] [INFO ] Deduced a trap composed of 77 places in 612 ms of which 6 ms to minimize.
[2024-05-31 23:22:14] [INFO ] Deduced a trap composed of 62 places in 592 ms of which 6 ms to minimize.
[2024-05-31 23:22:15] [INFO ] Deduced a trap composed of 61 places in 639 ms of which 6 ms to minimize.
[2024-05-31 23:22:16] [INFO ] Deduced a trap composed of 65 places in 652 ms of which 6 ms to minimize.
[2024-05-31 23:22:16] [INFO ] Deduced a trap composed of 59 places in 656 ms of which 6 ms to minimize.
[2024-05-31 23:22:17] [INFO ] Deduced a trap composed of 53 places in 646 ms of which 6 ms to minimize.
[2024-05-31 23:22:18] [INFO ] Deduced a trap composed of 57 places in 656 ms of which 6 ms to minimize.
[2024-05-31 23:22:18] [INFO ] Deduced a trap composed of 59 places in 646 ms of which 6 ms to minimize.
[2024-05-31 23:22:19] [INFO ] Deduced a trap composed of 59 places in 647 ms of which 6 ms to minimize.
[2024-05-31 23:22:20] [INFO ] Deduced a trap composed of 64 places in 622 ms of which 6 ms to minimize.
[2024-05-31 23:22:20] [INFO ] Deduced a trap composed of 59 places in 642 ms of which 6 ms to minimize.
[2024-05-31 23:22:21] [INFO ] Deduced a trap composed of 69 places in 576 ms of which 6 ms to minimize.
[2024-05-31 23:22:22] [INFO ] Deduced a trap composed of 83 places in 579 ms of which 5 ms to minimize.
[2024-05-31 23:22:22] [INFO ] Deduced a trap composed of 56 places in 617 ms of which 6 ms to minimize.
[2024-05-31 23:22:23] [INFO ] Deduced a trap composed of 59 places in 589 ms of which 6 ms to minimize.
[2024-05-31 23:22:23] [INFO ] Deduced a trap composed of 67 places in 630 ms of which 6 ms to minimize.
[2024-05-31 23:22:24] [INFO ] Deduced a trap composed of 56 places in 628 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/940 variables, 20/60 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-31 23:22:25] [INFO ] Deduced a trap composed of 159 places in 605 ms of which 6 ms to minimize.
[2024-05-31 23:22:25] [INFO ] Deduced a trap composed of 67 places in 563 ms of which 6 ms to minimize.
[2024-05-31 23:22:26] [INFO ] Deduced a trap composed of 64 places in 573 ms of which 5 ms to minimize.
[2024-05-31 23:22:27] [INFO ] Deduced a trap composed of 58 places in 646 ms of which 6 ms to minimize.
[2024-05-31 23:22:27] [INFO ] Deduced a trap composed of 78 places in 624 ms of which 6 ms to minimize.
[2024-05-31 23:22:28] [INFO ] Deduced a trap composed of 84 places in 607 ms of which 6 ms to minimize.
[2024-05-31 23:22:28] [INFO ] Deduced a trap composed of 92 places in 614 ms of which 6 ms to minimize.
[2024-05-31 23:22:29] [INFO ] Deduced a trap composed of 59 places in 602 ms of which 5 ms to minimize.
[2024-05-31 23:22:30] [INFO ] Deduced a trap composed of 59 places in 629 ms of which 6 ms to minimize.
[2024-05-31 23:22:30] [INFO ] Deduced a trap composed of 58 places in 626 ms of which 6 ms to minimize.
[2024-05-31 23:22:31] [INFO ] Deduced a trap composed of 70 places in 570 ms of which 6 ms to minimize.
[2024-05-31 23:22:32] [INFO ] Deduced a trap composed of 75 places in 558 ms of which 5 ms to minimize.
[2024-05-31 23:22:32] [INFO ] Deduced a trap composed of 135 places in 628 ms of which 6 ms to minimize.
[2024-05-31 23:22:33] [INFO ] Deduced a trap composed of 27 places in 531 ms of which 5 ms to minimize.
[2024-05-31 23:22:33] [INFO ] Deduced a trap composed of 136 places in 523 ms of which 6 ms to minimize.
[2024-05-31 23:22:34] [INFO ] Deduced a trap composed of 46 places in 620 ms of which 6 ms to minimize.
[2024-05-31 23:22:34] [INFO ] Deduced a trap composed of 129 places in 528 ms of which 6 ms to minimize.
[2024-05-31 23:22:35] [INFO ] Deduced a trap composed of 128 places in 539 ms of which 6 ms to minimize.
[2024-05-31 23:22:36] [INFO ] Deduced a trap composed of 46 places in 523 ms of which 6 ms to minimize.
[2024-05-31 23:22:36] [INFO ] Deduced a trap composed of 63 places in 519 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/940 variables, 20/80 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-31 23:22:37] [INFO ] Deduced a trap composed of 74 places in 621 ms of which 6 ms to minimize.
[2024-05-31 23:22:37] [INFO ] Deduced a trap composed of 69 places in 634 ms of which 6 ms to minimize.
[2024-05-31 23:22:38] [INFO ] Deduced a trap composed of 91 places in 601 ms of which 6 ms to minimize.
[2024-05-31 23:22:39] [INFO ] Deduced a trap composed of 110 places in 613 ms of which 6 ms to minimize.
[2024-05-31 23:22:39] [INFO ] Deduced a trap composed of 83 places in 649 ms of which 6 ms to minimize.
[2024-05-31 23:22:40] [INFO ] Deduced a trap composed of 76 places in 636 ms of which 6 ms to minimize.
SMT process timed out in 53540ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Applied a total of 0 rules in 117 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 984/984 places, 4278/4278 transitions.
RANDOM walk for 40000 steps (840 resets) in 2047 ms. (19 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (118 resets) in 324 ms. (123 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (119 resets) in 257 ms. (155 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (119 resets) in 318 ms. (125 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (117 resets) in 346 ms. (115 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (119 resets) in 286 ms. (139 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 59152 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 5
Probabilistic random walk after 59152 steps, saw 24968 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-31 23:22:44] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-31 23:22:44] [INFO ] Invariant cache hit.
[2024-05-31 23:22:44] [INFO ] State equation strengthened by 2722 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 884/887 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/905 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/940 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:22:46] [INFO ] Deduced a trap composed of 78 places in 655 ms of which 6 ms to minimize.
[2024-05-31 23:22:46] [INFO ] Deduced a trap composed of 80 places in 652 ms of which 5 ms to minimize.
[2024-05-31 23:22:47] [INFO ] Deduced a trap composed of 76 places in 634 ms of which 6 ms to minimize.
[2024-05-31 23:22:47] [INFO ] Deduced a trap composed of 82 places in 611 ms of which 6 ms to minimize.
[2024-05-31 23:22:48] [INFO ] Deduced a trap composed of 82 places in 662 ms of which 5 ms to minimize.
[2024-05-31 23:22:49] [INFO ] Deduced a trap composed of 5 places in 620 ms of which 6 ms to minimize.
[2024-05-31 23:22:49] [INFO ] Deduced a trap composed of 46 places in 618 ms of which 6 ms to minimize.
[2024-05-31 23:22:50] [INFO ] Deduced a trap composed of 46 places in 606 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/940 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/940 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 28/968 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/968 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 16/984 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/984 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 3881/4865 variables, 984/1042 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4865 variables, 2722/3764 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4865 variables, 0/3764 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/4865 variables, 0/3764 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4865/4865 variables, and 3764 constraints, problems are : Problem set: 0 solved, 5 unsolved in 8354 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 984/984 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 884/887 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/905 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:22:54] [INFO ] Deduced a trap composed of 257 places in 572 ms of which 6 ms to minimize.
[2024-05-31 23:22:54] [INFO ] Deduced a trap composed of 132 places in 621 ms of which 5 ms to minimize.
[2024-05-31 23:22:55] [INFO ] Deduced a trap composed of 83 places in 581 ms of which 5 ms to minimize.
[2024-05-31 23:22:55] [INFO ] Deduced a trap composed of 224 places in 580 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/905 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 35/940 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/940 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:22:56] [INFO ] Deduced a trap composed of 64 places in 592 ms of which 6 ms to minimize.
[2024-05-31 23:22:57] [INFO ] Deduced a trap composed of 83 places in 649 ms of which 10 ms to minimize.
[2024-05-31 23:22:58] [INFO ] Deduced a trap composed of 76 places in 651 ms of which 6 ms to minimize.
[2024-05-31 23:22:58] [INFO ] Deduced a trap composed of 74 places in 610 ms of which 6 ms to minimize.
[2024-05-31 23:22:59] [INFO ] Deduced a trap composed of 27 places in 606 ms of which 6 ms to minimize.
[2024-05-31 23:22:59] [INFO ] Deduced a trap composed of 71 places in 599 ms of which 6 ms to minimize.
[2024-05-31 23:23:00] [INFO ] Deduced a trap composed of 79 places in 625 ms of which 6 ms to minimize.
[2024-05-31 23:23:01] [INFO ] Deduced a trap composed of 76 places in 642 ms of which 5 ms to minimize.
[2024-05-31 23:23:01] [INFO ] Deduced a trap composed of 72 places in 607 ms of which 5 ms to minimize.
[2024-05-31 23:23:02] [INFO ] Deduced a trap composed of 82 places in 595 ms of which 6 ms to minimize.
[2024-05-31 23:23:03] [INFO ] Deduced a trap composed of 95 places in 613 ms of which 5 ms to minimize.
[2024-05-31 23:23:03] [INFO ] Deduced a trap composed of 46 places in 619 ms of which 6 ms to minimize.
[2024-05-31 23:23:04] [INFO ] Deduced a trap composed of 73 places in 619 ms of which 6 ms to minimize.
[2024-05-31 23:23:05] [INFO ] Deduced a trap composed of 89 places in 608 ms of which 6 ms to minimize.
[2024-05-31 23:23:05] [INFO ] Deduced a trap composed of 84 places in 615 ms of which 6 ms to minimize.
[2024-05-31 23:23:06] [INFO ] Deduced a trap composed of 88 places in 614 ms of which 6 ms to minimize.
[2024-05-31 23:23:06] [INFO ] Deduced a trap composed of 86 places in 598 ms of which 5 ms to minimize.
[2024-05-31 23:23:07] [INFO ] Deduced a trap composed of 86 places in 607 ms of which 5 ms to minimize.
[2024-05-31 23:23:08] [INFO ] Deduced a trap composed of 75 places in 593 ms of which 5 ms to minimize.
[2024-05-31 23:23:08] [INFO ] Deduced a trap composed of 78 places in 596 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/940 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:23:09] [INFO ] Deduced a trap composed of 173 places in 617 ms of which 6 ms to minimize.
[2024-05-31 23:23:10] [INFO ] Deduced a trap composed of 63 places in 599 ms of which 5 ms to minimize.
[2024-05-31 23:23:10] [INFO ] Deduced a trap composed of 76 places in 635 ms of which 6 ms to minimize.
[2024-05-31 23:23:11] [INFO ] Deduced a trap composed of 79 places in 586 ms of which 5 ms to minimize.
[2024-05-31 23:23:11] [INFO ] Deduced a trap composed of 76 places in 576 ms of which 5 ms to minimize.
[2024-05-31 23:23:12] [INFO ] Deduced a trap composed of 87 places in 587 ms of which 5 ms to minimize.
[2024-05-31 23:23:13] [INFO ] Deduced a trap composed of 84 places in 593 ms of which 5 ms to minimize.
[2024-05-31 23:23:13] [INFO ] Deduced a trap composed of 143 places in 582 ms of which 5 ms to minimize.
[2024-05-31 23:23:14] [INFO ] Deduced a trap composed of 137 places in 614 ms of which 5 ms to minimize.
[2024-05-31 23:23:14] [INFO ] Deduced a trap composed of 163 places in 602 ms of which 6 ms to minimize.
[2024-05-31 23:23:15] [INFO ] Deduced a trap composed of 84 places in 622 ms of which 6 ms to minimize.
[2024-05-31 23:23:16] [INFO ] Deduced a trap composed of 82 places in 647 ms of which 5 ms to minimize.
[2024-05-31 23:23:16] [INFO ] Deduced a trap composed of 88 places in 652 ms of which 6 ms to minimize.
[2024-05-31 23:23:17] [INFO ] Deduced a trap composed of 65 places in 668 ms of which 6 ms to minimize.
[2024-05-31 23:23:18] [INFO ] Deduced a trap composed of 78 places in 667 ms of which 6 ms to minimize.
[2024-05-31 23:23:19] [INFO ] Deduced a trap composed of 63 places in 692 ms of which 6 ms to minimize.
[2024-05-31 23:23:19] [INFO ] Deduced a trap composed of 76 places in 619 ms of which 6 ms to minimize.
[2024-05-31 23:23:20] [INFO ] Deduced a trap composed of 76 places in 632 ms of which 6 ms to minimize.
[2024-05-31 23:23:20] [INFO ] Deduced a trap composed of 83 places in 621 ms of which 6 ms to minimize.
[2024-05-31 23:23:21] [INFO ] Deduced a trap composed of 75 places in 647 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/940 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:23:22] [INFO ] Deduced a trap composed of 64 places in 646 ms of which 6 ms to minimize.
[2024-05-31 23:23:23] [INFO ] Deduced a trap composed of 72 places in 644 ms of which 7 ms to minimize.
[2024-05-31 23:23:23] [INFO ] Deduced a trap composed of 114 places in 619 ms of which 5 ms to minimize.
[2024-05-31 23:23:24] [INFO ] Deduced a trap composed of 80 places in 635 ms of which 5 ms to minimize.
[2024-05-31 23:23:24] [INFO ] Deduced a trap composed of 76 places in 635 ms of which 6 ms to minimize.
[2024-05-31 23:23:25] [INFO ] Deduced a trap composed of 60 places in 598 ms of which 5 ms to minimize.
[2024-05-31 23:23:26] [INFO ] Deduced a trap composed of 73 places in 651 ms of which 7 ms to minimize.
[2024-05-31 23:23:26] [INFO ] Deduced a trap composed of 69 places in 603 ms of which 6 ms to minimize.
[2024-05-31 23:23:27] [INFO ] Deduced a trap composed of 90 places in 641 ms of which 6 ms to minimize.
[2024-05-31 23:23:28] [INFO ] Deduced a trap composed of 73 places in 610 ms of which 6 ms to minimize.
[2024-05-31 23:23:28] [INFO ] Deduced a trap composed of 27 places in 629 ms of which 7 ms to minimize.
[2024-05-31 23:23:29] [INFO ] Deduced a trap composed of 70 places in 635 ms of which 6 ms to minimize.
[2024-05-31 23:23:30] [INFO ] Deduced a trap composed of 89 places in 596 ms of which 6 ms to minimize.
[2024-05-31 23:23:30] [INFO ] Deduced a trap composed of 96 places in 625 ms of which 6 ms to minimize.
[2024-05-31 23:23:31] [INFO ] Deduced a trap composed of 72 places in 591 ms of which 5 ms to minimize.
[2024-05-31 23:23:31] [INFO ] Deduced a trap composed of 63 places in 585 ms of which 6 ms to minimize.
[2024-05-31 23:23:32] [INFO ] Deduced a trap composed of 86 places in 667 ms of which 6 ms to minimize.
[2024-05-31 23:23:33] [INFO ] Deduced a trap composed of 77 places in 601 ms of which 7 ms to minimize.
[2024-05-31 23:23:33] [INFO ] Deduced a trap composed of 57 places in 642 ms of which 6 ms to minimize.
[2024-05-31 23:23:34] [INFO ] Deduced a trap composed of 86 places in 609 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/940 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:23:35] [INFO ] Deduced a trap composed of 109 places in 551 ms of which 6 ms to minimize.
[2024-05-31 23:23:35] [INFO ] Deduced a trap composed of 88 places in 618 ms of which 6 ms to minimize.
[2024-05-31 23:23:36] [INFO ] Deduced a trap composed of 120 places in 618 ms of which 6 ms to minimize.
[2024-05-31 23:23:37] [INFO ] Deduced a trap composed of 118 places in 597 ms of which 6 ms to minimize.
[2024-05-31 23:23:37] [INFO ] Deduced a trap composed of 70 places in 652 ms of which 6 ms to minimize.
[2024-05-31 23:23:38] [INFO ] Deduced a trap composed of 82 places in 634 ms of which 7 ms to minimize.
[2024-05-31 23:23:39] [INFO ] Deduced a trap composed of 93 places in 641 ms of which 6 ms to minimize.
[2024-05-31 23:23:39] [INFO ] Deduced a trap composed of 120 places in 641 ms of which 6 ms to minimize.
[2024-05-31 23:23:40] [INFO ] Deduced a trap composed of 74 places in 641 ms of which 6 ms to minimize.
[2024-05-31 23:23:41] [INFO ] Deduced a trap composed of 63 places in 635 ms of which 6 ms to minimize.
[2024-05-31 23:23:41] [INFO ] Deduced a trap composed of 92 places in 625 ms of which 5 ms to minimize.
[2024-05-31 23:23:42] [INFO ] Deduced a trap composed of 84 places in 587 ms of which 6 ms to minimize.
[2024-05-31 23:23:42] [INFO ] Deduced a trap composed of 113 places in 594 ms of which 6 ms to minimize.
[2024-05-31 23:23:43] [INFO ] Deduced a trap composed of 78 places in 595 ms of which 6 ms to minimize.
[2024-05-31 23:23:44] [INFO ] Deduced a trap composed of 75 places in 599 ms of which 6 ms to minimize.
[2024-05-31 23:23:44] [INFO ] Deduced a trap composed of 88 places in 601 ms of which 6 ms to minimize.
[2024-05-31 23:23:45] [INFO ] Deduced a trap composed of 95 places in 577 ms of which 6 ms to minimize.
[2024-05-31 23:23:45] [INFO ] Deduced a trap composed of 181 places in 493 ms of which 6 ms to minimize.
[2024-05-31 23:23:46] [INFO ] Deduced a trap composed of 127 places in 487 ms of which 6 ms to minimize.
[2024-05-31 23:23:47] [INFO ] Deduced a trap composed of 115 places in 653 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/940 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:23:47] [INFO ] Deduced a trap composed of 104 places in 634 ms of which 6 ms to minimize.
[2024-05-31 23:23:48] [INFO ] Deduced a trap composed of 85 places in 570 ms of which 6 ms to minimize.
[2024-05-31 23:23:49] [INFO ] Deduced a trap composed of 86 places in 570 ms of which 6 ms to minimize.
[2024-05-31 23:23:49] [INFO ] Deduced a trap composed of 76 places in 653 ms of which 7 ms to minimize.
[2024-05-31 23:23:50] [INFO ] Deduced a trap composed of 83 places in 607 ms of which 6 ms to minimize.
[2024-05-31 23:23:50] [INFO ] Deduced a trap composed of 194 places in 546 ms of which 6 ms to minimize.
[2024-05-31 23:23:51] [INFO ] Deduced a trap composed of 82 places in 667 ms of which 6 ms to minimize.
[2024-05-31 23:23:52] [INFO ] Deduced a trap composed of 115 places in 631 ms of which 6 ms to minimize.
[2024-05-31 23:23:52] [INFO ] Deduced a trap composed of 71 places in 662 ms of which 7 ms to minimize.
[2024-05-31 23:23:53] [INFO ] Deduced a trap composed of 153 places in 556 ms of which 6 ms to minimize.
[2024-05-31 23:23:54] [INFO ] Deduced a trap composed of 84 places in 590 ms of which 6 ms to minimize.
[2024-05-31 23:23:54] [INFO ] Deduced a trap composed of 156 places in 648 ms of which 5 ms to minimize.
[2024-05-31 23:23:55] [INFO ] Deduced a trap composed of 93 places in 573 ms of which 6 ms to minimize.
[2024-05-31 23:23:55] [INFO ] Deduced a trap composed of 221 places in 525 ms of which 7 ms to minimize.
[2024-05-31 23:23:56] [INFO ] Deduced a trap composed of 68 places in 633 ms of which 6 ms to minimize.
[2024-05-31 23:23:57] [INFO ] Deduced a trap composed of 67 places in 570 ms of which 6 ms to minimize.
[2024-05-31 23:23:57] [INFO ] Deduced a trap composed of 73 places in 616 ms of which 6 ms to minimize.
[2024-05-31 23:23:58] [INFO ] Deduced a trap composed of 95 places in 621 ms of which 6 ms to minimize.
[2024-05-31 23:23:59] [INFO ] Deduced a trap composed of 95 places in 582 ms of which 5 ms to minimize.
[2024-05-31 23:23:59] [INFO ] Deduced a trap composed of 95 places in 595 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/940 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 23:24:00] [INFO ] Deduced a trap composed of 80 places in 606 ms of which 6 ms to minimize.
[2024-05-31 23:24:00] [INFO ] Deduced a trap composed of 88 places in 627 ms of which 5 ms to minimize.
[2024-05-31 23:24:01] [INFO ] Deduced a trap composed of 85 places in 612 ms of which 6 ms to minimize.
[2024-05-31 23:24:02] [INFO ] Deduced a trap composed of 93 places in 597 ms of which 6 ms to minimize.
[2024-05-31 23:24:02] [INFO ] Deduced a trap composed of 89 places in 621 ms of which 6 ms to minimize.
[2024-05-31 23:24:03] [INFO ] Deduced a trap composed of 95 places in 651 ms of which 6 ms to minimize.
[2024-05-31 23:24:04] [INFO ] Deduced a trap composed of 102 places in 617 ms of which 6 ms to minimize.
[2024-05-31 23:24:04] [INFO ] Deduced a trap composed of 109 places in 624 ms of which 6 ms to minimize.
[2024-05-31 23:24:05] [INFO ] Deduced a trap composed of 101 places in 627 ms of which 5 ms to minimize.
[2024-05-31 23:24:06] [INFO ] Deduced a trap composed of 95 places in 607 ms of which 6 ms to minimize.
[2024-05-31 23:24:06] [INFO ] Deduced a trap composed of 71 places in 591 ms of which 6 ms to minimize.
[2024-05-31 23:24:07] [INFO ] Deduced a trap composed of 65 places in 612 ms of which 6 ms to minimize.
[2024-05-31 23:24:08] [INFO ] Deduced a trap composed of 65 places in 620 ms of which 6 ms to minimize.
[2024-05-31 23:24:08] [INFO ] Deduced a trap composed of 66 places in 610 ms of which 5 ms to minimize.
SMT process timed out in 83859ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Applied a total of 0 rules in 130 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 984/984 places, 4278/4278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Applied a total of 0 rules in 121 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
[2024-05-31 23:24:08] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-31 23:24:08] [INFO ] Invariant cache hit.
[2024-05-31 23:24:10] [INFO ] Implicit Places using invariants in 1250 ms returned []
[2024-05-31 23:24:10] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-31 23:24:10] [INFO ] Invariant cache hit.
[2024-05-31 23:24:11] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-31 23:24:41] [INFO ] Performed 727/984 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:24:49] [INFO ] Implicit Places using invariants and state equation in 39361 ms returned []
Implicit Place search using SMT with State Equation took 40612 ms to find 0 implicit places.
[2024-05-31 23:24:49] [INFO ] Redundant transitions in 227 ms returned []
Running 4216 sub problems to find dead transitions.
[2024-05-31 23:24:49] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-31 23:24:49] [INFO ] Invariant cache hit.
[2024-05-31 23:24:49] [INFO ] State equation strengthened by 2722 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/982 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4216 unsolved
SMT process timed out in 58724ms, After SMT, problems are : Problem set: 0 solved, 4216 unsolved
Search for dead transitions found 0 dead transitions in 58768ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99759 ms. Remains : 984/984 places, 4278/4278 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[2]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[2]
[2024-05-31 23:25:48] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-31 23:25:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2]
RANDOM walk for 10000 steps (210 resets) in 248 ms. (40 steps per ms)
BEST_FIRST walk for 10000 steps (30 resets) in 36 ms. (270 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2]
[2024-05-31 23:25:48] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-31 23:25:48] [INFO ] Invariant cache hit.
[2024-05-31 23:25:48] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-31 23:25:48] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-31 23:25:49] [INFO ] [Real]Absence check using state equation in 906 ms returned sat
[2024-05-31 23:25:49] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-31 23:25:50] [INFO ] [Real]Added 2722 Read/Feed constraints in 270 ms returned sat
[2024-05-31 23:25:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:25:50] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-31 23:25:50] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 5 ms returned sat
[2024-05-31 23:25:51] [INFO ] [Nat]Absence check using state equation in 888 ms returned sat
[2024-05-31 23:25:51] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:25:52] [INFO ] [Nat]Added 2722 Read/Feed constraints in 789 ms returned sat
[2024-05-31 23:25:52] [INFO ] Deduced a trap composed of 171 places in 539 ms of which 6 ms to minimize.
[2024-05-31 23:25:53] [INFO ] Deduced a trap composed of 201 places in 534 ms of which 6 ms to minimize.
[2024-05-31 23:25:54] [INFO ] Deduced a trap composed of 174 places in 552 ms of which 5 ms to minimize.
[2024-05-31 23:25:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2807 ms
[2024-05-31 23:25:55] [INFO ] Computed and/alt/rep : 1344/1952/1344 causal constraints (skipped 2475 transitions) in 258 ms.
[2024-05-31 23:25:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2]
Support contains 1 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 984 transition count 4277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 983 transition count 4277
Applied a total of 2 rules in 253 ms. Remains 983 /984 variables (removed 1) and now considering 4277/4278 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 983/984 places, 4277/4278 transitions.
[2024-05-31 23:25:55] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
// Phase 1: matrix 3879 rows 983 cols
[2024-05-31 23:25:55] [INFO ] Computed 50 invariants in 35 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2]
RANDOM walk for 1000000 steps (21025 resets) in 18736 ms. (53 steps per ms)
BEST_FIRST walk for 1000001 steps (3028 resets) in 3425 ms. (291 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2]
[2024-05-31 23:26:17] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-31 23:26:17] [INFO ] Invariant cache hit.
[2024-05-31 23:26:17] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-31 23:26:17] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-31 23:26:18] [INFO ] [Real]Absence check using state equation in 807 ms returned sat
[2024-05-31 23:26:18] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-31 23:26:19] [INFO ] [Real]Added 2722 Read/Feed constraints in 259 ms returned sat
[2024-05-31 23:26:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:26:19] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-31 23:26:19] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-31 23:26:20] [INFO ] [Nat]Absence check using state equation in 1005 ms returned sat
[2024-05-31 23:26:20] [INFO ] [Nat]Added 2722 Read/Feed constraints in 581 ms returned sat
[2024-05-31 23:26:21] [INFO ] Deduced a trap composed of 135 places in 515 ms of which 6 ms to minimize.
[2024-05-31 23:26:22] [INFO ] Deduced a trap composed of 168 places in 515 ms of which 6 ms to minimize.
[2024-05-31 23:26:23] [INFO ] Deduced a trap composed of 201 places in 524 ms of which 6 ms to minimize.
[2024-05-31 23:26:24] [INFO ] Deduced a trap composed of 173 places in 529 ms of which 7 ms to minimize.
[2024-05-31 23:26:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3413 ms
[2024-05-31 23:26:24] [INFO ] Computed and/alt/rep : 1342/1949/1342 causal constraints (skipped 2475 transitions) in 244 ms.
[2024-05-31 23:26:25] [INFO ] Added : 14 causal constraints over 3 iterations in 823 ms. Result :sat
Minimization took 5763 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2]
Support contains 1 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 124 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 983/983 places, 4277/4277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 114 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
[2024-05-31 23:26:31] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-31 23:26:31] [INFO ] Invariant cache hit.
[2024-05-31 23:26:32] [INFO ] Implicit Places using invariants in 1261 ms returned []
[2024-05-31 23:26:32] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-31 23:26:32] [INFO ] Invariant cache hit.
[2024-05-31 23:26:33] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-31 23:27:03] [INFO ] Performed 891/983 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:27:10] [INFO ] Implicit Places using invariants and state equation in 38182 ms returned []
Implicit Place search using SMT with State Equation took 39447 ms to find 0 implicit places.
[2024-05-31 23:27:10] [INFO ] Redundant transitions in 216 ms returned []
Running 4215 sub problems to find dead transitions.
[2024-05-31 23:27:10] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-31 23:27:10] [INFO ] Invariant cache hit.
[2024-05-31 23:27:10] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/981 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4215 unsolved
SMT process timed out in 56622ms, After SMT, problems are : Problem set: 0 solved, 4215 unsolved
Search for dead transitions found 0 dead transitions in 56668ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96469 ms. Remains : 983/983 places, 4277/4277 transitions.
RANDOM walk for 40000 steps (840 resets) in 978 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (120 resets) in 221 ms. (180 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (117 resets) in 266 ms. (149 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 64331 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 2
Probabilistic random walk after 64331 steps, saw 27110 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-31 23:28:10] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-31 23:28:10] [INFO ] Invariant cache hit.
[2024-05-31 23:28:10] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 884/888 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/905 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/939 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 23:28:11] [INFO ] Deduced a trap composed of 77 places in 654 ms of which 6 ms to minimize.
[2024-05-31 23:28:12] [INFO ] Deduced a trap composed of 65 places in 654 ms of which 6 ms to minimize.
[2024-05-31 23:28:13] [INFO ] Deduced a trap composed of 58 places in 670 ms of which 6 ms to minimize.
[2024-05-31 23:28:13] [INFO ] Deduced a trap composed of 73 places in 577 ms of which 5 ms to minimize.
[2024-05-31 23:28:14] [INFO ] Deduced a trap composed of 63 places in 666 ms of which 6 ms to minimize.
[2024-05-31 23:28:15] [INFO ] Deduced a trap composed of 56 places in 631 ms of which 5 ms to minimize.
[2024-05-31 23:28:15] [INFO ] Deduced a trap composed of 57 places in 652 ms of which 6 ms to minimize.
[2024-05-31 23:28:16] [INFO ] Deduced a trap composed of 65 places in 634 ms of which 6 ms to minimize.
SMT process timed out in 5535ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 128 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 983/983 places, 4277/4277 transitions.
RANDOM walk for 40000 steps (840 resets) in 849 ms. (47 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (120 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 70724 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 70724 steps, saw 29798 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-31 23:28:19] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-31 23:28:19] [INFO ] Invariant cache hit.
[2024-05-31 23:28:19] [INFO ] State equation strengthened by 2722 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 884/888 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/905 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/939 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/967 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/967 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/983 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/983 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3879/4862 variables, 983/1033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4862 variables, 2722/3755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4862 variables, 0/3755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/4862 variables, 0/3755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4862/4862 variables, and 3755 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1416 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 983/983 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 884/888 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/905 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/939 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:28:22] [INFO ] Deduced a trap composed of 5 places in 608 ms of which 6 ms to minimize.
[2024-05-31 23:28:22] [INFO ] Deduced a trap composed of 27 places in 588 ms of which 6 ms to minimize.
[2024-05-31 23:28:23] [INFO ] Deduced a trap composed of 63 places in 592 ms of which 6 ms to minimize.
[2024-05-31 23:28:23] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/939 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/967 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/967 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 16/983 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/983 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3879/4862 variables, 983/1037 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4862 variables, 2722/3759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4862 variables, 1/3760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:28:25] [INFO ] Deduced a trap composed of 201 places in 517 ms of which 10 ms to minimize.
[2024-05-31 23:28:26] [INFO ] Deduced a trap composed of 173 places in 507 ms of which 5 ms to minimize.
[2024-05-31 23:28:27] [INFO ] Deduced a trap composed of 184 places in 543 ms of which 6 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4862 variables, 3/3763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4862 variables, 0/3763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/4862 variables, 0/3763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4862/4862 variables, and 3763 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6853 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 983/983 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 8318ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 120 ms.
Support contains 1 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 112 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 983/983 places, 4277/4277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 113 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
[2024-05-31 23:28:28] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-31 23:28:28] [INFO ] Invariant cache hit.
[2024-05-31 23:28:29] [INFO ] Implicit Places using invariants in 1294 ms returned []
[2024-05-31 23:28:29] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-31 23:28:29] [INFO ] Invariant cache hit.
[2024-05-31 23:28:30] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-31 23:29:01] [INFO ] Performed 779/983 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:29:10] [INFO ] Implicit Places using invariants and state equation in 41091 ms returned []
Implicit Place search using SMT with State Equation took 42398 ms to find 0 implicit places.
[2024-05-31 23:29:11] [INFO ] Redundant transitions in 214 ms returned []
Running 4215 sub problems to find dead transitions.
[2024-05-31 23:29:11] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-31 23:29:11] [INFO ] Invariant cache hit.
[2024-05-31 23:29:11] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/981 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4215 unsolved
SMT process timed out in 56429ms, After SMT, problems are : Problem set: 0 solved, 4215 unsolved
Search for dead transitions found 0 dead transitions in 56462ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99207 ms. Remains : 983/983 places, 4277/4277 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[2]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01 in 259146 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:30:07] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
// Phase 1: matrix 3881 rows 984 cols
[2024-05-31 23:30:07] [INFO ] Computed 50 invariants in 39 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (211 resets) in 191 ms. (52 steps per ms)
BEST_FIRST walk for 10001 steps (29 resets) in 34 ms. (285 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:30:07] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-31 23:30:07] [INFO ] Invariant cache hit.
[2024-05-31 23:30:08] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned sat
[2024-05-31 23:30:08] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-31 23:30:08] [INFO ] [Real]Absence check using state equation in 853 ms returned sat
[2024-05-31 23:30:09] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-31 23:30:09] [INFO ] [Real]Added 2722 Read/Feed constraints in 287 ms returned sat
[2024-05-31 23:30:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:30:09] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-31 23:30:09] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-31 23:30:10] [INFO ] [Nat]Absence check using state equation in 780 ms returned sat
[2024-05-31 23:30:10] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:30:11] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1138 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 984 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node15ThinksNode14ShouldBeNodeMasterToReplaceNode4) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4276/4276 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 983 transition count 4274
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 983 transition count 4272
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 981 transition count 4272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 980 transition count 4271
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 980 transition count 4271
Applied a total of 7 rules in 306 ms. Remains 980 /984 variables (removed 4) and now considering 4271/4276 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 980/984 places, 4271/4276 transitions.
[2024-05-31 23:30:11] [INFO ] Flow matrix only has 3873 transitions (discarded 398 similar events)
// Phase 1: matrix 3873 rows 980 cols
[2024-05-31 23:30:11] [INFO ] Computed 50 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21031 resets) in 18698 ms. (53 steps per ms)
BEST_FIRST walk for 1000000 steps (3014 resets) in 3343 ms. (299 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:30:33] [INFO ] Flow matrix only has 3873 transitions (discarded 398 similar events)
[2024-05-31 23:30:33] [INFO ] Invariant cache hit.
[2024-05-31 23:30:34] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-31 23:30:34] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-31 23:30:34] [INFO ] [Real]Absence check using state equation in 729 ms returned sat
[2024-05-31 23:30:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:30:34] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-31 23:30:34] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 14 ms returned sat
[2024-05-31 23:30:35] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2024-05-31 23:30:35] [INFO ] State equation strengthened by 2720 read => feed constraints.
[2024-05-31 23:30:37] [INFO ] [Nat]Added 2720 Read/Feed constraints in 1505 ms returned sat
[2024-05-31 23:30:37] [INFO ] Computed and/alt/rep : 1335/1930/1335 causal constraints (skipped 2476 transitions) in 254 ms.
[2024-05-31 23:30:38] [INFO ] Added : 22 causal constraints over 5 iterations in 1118 ms. Result :sat
Minimization took 5409 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 980 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 980/980 places, 4271/4271 transitions.
Applied a total of 0 rules in 134 ms. Remains 980 /980 variables (removed 0) and now considering 4271/4271 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 980/980 places, 4271/4271 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 980/980 places, 4271/4271 transitions.
Applied a total of 0 rules in 129 ms. Remains 980 /980 variables (removed 0) and now considering 4271/4271 (removed 0) transitions.
[2024-05-31 23:30:44] [INFO ] Flow matrix only has 3873 transitions (discarded 398 similar events)
[2024-05-31 23:30:44] [INFO ] Invariant cache hit.
[2024-05-31 23:30:45] [INFO ] Implicit Places using invariants in 1257 ms returned [234]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1260 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 979/980 places, 4271/4271 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 978 transition count 4270
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 978 transition count 4270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 977 transition count 4269
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 977 transition count 4269
Applied a total of 4 rules in 204 ms. Remains 977 /979 variables (removed 2) and now considering 4269/4271 (removed 2) transitions.
[2024-05-31 23:30:45] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
// Phase 1: matrix 3871 rows 977 cols
[2024-05-31 23:30:45] [INFO ] Computed 49 invariants in 35 ms
[2024-05-31 23:30:46] [INFO ] Implicit Places using invariants in 1310 ms returned []
[2024-05-31 23:30:46] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-31 23:30:46] [INFO ] Invariant cache hit.
[2024-05-31 23:30:47] [INFO ] State equation strengthened by 2720 read => feed constraints.
[2024-05-31 23:31:18] [INFO ] Performed 569/977 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:31:37] [INFO ] Implicit Places using invariants and state equation in 50294 ms returned []
Implicit Place search using SMT with State Equation took 51605 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 977/980 places, 4269/4271 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 53198 ms. Remains : 977/980 places, 4269/4271 transitions.
[2024-05-31 23:31:37] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-31 23:31:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21033 resets) in 19054 ms. (52 steps per ms)
BEST_FIRST walk for 1000001 steps (3016 resets) in 3483 ms. (287 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:31:59] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-31 23:31:59] [INFO ] Invariant cache hit.
[2024-05-31 23:31:59] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-31 23:31:59] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-31 23:32:00] [INFO ] [Real]Absence check using state equation in 850 ms returned sat
[2024-05-31 23:32:00] [INFO ] State equation strengthened by 2720 read => feed constraints.
[2024-05-31 23:32:01] [INFO ] [Real]Added 2720 Read/Feed constraints in 400 ms returned sat
[2024-05-31 23:32:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:32:01] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-31 23:32:01] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-31 23:32:02] [INFO ] [Nat]Absence check using state equation in 824 ms returned sat
[2024-05-31 23:32:03] [INFO ] [Nat]Added 2720 Read/Feed constraints in 1345 ms returned sat
[2024-05-31 23:32:04] [INFO ] Deduced a trap composed of 235 places in 522 ms of which 5 ms to minimize.
[2024-05-31 23:32:05] [INFO ] Deduced a trap composed of 90 places in 696 ms of which 6 ms to minimize.
[2024-05-31 23:32:05] [INFO ] Deduced a trap composed of 94 places in 649 ms of which 6 ms to minimize.
[2024-05-31 23:32:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2246 ms
[2024-05-31 23:32:06] [INFO ] Computed and/alt/rep : 1334/1922/1334 causal constraints (skipped 2475 transitions) in 254 ms.
[2024-05-31 23:32:06] [INFO ] Added : 19 causal constraints over 4 iterations in 985 ms. Result :sat
Minimization took 5529 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4269/4269 transitions.
Applied a total of 0 rules in 134 ms. Remains 977 /977 variables (removed 0) and now considering 4269/4269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 977/977 places, 4269/4269 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4269/4269 transitions.
Applied a total of 0 rules in 129 ms. Remains 977 /977 variables (removed 0) and now considering 4269/4269 (removed 0) transitions.
[2024-05-31 23:32:12] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-31 23:32:12] [INFO ] Invariant cache hit.
[2024-05-31 23:32:13] [INFO ] Implicit Places using invariants in 1310 ms returned []
[2024-05-31 23:32:13] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-31 23:32:13] [INFO ] Invariant cache hit.
[2024-05-31 23:32:14] [INFO ] State equation strengthened by 2720 read => feed constraints.
[2024-05-31 23:32:45] [INFO ] Performed 559/977 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:33:05] [INFO ] Implicit Places using invariants and state equation in 51355 ms returned []
Implicit Place search using SMT with State Equation took 52666 ms to find 0 implicit places.
[2024-05-31 23:33:05] [INFO ] Redundant transitions in 218 ms returned []
Running 4207 sub problems to find dead transitions.
[2024-05-31 23:33:05] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-31 23:33:05] [INFO ] Invariant cache hit.
[2024-05-31 23:33:05] [INFO ] State equation strengthened by 2720 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/974 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4207 unsolved
SMT process timed out in 61769ms, After SMT, problems are : Problem set: 0 solved, 4207 unsolved
Search for dead transitions found 0 dead transitions in 61811ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114846 ms. Remains : 977/977 places, 4269/4269 transitions.
RANDOM walk for 40000 steps (839 resets) in 1448 ms. (27 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (118 resets) in 264 ms. (150 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (119 resets) in 293 ms. (136 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 63428 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 2
Probabilistic random walk after 63428 steps, saw 26758 distinct states, run finished after 3003 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-31 23:34:10] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-31 23:34:10] [INFO ] Invariant cache hit.
[2024-05-31 23:34:10] [INFO ] State equation strengthened by 2720 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 880/881 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/881 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/899 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:34:12] [INFO ] Deduced a trap composed of 80 places in 762 ms of which 5 ms to minimize.
[2024-05-31 23:34:12] [INFO ] Deduced a trap composed of 98 places in 627 ms of which 5 ms to minimize.
[2024-05-31 23:34:13] [INFO ] Deduced a trap composed of 157 places in 601 ms of which 6 ms to minimize.
[2024-05-31 23:34:14] [INFO ] Deduced a trap composed of 227 places in 583 ms of which 6 ms to minimize.
[2024-05-31 23:34:14] [INFO ] Deduced a trap composed of 111 places in 620 ms of which 5 ms to minimize.
[2024-05-31 23:34:15] [INFO ] Deduced a trap composed of 122 places in 594 ms of which 5 ms to minimize.
[2024-05-31 23:34:15] [INFO ] Deduced a trap composed of 224 places in 587 ms of which 6 ms to minimize.
[2024-05-31 23:34:16] [INFO ] Deduced a trap composed of 133 places in 595 ms of which 6 ms to minimize.
SMT process timed out in 5632ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4269/4269 transitions.
Applied a total of 0 rules in 128 ms. Remains 977 /977 variables (removed 0) and now considering 4269/4269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 977/977 places, 4269/4269 transitions.
RANDOM walk for 40000 steps (840 resets) in 1696 ms. (23 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (119 resets) in 263 ms. (151 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (117 resets) in 246 ms. (161 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 66694 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 2
Probabilistic random walk after 66694 steps, saw 28117 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-31 23:34:20] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-31 23:34:20] [INFO ] Invariant cache hit.
[2024-05-31 23:34:20] [INFO ] State equation strengthened by 2720 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 880/881 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/881 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/899 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:34:21] [INFO ] Deduced a trap composed of 80 places in 602 ms of which 6 ms to minimize.
[2024-05-31 23:34:21] [INFO ] Deduced a trap composed of 98 places in 624 ms of which 15 ms to minimize.
[2024-05-31 23:34:22] [INFO ] Deduced a trap composed of 157 places in 622 ms of which 6 ms to minimize.
[2024-05-31 23:34:23] [INFO ] Deduced a trap composed of 227 places in 610 ms of which 5 ms to minimize.
[2024-05-31 23:34:23] [INFO ] Deduced a trap composed of 111 places in 607 ms of which 6 ms to minimize.
[2024-05-31 23:34:24] [INFO ] Deduced a trap composed of 122 places in 612 ms of which 6 ms to minimize.
[2024-05-31 23:34:25] [INFO ] Deduced a trap composed of 224 places in 618 ms of which 6 ms to minimize.
[2024-05-31 23:34:25] [INFO ] Deduced a trap composed of 133 places in 602 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 34/933 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/933 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/961 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/961 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 16/977 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/977 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3871/4848 variables, 977/1034 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4848 variables, 2720/3754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4848 variables, 0/3754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/4848 variables, 0/3754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4848/4848 variables, and 3754 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6742 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 977/977 constraints, ReadFeed: 2720/2720 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 880/881 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/881 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/899 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:34:27] [INFO ] Deduced a trap composed of 300 places in 607 ms of which 6 ms to minimize.
[2024-05-31 23:34:28] [INFO ] Deduced a trap composed of 81 places in 582 ms of which 6 ms to minimize.
[2024-05-31 23:34:29] [INFO ] Deduced a trap composed of 144 places in 569 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/933 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:34:29] [INFO ] Deduced a trap composed of 5 places in 529 ms of which 6 ms to minimize.
[2024-05-31 23:34:30] [INFO ] Deduced a trap composed of 140 places in 535 ms of which 6 ms to minimize.
[2024-05-31 23:34:30] [INFO ] Deduced a trap composed of 46 places in 544 ms of which 6 ms to minimize.
[2024-05-31 23:34:31] [INFO ] Deduced a trap composed of 27 places in 560 ms of which 6 ms to minimize.
[2024-05-31 23:34:32] [INFO ] Deduced a trap composed of 57 places in 556 ms of which 6 ms to minimize.
[2024-05-31 23:34:32] [INFO ] Deduced a trap composed of 139 places in 543 ms of which 5 ms to minimize.
[2024-05-31 23:34:33] [INFO ] Deduced a trap composed of 141 places in 558 ms of which 7 ms to minimize.
[2024-05-31 23:34:33] [INFO ] Deduced a trap composed of 46 places in 535 ms of which 6 ms to minimize.
[2024-05-31 23:34:34] [INFO ] Deduced a trap composed of 161 places in 563 ms of which 7 ms to minimize.
[2024-05-31 23:34:35] [INFO ] Deduced a trap composed of 77 places in 658 ms of which 6 ms to minimize.
[2024-05-31 23:34:35] [INFO ] Deduced a trap composed of 82 places in 661 ms of which 6 ms to minimize.
[2024-05-31 23:34:36] [INFO ] Deduced a trap composed of 70 places in 646 ms of which 6 ms to minimize.
[2024-05-31 23:34:37] [INFO ] Deduced a trap composed of 75 places in 643 ms of which 5 ms to minimize.
[2024-05-31 23:34:37] [INFO ] Deduced a trap composed of 85 places in 545 ms of which 5 ms to minimize.
[2024-05-31 23:34:38] [INFO ] Deduced a trap composed of 46 places in 539 ms of which 6 ms to minimize.
[2024-05-31 23:34:38] [INFO ] Deduced a trap composed of 176 places in 499 ms of which 6 ms to minimize.
[2024-05-31 23:34:39] [INFO ] Deduced a trap composed of 71 places in 493 ms of which 5 ms to minimize.
[2024-05-31 23:34:39] [INFO ] Deduced a trap composed of 88 places in 492 ms of which 5 ms to minimize.
[2024-05-31 23:34:40] [INFO ] Deduced a trap composed of 62 places in 490 ms of which 6 ms to minimize.
[2024-05-31 23:34:40] [INFO ] Deduced a trap composed of 75 places in 548 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/933 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:34:41] [INFO ] Deduced a trap composed of 187 places in 530 ms of which 9 ms to minimize.
[2024-05-31 23:34:41] [INFO ] Deduced a trap composed of 187 places in 556 ms of which 6 ms to minimize.
[2024-05-31 23:34:42] [INFO ] Deduced a trap composed of 92 places in 504 ms of which 6 ms to minimize.
[2024-05-31 23:34:43] [INFO ] Deduced a trap composed of 118 places in 562 ms of which 6 ms to minimize.
[2024-05-31 23:34:43] [INFO ] Deduced a trap composed of 66 places in 644 ms of which 6 ms to minimize.
[2024-05-31 23:34:44] [INFO ] Deduced a trap composed of 71 places in 613 ms of which 6 ms to minimize.
[2024-05-31 23:34:44] [INFO ] Deduced a trap composed of 63 places in 618 ms of which 6 ms to minimize.
[2024-05-31 23:34:45] [INFO ] Deduced a trap composed of 74 places in 671 ms of which 6 ms to minimize.
[2024-05-31 23:34:46] [INFO ] Deduced a trap composed of 64 places in 610 ms of which 6 ms to minimize.
[2024-05-31 23:34:46] [INFO ] Deduced a trap composed of 76 places in 600 ms of which 5 ms to minimize.
[2024-05-31 23:34:47] [INFO ] Deduced a trap composed of 92 places in 543 ms of which 6 ms to minimize.
[2024-05-31 23:34:48] [INFO ] Deduced a trap composed of 97 places in 630 ms of which 6 ms to minimize.
[2024-05-31 23:34:48] [INFO ] Deduced a trap composed of 69 places in 635 ms of which 6 ms to minimize.
[2024-05-31 23:34:49] [INFO ] Deduced a trap composed of 106 places in 618 ms of which 6 ms to minimize.
[2024-05-31 23:34:50] [INFO ] Deduced a trap composed of 85 places in 649 ms of which 6 ms to minimize.
[2024-05-31 23:34:50] [INFO ] Deduced a trap composed of 83 places in 664 ms of which 6 ms to minimize.
[2024-05-31 23:34:51] [INFO ] Deduced a trap composed of 97 places in 615 ms of which 6 ms to minimize.
[2024-05-31 23:34:51] [INFO ] Deduced a trap composed of 154 places in 554 ms of which 6 ms to minimize.
[2024-05-31 23:34:52] [INFO ] Deduced a trap composed of 85 places in 491 ms of which 6 ms to minimize.
[2024-05-31 23:34:53] [INFO ] Deduced a trap composed of 95 places in 634 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/933 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:34:53] [INFO ] Deduced a trap composed of 81 places in 641 ms of which 6 ms to minimize.
[2024-05-31 23:34:54] [INFO ] Deduced a trap composed of 85 places in 617 ms of which 6 ms to minimize.
[2024-05-31 23:34:55] [INFO ] Deduced a trap composed of 72 places in 623 ms of which 5 ms to minimize.
[2024-05-31 23:34:55] [INFO ] Deduced a trap composed of 82 places in 648 ms of which 5 ms to minimize.
[2024-05-31 23:34:56] [INFO ] Deduced a trap composed of 74 places in 626 ms of which 5 ms to minimize.
[2024-05-31 23:34:57] [INFO ] Deduced a trap composed of 73 places in 638 ms of which 5 ms to minimize.
[2024-05-31 23:34:57] [INFO ] Deduced a trap composed of 85 places in 649 ms of which 6 ms to minimize.
[2024-05-31 23:34:58] [INFO ] Deduced a trap composed of 86 places in 635 ms of which 6 ms to minimize.
[2024-05-31 23:34:58] [INFO ] Deduced a trap composed of 103 places in 485 ms of which 6 ms to minimize.
[2024-05-31 23:34:59] [INFO ] Deduced a trap composed of 70 places in 584 ms of which 6 ms to minimize.
[2024-05-31 23:35:00] [INFO ] Deduced a trap composed of 77 places in 591 ms of which 5 ms to minimize.
[2024-05-31 23:35:00] [INFO ] Deduced a trap composed of 72 places in 593 ms of which 6 ms to minimize.
[2024-05-31 23:35:01] [INFO ] Deduced a trap composed of 219 places in 505 ms of which 5 ms to minimize.
[2024-05-31 23:35:01] [INFO ] Deduced a trap composed of 204 places in 532 ms of which 6 ms to minimize.
[2024-05-31 23:35:02] [INFO ] Deduced a trap composed of 213 places in 519 ms of which 5 ms to minimize.
[2024-05-31 23:35:03] [INFO ] Deduced a trap composed of 76 places in 651 ms of which 6 ms to minimize.
[2024-05-31 23:35:03] [INFO ] Deduced a trap composed of 246 places in 541 ms of which 5 ms to minimize.
[2024-05-31 23:35:04] [INFO ] Deduced a trap composed of 209 places in 504 ms of which 5 ms to minimize.
[2024-05-31 23:35:04] [INFO ] Deduced a trap composed of 113 places in 479 ms of which 5 ms to minimize.
[2024-05-31 23:35:05] [INFO ] Deduced a trap composed of 84 places in 616 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/933 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:35:05] [INFO ] Deduced a trap composed of 64 places in 572 ms of which 6 ms to minimize.
[2024-05-31 23:35:06] [INFO ] Deduced a trap composed of 80 places in 573 ms of which 6 ms to minimize.
[2024-05-31 23:35:07] [INFO ] Deduced a trap composed of 62 places in 568 ms of which 6 ms to minimize.
[2024-05-31 23:35:07] [INFO ] Deduced a trap composed of 111 places in 665 ms of which 7 ms to minimize.
[2024-05-31 23:35:08] [INFO ] Deduced a trap composed of 70 places in 572 ms of which 5 ms to minimize.
[2024-05-31 23:35:08] [INFO ] Deduced a trap composed of 157 places in 468 ms of which 5 ms to minimize.
[2024-05-31 23:35:09] [INFO ] Deduced a trap composed of 145 places in 481 ms of which 5 ms to minimize.
[2024-05-31 23:35:09] [INFO ] Deduced a trap composed of 80 places in 567 ms of which 5 ms to minimize.
[2024-05-31 23:35:10] [INFO ] Deduced a trap composed of 70 places in 589 ms of which 5 ms to minimize.
[2024-05-31 23:35:11] [INFO ] Deduced a trap composed of 72 places in 616 ms of which 7 ms to minimize.
[2024-05-31 23:35:11] [INFO ] Deduced a trap composed of 88 places in 621 ms of which 6 ms to minimize.
[2024-05-31 23:35:12] [INFO ] Deduced a trap composed of 71 places in 662 ms of which 6 ms to minimize.
SMT process timed out in 52008ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4269/4269 transitions.
Applied a total of 0 rules in 124 ms. Remains 977 /977 variables (removed 0) and now considering 4269/4269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 977/977 places, 4269/4269 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4269/4269 transitions.
Applied a total of 0 rules in 126 ms. Remains 977 /977 variables (removed 0) and now considering 4269/4269 (removed 0) transitions.
[2024-05-31 23:35:12] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-31 23:35:12] [INFO ] Invariant cache hit.
[2024-05-31 23:35:14] [INFO ] Implicit Places using invariants in 1338 ms returned []
[2024-05-31 23:35:14] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-31 23:35:14] [INFO ] Invariant cache hit.
[2024-05-31 23:35:15] [INFO ] State equation strengthened by 2720 read => feed constraints.
[2024-05-31 23:35:45] [INFO ] Performed 556/977 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:36:07] [INFO ] Implicit Places using invariants and state equation in 53375 ms returned []
Implicit Place search using SMT with State Equation took 54736 ms to find 0 implicit places.
[2024-05-31 23:36:07] [INFO ] Redundant transitions in 218 ms returned []
Running 4207 sub problems to find dead transitions.
[2024-05-31 23:36:07] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-31 23:36:07] [INFO ] Invariant cache hit.
[2024-05-31 23:36:07] [INFO ] State equation strengthened by 2720 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/974 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4207 unsolved
SMT process timed out in 59398ms, After SMT, problems are : Problem set: 0 solved, 4207 unsolved
Search for dead transitions found 0 dead transitions in 59435ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114535 ms. Remains : 977/977 places, 4269/4269 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02 in 419390 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:37:07] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
// Phase 1: matrix 3881 rows 984 cols
[2024-05-31 23:37:07] [INFO ] Computed 50 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (210 resets) in 207 ms. (48 steps per ms)
BEST_FIRST walk for 10001 steps (30 resets) in 39 ms. (250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:37:07] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-31 23:37:07] [INFO ] Invariant cache hit.
[2024-05-31 23:37:07] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2024-05-31 23:37:07] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-31 23:37:08] [INFO ] [Real]Absence check using state equation in 800 ms returned sat
[2024-05-31 23:37:08] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-31 23:37:08] [INFO ] [Real]Added 2722 Read/Feed constraints in 239 ms returned sat
[2024-05-31 23:37:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:37:08] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-31 23:37:08] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-31 23:37:09] [INFO ] [Nat]Absence check using state equation in 863 ms returned sat
[2024-05-31 23:37:10] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:37:10] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1143 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 984 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node13ThinksNode4ShouldBeNodeMasterToReplaceNode12) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4276/4276 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 984 transition count 4275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 983 transition count 4275
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 982 transition count 4274
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 982 transition count 4274
Applied a total of 4 rules in 275 ms. Remains 982 /984 variables (removed 2) and now considering 4274/4276 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 275 ms. Remains : 982/984 places, 4274/4276 transitions.
[2024-05-31 23:37:11] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 982 cols
[2024-05-31 23:37:11] [INFO ] Computed 50 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21028 resets) in 19112 ms. (52 steps per ms)
BEST_FIRST walk for 1000001 steps (3000 resets) in 3411 ms. (293 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:37:33] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2024-05-31 23:37:33] [INFO ] Invariant cache hit.
[2024-05-31 23:37:33] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-31 23:37:33] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 6 ms returned sat
[2024-05-31 23:37:34] [INFO ] [Real]Absence check using state equation in 913 ms returned sat
[2024-05-31 23:37:34] [INFO ] State equation strengthened by 2721 read => feed constraints.
[2024-05-31 23:37:35] [INFO ] [Real]Added 2721 Read/Feed constraints in 343 ms returned sat
[2024-05-31 23:37:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:37:35] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-31 23:37:35] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 6 ms returned sat
[2024-05-31 23:37:36] [INFO ] [Nat]Absence check using state equation in 1025 ms returned sat
[2024-05-31 23:37:37] [INFO ] [Nat]Added 2721 Read/Feed constraints in 1305 ms returned sat
[2024-05-31 23:37:38] [INFO ] Deduced a trap composed of 228 places in 577 ms of which 7 ms to minimize.
[2024-05-31 23:37:39] [INFO ] Deduced a trap composed of 92 places in 656 ms of which 6 ms to minimize.
[2024-05-31 23:37:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1509 ms
[2024-05-31 23:37:39] [INFO ] Computed and/alt/rep : 1339/1936/1339 causal constraints (skipped 2476 transitions) in 232 ms.
[2024-05-31 23:37:41] [INFO ] Deduced a trap composed of 84 places in 652 ms of which 6 ms to minimize.
[2024-05-31 23:37:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 874 ms
[2024-05-31 23:37:41] [INFO ] Added : 23 causal constraints over 7 iterations in 2505 ms. Result :sat
Minimization took 5495 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 982 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 982/982 places, 4274/4274 transitions.
Applied a total of 0 rules in 123 ms. Remains 982 /982 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 982/982 places, 4274/4274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 982/982 places, 4274/4274 transitions.
Applied a total of 0 rules in 120 ms. Remains 982 /982 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
[2024-05-31 23:37:47] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2024-05-31 23:37:47] [INFO ] Invariant cache hit.
[2024-05-31 23:37:48] [INFO ] Implicit Places using invariants in 1285 ms returned [234]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1289 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 981/982 places, 4274/4274 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 980 transition count 4273
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 980 transition count 4273
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 979 transition count 4272
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 979 transition count 4272
Applied a total of 4 rules in 192 ms. Remains 979 /981 variables (removed 2) and now considering 4272/4274 (removed 2) transitions.
[2024-05-31 23:37:48] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
// Phase 1: matrix 3875 rows 979 cols
[2024-05-31 23:37:49] [INFO ] Computed 49 invariants in 30 ms
[2024-05-31 23:37:50] [INFO ] Implicit Places using invariants in 1336 ms returned []
[2024-05-31 23:37:50] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-31 23:37:50] [INFO ] Invariant cache hit.
[2024-05-31 23:37:51] [INFO ] State equation strengthened by 2721 read => feed constraints.
[2024-05-31 23:38:21] [INFO ] Performed 820/979 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:38:31] [INFO ] Implicit Places using invariants and state equation in 40837 ms returned []
Implicit Place search using SMT with State Equation took 42175 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 979/982 places, 4272/4274 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 43777 ms. Remains : 979/982 places, 4272/4274 transitions.
[2024-05-31 23:38:31] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-31 23:38:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21029 resets) in 19631 ms. (50 steps per ms)
BEST_FIRST walk for 1000001 steps (3002 resets) in 3468 ms. (288 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:38:54] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-31 23:38:54] [INFO ] Invariant cache hit.
[2024-05-31 23:38:54] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-31 23:38:54] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-31 23:38:55] [INFO ] [Real]Absence check using state equation in 955 ms returned sat
[2024-05-31 23:38:55] [INFO ] State equation strengthened by 2721 read => feed constraints.
[2024-05-31 23:38:55] [INFO ] [Real]Added 2721 Read/Feed constraints in 219 ms returned sat
[2024-05-31 23:38:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:38:55] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-31 23:38:55] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 6 ms returned sat
[2024-05-31 23:38:56] [INFO ] [Nat]Absence check using state equation in 883 ms returned sat
[2024-05-31 23:38:57] [INFO ] [Nat]Added 2721 Read/Feed constraints in 1211 ms returned sat
[2024-05-31 23:38:58] [INFO ] Deduced a trap composed of 221 places in 565 ms of which 6 ms to minimize.
[2024-05-31 23:38:59] [INFO ] Deduced a trap composed of 84 places in 645 ms of which 6 ms to minimize.
[2024-05-31 23:39:00] [INFO ] Deduced a trap composed of 85 places in 642 ms of which 6 ms to minimize.
[2024-05-31 23:39:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2293 ms
[2024-05-31 23:39:00] [INFO ] Computed and/alt/rep : 1338/1928/1338 causal constraints (skipped 2475 transitions) in 221 ms.
[2024-05-31 23:39:01] [INFO ] Added : 18 causal constraints over 4 iterations in 975 ms. Result :sat
Minimization took 4960 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4272/4272 transitions.
Applied a total of 0 rules in 126 ms. Remains 979 /979 variables (removed 0) and now considering 4272/4272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 979/979 places, 4272/4272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4272/4272 transitions.
Applied a total of 0 rules in 123 ms. Remains 979 /979 variables (removed 0) and now considering 4272/4272 (removed 0) transitions.
[2024-05-31 23:39:06] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-31 23:39:06] [INFO ] Invariant cache hit.
[2024-05-31 23:39:07] [INFO ] Implicit Places using invariants in 1283 ms returned []
[2024-05-31 23:39:07] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-31 23:39:07] [INFO ] Invariant cache hit.
[2024-05-31 23:39:08] [INFO ] State equation strengthened by 2721 read => feed constraints.
[2024-05-31 23:39:38] [INFO ] Performed 827/979 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:39:48] [INFO ] Implicit Places using invariants and state equation in 40844 ms returned []
Implicit Place search using SMT with State Equation took 42129 ms to find 0 implicit places.
[2024-05-31 23:39:48] [INFO ] Redundant transitions in 218 ms returned []
Running 4210 sub problems to find dead transitions.
[2024-05-31 23:39:48] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-31 23:39:48] [INFO ] Invariant cache hit.
[2024-05-31 23:39:48] [INFO ] State equation strengthened by 2721 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4210 unsolved
SMT process timed out in 58912ms, After SMT, problems are : Problem set: 0 solved, 4210 unsolved
Search for dead transitions found 0 dead transitions in 58946ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101442 ms. Remains : 979/979 places, 4272/4272 transitions.
RANDOM walk for 40000 steps (840 resets) in 843 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (119 resets) in 255 ms. (156 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (117 resets) in 237 ms. (168 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 66708 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 2
Probabilistic random walk after 66708 steps, saw 28128 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-31 23:40:51] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-31 23:40:51] [INFO ] Invariant cache hit.
[2024-05-31 23:40:51] [INFO ] State equation strengthened by 2721 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 882/883 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/883 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/901 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:40:52] [INFO ] Deduced a trap composed of 177 places in 635 ms of which 7 ms to minimize.
[2024-05-31 23:40:52] [INFO ] Deduced a trap composed of 247 places in 616 ms of which 6 ms to minimize.
[2024-05-31 23:40:53] [INFO ] Deduced a trap composed of 137 places in 622 ms of which 6 ms to minimize.
[2024-05-31 23:40:53] [INFO ] Deduced a trap composed of 182 places in 607 ms of which 5 ms to minimize.
[2024-05-31 23:40:54] [INFO ] Deduced a trap composed of 92 places in 602 ms of which 5 ms to minimize.
[2024-05-31 23:40:55] [INFO ] Deduced a trap composed of 129 places in 602 ms of which 6 ms to minimize.
[2024-05-31 23:40:55] [INFO ] Deduced a trap composed of 87 places in 613 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/901 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 34/935 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/935 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/963 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/963 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 16/979 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/979 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 5043ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4272/4272 transitions.
Applied a total of 0 rules in 121 ms. Remains 979 /979 variables (removed 0) and now considering 4272/4272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 979/979 places, 4272/4272 transitions.
RANDOM walk for 40000 steps (840 resets) in 1392 ms. (28 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (120 resets) in 243 ms. (163 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (118 resets) in 255 ms. (156 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 64933 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 2
Probabilistic random walk after 64933 steps, saw 27381 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-31 23:40:59] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-31 23:40:59] [INFO ] Invariant cache hit.
[2024-05-31 23:40:59] [INFO ] State equation strengthened by 2721 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 882/883 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/883 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/901 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:41:00] [INFO ] Deduced a trap composed of 177 places in 599 ms of which 5 ms to minimize.
[2024-05-31 23:41:01] [INFO ] Deduced a trap composed of 247 places in 589 ms of which 5 ms to minimize.
[2024-05-31 23:41:01] [INFO ] Deduced a trap composed of 137 places in 600 ms of which 6 ms to minimize.
[2024-05-31 23:41:02] [INFO ] Deduced a trap composed of 182 places in 604 ms of which 6 ms to minimize.
[2024-05-31 23:41:03] [INFO ] Deduced a trap composed of 92 places in 590 ms of which 5 ms to minimize.
[2024-05-31 23:41:03] [INFO ] Deduced a trap composed of 129 places in 596 ms of which 6 ms to minimize.
[2024-05-31 23:41:04] [INFO ] Deduced a trap composed of 87 places in 591 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/901 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 34/935 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/935 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/963 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/963 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 16/979 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/979 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3875/4854 variables, 979/1035 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4854 variables, 2721/3756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4854 variables, 0/3756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/4854 variables, 0/3756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4854/4854 variables, and 3756 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6030 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 979/979 constraints, ReadFeed: 2721/2721 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 882/883 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/883 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/901 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/901 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 34/935 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:41:06] [INFO ] Deduced a trap composed of 5 places in 501 ms of which 5 ms to minimize.
[2024-05-31 23:41:07] [INFO ] Deduced a trap composed of 46 places in 527 ms of which 6 ms to minimize.
[2024-05-31 23:41:07] [INFO ] Deduced a trap composed of 160 places in 515 ms of which 6 ms to minimize.
[2024-05-31 23:41:08] [INFO ] Deduced a trap composed of 151 places in 502 ms of which 5 ms to minimize.
[2024-05-31 23:41:08] [INFO ] Deduced a trap composed of 189 places in 504 ms of which 6 ms to minimize.
[2024-05-31 23:41:09] [INFO ] Deduced a trap composed of 153 places in 509 ms of which 6 ms to minimize.
[2024-05-31 23:41:09] [INFO ] Deduced a trap composed of 151 places in 511 ms of which 6 ms to minimize.
[2024-05-31 23:41:10] [INFO ] Deduced a trap composed of 152 places in 483 ms of which 6 ms to minimize.
[2024-05-31 23:41:10] [INFO ] Deduced a trap composed of 157 places in 451 ms of which 6 ms to minimize.
[2024-05-31 23:41:11] [INFO ] Deduced a trap composed of 140 places in 486 ms of which 6 ms to minimize.
[2024-05-31 23:41:11] [INFO ] Deduced a trap composed of 141 places in 480 ms of which 6 ms to minimize.
[2024-05-31 23:41:12] [INFO ] Deduced a trap composed of 140 places in 491 ms of which 6 ms to minimize.
[2024-05-31 23:41:12] [INFO ] Deduced a trap composed of 150 places in 490 ms of which 5 ms to minimize.
[2024-05-31 23:41:13] [INFO ] Deduced a trap composed of 140 places in 512 ms of which 6 ms to minimize.
[2024-05-31 23:41:13] [INFO ] Deduced a trap composed of 139 places in 489 ms of which 5 ms to minimize.
[2024-05-31 23:41:14] [INFO ] Deduced a trap composed of 159 places in 507 ms of which 6 ms to minimize.
[2024-05-31 23:41:14] [INFO ] Deduced a trap composed of 173 places in 493 ms of which 5 ms to minimize.
[2024-05-31 23:41:15] [INFO ] Deduced a trap composed of 161 places in 486 ms of which 5 ms to minimize.
[2024-05-31 23:41:15] [INFO ] Deduced a trap composed of 197 places in 485 ms of which 5 ms to minimize.
[2024-05-31 23:41:16] [INFO ] Deduced a trap composed of 157 places in 496 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/935 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:41:16] [INFO ] Deduced a trap composed of 160 places in 496 ms of which 6 ms to minimize.
[2024-05-31 23:41:17] [INFO ] Deduced a trap composed of 148 places in 482 ms of which 5 ms to minimize.
[2024-05-31 23:41:17] [INFO ] Deduced a trap composed of 160 places in 486 ms of which 5 ms to minimize.
[2024-05-31 23:41:18] [INFO ] Deduced a trap composed of 46 places in 516 ms of which 5 ms to minimize.
[2024-05-31 23:41:18] [INFO ] Deduced a trap composed of 88 places in 491 ms of which 6 ms to minimize.
[2024-05-31 23:41:19] [INFO ] Deduced a trap composed of 71 places in 487 ms of which 5 ms to minimize.
[2024-05-31 23:41:20] [INFO ] Deduced a trap composed of 144 places in 512 ms of which 6 ms to minimize.
[2024-05-31 23:41:20] [INFO ] Deduced a trap composed of 205 places in 517 ms of which 6 ms to minimize.
[2024-05-31 23:41:21] [INFO ] Deduced a trap composed of 223 places in 489 ms of which 6 ms to minimize.
[2024-05-31 23:41:21] [INFO ] Deduced a trap composed of 208 places in 492 ms of which 6 ms to minimize.
[2024-05-31 23:41:22] [INFO ] Deduced a trap composed of 177 places in 493 ms of which 5 ms to minimize.
[2024-05-31 23:41:22] [INFO ] Deduced a trap composed of 182 places in 513 ms of which 5 ms to minimize.
[2024-05-31 23:41:23] [INFO ] Deduced a trap composed of 149 places in 516 ms of which 5 ms to minimize.
[2024-05-31 23:41:23] [INFO ] Deduced a trap composed of 155 places in 477 ms of which 6 ms to minimize.
[2024-05-31 23:41:24] [INFO ] Deduced a trap composed of 149 places in 495 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/935 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 28/963 variables, 28/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:41:24] [INFO ] Deduced a trap composed of 183 places in 523 ms of which 5 ms to minimize.
[2024-05-31 23:41:25] [INFO ] Deduced a trap composed of 72 places in 613 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/963 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/963 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 16/979 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/979 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3875/4854 variables, 979/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4854 variables, 2721/3793 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4854 variables, 2/3795 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:41:29] [INFO ] Deduced a trap composed of 76 places in 627 ms of which 5 ms to minimize.
[2024-05-31 23:41:29] [INFO ] Deduced a trap composed of 420 places in 519 ms of which 6 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4854 variables, 2/3797 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4854 variables, 0/3797 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/4854 variables, 0/3797 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4854/4854 variables, and 3797 constraints, problems are : Problem set: 0 solved, 2 unsolved in 24674 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 979/979 constraints, ReadFeed: 2721/2721 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 46/46 constraints]
After SMT, in 30738ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 155 ms.
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4272/4272 transitions.
Applied a total of 0 rules in 130 ms. Remains 979 /979 variables (removed 0) and now considering 4272/4272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 979/979 places, 4272/4272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4272/4272 transitions.
Applied a total of 0 rules in 126 ms. Remains 979 /979 variables (removed 0) and now considering 4272/4272 (removed 0) transitions.
[2024-05-31 23:41:31] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-31 23:41:31] [INFO ] Invariant cache hit.
[2024-05-31 23:41:32] [INFO ] Implicit Places using invariants in 1334 ms returned []
[2024-05-31 23:41:32] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-31 23:41:32] [INFO ] Invariant cache hit.
[2024-05-31 23:41:33] [INFO ] State equation strengthened by 2721 read => feed constraints.
[2024-05-31 23:42:03] [INFO ] Performed 744/979 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:42:16] [INFO ] Implicit Places using invariants and state equation in 43697 ms returned []
Implicit Place search using SMT with State Equation took 45056 ms to find 0 implicit places.
[2024-05-31 23:42:16] [INFO ] Redundant transitions in 218 ms returned []
Running 4210 sub problems to find dead transitions.
[2024-05-31 23:42:16] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-31 23:42:16] [INFO ] Invariant cache hit.
[2024-05-31 23:42:16] [INFO ] State equation strengthened by 2721 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4210 unsolved
SMT process timed out in 60151ms, After SMT, problems are : Problem set: 0 solved, 4210 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105617 ms. Remains : 979/979 places, 4272/4272 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13 in 369471 ms.
[2024-05-31 23:43:17] [INFO ] Flatten gal took : 338 ms
[2024-05-31 23:43:17] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2024-05-31 23:43:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 984 places, 4278 transitions and 21331 arcs took 26 ms.
Total runtime 1724773 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13

BK_STOP 1717198997388

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01
ub formula formula --maxsum=/tmp/2224/ub_0_
ub formula name MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02
ub formula formula --maxsum=/tmp/2224/ub_1_
ub formula name MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13
ub formula formula --maxsum=/tmp/2224/ub_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="MultiCrashLeafsetExtension-PT-S16C08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C08, 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 r508-tall-171654350800053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C08.tgz
mv MultiCrashLeafsetExtension-PT-S16C08 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;