About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S24C07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12661.924 | 1902268.00 | 2096806.00 | 4071.10 | 1 1 1 1 1 1 1 1 ? 0 0 1 ? 0 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-171654350900101.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-S24C07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654350900101
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 12 07:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Apr 12 07:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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:28 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 14M 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-S24C07-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717205618271
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-S24C07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 01:33:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 01:33:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 01:33:40] [INFO ] Load time of PNML (sax parser for PT used): 673 ms
[2024-06-01 01:33:40] [INFO ] Transformed 13822 places.
[2024-06-01 01:33:40] [INFO ] Transformed 20365 transitions.
[2024-06-01 01:33:40] [INFO ] Parsed PT model containing 13822 places and 20365 transitions and 77774 arcs in 861 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 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-06-01 01:33:40] [INFO ] Flow matrix only has 19765 transitions (discarded 600 similar events)
// Phase 1: matrix 19765 rows 13822 cols
[2024-06-01 01:33:42] [INFO ] Computed 1083 invariants in 1634 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:[25, 75, 25, 25, 75, 25, 25, 75, 1, 1, 1, 75, 25, 1, 75, 25]
RANDOM walk for 10000 steps (138 resets) in 299 ms. (33 steps per ms)
BEST_FIRST walk for 160016 steps (416 resets) in 744 ms. (214 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1] Max Struct:[25, 75, 25, 25, 75, 25, 25, 75, 1, 1, 1, 75, 25, 1, 75, 25]
[2024-06-01 01:33:43] [INFO ] Flow matrix only has 19765 transitions (discarded 600 similar events)
[2024-06-01 01:33:43] [INFO ] Invariant cache hit.
[2024-06-01 01:33:45] [INFO ] [Real]Absence check using 68 positive place invariants in 314 ms returned sat
[2024-06-01 01:33:45] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 304 ms returned unsat
[2024-06-01 01:33:47] [INFO ] [Real]Absence check using 68 positive place invariants in 294 ms returned sat
[2024-06-01 01:33:47] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 482 ms returned sat
[2024-06-01 01:33:49] [INFO ] [Real]Absence check using state equation in 2163 ms returned sat
[2024-06-01 01:33:50] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-06-01 01:33:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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-06-01 01:33:52] [INFO ] [Real]Absence check using 68 positive place invariants in 298 ms returned sat
[2024-06-01 01:33:52] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 520 ms returned sat
[2024-06-01 01:33:54] [INFO ] [Real]Absence check using state equation in 2175 ms returned sat
[2024-06-01 01:33: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 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.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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-06-01 01:33:57] [INFO ] [Real]Absence check using 68 positive place invariants in 289 ms returned sat
[2024-06-01 01:33:57] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 278 ms returned unsat
[2024-06-01 01:33:59] [INFO ] [Real]Absence check using 68 positive place invariants in 300 ms returned sat
[2024-06-01 01:33:59] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 303 ms returned unsat
[2024-06-01 01:34:00] [INFO ] [Real]Absence check using 68 positive place invariants in 287 ms returned sat
[2024-06-01 01:34:01] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 300 ms returned unsat
[2024-06-01 01:34:02] [INFO ] [Real]Absence check using 68 positive place invariants in 287 ms returned sat
[2024-06-01 01:34:03] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 298 ms returned unsat
[2024-06-01 01:34:04] [INFO ] [Real]Absence check using 68 positive place invariants in 295 ms returned sat
[2024-06-01 01:34:05] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 519 ms returned sat
[2024-06-01 01:34:07] [INFO ] [Real]Absence check using state equation in 2106 ms returned sat
[2024-06-01 01:34:08] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:34:08] [INFO ] [Real]Added 6202 Read/Feed constraints in 316 ms returned unknown
[2024-06-01 01:34:09] [INFO ] [Real]Absence check using 68 positive place invariants in 294 ms returned sat
[2024-06-01 01:34:10] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 538 ms returned sat
[2024-06-01 01:34:12] [INFO ] [Real]Absence check using state equation in 2184 ms returned sat
[2024-06-01 01:34:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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-06-01 01:34:14] [INFO ] [Real]Absence check using 68 positive place invariants in 300 ms returned sat
[2024-06-01 01:34:15] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 515 ms returned sat
[2024-06-01 01:34:17] [INFO ] [Real]Absence check using state equation in 2174 ms returned sat
[2024-06-01 01:34:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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-06-01 01:34:19] [INFO ] [Real]Absence check using 68 positive place invariants in 296 ms returned sat
[2024-06-01 01:34:20] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 507 ms returned sat
[2024-06-01 01:34:22] [INFO ] [Real]Absence check using state equation in 2141 ms returned sat
[2024-06-01 01:34:23] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:34:23] [INFO ] [Real]Added 6202 Read/Feed constraints in 272 ms returned unknown
[2024-06-01 01:34:24] [INFO ] [Real]Absence check using 68 positive place invariants in 286 ms returned sat
[2024-06-01 01:34:25] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 514 ms returned sat
[2024-06-01 01:34:27] [INFO ] [Real]Absence check using state equation in 2111 ms returned sat
[2024-06-01 01:34:28] [INFO ] [Real]Added 6202 Read/Feed constraints in 376 ms returned sat
[2024-06-01 01:34:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:34:29] [INFO ] [Nat]Absence check using 68 positive place invariants in 309 ms returned sat
[2024-06-01 01:34:30] [INFO ] [Nat]Absence check using 68 positive and 1015 generalized place invariants in 519 ms returned sat
[2024-06-01 01:34:32] [INFO ] [Nat]Absence check using state equation in 2127 ms returned sat
[2024-06-01 01:34:32] [INFO ] [Nat]Added 6202 Read/Feed constraints in 363 ms returned sat
[2024-06-01 01:35:09] [INFO ] Deduced a trap composed of 1230 places in 36245 ms of which 623 ms to minimize.
[2024-06-01 01:35:09] [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-06-01 01:35:11] [INFO ] [Real]Absence check using 68 positive place invariants in 286 ms returned sat
[2024-06-01 01:35:11] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 530 ms returned sat
[2024-06-01 01:35:13] [INFO ] [Real]Absence check using state equation in 2174 ms returned sat
[2024-06-01 01:35:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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-06-01 01:35:16] [INFO ] [Real]Absence check using 68 positive place invariants in 294 ms returned sat
[2024-06-01 01:35:16] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 524 ms returned sat
[2024-06-01 01:35:18] [INFO ] [Real]Absence check using state equation in 2186 ms returned sat
[2024-06-01 01:35:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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-06-01 01:35:21] [INFO ] [Real]Absence check using 68 positive place invariants in 284 ms returned sat
[2024-06-01 01:35:21] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 304 ms returned unsat
[2024-06-01 01:35:23] [INFO ] [Real]Absence check using 68 positive place invariants in 283 ms returned sat
[2024-06-01 01:35:23] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 301 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1] Max Struct:[1, 75, 25, 1, 1, 1, 1, 75, 1, 1, 1, 75, 25, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C07-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, 0, 0, 0] Max Struct:[75, 25, 75, 1, 1, 1, 75, 25, 1]
Support contains 9 out of 13822 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13822/13822 places, 20365/20365 transitions.
Graph (complete) has 45351 edges and 13822 vertex of which 13780 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.40 ms
Discarding 42 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4195 transitions
Trivial Post-agglo rules discarded 4195 transitions
Performed 4195 trivial Post agglomeration. Transition count delta: 4195
Iterating post reduction 0 with 4195 rules applied. Total rules applied 4196 place count 13780 transition count 16170
Reduce places removed 4195 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 4198 rules applied. Total rules applied 8394 place count 9585 transition count 16167
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 8397 place count 9582 transition count 16167
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 350 Pre rules applied. Total rules applied 8397 place count 9582 transition count 15817
Deduced a syphon composed of 350 places in 13 ms
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 3 with 700 rules applied. Total rules applied 9097 place count 9232 transition count 15817
Discarding 3845 places :
Symmetric choice reduction at 3 with 3845 rule applications. Total rules 12942 place count 5387 transition count 11972
Iterating global reduction 3 with 3845 rules applied. Total rules applied 16787 place count 5387 transition count 11972
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 16787 place count 5387 transition count 11962
Deduced a syphon composed of 10 places in 22 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 16807 place count 5377 transition count 11962
Discarding 545 places :
Symmetric choice reduction at 3 with 545 rule applications. Total rules 17352 place count 4832 transition count 8147
Iterating global reduction 3 with 545 rules applied. Total rules applied 17897 place count 4832 transition count 8147
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 7 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 17947 place count 4807 transition count 8122
Free-agglomeration rule (complex) applied 341 times.
Iterating global reduction 3 with 341 rules applied. Total rules applied 18288 place count 4807 transition count 11051
Reduce places removed 341 places and 0 transitions.
Iterating post reduction 3 with 341 rules applied. Total rules applied 18629 place count 4466 transition count 11051
Partial Free-agglomeration rule applied 100 times.
Drop transitions (Partial Free agglomeration) removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 18729 place count 4466 transition count 11051
Applied a total of 18729 rules in 5077 ms. Remains 4466 /13822 variables (removed 9356) and now considering 11051/20365 (removed 9314) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5089 ms. Remains : 4466/13822 places, 11051/20365 transitions.
[2024-06-01 01:35:28] [INFO ] Flow matrix only has 10165 transitions (discarded 886 similar events)
// Phase 1: matrix 10165 rows 4466 cols
[2024-06-01 01:35:28] [INFO ] Computed 1041 invariants in 266 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 1, 2, 1, 1, 1, 2, 1, 1]
RANDOM walk for 810126 steps (18674 resets) in 30001 ms. (27 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6921186 steps (20093 resets) in 40008 ms. (172 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0] Max Struct:[2, 2, 1, 1, 1, 2, 1, 1]
[2024-06-01 01:36:38] [INFO ] Flow matrix only has 10165 transitions (discarded 886 similar events)
[2024-06-01 01:36:38] [INFO ] Invariant cache hit.
[2024-06-01 01:36:39] [INFO ] [Real]Absence check using 49 positive place invariants in 108 ms returned sat
[2024-06-01 01:36:39] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 118 ms returned unsat
[2024-06-01 01:36:40] [INFO ] [Real]Absence check using 49 positive place invariants in 109 ms returned sat
[2024-06-01 01:36:40] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 34 ms returned unsat
[2024-06-01 01:36:40] [INFO ] [Real]Absence check using 49 positive place invariants in 98 ms returned sat
[2024-06-01 01:36:40] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 205 ms returned sat
[2024-06-01 01:36:44] [INFO ] [Real]Absence check using state equation in 3317 ms returned sat
[2024-06-01 01:36:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:36:44] [INFO ] [Nat]Absence check using 49 positive place invariants in 94 ms returned sat
[2024-06-01 01:36:45] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 204 ms returned sat
[2024-06-01 01:36:48] [INFO ] [Nat]Absence check using state equation in 3306 ms returned sat
[2024-06-01 01:36:48] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-06-01 01:36:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:36:57] [INFO ] [Nat]Added 6202 Read/Feed constraints in 9384 ms returned unknown
[2024-06-01 01:36:58] [INFO ] [Real]Absence check using 49 positive place invariants in 98 ms returned sat
[2024-06-01 01:36:58] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 204 ms returned sat
[2024-06-01 01:37:01] [INFO ] [Real]Absence check using state equation in 3390 ms returned sat
[2024-06-01 01:37:02] [INFO ] [Real]Added 6202 Read/Feed constraints in 890 ms returned sat
[2024-06-01 01:37:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:37:03] [INFO ] [Nat]Absence check using 49 positive place invariants in 94 ms returned sat
[2024-06-01 01:37:03] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 200 ms returned sat
[2024-06-01 01:37:07] [INFO ] [Nat]Absence check using state equation in 3342 ms returned sat
[2024-06-01 01:37:12] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:37:12] [INFO ] [Nat]Added 6202 Read/Feed constraints in 5646 ms returned unsat
[2024-06-01 01:37:13] [INFO ] [Real]Absence check using 49 positive place invariants in 92 ms returned sat
[2024-06-01 01:37:13] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 201 ms returned sat
[2024-06-01 01:37:16] [INFO ] [Real]Absence check using state equation in 3357 ms returned sat
[2024-06-01 01:37:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:37:17] [INFO ] [Nat]Absence check using 49 positive place invariants in 93 ms returned sat
[2024-06-01 01:37:17] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 203 ms returned sat
[2024-06-01 01:37:21] [INFO ] [Nat]Absence check using state equation in 3290 ms returned sat
[2024-06-01 01:37:25] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:37:30] [INFO ] [Nat]Added 6202 Read/Feed constraints in 9345 ms returned unknown
[2024-06-01 01:37:30] [INFO ] [Real]Absence check using 49 positive place invariants in 93 ms returned sat
[2024-06-01 01:37:31] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 202 ms returned sat
[2024-06-01 01:37:34] [INFO ] [Real]Absence check using state equation in 3290 ms returned sat
[2024-06-01 01:37:35] [INFO ] [Real]Added 6202 Read/Feed constraints in 1134 ms returned sat
[2024-06-01 01:37:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:37:36] [INFO ] [Nat]Absence check using 49 positive place invariants in 95 ms returned sat
[2024-06-01 01:37:36] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 196 ms returned sat
[2024-06-01 01:37:40] [INFO ] [Nat]Absence check using state equation in 3477 ms returned sat
[2024-06-01 01:37:44] [INFO ] [Nat]Added 6202 Read/Feed constraints in 4360 ms returned sat
[2024-06-01 01:37:45] [INFO ] Computed and/alt/rep : 4617/6654/4617 causal constraints (skipped 5523 transitions) in 948 ms.
[2024-06-01 01:37:47] [INFO ] Added : 7 causal constraints over 2 iterations in 2646 ms. Result :sat
Minimization took 8912 ms.
[2024-06-01 01:37:56] [INFO ] [Real]Absence check using 49 positive place invariants in 94 ms returned sat
[2024-06-01 01:37:57] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 207 ms returned sat
[2024-06-01 01:38:01] [INFO ] [Real]Absence check using state equation in 3993 ms returned sat
[2024-06-01 01:38:02] [INFO ] [Real]Added 6202 Read/Feed constraints in 1265 ms returned sat
[2024-06-01 01:38:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:38:03] [INFO ] [Nat]Absence check using 49 positive place invariants in 95 ms returned sat
[2024-06-01 01:38:03] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 208 ms returned sat
[2024-06-01 01:38:08] [INFO ] [Nat]Absence check using state equation in 5197 ms returned sat
[2024-06-01 01:38:13] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:38:15] [INFO ] [Nat]Added 6202 Read/Feed constraints in 6338 ms returned sat
[2024-06-01 01:38:20] [INFO ] Deduced a trap composed of 398 places in 5126 ms of which 32 ms to minimize.
[2024-06-01 01:38:28] [INFO ] Deduced a trap composed of 300 places in 5263 ms of which 40 ms to minimize.
[2024-06-01 01:38:37] [INFO ] Deduced a trap composed of 372 places in 5242 ms of which 29 ms to minimize.
[2024-06-01 01:38:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 24677 ms
[2024-06-01 01:38:40] [INFO ] Computed and/alt/rep : 4617/6654/4617 causal constraints (skipped 5523 transitions) in 902 ms.
[2024-06-01 01:38:42] [INFO ] Added : 8 causal constraints over 2 iterations in 2548 ms. Result :sat
Minimization took 5547 ms.
[2024-06-01 01:38:48] [INFO ] [Real]Absence check using 49 positive place invariants in 94 ms returned sat
[2024-06-01 01:38:48] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 206 ms returned sat
[2024-06-01 01:38:51] [INFO ] [Real]Absence check using state equation in 3300 ms returned sat
[2024-06-01 01:38:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:38:52] [INFO ] [Nat]Absence check using 49 positive place invariants in 93 ms returned sat
[2024-06-01 01:38:52] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 206 ms returned sat
[2024-06-01 01:38:56] [INFO ] [Nat]Absence check using state equation in 3344 ms returned sat
[2024-06-01 01:39:00] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:39:02] [INFO ] [Nat]Added 6202 Read/Feed constraints in 6561 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 0, 1, 2, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 2, 1]
Support contains 4 out of 4466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4466/4466 places, 11051/11051 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 4466 transition count 11050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4465 transition count 11050
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 4465 transition count 11048
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 4463 transition count 11048
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 8 place count 4461 transition count 11046
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 4461 transition count 11046
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 4461 transition count 11046
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 4460 transition count 11045
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 4460 transition count 11045
Applied a total of 13 rules in 2205 ms. Remains 4460 /4466 variables (removed 6) and now considering 11045/11051 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2205 ms. Remains : 4460/4466 places, 11045/11051 transitions.
[2024-06-01 01:39:04] [INFO ] Flow matrix only has 10159 transitions (discarded 886 similar events)
// Phase 1: matrix 10159 rows 4460 cols
[2024-06-01 01:39:05] [INFO ] Computed 1041 invariants in 273 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 2, 1]
RANDOM walk for 832778 steps (19204 resets) in 30001 ms. (27 steps per ms)
BEST_FIRST walk for 3535924 steps (10265 resets) in 20004 ms. (176 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 2, 1]
[2024-06-01 01:39:55] [INFO ] Flow matrix only has 10159 transitions (discarded 886 similar events)
[2024-06-01 01:39:55] [INFO ] Invariant cache hit.
[2024-06-01 01:39:55] [INFO ] [Real]Absence check using 49 positive place invariants in 88 ms returned sat
[2024-06-01 01:39:55] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 205 ms returned sat
[2024-06-01 01:39:59] [INFO ] [Real]Absence check using state equation in 3560 ms returned sat
[2024-06-01 01:39:59] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-06-01 01:40:01] [INFO ] [Real]Added 6202 Read/Feed constraints in 1845 ms returned sat
[2024-06-01 01:40:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:40:02] [INFO ] [Nat]Absence check using 49 positive place invariants in 88 ms returned sat
[2024-06-01 01:40:02] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 202 ms returned sat
[2024-06-01 01:40:05] [INFO ] [Nat]Absence check using state equation in 3273 ms returned sat
[2024-06-01 01:40:10] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:40:15] [INFO ] [Nat]Added 6202 Read/Feed constraints in 9335 ms returned unknown
[2024-06-01 01:40:15] [INFO ] [Real]Absence check using 49 positive place invariants in 91 ms returned sat
[2024-06-01 01:40:15] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 207 ms returned sat
[2024-06-01 01:40:18] [INFO ] [Real]Absence check using state equation in 3223 ms returned sat
[2024-06-01 01:40:19] [INFO ] [Real]Added 6202 Read/Feed constraints in 751 ms returned unsat
[2024-06-01 01:40:20] [INFO ] [Real]Absence check using 49 positive place invariants in 90 ms returned sat
[2024-06-01 01:40:20] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 205 ms returned sat
[2024-06-01 01:40:24] [INFO ] [Real]Absence check using state equation in 3367 ms returned sat
[2024-06-01 01:40:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:40:24] [INFO ] [Nat]Absence check using 49 positive place invariants in 94 ms returned sat
[2024-06-01 01:40:24] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 212 ms returned sat
[2024-06-01 01:40:28] [INFO ] [Nat]Absence check using state equation in 4024 ms returned sat
[2024-06-01 01:40:33] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:40:33] [INFO ] [Nat]Added 6202 Read/Feed constraints in 4976 ms returned sat
[2024-06-01 01:40:35] [INFO ] Computed and/alt/rep : 4613/6647/4613 causal constraints (skipped 5521 transitions) in 859 ms.
[2024-06-01 01:40:36] [INFO ] Added : 7 causal constraints over 2 iterations in 2562 ms. Result :sat
Minimization took 5746 ms.
[2024-06-01 01:40:42] [INFO ] [Real]Absence check using 49 positive place invariants in 97 ms returned sat
[2024-06-01 01:40:43] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 218 ms returned sat
[2024-06-01 01:40:46] [INFO ] [Real]Absence check using state equation in 3325 ms returned sat
[2024-06-01 01:40:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:40:47] [INFO ] [Nat]Absence check using 49 positive place invariants in 95 ms returned sat
[2024-06-01 01:40:47] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 205 ms returned sat
[2024-06-01 01:40:50] [INFO ] [Nat]Absence check using state equation in 3520 ms returned sat
[2024-06-01 01:40:55] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:40:56] [INFO ] [Nat]Added 6202 Read/Feed constraints in 5888 ms returned sat
[2024-06-01 01:41:02] [INFO ] Deduced a trap composed of 391 places in 5238 ms of which 30 ms to minimize.
[2024-06-01 01:41:10] [INFO ] Deduced a trap composed of 604 places in 5252 ms of which 30 ms to minimize.
[2024-06-01 01:41:17] [INFO ] Deduced a trap composed of 419 places in 5222 ms of which 29 ms to minimize.
[2024-06-01 01:41:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 22474 ms
[2024-06-01 01:41:20] [INFO ] Computed and/alt/rep : 4613/6647/4613 causal constraints (skipped 5521 transitions) in 676 ms.
[2024-06-01 01:41:21] [INFO ] Added : 8 causal constraints over 2 iterations in 2286 ms. Result :sat
Minimization took 5714 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 0, 2, 1]
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 2, 1]
Support contains 3 out of 4460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4460/4460 places, 11045/11045 transitions.
Applied a total of 0 rules in 557 ms. Remains 4460 /4460 variables (removed 0) and now considering 11045/11045 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 559 ms. Remains : 4460/4460 places, 11045/11045 transitions.
[2024-06-01 01:41:27] [INFO ] Flow matrix only has 10159 transitions (discarded 886 similar events)
[2024-06-01 01:41:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 2, 1]
RANDOM walk for 824514 steps (19007 resets) in 30001 ms. (27 steps per ms)
BEST_FIRST walk for 2628360 steps (7630 resets) in 15003 ms. (175 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 2, 1]
[2024-06-01 01:42:12] [INFO ] Flow matrix only has 10159 transitions (discarded 886 similar events)
[2024-06-01 01:42:12] [INFO ] Invariant cache hit.
[2024-06-01 01:42:13] [INFO ] [Real]Absence check using 49 positive place invariants in 88 ms returned sat
[2024-06-01 01:42:13] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 205 ms returned sat
[2024-06-01 01:42:17] [INFO ] [Real]Absence check using state equation in 3454 ms returned sat
[2024-06-01 01:42:17] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-06-01 01:42:19] [INFO ] [Real]Added 6202 Read/Feed constraints in 1875 ms returned sat
[2024-06-01 01:42:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:42:19] [INFO ] [Nat]Absence check using 49 positive place invariants in 92 ms returned sat
[2024-06-01 01:42:20] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 206 ms returned sat
[2024-06-01 01:42:23] [INFO ] [Nat]Absence check using state equation in 3292 ms returned sat
[2024-06-01 01:42:28] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:42:32] [INFO ] [Nat]Added 6202 Read/Feed constraints in 9335 ms returned unknown
[2024-06-01 01:42:33] [INFO ] [Real]Absence check using 49 positive place invariants in 89 ms returned sat
[2024-06-01 01:42:33] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 186 ms returned sat
[2024-06-01 01:42:36] [INFO ] [Real]Absence check using state equation in 3426 ms returned sat
[2024-06-01 01:42:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:42:37] [INFO ] [Nat]Absence check using 49 positive place invariants in 96 ms returned sat
[2024-06-01 01:42:37] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 221 ms returned sat
[2024-06-01 01:42:41] [INFO ] [Nat]Absence check using state equation in 4151 ms returned sat
[2024-06-01 01:42:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:42:46] [INFO ] [Nat]Added 6202 Read/Feed constraints in 5000 ms returned sat
[2024-06-01 01:42:47] [INFO ] Computed and/alt/rep : 4613/6647/4613 causal constraints (skipped 5521 transitions) in 658 ms.
[2024-06-01 01:42:49] [INFO ] Added : 7 causal constraints over 2 iterations in 2369 ms. Result :sat
Minimization took 5845 ms.
[2024-06-01 01:42:55] [INFO ] [Real]Absence check using 49 positive place invariants in 91 ms returned sat
[2024-06-01 01:42:56] [INFO ] [Real]Absence check using 49 positive and 992 generalized place invariants in 208 ms returned sat
[2024-06-01 01:42:59] [INFO ] [Real]Absence check using state equation in 3306 ms returned sat
[2024-06-01 01:42:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:43:00] [INFO ] [Nat]Absence check using 49 positive place invariants in 92 ms returned sat
[2024-06-01 01:43:00] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 209 ms returned sat
[2024-06-01 01:43:03] [INFO ] [Nat]Absence check using state equation in 3427 ms returned sat
[2024-06-01 01:43:08] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:43:09] [INFO ] [Nat]Added 6202 Read/Feed constraints in 6022 ms returned sat
[2024-06-01 01:43:15] [INFO ] Deduced a trap composed of 391 places in 4918 ms of which 29 ms to minimize.
[2024-06-01 01:43:23] [INFO ] Deduced a trap composed of 604 places in 5287 ms of which 31 ms to minimize.
[2024-06-01 01:43:31] [INFO ] Deduced a trap composed of 358 places in 5163 ms of which 30 ms to minimize.
[2024-06-01 01:43:37] [INFO ] Deduced a trap composed of 454 places in 5316 ms of which 29 ms to minimize.
[2024-06-01 01:43:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 29531 ms
[2024-06-01 01:43:40] [INFO ] Computed and/alt/rep : 4613/6647/4613 causal constraints (skipped 5521 transitions) in 662 ms.
[2024-06-01 01:43:41] [INFO ] Added : 8 causal constraints over 2 iterations in 2310 ms. Result :sat
Minimization took 3013 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 2, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 2, 1]
Support contains 3 out of 4460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4460/4460 places, 11045/11045 transitions.
Applied a total of 0 rules in 555 ms. Remains 4460 /4460 variables (removed 0) and now considering 11045/11045 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 555 ms. Remains : 4460/4460 places, 11045/11045 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4460/4460 places, 11045/11045 transitions.
Applied a total of 0 rules in 544 ms. Remains 4460 /4460 variables (removed 0) and now considering 11045/11045 (removed 0) transitions.
[2024-06-01 01:43:45] [INFO ] Flow matrix only has 10159 transitions (discarded 886 similar events)
[2024-06-01 01:43:45] [INFO ] Invariant cache hit.
[2024-06-01 01:44:00] [INFO ] Implicit Places using invariants in 14735 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 16, 20, 26, 34, 44, 56, 70, 86, 104, 124, 146, 169, 191, 192, 193, 194, 195, 196, 197, 198, 218, 236, 252, 266, 278, 288, 296, 302, 306, 308, 325, 331, 333, 334, 335, 336, 337, 338, 339, 340, 342, 346, 352, 360, 370, 382, 396, 412, 430, 450, 471, 491, 492, 493, 494, 495, 496, 497, 498, 516, 532, 546, 558, 568, 576, 582, 586, 588, 590, 607, 613, 615, 616, 617, 618, 619, 620, 621, 622, 624, 626, 630, 636, 644, 654, 666, 680, 696, 714, 733, 751, 752, 753, 754, 755, 756, 757, 758, 774, 788, 800, 810, 818, 824, 828, 830, 832, 834, 851, 857, 859, 860, 861, 862, 863, 864, 865, 866, 868, 870, 872, 876, 882, 890, 900, 912, 926, 942, 959, 975, 976, 977, 978, 979, 980, 981, 982, 996, 1008, 1018, 1026, 1032, 1036, 1038, 1040, 1042, 1044, 1061, 1067, 1069, 1070, 1071, 1072, 1073, 1074, 1075, 1076, 1078, 1080, 1082, 1084, 1088, 1094, 1102, 1112, 1124, 1138, 1153, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1186, 1196, 1204, 1210, 1214, 1216, 1218, 1220, 1222, 1224, 1241, 1247, 1249, 1250, 1251, 1252, 1253, 1254, 1255, 1256, 1258, 1260, 1262, 1264, 1266, 1270, 1276, 1284, 1294, 1306, 1319, 1331, 1332, 1333, 1334, 1335, 1336, 1337, 1338, 1348, 1356, 1362, 1366, 1368, 1370, 1372, 1374, 1376, 1378, 1395, 1401, 1403, 1404, 1405, 1406, 1407, 1408, 1409, 1410, 1412, 1414, 1416, 1418, 1420, 1422, 1426, 1432, 1440, 1450, 1461, 1471, 1472, 1473, 1474, 1475, 1476, 1477, 1478, 1486, 1492, 1496, 1498, 1500, 1502, 1504, 1506, 1508, 1510, 1527, 1533, 1535, 1536, 1537, 1538, 1539, 1540, 1541, 1542, 1544, 1546, 1548, 1550, 1552, 1554, 1556, 1560, 1566, 1574, 1583, 1591, 1592, 1593, 1594, 1595, 1596, 1597, 1598, 1604, 1608, 1610, 1612, 1614, 1616, 1618, 1620, 1622, 1624, 1641, 1647, 1649, 1650, 1651, 1652, 1653, 1654, 1655, 1656, 1658, 1660, 1662, 1664, 1666, 1668, 1670, 1672, 1676, 1682, 1689, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1706, 1708, 1710, 1712, 1714, 1716, 1718, 1720, 1722, 1724, 1741, 1747, 1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1758, 1760, 1762, 1764, 1766, 1768, 1770, 1772, 1774, 1778, 1783, 1787, 1788, 1789, 1790, 1791, 1792, 1793, 1794, 1796, 1798, 1800, 1802, 1804, 1806, 1808, 1810, 1812, 1814, 1831, 1837, 1839, 1840, 1841, 1842, 1843, 1844, 1845, 1846, 1848, 1850, 1852, 1854, 1856, 1858, 1860, 1862, 1864, 1866, 1869, 1871, 1872, 1873, 1874, 1875, 1876, 1877, 1878, 1880, 1882, 1884, 1886, 1888, 1890, 1892, 1894, 1896, 1898, 1915, 1921, 1923, 1924, 1925, 1926, 1927, 1928, 1929, 1930, 1932, 1934, 1936, 1938, 1940, 1942, 1944, 1946, 1948, 1950, 1952, 1954, 1955, 1956, 1957, 1958, 1959, 1960, 1961, 1963, 1965, 1967, 1969, 1971, 1973, 1975, 1977, 1979, 1981, 1998, 2000, 2003, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2014, 2016, 2018, 2020, 2022, 2024, 2026, 2028, 2030, 2032, 2034, 2036, 2037, 2038, 2039, 2040, 2041, 2042, 2043, 2045, 2047, 2049, 2051, 2053, 2055, 2057, 2059, 2061, 2063, 2080, 2086, 2088, 2089, 2090, 2091, 2092, 2093, 2095, 2097, 2099, 2101, 2103, 2105, 2107, 2109, 2111, 2113, 2116, 2118, 2120, 2121, 2122, 2123, 2124, 2125, 2126, 2127, 2129, 2131, 2133, 2135, 2137, 2139, 2141, 2143, 2145, 2147, 2164, 2170, 2172, 2173, 2174, 2175, 2176, 2177, 2178, 2179, 2181, 2183, 2185, 2187, 2189, 2191, 2193, 2195, 2197, 2199, 2201, 2204, 2205, 2206, 2207, 2208, 2209, 2211, 2213, 2215, 2217, 2219, 2221, 2223, 2227, 2229, 2231, 2233, 2250, 2256, 2258, 2259, 2260, 2261, 2262, 2263, 2264, 2265, 2267, 2269, 2271, 2273, 2275, 2277, 2279, 2281, 2283, 2285, 2289, 2294, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2305, 2307, 2309, 2311, 2313, 2315, 2317, 2319, 2321, 2323, 2340, 2346, 2348, 2349, 2350, 2351, 2352, 2353, 2354, 2355, 2357, 2359, 2361, 2363, 2365, 2367, 2369, 2371, 2373, 2377, 2383, 2390, 2391, 2392, 2393, 2394, 2395, 2396, 2397, 2403, 2407, 2409, 2411, 2413, 2415, 2417, 2419, 2421, 2423, 2440, 2446, 2448, 2449, 2450, 2451, 2452, 2453, 2454, 2455, 2457, 2459, 2461, 2463, 2465, 2467, 2469, 2471, 2475, 2481, 2489, 2498, 2499, 2500, 2501, 2502, 2503, 2504, 2505, 2513, 2519, 2523, 2525, 2527, 2529, 2531, 2533, 2535, 2537, 2554, 2560, 2562, 2563, 2564, 2565, 2566, 2567, 2568, 2569, 2571, 2573, 2575, 2577, 2579, 2581, 2583, 2587, 2593, 2601, 2611, 2622, 2623, 2624, 2625, 2626, 2627, 2628, 2629, 2639, 2647, 2653, 2657, 2659, 2661, 2663, 2665, 2667, 2669, 2686, 2692, 2694, 2695, 2696, 2697, 2698, 2699, 2700, 2701, 2703, 2705, 2707, 2709, 2711, 2713, 2717, 2723, 2731, 2741, 2753, 2766, 2767, 2768, 2769, 2770, 2771, 2772, 2773, 2785, 2795, 2803, 2809, 2813, 2815, 2817, 2819, 2821, 2823, 2840, 2846, 2848, 2849, 2850, 2851, 2852, 2853, 2854, 2855, 2857, 2859, 2861, 2863, 2865, 2869, 2875, 2883, 2893, 2905, 2919, 2934, 2935, 2936, 2937, 2938, 2939, 2940, 2941, 2955, 2967, 2977, 2985, 2991, 2995, 2997, 2999, 3001, 3003, 3020, 3026, 3028, 3029, 3030, 3031, 3032, 3033, 3034, 3035, 3037, 3039, 3041, 3043, 3047, 3053, 3061, 3071, 3083, 3097, 3113, 3130, 3131, 3132, 3133, 3134, 3135, 3136, 3137, 3153, 3167, 3179, 3189, 3197, 3203, 3207, 3209, 3211, 3213, 3230, 3236, 3238, 3239, 3240, 3241, 3242, 3243, 3244, 3245, 3247, 3249, 3251, 3255, 3261, 3269, 3279, 3291, 3305, 3321, 3339, 3358, 3359, 3360, 3361, 3362, 3363, 3364, 3365, 3383, 3399, 3413, 3425, 3435, 3443, 3449, 3453, 3455, 3457, 3474, 3480, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3491, 3493, 3497, 3503, 3511, 3521, 3533, 3547, 3563, 3581, 3601, 3622, 3623, 3624, 3625, 3626, 3627, 3628, 3629, 3649, 3667, 3683, 3697, 3709, 3719, 3727, 3733, 3737, 3739, 3756, 3758, 3761, 3763, 3764, 3765, 3766, 3767, 3768, 3769, 3770, 3772, 3776, 3782, 3790, 3800, 3812, 3826, 3842, 3860, 3880, 3902, 3925, 3926, 3927, 3928, 3929, 3930, 3931, 3932, 3954, 3974, 3992, 4008, 4022, 4034, 4044, 4052, 4058, 4062, 4079]
[2024-06-01 01:44:00] [INFO ] Actually due to overlaps returned [325, 607, 851, 1061, 1241, 1395, 1527, 1641, 1741, 1831, 1915, 1998, 2080, 2164, 2250, 2340, 2440, 2554, 2686, 2840, 3020, 3230, 3474, 3756, 4079, 4, 9, 10, 11, 12, 13, 14, 15, 191, 192, 193, 194, 195, 196, 197, 333, 334, 335, 336, 337, 338, 339, 491, 492, 493, 494, 495, 496, 497, 615, 616, 617, 618, 619, 620, 621, 751, 752, 753, 754, 755, 756, 757, 859, 860, 861, 862, 863, 864, 865, 975, 976, 977, 978, 979, 980, 981, 1069, 1070, 1071, 1072, 1073, 1074, 1075, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1249, 1250, 1251, 1252, 1253, 1254, 1255, 1331, 1332, 1333, 1334, 1335, 1336, 1337, 1403, 1404, 1405, 1406, 1407, 1408, 1409, 1471, 1472, 1473, 1474, 1475, 1476, 1477, 1535, 1536, 1537, 1538, 1539, 1540, 1541, 1591, 1592, 1593, 1594, 1595, 1596, 1597, 1649, 1650, 1651, 1652, 1653, 1654, 1655, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1749, 1750, 1751, 1752, 1753, 1754, 1755, 1787, 1788, 1789, 1790, 1791, 1792, 1793, 1839, 1840, 1841, 1842, 1843, 1844, 1845, 1871, 1872, 1873, 1874, 1875, 1876, 1877, 1923, 1924, 1925, 1926, 1927, 1928, 1929, 1954, 1955, 1956, 1957, 1958, 1959, 1960, 2000, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2036, 2037, 2038, 2039, 2040, 2041, 2042, 2088, 2089, 2090, 2091, 2092, 2093, 2120, 2121, 2122, 2123, 2124, 2125, 2126, 2172, 2173, 2174, 2175, 2176, 2177, 2178, 2204, 2205, 2206, 2207, 2208, 2209, 2258, 2259, 2260, 2261, 2262, 2263, 2264, 2294, 2295, 2296, 2297, 2298, 2299, 2300, 2348, 2349, 2350, 2351, 2352, 2353, 2354, 2390, 2391, 2392, 2393, 2394, 2395, 2396, 2448, 2449, 2450, 2451, 2452, 2453, 2454, 2498, 2499, 2500, 2501, 2502, 2503, 2504, 2562, 2563, 2564, 2565, 2566, 2567, 2568, 2622, 2623, 2624, 2625, 2626, 2627, 2628, 2694, 2695, 2696, 2697, 2698, 2699, 2700, 2766, 2767, 2768, 2769, 2770, 2771, 2772, 2848, 2849, 2850, 2851, 2852, 2853, 2854, 2934, 2935, 2936, 2937, 2938, 2939, 2940, 3028, 3029, 3030, 3031, 3032, 3033, 3034, 3130, 3131, 3132, 3133, 3134, 3135, 3136, 3238, 3239, 3240, 3241, 3242, 3243, 3244, 3358, 3359, 3360, 3361, 3362, 3363, 3364, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3622, 3623, 3624, 3625, 3626, 3627, 3628, 3758, 3763, 3764, 3765, 3766, 3767, 3768, 3769, 3925, 3926, 3927, 3928, 3929, 3930, 3931]
Discarding 376 places :
Implicit Place search using SMT only with invariants took 14769 ms to find 376 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 4084/4460 places, 11045/11045 transitions.
Discarding 334 places :
Symmetric choice reduction at 0 with 334 rule applications. Total rules 334 place count 3750 transition count 10711
Iterating global reduction 0 with 334 rules applied. Total rules applied 668 place count 3750 transition count 10711
Discarding 334 places :
Symmetric choice reduction at 0 with 334 rule applications. Total rules 1002 place count 3416 transition count 10377
Iterating global reduction 0 with 334 rules applied. Total rules applied 1336 place count 3416 transition count 10377
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 1339 place count 3416 transition count 10374
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 1342 place count 3413 transition count 10374
Applied a total of 1342 rules in 1533 ms. Remains 3413 /4084 variables (removed 671) and now considering 10374/11045 (removed 671) transitions.
[2024-06-01 01:44:02] [INFO ] Flow matrix only has 9488 transitions (discarded 886 similar events)
// Phase 1: matrix 9488 rows 3413 cols
[2024-06-01 01:44:02] [INFO ] Computed 665 invariants in 183 ms
[2024-06-01 01:44:12] [INFO ] Implicit Places using invariants in 10094 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 78, 96, 116, 138, 161, 183, 203, 221, 237, 251, 263, 273, 281, 287, 291, 293, 314, 316, 318, 322, 328, 336, 346, 358, 372, 388, 406, 426, 447, 467, 485, 501, 515, 527, 537, 545, 551, 555, 557, 559, 567, 569, 571, 573, 577, 583, 591, 601, 613, 627, 643, 661, 680, 698, 714, 728, 740, 750, 758, 764, 768, 770, 772, 774, 782, 784, 786, 788, 790, 794, 800, 808, 818, 830, 844, 860, 877, 893, 907, 919, 929, 937, 943, 947, 949, 951, 953, 955, 963, 965, 967, 969, 971, 973, 977, 983, 991, 1001, 1013, 1027, 1042, 1056, 1068, 1078, 1086, 1092, 1096, 1098, 1100, 1102, 1104, 1106, 1114, 1116, 1118, 1120, 1122, 1124, 1126, 1130, 1136, 1144, 1154, 1166, 1179, 1191, 1201, 1209, 1215, 1219, 1221, 1223, 1225, 1227, 1229, 1231, 1239, 1241, 1243, 1245, 1247, 1249, 1251, 1253, 1257, 1263, 1271, 1281, 1292, 1302, 1310, 1316, 1320, 1322, 1324, 1326, 1328, 1330, 1332, 1334, 1342, 1344, 1346, 1348, 1350, 1352, 1354, 1356, 1358, 1362, 1368, 1376, 1385, 1393, 1399, 1403, 1405, 1407, 1409, 1411, 1413, 1415, 1417, 1419, 1427, 1429, 1431, 1433, 1435, 1437, 1439, 1441, 1443, 1445, 1449, 1455, 1462, 1468, 1472, 1474, 1476, 1478, 1480, 1482, 1484, 1486, 1488, 1490, 1498, 1500, 1502, 1504, 1506, 1508, 1510, 1512, 1514, 1516, 1518, 1522, 1527, 1531, 1533, 1535, 1537, 1539, 1541, 1543, 1545, 1547, 1549, 1551, 1559, 1561, 1563, 1565, 1567, 1569, 1571, 1573, 1575, 1577, 1579, 1581, 1584, 1586, 1588, 1590, 1592, 1594, 1596, 1598, 1600, 1602, 1604, 1606, 1614, 1616, 1618, 1620, 1622, 1624, 1626, 1628, 1630, 1632, 1634, 1636, 1638, 1640, 1642, 1644, 1646, 1648, 1650, 1652, 1654, 1656, 1658, 1660, 1666, 1668, 1670, 1672, 1674, 1676, 1678, 1680, 1682, 1684, 1686, 1688, 1690, 1692, 1694, 1696, 1698, 1700, 1702, 1704, 1706, 1708, 1710, 1712, 1719, 1722, 1724, 1726, 1728, 1730, 1732, 1734, 1736, 1738, 1740, 1743, 1745, 1747, 1749, 1751, 1753, 1755, 1757, 1759, 1761, 1763, 1765, 1767, 1776, 1778, 1780, 1782, 1784, 1786, 1788, 1790, 1792, 1794, 1796, 1798, 1800, 1804, 1806, 1808, 1810, 1812, 1814, 1816, 1820, 1822, 1824, 1826, 1835, 1837, 1839, 1841, 1843, 1845, 1847, 1849, 1851, 1853, 1855, 1857, 1861, 1866, 1870, 1872, 1874, 1876, 1878, 1880, 1882, 1884, 1886, 1888, 1896, 1898, 1900, 1902, 1904, 1906, 1908, 1910, 1912, 1914, 1916, 1920, 1926, 1933, 1939, 1943, 1945, 1947, 1949, 1951, 1953, 1955, 1957, 1959, 1967, 1969, 1971, 1973, 1975, 1977, 1979, 1981, 1983, 1985, 1989, 1995, 2003, 2012, 2020, 2026, 2030, 2032, 2034, 2036, 2038, 2040, 2042, 2044, 2052, 2054, 2056, 2058, 2060, 2062, 2064, 2066, 2068, 2072, 2078, 2086, 2096, 2107, 2117, 2125, 2131, 2135, 2137, 2139, 2141, 2143, 2145, 2147, 2155, 2157, 2159, 2161, 2163, 2165, 2167, 2169, 2173, 2179, 2187, 2197, 2209, 2222, 2234, 2244, 2252, 2258, 2262, 2264, 2266, 2268, 2270, 2272, 2280, 2282, 2284, 2286, 2288, 2290, 2292, 2296, 2302, 2310, 2320, 2332, 2346, 2361, 2375, 2387, 2397, 2405, 2411, 2415, 2417, 2419, 2421, 2423, 2431, 2433, 2435, 2437, 2439, 2441, 2445, 2451, 2459, 2469, 2481, 2495, 2511, 2528, 2544, 2558, 2570, 2580, 2588, 2594, 2598, 2600, 2602, 2604, 2612, 2614, 2616, 2618, 2620, 2624, 2630, 2638, 2648, 2660, 2674, 2690, 2708, 2727, 2745, 2761, 2775, 2787, 2797, 2805, 2811, 2815, 2817, 2819, 2827, 2829, 2831, 2833, 2837, 2843, 2851, 2861, 2873, 2887, 2903, 2921, 2941, 2962, 2982, 3000, 3016, 3030, 3042, 3052, 3060, 3066, 3070, 3072, 3078, 3080, 3082, 3086, 3092, 3100, 3110, 3122, 3136, 3152, 3170, 3190, 3212, 3235, 3257, 3277, 3295, 3311, 3325, 3337, 3347, 3355, 3361, 3365]
Discarding 600 places :
Implicit Place search using SMT only with invariants took 10118 ms to find 600 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2813/4460 places, 10374/11045 transitions.
Applied a total of 0 rules in 513 ms. Remains 2813 /2813 variables (removed 0) and now considering 10374/10374 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 27481 ms. Remains : 2813/4460 places, 10374/11045 transitions.
[2024-06-01 01:44:12] [INFO ] Flow matrix only has 9488 transitions (discarded 886 similar events)
// Phase 1: matrix 9488 rows 2813 cols
[2024-06-01 01:44:12] [INFO ] Computed 65 invariants in 151 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 2, 1]
RANDOM walk for 855921 steps (20738 resets) in 30001 ms. (28 steps per ms)
BEST_FIRST walk for 3000003 steps (6450 resets) in 12306 ms. (243 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 2, 1]
[2024-06-01 01:44:55] [INFO ] Flow matrix only has 9488 transitions (discarded 886 similar events)
[2024-06-01 01:44:55] [INFO ] Invariant cache hit.
[2024-06-01 01:44:55] [INFO ] [Real]Absence check using 47 positive place invariants in 51 ms returned sat
[2024-06-01 01:44:55] [INFO ] [Real]Absence check using 47 positive and 18 generalized place invariants in 4 ms returned sat
[2024-06-01 01:44:58] [INFO ] [Real]Absence check using state equation in 3061 ms returned sat
[2024-06-01 01:44:58] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-06-01 01:45:00] [INFO ] [Real]Added 6202 Read/Feed constraints in 1202 ms returned sat
[2024-06-01 01:45:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:45:00] [INFO ] [Nat]Absence check using 47 positive place invariants in 50 ms returned sat
[2024-06-01 01:45:00] [INFO ] [Nat]Absence check using 47 positive and 18 generalized place invariants in 4 ms returned sat
[2024-06-01 01:45:03] [INFO ] [Nat]Absence check using state equation in 3182 ms returned sat
[2024-06-01 01:45:08] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:45:10] [INFO ] [Nat]Added 6202 Read/Feed constraints in 7129 ms returned sat
[2024-06-01 01:45:13] [INFO ] Deduced a trap composed of 318 places in 2098 ms of which 19 ms to minimize.
[2024-06-01 01:45:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2527 ms
[2024-06-01 01:45:13] [INFO ] Computed and/alt/rep : 4557/6605/4557 causal constraints (skipped 4837 transitions) in 585 ms.
[2024-06-01 01:45:15] [INFO ] Added : 18 causal constraints over 4 iterations in 2470 ms. Result :sat
Minimization took 12198 ms.
[2024-06-01 01:45:28] [INFO ] [Real]Absence check using 47 positive place invariants in 51 ms returned sat
[2024-06-01 01:45:28] [INFO ] [Real]Absence check using 47 positive and 18 generalized place invariants in 10 ms returned sat
[2024-06-01 01:45:31] [INFO ] [Real]Absence check using state equation in 3343 ms returned sat
[2024-06-01 01:45:32] [INFO ] [Real]Added 6202 Read/Feed constraints in 624 ms returned sat
[2024-06-01 01:45:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:45:33] [INFO ] [Nat]Absence check using 47 positive place invariants in 49 ms returned sat
[2024-06-01 01:45:33] [INFO ] [Nat]Absence check using 47 positive and 18 generalized place invariants in 6 ms returned sat
[2024-06-01 01:45:36] [INFO ] [Nat]Absence check using state equation in 3283 ms returned sat
[2024-06-01 01:45:41] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:45:42] [INFO ] [Nat]Added 6202 Read/Feed constraints in 5841 ms returned sat
[2024-06-01 01:45:42] [INFO ] Computed and/alt/rep : 4557/6605/4557 causal constraints (skipped 4837 transitions) in 578 ms.
[2024-06-01 01:45:44] [INFO ] Added : 12 causal constraints over 3 iterations in 2139 ms. Result :sat
Minimization took 12077 ms.
[2024-06-01 01:45:56] [INFO ] [Real]Absence check using 47 positive place invariants in 52 ms returned sat
[2024-06-01 01:45:56] [INFO ] [Real]Absence check using 47 positive and 18 generalized place invariants in 5 ms returned sat
[2024-06-01 01:45:59] [INFO ] [Real]Absence check using state equation in 2769 ms returned sat
[2024-06-01 01:46:00] [INFO ] [Real]Added 6202 Read/Feed constraints in 1093 ms returned sat
[2024-06-01 01:46:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:46:01] [INFO ] [Nat]Absence check using 47 positive place invariants in 50 ms returned sat
[2024-06-01 01:46:01] [INFO ] [Nat]Absence check using 47 positive and 18 generalized place invariants in 4 ms returned sat
[2024-06-01 01:46:04] [INFO ] [Nat]Absence check using state equation in 2798 ms returned sat
[2024-06-01 01:46:07] [INFO ] [Nat]Added 6202 Read/Feed constraints in 3310 ms returned sat
[2024-06-01 01:46:09] [INFO ] Deduced a trap composed of 266 places in 1976 ms of which 18 ms to minimize.
[2024-06-01 01:46:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4027 ms
[2024-06-01 01:46:12] [INFO ] Computed and/alt/rep : 4557/6605/4557 causal constraints (skipped 4837 transitions) in 548 ms.
[2024-06-01 01:46:13] [INFO ] Added : 13 causal constraints over 3 iterations in 2129 ms. Result :sat
Minimization took 11946 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 2, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 2, 1]
Support contains 3 out of 2813 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2813/2813 places, 10374/10374 transitions.
Applied a total of 0 rules in 490 ms. Remains 2813 /2813 variables (removed 0) and now considering 10374/10374 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 490 ms. Remains : 2813/2813 places, 10374/10374 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2813/2813 places, 10374/10374 transitions.
Applied a total of 0 rules in 489 ms. Remains 2813 /2813 variables (removed 0) and now considering 10374/10374 (removed 0) transitions.
[2024-06-01 01:46:26] [INFO ] Flow matrix only has 9488 transitions (discarded 886 similar events)
[2024-06-01 01:46:26] [INFO ] Invariant cache hit.
[2024-06-01 01:46:31] [INFO ] Implicit Places using invariants in 5363 ms returned []
Implicit Place search using SMT only with invariants took 5364 ms to find 0 implicit places.
Running 10280 sub problems to find dead transitions.
[2024-06-01 01:46:32] [INFO ] Flow matrix only has 9488 transitions (discarded 886 similar events)
[2024-06-01 01:46:32] [INFO ] Invariant cache hit.
[2024-06-01 01:46:32] [INFO ] State equation strengthened by 6202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2811 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 10280 unsolved
SMT process timed out in 92546ms, After SMT, problems are : Problem set: 0 solved, 10280 unsolved
Search for dead transitions found 0 dead transitions in 92669ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98580 ms. Remains : 2813/2813 places, 10374/10374 transitions.
RANDOM walk for 40000 steps (966 resets) in 1857 ms. (21 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (85 resets) in 236 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (85 resets) in 240 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (84 resets) in 256 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (84 resets) in 281 ms. (141 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (82 resets) in 184 ms. (216 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (83 resets) in 167 ms. (238 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 24662 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 6
Probabilistic random walk after 24662 steps, saw 10553 distinct states, run finished after 3004 ms. (steps per millisecond=8 ) properties seen :0
[2024-06-01 01:48:08] [INFO ] Flow matrix only has 9488 transitions (discarded 886 similar events)
[2024-06-01 01:48:08] [INFO ] Invariant cache hit.
[2024-06-01 01:48:08] [INFO ] State equation strengthened by 6202 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) 2709/2712 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 01:48:11] [INFO ] Deduced a trap composed of 277 places in 1995 ms of which 17 ms to minimize.
[2024-06-01 01:48:13] [INFO ] Deduced a trap composed of 270 places in 2070 ms of which 18 ms to minimize.
[2024-06-01 01:48:15] [INFO ] Deduced a trap composed of 138 places in 2008 ms of which 16 ms to minimize.
SMT process timed out in 6587ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 2813 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2813/2813 places, 10374/10374 transitions.
Applied a total of 0 rules in 491 ms. Remains 2813 /2813 variables (removed 0) and now considering 10374/10374 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 494 ms. Remains : 2813/2813 places, 10374/10374 transitions.
RANDOM walk for 40000 steps (968 resets) in 1633 ms. (24 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (86 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (85 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (83 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (83 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (83 resets) in 168 ms. (236 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (83 resets) in 169 ms. (235 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 26322 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 6
Probabilistic random walk after 26322 steps, saw 11240 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
[2024-06-01 01:48:19] [INFO ] Flow matrix only has 9488 transitions (discarded 886 similar events)
[2024-06-01 01:48:19] [INFO ] Invariant cache hit.
[2024-06-01 01:48:19] [INFO ] State equation strengthened by 6202 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) 2709/2712 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 01:48:21] [INFO ] Deduced a trap composed of 277 places in 2068 ms of which 17 ms to minimize.
[2024-06-01 01:48:24] [INFO ] Deduced a trap composed of 270 places in 2070 ms of which 17 ms to minimize.
[2024-06-01 01:48:26] [INFO ] Deduced a trap composed of 138 places in 2059 ms of which 17 ms to minimize.
[2024-06-01 01:48:28] [INFO ] Deduced a trap composed of 152 places in 2084 ms of which 17 ms to minimize.
[2024-06-01 01:48:30] [INFO ] Deduced a trap composed of 623 places in 2061 ms of which 18 ms to minimize.
[2024-06-01 01:48:32] [INFO ] Deduced a trap composed of 524 places in 2084 ms of which 17 ms to minimize.
[2024-06-01 01:48:34] [INFO ] Deduced a trap composed of 204 places in 2068 ms of which 17 ms to minimize.
[2024-06-01 01:48:36] [INFO ] Deduced a trap composed of 346 places in 2054 ms of which 18 ms to minimize.
[2024-06-01 01:48:38] [INFO ] Deduced a trap composed of 363 places in 2110 ms of which 18 ms to minimize.
[2024-06-01 01:48:40] [INFO ] Deduced a trap composed of 485 places in 2090 ms of which 18 ms to minimize.
[2024-06-01 01:48:43] [INFO ] Deduced a trap composed of 1142 places in 2056 ms of which 17 ms to minimize.
[2024-06-01 01:48:45] [INFO ] Deduced a trap composed of 554 places in 2064 ms of which 18 ms to minimize.
[2024-06-01 01:48:47] [INFO ] Deduced a trap composed of 259 places in 2097 ms of which 17 ms to minimize.
[2024-06-01 01:48:49] [INFO ] Deduced a trap composed of 348 places in 2073 ms of which 15 ms to minimize.
[2024-06-01 01:48:51] [INFO ] Deduced a trap composed of 268 places in 2080 ms of which 18 ms to minimize.
[2024-06-01 01:48:53] [INFO ] Deduced a trap composed of 336 places in 2018 ms of which 17 ms to minimize.
[2024-06-01 01:48:55] [INFO ] Deduced a trap composed of 233 places in 2090 ms of which 17 ms to minimize.
[2024-06-01 01:48:57] [INFO ] Deduced a trap composed of 178 places in 2092 ms of which 18 ms to minimize.
[2024-06-01 01:48:59] [INFO ] Deduced a trap composed of 265 places in 2084 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2712 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 01:49:02] [INFO ] Deduced a trap composed of 167 places in 2065 ms of which 17 ms to minimize.
[2024-06-01 01:49:04] [INFO ] Deduced a trap composed of 247 places in 2076 ms of which 18 ms to minimize.
SMT process timed out in 45110ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 2813 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2813/2813 places, 10374/10374 transitions.
Applied a total of 0 rules in 501 ms. Remains 2813 /2813 variables (removed 0) and now considering 10374/10374 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 501 ms. Remains : 2813/2813 places, 10374/10374 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2813/2813 places, 10374/10374 transitions.
Applied a total of 0 rules in 496 ms. Remains 2813 /2813 variables (removed 0) and now considering 10374/10374 (removed 0) transitions.
[2024-06-01 01:49:05] [INFO ] Flow matrix only has 9488 transitions (discarded 886 similar events)
[2024-06-01 01:49:05] [INFO ] Invariant cache hit.
[2024-06-01 01:49:10] [INFO ] Implicit Places using invariants in 5259 ms returned []
Implicit Place search using SMT only with invariants took 5260 ms to find 0 implicit places.
Running 10280 sub problems to find dead transitions.
[2024-06-01 01:49:11] [INFO ] Flow matrix only has 9488 transitions (discarded 886 similar events)
[2024-06-01 01:49:11] [INFO ] Invariant cache hit.
[2024-06-01 01:49:11] [INFO ] State equation strengthened by 6202 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 1.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 0.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 0.0)
(s524 0.0)
(s525 1.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 1.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 1.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 1.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 1.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 1.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 1.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 1.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 1.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 1.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 1.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 1.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 1.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 1.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 1.0)
(s698 0.0)
(s699 0.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 0.0)
(s706 0.0)
(s707 1.0)
(s708 0.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 0.0)
(s716 0.0)
(s717 1.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 1.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 1.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 1.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 1.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 1.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 1.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 1.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 1.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 1.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 1.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 1.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 1.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 1.0)
(s854 0.0)
(s855 0.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 0.0)
(s863 0.0)
(s864 1.0)
(s865 0.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 0.0)
(s874 0.0)
(s875 1.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 1.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 1.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 1.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 1.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 1.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 1.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 1.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 1.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 1.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2811 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 10280 unsolved
SMT process timed out in 93023ms, After SMT, problems are : Problem set: 0 solved, 10280 unsolved
Search for dead transitions found 0 dead transitions in 93178ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98997 ms. Remains : 2813/2813 places, 10374/10374 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0] Max Struct:[1, 2, 1]
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-06-01 01:50:44] [INFO ] Flow matrix only has 9488 transitions (discarded 886 similar events)
[2024-06-01 01:50:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (242 resets) in 342 ms. (29 steps per ms)
BEST_FIRST walk for 10001 steps (22 resets) in 42 ms. (232 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 01:50:44] [INFO ] Flow matrix only has 9488 transitions (discarded 886 similar events)
[2024-06-01 01:50:44] [INFO ] Invariant cache hit.
[2024-06-01 01:50:44] [INFO ] [Real]Absence check using 47 positive place invariants in 50 ms returned sat
[2024-06-01 01:50:44] [INFO ] [Real]Absence check using 47 positive and 18 generalized place invariants in 11 ms returned sat
[2024-06-01 01:50:47] [INFO ] [Real]Absence check using state equation in 3155 ms returned sat
[2024-06-01 01:50:48] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-06-01 01:50:48] [INFO ] [Real]Added 6202 Read/Feed constraints in 639 ms returned sat
[2024-06-01 01:50:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:50:49] [INFO ] [Nat]Absence check using 47 positive place invariants in 52 ms returned sat
[2024-06-01 01:50:49] [INFO ] [Nat]Absence check using 47 positive and 18 generalized place invariants in 5 ms returned sat
[2024-06-01 01:50:52] [INFO ] [Nat]Absence check using state equation in 3167 ms returned sat
[2024-06-01 01:50:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:50:54] [INFO ] [Nat]Added 6202 Read/Feed constraints in 1530 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 2813 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node3ThinksNode6ShouldBeNodeMasterToReplaceNode7) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 2813/2813 places, 10372/10372 transitions.
Reduce places removed 1 places and 2 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 2 rules applied. Total rules applied 2 place count 2812 transition count 10369
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 2810 transition count 10367
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 2809 transition count 10365
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6 place count 2808 transition count 10363
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7 place count 2807 transition count 10361
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 9 place count 2807 transition count 10359
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 11 place count 2805 transition count 10359
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 13 place count 2803 transition count 10357
Iterating global reduction 6 with 2 rules applied. Total rules applied 15 place count 2803 transition count 10357
Applied a total of 15 rules in 1200 ms. Remains 2803 /2813 variables (removed 10) and now considering 10357/10372 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1201 ms. Remains : 2803/2813 places, 10357/10372 transitions.
[2024-06-01 01:50:55] [INFO ] Flow matrix only has 9471 transitions (discarded 886 similar events)
// Phase 1: matrix 9471 rows 2803 cols
[2024-06-01 01:50:55] [INFO ] Computed 65 invariants in 158 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 871437 steps (21116 resets) in 30001 ms. (29 steps per ms)
BEST_FIRST walk for 1000001 steps (2157 resets) in 4136 ms. (241 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 01:51:29] [INFO ] Flow matrix only has 9471 transitions (discarded 886 similar events)
[2024-06-01 01:51:29] [INFO ] Invariant cache hit.
[2024-06-01 01:51:29] [INFO ] [Real]Absence check using 47 positive place invariants in 51 ms returned sat
[2024-06-01 01:51:29] [INFO ] [Real]Absence check using 47 positive and 18 generalized place invariants in 11 ms returned sat
[2024-06-01 01:51:32] [INFO ] [Real]Absence check using state equation in 2799 ms returned sat
[2024-06-01 01:51:32] [INFO ] State equation strengthened by 6196 read => feed constraints.
[2024-06-01 01:51:34] [INFO ] [Real]Added 6196 Read/Feed constraints in 1853 ms returned sat
[2024-06-01 01:51:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:51:35] [INFO ] [Nat]Absence check using 47 positive place invariants in 52 ms returned sat
[2024-06-01 01:51:35] [INFO ] [Nat]Absence check using 47 positive and 18 generalized place invariants in 14 ms returned sat
[2024-06-01 01:51:39] [INFO ] [Nat]Absence check using state equation in 4423 ms returned sat
[2024-06-01 01:51:44] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:51:48] [INFO ] [Nat]Added 6196 Read/Feed constraints in 8991 ms returned sat
[2024-06-01 01:51:50] [INFO ] Deduced a trap composed of 332 places in 2062 ms of which 16 ms to minimize.
[2024-06-01 01:51:53] [INFO ] Deduced a trap composed of 118 places in 2254 ms of which 17 ms to minimize.
[2024-06-01 01:51:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4999 ms
[2024-06-01 01:51:54] [INFO ] Computed and/alt/rep : 4540/6578/4540 causal constraints (skipped 4837 transitions) in 558 ms.
[2024-06-01 01:51:57] [INFO ] Added : 19 causal constraints over 5 iterations in 4135 ms. Result :sat
Minimization took 12213 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 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10357/10357 transitions.
Applied a total of 0 rules in 486 ms. Remains 2803 /2803 variables (removed 0) and now considering 10357/10357 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 487 ms. Remains : 2803/2803 places, 10357/10357 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10357/10357 transitions.
Applied a total of 0 rules in 481 ms. Remains 2803 /2803 variables (removed 0) and now considering 10357/10357 (removed 0) transitions.
[2024-06-01 01:52:10] [INFO ] Flow matrix only has 9471 transitions (discarded 886 similar events)
[2024-06-01 01:52:10] [INFO ] Invariant cache hit.
[2024-06-01 01:52:16] [INFO ] Implicit Places using invariants in 5364 ms returned [1403, 1448]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 5371 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2801/2803 places, 10357/10357 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2799 transition count 10355
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2799 transition count 10355
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 2797 transition count 10353
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 2797 transition count 10353
Applied a total of 8 rules in 903 ms. Remains 2797 /2801 variables (removed 4) and now considering 10353/10357 (removed 4) transitions.
[2024-06-01 01:52:17] [INFO ] Flow matrix only has 9467 transitions (discarded 886 similar events)
// Phase 1: matrix 9467 rows 2797 cols
[2024-06-01 01:52:17] [INFO ] Computed 63 invariants in 150 ms
[2024-06-01 01:52:22] [INFO ] Implicit Places using invariants in 5619 ms returned []
Implicit Place search using SMT only with invariants took 5620 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2797/2803 places, 10353/10357 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12376 ms. Remains : 2797/2803 places, 10353/10357 transitions.
[2024-06-01 01:52:22] [INFO ] Flow matrix only has 9467 transitions (discarded 886 similar events)
[2024-06-01 01:52:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 863803 steps (20931 resets) in 30001 ms. (28 steps per ms)
BEST_FIRST walk for 1000001 steps (2158 resets) in 4032 ms. (247 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 01:52:56] [INFO ] Flow matrix only has 9467 transitions (discarded 886 similar events)
[2024-06-01 01:52:56] [INFO ] Invariant cache hit.
[2024-06-01 01:52:57] [INFO ] [Real]Absence check using 47 positive place invariants in 50 ms returned sat
[2024-06-01 01:52:57] [INFO ] [Real]Absence check using 47 positive and 16 generalized place invariants in 5 ms returned sat
[2024-06-01 01:52:59] [INFO ] [Real]Absence check using state equation in 2359 ms returned sat
[2024-06-01 01:52:59] [INFO ] State equation strengthened by 6196 read => feed constraints.
[2024-06-01 01:53:01] [INFO ] [Real]Added 6196 Read/Feed constraints in 1575 ms returned sat
[2024-06-01 01:53:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:53:01] [INFO ] [Nat]Absence check using 47 positive place invariants in 52 ms returned sat
[2024-06-01 01:53:01] [INFO ] [Nat]Absence check using 47 positive and 16 generalized place invariants in 6 ms returned sat
[2024-06-01 01:53:04] [INFO ] [Nat]Absence check using state equation in 2431 ms returned sat
[2024-06-01 01:53:09] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:53:13] [INFO ] [Nat]Added 6196 Read/Feed constraints in 9279 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 2797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2797/2797 places, 10353/10353 transitions.
Applied a total of 0 rules in 529 ms. Remains 2797 /2797 variables (removed 0) and now considering 10353/10353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 529 ms. Remains : 2797/2797 places, 10353/10353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2797/2797 places, 10353/10353 transitions.
Applied a total of 0 rules in 485 ms. Remains 2797 /2797 variables (removed 0) and now considering 10353/10353 (removed 0) transitions.
[2024-06-01 01:53:14] [INFO ] Flow matrix only has 9467 transitions (discarded 886 similar events)
[2024-06-01 01:53:14] [INFO ] Invariant cache hit.
[2024-06-01 01:53:19] [INFO ] Implicit Places using invariants in 5260 ms returned []
Implicit Place search using SMT only with invariants took 5262 ms to find 0 implicit places.
Running 10259 sub problems to find dead transitions.
[2024-06-01 01:53:20] [INFO ] Flow matrix only has 9467 transitions (discarded 886 similar events)
[2024-06-01 01:53:20] [INFO ] Invariant cache hit.
[2024-06-01 01:53:20] [INFO ] State equation strengthened by 6196 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2794 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 10259 unsolved
SMT process timed out in 92342ms, After SMT, problems are : Problem set: 0 solved, 10259 unsolved
Search for dead transitions found 0 dead transitions in 92429ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98202 ms. Remains : 2797/2797 places, 10353/10353 transitions.
RANDOM walk for 40000 steps (968 resets) in 1752 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (83 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (84 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 26911 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 26911 steps, saw 11476 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
[2024-06-01 01:54:55] [INFO ] Flow matrix only has 9467 transitions (discarded 886 similar events)
[2024-06-01 01:54:55] [INFO ] Invariant cache hit.
[2024-06-01 01:54:55] [INFO ] State equation strengthened by 6196 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) 2672/2673 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2673 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2699 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 01:54:58] [INFO ] Deduced a trap composed of 581 places in 2048 ms of which 16 ms to minimize.
[2024-06-01 01:55:00] [INFO ] Deduced a trap composed of 463 places in 2053 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2699 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2699 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 40/2739 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 01:55:03] [INFO ] Deduced a trap composed of 5 places in 2042 ms of which 17 ms to minimize.
SMT process timed out in 7098ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2797/2797 places, 10353/10353 transitions.
Applied a total of 0 rules in 499 ms. Remains 2797 /2797 variables (removed 0) and now considering 10353/10353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 499 ms. Remains : 2797/2797 places, 10353/10353 transitions.
RANDOM walk for 40000 steps (968 resets) in 1557 ms. (25 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (86 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (85 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 26785 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 26785 steps, saw 11422 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
[2024-06-01 01:55:07] [INFO ] Flow matrix only has 9467 transitions (discarded 886 similar events)
[2024-06-01 01:55:07] [INFO ] Invariant cache hit.
[2024-06-01 01:55:07] [INFO ] State equation strengthened by 6196 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) 2672/2673 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2673 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2699 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 01:55:09] [INFO ] Deduced a trap composed of 581 places in 2050 ms of which 17 ms to minimize.
[2024-06-01 01:55:11] [INFO ] Deduced a trap composed of 463 places in 2031 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2699 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2699 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 40/2739 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 01:55:14] [INFO ] Deduced a trap composed of 5 places in 2033 ms of which 18 ms to minimize.
[2024-06-01 01:55:16] [INFO ] Deduced a trap composed of 39 places in 1975 ms of which 17 ms to minimize.
[2024-06-01 01:55:18] [INFO ] Deduced a trap composed of 39 places in 2034 ms of which 17 ms to minimize.
[2024-06-01 01:55:20] [INFO ] Deduced a trap composed of 89 places in 1977 ms of which 18 ms to minimize.
[2024-06-01 01:55:22] [INFO ] Deduced a trap composed of 70 places in 2001 ms of which 18 ms to minimize.
[2024-06-01 01:55:24] [INFO ] Deduced a trap composed of 227 places in 2062 ms of which 18 ms to minimize.
[2024-06-01 01:55:26] [INFO ] Deduced a trap composed of 219 places in 2037 ms of which 19 ms to minimize.
[2024-06-01 01:55:28] [INFO ] Deduced a trap composed of 98 places in 2078 ms of which 18 ms to minimize.
[2024-06-01 01:55:30] [INFO ] Deduced a trap composed of 216 places in 2071 ms of which 17 ms to minimize.
[2024-06-01 01:55:32] [INFO ] Deduced a trap composed of 243 places in 1982 ms of which 18 ms to minimize.
[2024-06-01 01:55:34] [INFO ] Deduced a trap composed of 123 places in 1964 ms of which 18 ms to minimize.
[2024-06-01 01:55:36] [INFO ] Deduced a trap composed of 257 places in 2025 ms of which 18 ms to minimize.
[2024-06-01 01:55:38] [INFO ] Deduced a trap composed of 240 places in 2110 ms of which 18 ms to minimize.
[2024-06-01 01:55:41] [INFO ] Deduced a trap composed of 145 places in 2150 ms of which 16 ms to minimize.
[2024-06-01 01:55:43] [INFO ] Deduced a trap composed of 242 places in 1968 ms of which 18 ms to minimize.
[2024-06-01 01:55:45] [INFO ] Deduced a trap composed of 243 places in 2030 ms of which 17 ms to minimize.
[2024-06-01 01:55:47] [INFO ] Deduced a trap composed of 216 places in 2045 ms of which 17 ms to minimize.
[2024-06-01 01:55:49] [INFO ] Deduced a trap composed of 229 places in 2112 ms of which 18 ms to minimize.
[2024-06-01 01:55:51] [INFO ] Deduced a trap composed of 97 places in 2265 ms of which 18 ms to minimize.
[2024-06-01 01:55:54] [INFO ] Deduced a trap composed of 92 places in 2231 ms of which 18 ms to minimize.
SMT process timed out in 46988ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2797/2797 places, 10353/10353 transitions.
Applied a total of 0 rules in 496 ms. Remains 2797 /2797 variables (removed 0) and now considering 10353/10353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 497 ms. Remains : 2797/2797 places, 10353/10353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2797/2797 places, 10353/10353 transitions.
Applied a total of 0 rules in 492 ms. Remains 2797 /2797 variables (removed 0) and now considering 10353/10353 (removed 0) transitions.
[2024-06-01 01:55:55] [INFO ] Flow matrix only has 9467 transitions (discarded 886 similar events)
[2024-06-01 01:55:55] [INFO ] Invariant cache hit.
[2024-06-01 01:56:00] [INFO ] Implicit Places using invariants in 5409 ms returned []
Implicit Place search using SMT only with invariants took 5410 ms to find 0 implicit places.
Running 10259 sub problems to find dead transitions.
[2024-06-01 01:56:00] [INFO ] Flow matrix only has 9467 transitions (discarded 886 similar events)
[2024-06-01 01:56:00] [INFO ] Invariant cache hit.
[2024-06-01 01:56:00] [INFO ] State equation strengthened by 6196 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/2794 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 10259 unsolved
SMT process timed out in 91948ms, After SMT, problems are : Problem set: 0 solved, 10259 unsolved
Search for dead transitions found 0 dead transitions in 92032ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97960 ms. Remains : 2797/2797 places, 10353/10353 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-08 in 408483 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[2]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[2]
[2024-06-01 01:57:32] [INFO ] Flow matrix only has 9488 transitions (discarded 886 similar events)
// Phase 1: matrix 9488 rows 2813 cols
[2024-06-01 01:57:32] [INFO ] Computed 65 invariants in 144 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2]
RANDOM walk for 10000 steps (242 resets) in 349 ms. (28 steps per ms)
BEST_FIRST walk for 10001 steps (21 resets) in 41 ms. (238 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2]
[2024-06-01 01:57:33] [INFO ] Flow matrix only has 9488 transitions (discarded 886 similar events)
[2024-06-01 01:57:33] [INFO ] Invariant cache hit.
[2024-06-01 01:57:33] [INFO ] [Real]Absence check using 47 positive place invariants in 64 ms returned sat
[2024-06-01 01:57:33] [INFO ] [Real]Absence check using 47 positive and 18 generalized place invariants in 9 ms returned sat
[2024-06-01 01:57:36] [INFO ] [Real]Absence check using state equation in 3295 ms returned sat
[2024-06-01 01:57:36] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-06-01 01:57:37] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:57:37] [INFO ] [Real]Added 6202 Read/Feed constraints in 858 ms returned sat
[2024-06-01 01:57:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:57:38] [INFO ] [Nat]Absence check using 47 positive place invariants in 52 ms returned sat
[2024-06-01 01:57:38] [INFO ] [Nat]Absence check using 47 positive and 18 generalized place invariants in 5 ms returned sat
[2024-06-01 01:57:41] [INFO ] [Nat]Absence check using state equation in 3268 ms returned sat
[2024-06-01 01:57:42] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:57:42] [INFO ] [Nat]Added 6202 Read/Feed constraints in 1428 ms returned unknown
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 2813 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2813/2813 places, 10374/10374 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 2813 transition count 10373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2812 transition count 10373
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 2812 transition count 10372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 2811 transition count 10372
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 2810 transition count 10371
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 2810 transition count 10371
Applied a total of 6 rules in 1248 ms. Remains 2810 /2813 variables (removed 3) and now considering 10371/10374 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1250 ms. Remains : 2810/2813 places, 10371/10374 transitions.
[2024-06-01 01:57:44] [INFO ] Flow matrix only has 9485 transitions (discarded 886 similar events)
// Phase 1: matrix 9485 rows 2810 cols
[2024-06-01 01:57:44] [INFO ] Computed 65 invariants in 136 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2]
RANDOM walk for 872291 steps (21138 resets) in 30001 ms. (29 steps per ms)
BEST_FIRST walk for 1000000 steps (2153 resets) in 4032 ms. (247 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[2]
[2024-06-01 01:58:18] [INFO ] Flow matrix only has 9485 transitions (discarded 886 similar events)
[2024-06-01 01:58:18] [INFO ] Invariant cache hit.
[2024-06-01 01:58:18] [INFO ] [Real]Absence check using 47 positive place invariants in 51 ms returned sat
[2024-06-01 01:58:18] [INFO ] [Real]Absence check using 47 positive and 18 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[1]
FORMULA MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-11 in 46248 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-12
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-06-01 01:58:18] [INFO ] Flow matrix only has 9488 transitions (discarded 886 similar events)
// Phase 1: matrix 9488 rows 2813 cols
[2024-06-01 01:58:18] [INFO ] Computed 65 invariants in 137 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (242 resets) in 350 ms. (28 steps per ms)
BEST_FIRST walk for 10001 steps (21 resets) in 41 ms. (238 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 01:58:19] [INFO ] Flow matrix only has 9488 transitions (discarded 886 similar events)
[2024-06-01 01:58:19] [INFO ] Invariant cache hit.
[2024-06-01 01:58:19] [INFO ] [Real]Absence check using 47 positive place invariants in 48 ms returned sat
[2024-06-01 01:58:19] [INFO ] [Real]Absence check using 47 positive and 18 generalized place invariants in 5 ms returned sat
[2024-06-01 01:58:22] [INFO ] [Real]Absence check using state equation in 2761 ms returned sat
[2024-06-01 01:58:22] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-06-01 01:58:23] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:58:23] [INFO ] [Real]Added 6202 Read/Feed constraints in 1115 ms returned sat
[2024-06-01 01:58:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:58:24] [INFO ] [Nat]Absence check using 47 positive place invariants in 50 ms returned sat
[2024-06-01 01:58:24] [INFO ] [Nat]Absence check using 47 positive and 18 generalized place invariants in 4 ms returned sat
[2024-06-01 01:58:27] [INFO ] [Nat]Absence check using state equation in 2794 ms returned sat
[2024-06-01 01:58:28] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:58:28] [INFO ] [Nat]Added 6202 Read/Feed constraints in 1659 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 2813 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node14HasTheLeafSetOfRx6ToReplaceNode20) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 2813/2813 places, 10373/10373 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2812 transition count 10372
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 2812 transition count 10371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 2811 transition count 10371
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 2810 transition count 10370
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 2810 transition count 10370
Applied a total of 5 rules in 1220 ms. Remains 2810 /2813 variables (removed 3) and now considering 10370/10373 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1220 ms. Remains : 2810/2813 places, 10370/10373 transitions.
[2024-06-01 01:58:29] [INFO ] Flow matrix only has 9484 transitions (discarded 886 similar events)
// Phase 1: matrix 9484 rows 2810 cols
[2024-06-01 01:58:30] [INFO ] Computed 65 invariants in 142 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 875459 steps (21211 resets) in 30001 ms. (29 steps per ms)
BEST_FIRST walk for 1000001 steps (2155 resets) in 4061 ms. (246 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 01:59:04] [INFO ] Flow matrix only has 9484 transitions (discarded 886 similar events)
[2024-06-01 01:59:04] [INFO ] Invariant cache hit.
[2024-06-01 01:59:04] [INFO ] [Real]Absence check using 47 positive place invariants in 53 ms returned sat
[2024-06-01 01:59:04] [INFO ] [Real]Absence check using 47 positive and 18 generalized place invariants in 4 ms returned sat
[2024-06-01 01:59:06] [INFO ] [Real]Absence check using state equation in 2043 ms returned sat
[2024-06-01 01:59:06] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-06-01 01:59:08] [INFO ] [Real]Added 6202 Read/Feed constraints in 1337 ms returned sat
[2024-06-01 01:59:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:59:08] [INFO ] [Nat]Absence check using 47 positive place invariants in 50 ms returned sat
[2024-06-01 01:59:08] [INFO ] [Nat]Absence check using 47 positive and 18 generalized place invariants in 4 ms returned sat
[2024-06-01 01:59:10] [INFO ] [Nat]Absence check using state equation in 2137 ms returned sat
[2024-06-01 01:59:15] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 01:59:16] [INFO ] [Nat]Added 6202 Read/Feed constraints in 5525 ms returned sat
[2024-06-01 01:59:18] [INFO ] Deduced a trap composed of 265 places in 2109 ms of which 18 ms to minimize.
[2024-06-01 01:59:22] [INFO ] Deduced a trap composed of 280 places in 2008 ms of which 18 ms to minimize.
[2024-06-01 01:59:27] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 11012 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 2810 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2810/2810 places, 10370/10370 transitions.
Applied a total of 0 rules in 485 ms. Remains 2810 /2810 variables (removed 0) and now considering 10370/10370 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 485 ms. Remains : 2810/2810 places, 10370/10370 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2810/2810 places, 10370/10370 transitions.
Applied a total of 0 rules in 488 ms. Remains 2810 /2810 variables (removed 0) and now considering 10370/10370 (removed 0) transitions.
[2024-06-01 01:59:28] [INFO ] Flow matrix only has 9484 transitions (discarded 886 similar events)
[2024-06-01 01:59:28] [INFO ] Invariant cache hit.
[2024-06-01 01:59:33] [INFO ] Implicit Places using invariants in 5285 ms returned [1408]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 5293 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2809/2810 places, 10370/10370 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2808 transition count 10369
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2808 transition count 10369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 2807 transition count 10368
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2807 transition count 10368
Applied a total of 4 rules in 840 ms. Remains 2807 /2809 variables (removed 2) and now considering 10368/10370 (removed 2) transitions.
[2024-06-01 01:59:34] [INFO ] Flow matrix only has 9482 transitions (discarded 886 similar events)
// Phase 1: matrix 9482 rows 2807 cols
[2024-06-01 01:59:34] [INFO ] Computed 64 invariants in 160 ms
[2024-06-01 01:59:40] [INFO ] Implicit Places using invariants in 5475 ms returned []
Implicit Place search using SMT only with invariants took 5476 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2807/2810 places, 10368/10370 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12097 ms. Remains : 2807/2810 places, 10368/10370 transitions.
[2024-06-01 01:59:40] [INFO ] Flow matrix only has 9482 transitions (discarded 886 similar events)
[2024-06-01 01:59:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 872816 steps (21151 resets) in 30001 ms. (29 steps per ms)
BEST_FIRST walk for 1000000 steps (2146 resets) in 4050 ms. (246 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 02:00:14] [INFO ] Flow matrix only has 9482 transitions (discarded 886 similar events)
[2024-06-01 02:00:14] [INFO ] Invariant cache hit.
[2024-06-01 02:00:14] [INFO ] [Real]Absence check using 47 positive place invariants in 50 ms returned sat
[2024-06-01 02:00:14] [INFO ] [Real]Absence check using 47 positive and 17 generalized place invariants in 4 ms returned sat
[2024-06-01 02:00:17] [INFO ] [Real]Absence check using state equation in 3214 ms returned sat
[2024-06-01 02:00:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:00:18] [INFO ] [Nat]Absence check using 47 positive place invariants in 51 ms returned sat
[2024-06-01 02:00:18] [INFO ] [Nat]Absence check using 47 positive and 17 generalized place invariants in 4 ms returned sat
[2024-06-01 02:00:21] [INFO ] [Nat]Absence check using state equation in 3320 ms returned sat
[2024-06-01 02:00:21] [INFO ] State equation strengthened by 6202 read => feed constraints.
[2024-06-01 02:00:24] [INFO ] [Nat]Added 6202 Read/Feed constraints in 3442 ms returned sat
[2024-06-01 02:00:27] [INFO ] Deduced a trap composed of 280 places in 1997 ms of which 17 ms to minimize.
[2024-06-01 02:00:32] [INFO ] Deduced a trap composed of 285 places in 1973 ms of which 18 ms to minimize.
[2024-06-01 02:00:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 9356 ms
[2024-06-01 02:00:34] [INFO ] Computed and/alt/rep : 4553/6598/4553 causal constraints (skipped 4835 transitions) in 568 ms.
[2024-06-01 02:00:36] [INFO ] Added : 13 causal constraints over 3 iterations in 2219 ms. Result :sat
Minimization took 12360 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 2807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2807/2807 places, 10368/10368 transitions.
Applied a total of 0 rules in 493 ms. Remains 2807 /2807 variables (removed 0) and now considering 10368/10368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 493 ms. Remains : 2807/2807 places, 10368/10368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2807/2807 places, 10368/10368 transitions.
Applied a total of 0 rules in 485 ms. Remains 2807 /2807 variables (removed 0) and now considering 10368/10368 (removed 0) transitions.
[2024-06-01 02:00:49] [INFO ] Flow matrix only has 9482 transitions (discarded 886 similar events)
[2024-06-01 02:00:49] [INFO ] Invariant cache hit.
[2024-06-01 02:00:55] [INFO ] Implicit Places using invariants in 5225 ms returned []
Implicit Place search using SMT only with invariants took 5226 ms to find 0 implicit places.
Running 10274 sub problems to find dead transitions.
[2024-06-01 02:00:55] [INFO ] Flow matrix only has 9482 transitions (discarded 886 similar events)
[2024-06-01 02:00:55] [INFO ] Invariant cache hit.
[2024-06-01 02:00:55] [INFO ] State equation strengthened by 6202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2804 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 10274 unsolved
SMT process timed out in 92353ms, After SMT, problems are : Problem set: 0 solved, 10274 unsolved
Search for dead transitions found 0 dead transitions in 92437ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98174 ms. Remains : 2807/2807 places, 10368/10368 transitions.
RANDOM walk for 40000 steps (968 resets) in 1743 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (83 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (85 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 26965 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 26965 steps, saw 11506 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
[2024-06-01 02:02:31] [INFO ] Flow matrix only has 9482 transitions (discarded 886 similar events)
[2024-06-01 02:02:31] [INFO ] Invariant cache hit.
[2024-06-01 02:02:31] [INFO ] State equation strengthened by 6202 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) 2681/2682 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2682 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/2707 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2707 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/2749 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2749 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/2793 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2793 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/2807 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2807 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9482/12289 variables, 2807/2871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 12289/12289 variables, and 9073 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5005 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 2807/2807 constraints, ReadFeed: 6202/6202 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2681/2682 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2682 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/2707 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2707 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/2749 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 02:02:38] [INFO ] Deduced a trap composed of 144 places in 2028 ms of which 17 ms to minimize.
[2024-06-01 02:02:41] [INFO ] Deduced a trap composed of 178 places in 2058 ms of which 18 ms to minimize.
[2024-06-01 02:02:43] [INFO ] Deduced a trap composed of 165 places in 1980 ms of which 18 ms to minimize.
SMT process timed out in 11798ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2807/2807 places, 10368/10368 transitions.
Applied a total of 0 rules in 493 ms. Remains 2807 /2807 variables (removed 0) and now considering 10368/10368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 494 ms. Remains : 2807/2807 places, 10368/10368 transitions.
RANDOM walk for 40000 steps (968 resets) in 1458 ms. (27 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (85 resets) in 176 ms. (226 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (84 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 27645 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :0 out of 2
Probabilistic random walk after 27645 steps, saw 11781 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
[2024-06-01 02:02:47] [INFO ] Flow matrix only has 9482 transitions (discarded 886 similar events)
[2024-06-01 02:02:47] [INFO ] Invariant cache hit.
[2024-06-01 02:02:47] [INFO ] State equation strengthened by 6202 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) 2681/2682 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2682 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/2707 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2707 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/2749 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2749 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/2793 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2793 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/2807 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2807 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9482/12289 variables, 2807/2871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/12289 variables, 6202/9073 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12289 variables, 0/9073 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/12289 variables, 0/9073 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12289/12289 variables, and 9073 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6609 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 2807/2807 constraints, ReadFeed: 6202/6202 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2681/2682 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2682 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/2707 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2707 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/2749 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 02:02:56] [INFO ] Deduced a trap composed of 144 places in 1923 ms of which 18 ms to minimize.
[2024-06-01 02:02:58] [INFO ] Deduced a trap composed of 178 places in 2029 ms of which 18 ms to minimize.
[2024-06-01 02:03:00] [INFO ] Deduced a trap composed of 165 places in 1974 ms of which 17 ms to minimize.
[2024-06-01 02:03:02] [INFO ] Deduced a trap composed of 165 places in 1941 ms of which 16 ms to minimize.
[2024-06-01 02:03:04] [INFO ] Deduced a trap composed of 168 places in 2003 ms of which 17 ms to minimize.
[2024-06-01 02:03:06] [INFO ] Deduced a trap composed of 165 places in 1961 ms of which 17 ms to minimize.
[2024-06-01 02:03:08] [INFO ] Deduced a trap composed of 169 places in 1891 ms of which 17 ms to minimize.
[2024-06-01 02:03:10] [INFO ] Deduced a trap composed of 193 places in 1950 ms of which 17 ms to minimize.
[2024-06-01 02:03:12] [INFO ] Deduced a trap composed of 142 places in 1961 ms of which 18 ms to minimize.
[2024-06-01 02:03:14] [INFO ] Deduced a trap composed of 145 places in 1983 ms of which 18 ms to minimize.
[2024-06-01 02:03:16] [INFO ] Deduced a trap composed of 143 places in 2033 ms of which 19 ms to minimize.
[2024-06-01 02:03:18] [INFO ] Deduced a trap composed of 144 places in 1919 ms of which 17 ms to minimize.
[2024-06-01 02:03:20] [INFO ] Deduced a trap composed of 142 places in 1893 ms of which 18 ms to minimize.
[2024-06-01 02:03:22] [INFO ] Deduced a trap composed of 146 places in 1922 ms of which 18 ms to minimize.
[2024-06-01 02:03:24] [INFO ] Deduced a trap composed of 141 places in 1997 ms of which 17 ms to minimize.
[2024-06-01 02:03:26] [INFO ] Deduced a trap composed of 144 places in 2003 ms of which 18 ms to minimize.
[2024-06-01 02:03:28] [INFO ] Deduced a trap composed of 145 places in 1919 ms of which 17 ms to minimize.
[2024-06-01 02:03:30] [INFO ] Deduced a trap composed of 144 places in 1980 ms of which 17 ms to minimize.
[2024-06-01 02:03:32] [INFO ] Deduced a trap composed of 146 places in 1901 ms of which 18 ms to minimize.
[2024-06-01 02:03:34] [INFO ] Deduced a trap composed of 140 places in 1979 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2749 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 02:03:36] [INFO ] Deduced a trap composed of 146 places in 1950 ms of which 18 ms to minimize.
[2024-06-01 02:03:38] [INFO ] Deduced a trap composed of 143 places in 1965 ms of which 18 ms to minimize.
[2024-06-01 02:03:40] [INFO ] Deduced a trap composed of 146 places in 1862 ms of which 17 ms to minimize.
SMT process timed out in 53013ms, 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 2807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2807/2807 places, 10368/10368 transitions.
Applied a total of 0 rules in 500 ms. Remains 2807 /2807 variables (removed 0) and now considering 10368/10368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 500 ms. Remains : 2807/2807 places, 10368/10368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2807/2807 places, 10368/10368 transitions.
Applied a total of 0 rules in 501 ms. Remains 2807 /2807 variables (removed 0) and now considering 10368/10368 (removed 0) transitions.
[2024-06-01 02:03:41] [INFO ] Flow matrix only has 9482 transitions (discarded 886 similar events)
[2024-06-01 02:03:41] [INFO ] Invariant cache hit.
[2024-06-01 02:03:46] [INFO ] Implicit Places using invariants in 5455 ms returned []
Implicit Place search using SMT only with invariants took 5456 ms to find 0 implicit places.
Running 10274 sub problems to find dead transitions.
[2024-06-01 02:03:46] [INFO ] Flow matrix only has 9482 transitions (discarded 886 similar events)
[2024-06-01 02:03:46] [INFO ] Invariant cache hit.
[2024-06-01 02:03:46] [INFO ] State equation strengthened by 6202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2804 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 10274 unsolved
SMT process timed out in 92802ms, After SMT, problems are : Problem set: 0 solved, 10274 unsolved
Search for dead transitions found 0 dead transitions in 92885ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98859 ms. Remains : 2807/2807 places, 10368/10368 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-12 in 420620 ms.
[2024-06-01 02:05:20] [INFO ] Flatten gal took : 605 ms
[2024-06-01 02:05:20] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-06-01 02:05:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2813 places, 10374 transitions and 50914 arcs took 46 ms.
Total runtime 1900917 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-08
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-12
BK_STOP 1717207520539
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-08
ub formula formula --maxsum=/tmp/1192/ub_0_
ub formula name MultiCrashLeafsetExtension-PT-S24C07-UpperBounds-12
ub formula formula --maxsum=/tmp/1192/ub_1_
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-S24C07"
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-S24C07, 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-171654350900101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C07.tgz
mv MultiCrashLeafsetExtension-PT-S24C07 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 '
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 ;