About the Execution of GreatSPN+red for MultiCrashLeafsetExtension-PT-S24C08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
13736.216 | 3600000.00 | 5884054.00 | 8157.50 | 1 1 1 1 1 1 1 1 ? 1 1 1 1 1 1 ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r245-tall-171654349200109.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 greatspnxred
Input is MultiCrashLeafsetExtension-PT-S24C08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349200109
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K 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 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Apr 12 06:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 12 06:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 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 15M 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-S24C08-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716600912259
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 01:35:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-25 01:35:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 01:35:14] [INFO ] Load time of PNML (sax parser for PT used): 691 ms
[2024-05-25 01:35:14] [INFO ] Transformed 15180 places.
[2024-05-25 01:35:14] [INFO ] Transformed 22267 transitions.
[2024-05-25 01:35:14] [INFO ] Parsed PT model containing 15180 places and 22267 transitions and 84086 arcs in 936 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-25 01:35:14] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15180 cols
[2024-05-25 01:35:16] [INFO ] Computed 1137 invariants in 1827 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, 75, 75, 25, 25, 25, 75, 75, +inf, 25, 75, 75, 25, 75, 75]
RANDOM walk for 10000 steps (122 resets) in 350 ms. (28 steps per ms)
BEST_FIRST walk for 160015 steps (368 resets) in 791 ms. (202 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0] Max Struct:[25, 75, 75, 75, 25, 25, 25, 75, 75, +inf, 25, 75, 75, 25, 75, 75]
[2024-05-25 01:35:17] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
[2024-05-25 01:35:17] [INFO ] Invariant cache hit.
[2024-05-25 01:35:19] [INFO ] [Real]Absence check using 70 positive place invariants in 371 ms returned sat
[2024-05-25 01:35:20] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 580 ms returned sat
[2024-05-25 01:35:22] [INFO ] [Real]Absence check using state equation in 2408 ms returned unknown
[2024-05-25 01:35:24] [INFO ] [Real]Absence check using 70 positive place invariants in 363 ms returned sat
[2024-05-25 01:35:25] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 496 ms returned unsat
[2024-05-25 01:35:27] [INFO ] [Real]Absence check using 70 positive place invariants in 361 ms returned sat
[2024-05-25 01:35:27] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 542 ms returned sat
[2024-05-25 01:35:30] [INFO ] [Real]Absence check using state equation in 2522 ms returned unknown
[2024-05-25 01:35:32] [INFO ] [Real]Absence check using 70 positive place invariants in 352 ms returned sat
[2024-05-25 01:35:32] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 567 ms returned sat
[2024-05-25 01:35:35] [INFO ] [Real]Absence check using state equation in 2619 ms returned unknown
[2024-05-25 01:35:37] [INFO ] [Real]Absence check using 70 positive place invariants in 361 ms returned sat
[2024-05-25 01:35:37] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 391 ms returned unsat
[2024-05-25 01:35:39] [INFO ] [Real]Absence check using 70 positive place invariants in 366 ms returned sat
[2024-05-25 01:35:40] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 604 ms returned sat
[2024-05-25 01:35:42] [INFO ] [Real]Absence check using state equation in 2518 ms returned sat
[2024-05-25 01:35:42] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2024-05-25 01:35:42] [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 5
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-05-25 01:35:44] [INFO ] [Real]Absence check using 70 positive place invariants in 348 ms returned sat
[2024-05-25 01:35:45] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 571 ms returned sat
[2024-05-25 01:35:47] [INFO ] [Real]Absence check using state equation in 2416 ms returned sat
[2024-05-25 01:35:47] [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 6
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-05-25 01:35:49] [INFO ] [Real]Absence check using 70 positive place invariants in 355 ms returned sat
[2024-05-25 01:35:50] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 524 ms returned unsat
[2024-05-25 01:35:51] [INFO ] [Real]Absence check using 70 positive place invariants in 353 ms returned sat
[2024-05-25 01:35:52] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 563 ms returned sat
[2024-05-25 01:35:54] [INFO ] [Real]Absence check using state equation in 2436 ms returned sat
[2024-05-25 01:35: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 8
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-05-25 01:35:57] [INFO ] [Real]Absence check using 70 positive place invariants in 369 ms returned sat
[2024-05-25 01:35:57] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 411 ms returned unsat
[2024-05-25 01:35:59] [INFO ] [Real]Absence check using 70 positive place invariants in 360 ms returned sat
[2024-05-25 01:35:59] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 402 ms returned unsat
[2024-05-25 01:36:01] [INFO ] [Real]Absence check using 70 positive place invariants in 357 ms returned sat
[2024-05-25 01:36:02] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 581 ms returned sat
[2024-05-25 01:36:04] [INFO ] [Real]Absence check using state equation in 2445 ms returned sat
[2024-05-25 01:36:04] [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.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-05-25 01:36:06] [INFO ] [Real]Absence check using 70 positive place invariants in 344 ms returned sat
[2024-05-25 01:36:07] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 564 ms returned unsat
[2024-05-25 01:36:08] [INFO ] [Real]Absence check using 70 positive place invariants in 354 ms returned sat
[2024-05-25 01:36:09] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 396 ms returned unsat
[2024-05-25 01:36:11] [INFO ] [Real]Absence check using 70 positive place invariants in 341 ms returned sat
[2024-05-25 01:36:11] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 440 ms returned unsat
[2024-05-25 01:36:13] [INFO ] [Real]Absence check using 70 positive place invariants in 349 ms returned sat
[2024-05-25 01:36:14] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 563 ms returned sat
[2024-05-25 01:36:16] [INFO ] [Real]Absence check using state equation in 2399 ms returned sat
[2024-05-25 01:36:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:36:18] [INFO ] [Nat]Absence check using 70 positive place invariants in 352 ms returned sat
[2024-05-25 01:36:19] [INFO ] [Nat]Absence check using 70 positive and 1067 generalized place invariants in 546 ms returned sat
[2024-05-25 01:36:21] [INFO ] [Nat]Absence check using state equation in 2425 ms returned sat
[2024-05-25 01:36:21] [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 15
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:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0] Max Struct:[25, 1, 75, 75, 1, 25, 25, 1, 75, 1, 1, 75, 1, 1, 1, 75]
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-01 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] Max Struct:[25, 75, 75, 25, 25, 75, 75, 75]
Support contains 8 out of 15180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15180/15180 places, 22267/22267 transitions.
Graph (complete) has 49169 edges and 15180 vertex of which 15136 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.45 ms
Discarding 44 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4792 transitions
Trivial Post-agglo rules discarded 4792 transitions
Performed 4792 trivial Post agglomeration. Transition count delta: 4792
Iterating post reduction 0 with 4792 rules applied. Total rules applied 4793 place count 15136 transition count 17475
Reduce places removed 4792 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 4797 rules applied. Total rules applied 9590 place count 10344 transition count 17470
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 9595 place count 10339 transition count 17470
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 9595 place count 10339 transition count 17070
Deduced a syphon composed of 400 places in 14 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 10395 place count 9939 transition count 17070
Discarding 4392 places :
Symmetric choice reduction at 3 with 4392 rule applications. Total rules 14787 place count 5547 transition count 12678
Iterating global reduction 3 with 4392 rules applied. Total rules applied 19179 place count 5547 transition count 12678
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 19179 place count 5547 transition count 12667
Deduced a syphon composed of 11 places in 10 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 19201 place count 5536 transition count 12667
Discarding 542 places :
Symmetric choice reduction at 3 with 542 rule applications. Total rules 19743 place count 4994 transition count 8331
Iterating global reduction 3 with 542 rules applied. Total rules applied 20285 place count 4994 transition count 8331
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 12 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 20335 place count 4969 transition count 8306
Free-agglomeration rule (complex) applied 344 times.
Iterating global reduction 3 with 344 rules applied. Total rules applied 20679 place count 4969 transition count 11756
Reduce places removed 344 places and 0 transitions.
Iterating post reduction 3 with 344 rules applied. Total rules applied 21023 place count 4625 transition count 11756
Partial Free-agglomeration rule applied 125 times.
Drop transitions (Partial Free agglomeration) removed 125 transitions
Iterating global reduction 4 with 125 rules applied. Total rules applied 21148 place count 4625 transition count 11756
Applied a total of 21148 rules in 5753 ms. Remains 4625 /15180 variables (removed 10555) and now considering 11756/22267 (removed 10511) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5771 ms. Remains : 4625/15180 places, 11756/22267 transitions.
[2024-05-25 01:36:27] [INFO ] Flow matrix only has 10870 transitions (discarded 886 similar events)
// Phase 1: matrix 10870 rows 4625 cols
[2024-05-25 01:36:27] [INFO ] Computed 1093 invariants in 319 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 2, 2, 1, 1, 2, 2, 2]
RANDOM walk for 646304 steps (13070 resets) in 30001 ms. (21 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3547591 steps (9202 resets) in 25005 ms. (141 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 1, 0] Max Struct:[2, 2, 2, 2, 2]
[2024-05-25 01:37:22] [INFO ] Flow matrix only has 10870 transitions (discarded 886 similar events)
[2024-05-25 01:37:22] [INFO ] Invariant cache hit.
[2024-05-25 01:37:23] [INFO ] [Real]Absence check using 49 positive place invariants in 107 ms returned sat
[2024-05-25 01:37:23] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 227 ms returned sat
[2024-05-25 01:37:27] [INFO ] [Real]Absence check using state equation in 3546 ms returned sat
[2024-05-25 01:37:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:37:28] [INFO ] [Nat]Absence check using 49 positive place invariants in 103 ms returned sat
[2024-05-25 01:37:28] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 221 ms returned sat
[2024-05-25 01:37:32] [INFO ] [Nat]Absence check using state equation in 3646 ms returned sat
[2024-05-25 01:37:32] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2024-05-25 01:37:37] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 01:37:38] [INFO ] [Nat]Added 6802 Read/Feed constraints in 6063 ms returned sat
[2024-05-25 01:37:44] [INFO ] Deduced a trap composed of 370 places in 6125 ms of which 221 ms to minimize.
[2024-05-25 01:37:51] [INFO ] Deduced a trap composed of 551 places in 5744 ms of which 35 ms to minimize.
[2024-05-25 01:37:59] [INFO ] Deduced a trap composed of 582 places in 5911 ms of which 31 ms to minimize.
[2024-05-25 01:38:07] [INFO ] Deduced a trap composed of 610 places in 5867 ms of which 30 ms to minimize.
[2024-05-25 01:38:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 31419 ms
[2024-05-25 01:38:10] [INFO ] Computed and/alt/rep : 4621/6661/4621 causal constraints (skipped 6224 transitions) in 1077 ms.
[2024-05-25 01:38:12] [INFO ] Added : 8 causal constraints over 2 iterations in 2979 ms. Result :sat
Minimization took 36 ms.
[2024-05-25 01:38:13] [INFO ] [Real]Absence check using 49 positive place invariants in 107 ms returned sat
[2024-05-25 01:38:13] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 19 ms returned unsat
[2024-05-25 01:38:13] [INFO ] [Real]Absence check using 49 positive place invariants in 96 ms returned sat
[2024-05-25 01:38:13] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 213 ms returned sat
[2024-05-25 01:38:17] [INFO ] [Real]Absence check using state equation in 3423 ms returned sat
[2024-05-25 01:38:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:38:18] [INFO ] [Nat]Absence check using 49 positive place invariants in 94 ms returned sat
[2024-05-25 01:38:18] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 229 ms returned sat
[2024-05-25 01:38:22] [INFO ] [Nat]Absence check using state equation in 3724 ms returned sat
[2024-05-25 01:38:26] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 01:38:29] [INFO ] [Nat]Added 6802 Read/Feed constraints in 7380 ms returned sat
[2024-05-25 01:38:35] [INFO ] Deduced a trap composed of 609 places in 5816 ms of which 34 ms to minimize.
[2024-05-25 01:38:40] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 10593 ms
[2024-05-25 01:38:40] [INFO ] [Real]Absence check using 49 positive place invariants in 102 ms returned sat
[2024-05-25 01:38:40] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 21 ms returned unsat
[2024-05-25 01:38:41] [INFO ] [Real]Absence check using 49 positive place invariants in 98 ms returned sat
[2024-05-25 01:38:41] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 210 ms returned sat
[2024-05-25 01:38:44] [INFO ] [Real]Absence check using state equation in 3539 ms returned sat
[2024-05-25 01:38:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:38:45] [INFO ] [Nat]Absence check using 49 positive place invariants in 92 ms returned sat
[2024-05-25 01:38:45] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 212 ms returned sat
[2024-05-25 01:38:49] [INFO ] [Nat]Absence check using state equation in 3407 ms returned sat
[2024-05-25 01:38:54] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 01:38:54] [INFO ] [Nat]Added 6802 Read/Feed constraints in 5036 ms returned sat
[2024-05-25 01:39:00] [INFO ] Deduced a trap composed of 494 places in 5678 ms of which 32 ms to minimize.
[2024-05-25 01:39:04] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 10459 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 1, 0] Max Struct:[2, 1, 2, 1, 2]
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[2, 2, 2]
Support contains 3 out of 4625 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4625/4625 places, 11756/11756 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4625 transition count 11753
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 4622 transition count 11753
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 4621 transition count 11752
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 4621 transition count 11752
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 4621 transition count 11750
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 4619 transition count 11750
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 14 place count 4617 transition count 11748
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 4617 transition count 11748
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 4617 transition count 11748
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 20 place count 4615 transition count 11746
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 4615 transition count 11746
Applied a total of 22 rules in 2657 ms. Remains 4615 /4625 variables (removed 10) and now considering 11746/11756 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2658 ms. Remains : 4615/4625 places, 11746/11756 transitions.
[2024-05-25 01:39:07] [INFO ] Flow matrix only has 10860 transitions (discarded 886 similar events)
// Phase 1: matrix 10860 rows 4615 cols
[2024-05-25 01:39:08] [INFO ] Computed 1093 invariants in 317 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[2, 2, 2]
RANDOM walk for 650550 steps (13157 resets) in 30001 ms. (21 steps per ms)
BEST_FIRST walk for 2183435 steps (5663 resets) in 15003 ms. (145 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[2, 2, 2]
[2024-05-25 01:39:53] [INFO ] Flow matrix only has 10860 transitions (discarded 886 similar events)
[2024-05-25 01:39:53] [INFO ] Invariant cache hit.
[2024-05-25 01:39:53] [INFO ] [Real]Absence check using 49 positive place invariants in 103 ms returned sat
[2024-05-25 01:39:54] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 222 ms returned sat
[2024-05-25 01:39:57] [INFO ] [Real]Absence check using state equation in 3612 ms returned sat
[2024-05-25 01:39:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:39:58] [INFO ] [Nat]Absence check using 49 positive place invariants in 89 ms returned sat
[2024-05-25 01:39:58] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 220 ms returned sat
[2024-05-25 01:40:02] [INFO ] [Nat]Absence check using state equation in 4113 ms returned sat
[2024-05-25 01:40:02] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2024-05-25 01:40:07] [INFO ] [Nat]Added 6802 Read/Feed constraints in 4355 ms returned sat
[2024-05-25 01:40:13] [INFO ] Deduced a trap composed of 410 places in 5720 ms of which 29 ms to minimize.
[2024-05-25 01:40:19] [INFO ] Deduced a trap composed of 458 places in 5754 ms of which 30 ms to minimize.
[2024-05-25 01:40:24] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 17268 ms
[2024-05-25 01:40:24] [INFO ] [Real]Absence check using 49 positive place invariants in 92 ms returned sat
[2024-05-25 01:40:25] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 216 ms returned sat
[2024-05-25 01:40:28] [INFO ] [Real]Absence check using state equation in 3601 ms returned sat
[2024-05-25 01:40:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:40:29] [INFO ] [Nat]Absence check using 49 positive place invariants in 91 ms returned sat
[2024-05-25 01:40:29] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 214 ms returned sat
[2024-05-25 01:40:33] [INFO ] [Nat]Absence check using state equation in 3685 ms returned sat
[2024-05-25 01:40:38] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 01:40:41] [INFO ] [Nat]Added 6802 Read/Feed constraints in 8407 ms returned sat
[2024-05-25 01:40:43] [INFO ] Computed and/alt/rep : 4613/6648/4613 causal constraints (skipped 6222 transitions) in 987 ms.
[2024-05-25 01:40:44] [INFO ] Added : 8 causal constraints over 2 iterations in 2769 ms. Result :sat
Minimization took 5586 ms.
[2024-05-25 01:40:51] [INFO ] [Real]Absence check using 49 positive place invariants in 95 ms returned sat
[2024-05-25 01:40:51] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 214 ms returned sat
[2024-05-25 01:40:54] [INFO ] [Real]Absence check using state equation in 3692 ms returned sat
[2024-05-25 01:40:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:40:55] [INFO ] [Nat]Absence check using 49 positive place invariants in 93 ms returned sat
[2024-05-25 01:40:55] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 229 ms returned sat
[2024-05-25 01:41:01] [INFO ] [Nat]Absence check using state equation in 5576 ms returned sat
[2024-05-25 01:41:06] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 01:41:08] [INFO ] [Nat]Added 6802 Read/Feed constraints in 6638 ms returned sat
[2024-05-25 01:41:14] [INFO ] Deduced a trap composed of 589 places in 5711 ms of which 31 ms to minimize.
[2024-05-25 01:41:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 10002 ms
[2024-05-25 01:41:18] [INFO ] Computed and/alt/rep : 4613/6648/4613 causal constraints (skipped 6222 transitions) in 788 ms.
[2024-05-25 01:41:20] [INFO ] Added : 8 causal constraints over 2 iterations in 2571 ms. Result :sat
Minimization took 5473 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[2, 2, 2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[2, 2, 2]
Support contains 3 out of 4615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4615/4615 places, 11746/11746 transitions.
Applied a total of 0 rules in 626 ms. Remains 4615 /4615 variables (removed 0) and now considering 11746/11746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 626 ms. Remains : 4615/4615 places, 11746/11746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4615/4615 places, 11746/11746 transitions.
Applied a total of 0 rules in 626 ms. Remains 4615 /4615 variables (removed 0) and now considering 11746/11746 (removed 0) transitions.
[2024-05-25 01:41:27] [INFO ] Flow matrix only has 10860 transitions (discarded 886 similar events)
[2024-05-25 01:41:27] [INFO ] Invariant cache hit.
[2024-05-25 01:41:43] [INFO ] Implicit Places using invariants in 16348 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 21, 27, 35, 45, 57, 71, 87, 105, 125, 147, 170, 192, 193, 194, 195, 196, 197, 198, 199, 200, 220, 238, 254, 268, 280, 290, 298, 304, 308, 310, 329, 335, 337, 338, 339, 340, 341, 342, 344, 345, 347, 351, 357, 365, 375, 387, 401, 417, 435, 456, 477, 497, 498, 499, 500, 501, 502, 503, 504, 505, 523, 539, 553, 565, 575, 583, 589, 593, 595, 597, 616, 622, 624, 625, 626, 627, 628, 629, 630, 631, 632, 634, 636, 640, 646, 654, 664, 676, 690, 706, 724, 743, 761, 762, 763, 764, 765, 766, 767, 768, 769, 785, 799, 811, 821, 829, 835, 839, 841, 843, 845, 864, 870, 872, 873, 874, 875, 876, 877, 878, 880, 882, 884, 886, 890, 896, 904, 915, 927, 941, 957, 974, 990, 991, 992, 993, 994, 995, 996, 997, 998, 1012, 1024, 1034, 1042, 1048, 1052, 1054, 1056, 1058, 1060, 1079, 1085, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1097, 1099, 1101, 1103, 1107, 1113, 1121, 1131, 1143, 1157, 1172, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1206, 1216, 1224, 1230, 1234, 1236, 1238, 1240, 1242, 1244, 1263, 1269, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1281, 1283, 1285, 1287, 1289, 1293, 1299, 1307, 1317, 1329, 1342, 1354, 1355, 1356, 1357, 1358, 1359, 1360, 1361, 1362, 1372, 1380, 1386, 1390, 1392, 1394, 1396, 1398, 1400, 1402, 1421, 1427, 1429, 1430, 1431, 1432, 1433, 1434, 1435, 1436, 1437, 1439, 1441, 1443, 1445, 1447, 1449, 1453, 1459, 1467, 1477, 1488, 1498, 1499, 1500, 1501, 1502, 1503, 1504, 1505, 1506, 1514, 1520, 1524, 1526, 1528, 1530, 1532, 1534, 1536, 1538, 1557, 1563, 1565, 1566, 1567, 1568, 1569, 1570, 1571, 1572, 1573, 1575, 1577, 1579, 1581, 1583, 1585, 1587, 1591, 1597, 1605, 1614, 1622, 1623, 1624, 1625, 1626, 1627, 1628, 1629, 1630, 1636, 1640, 1642, 1644, 1646, 1648, 1650, 1652, 1654, 1656, 1675, 1681, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1711, 1717, 1724, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1742, 1744, 1746, 1748, 1750, 1752, 1754, 1756, 1758, 1760, 1779, 1785, 1787, 1788, 1789, 1790, 1791, 1792, 1793, 1794, 1795, 1797, 1799, 1801, 1803, 1805, 1807, 1809, 1811, 1813, 1817, 1822, 1826, 1827, 1828, 1829, 1830, 1831, 1832, 1833, 1834, 1836, 1838, 1840, 1842, 1844, 1846, 1848, 1850, 1852, 1854, 1873, 1879, 1881, 1882, 1883, 1884, 1885, 1886, 1887, 1888, 1889, 1891, 1893, 1895, 1897, 1899, 1901, 1903, 1905, 1907, 1909, 1912, 1914, 1915, 1916, 1917, 1918, 1919, 1920, 1921, 1922, 1924, 1926, 1928, 1930, 1932, 1934, 1936, 1938, 1940, 1942, 1961, 1967, 1969, 1970, 1971, 1972, 1973, 1974, 1975, 1976, 1977, 1979, 1981, 1983, 1985, 1987, 1989, 1991, 1993, 1995, 1997, 1999, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2011, 2013, 2015, 2017, 2019, 2021, 2023, 2025, 2027, 2029, 2048, 2050, 2053, 2055, 2056, 2057, 2058, 2059, 2060, 2061, 2062, 2063, 2065, 2067, 2069, 2071, 2073, 2075, 2077, 2079, 2081, 2083, 2085, 2087, 2088, 2089, 2090, 2091, 2092, 2093, 2094, 2095, 2097, 2099, 2101, 2103, 2105, 2107, 2109, 2111, 2113, 2115, 2134, 2140, 2142, 2143, 2144, 2145, 2146, 2147, 2148, 2149, 2150, 2152, 2154, 2156, 2158, 2160, 2162, 2164, 2166, 2168, 2170, 2172, 2174, 2175, 2176, 2177, 2178, 2179, 2180, 2181, 2182, 2184, 2186, 2188, 2190, 2192, 2194, 2196, 2198, 2200, 2202, 2221, 2227, 2229, 2230, 2231, 2232, 2233, 2234, 2235, 2236, 2237, 2239, 2241, 2243, 2245, 2247, 2249, 2251, 2253, 2255, 2257, 2259, 2262, 2263, 2264, 2265, 2266, 2267, 2268, 2269, 2270, 2272, 2274, 2276, 2278, 2280, 2282, 2284, 2286, 2288, 2290, 2309, 2315, 2317, 2318, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 2327, 2329, 2331, 2333, 2335, 2337, 2339, 2341, 2343, 2345, 2349, 2354, 2355, 2356, 2357, 2358, 2359, 2360, 2361, 2362, 2366, 2368, 2370, 2372, 2374, 2376, 2378, 2380, 2382, 2384, 2403, 2409, 2411, 2412, 2413, 2414, 2415, 2416, 2417, 2418, 2419, 2421, 2423, 2425, 2427, 2429, 2431, 2433, 2435, 2437, 2441, 2447, 2454, 2455, 2456, 2457, 2458, 2459, 2460, 2461, 2462, 2468, 2472, 2474, 2476, 2478, 2480, 2482, 2484, 2486, 2488, 2507, 2513, 2515, 2516, 2517, 2518, 2519, 2520, 2521, 2522, 2523, 2525, 2527, 2529, 2531, 2533, 2535, 2537, 2539, 2543, 2549, 2557, 2566, 2567, 2568, 2569, 2570, 2571, 2572, 2573, 2574, 2582, 2588, 2592, 2594, 2596, 2598, 2600, 2602, 2604, 2606, 2625, 2631, 2633, 2634, 2635, 2636, 2637, 2638, 2639, 2640, 2641, 2643, 2645, 2647, 2649, 2651, 2653, 2655, 2659, 2665, 2673, 2683, 2694, 2695, 2696, 2697, 2698, 2699, 2700, 2701, 2702, 2712, 2720, 2726, 2730, 2732, 2734, 2736, 2738, 2740, 2742, 2761, 2767, 2769, 2770, 2771, 2772, 2773, 2774, 2775, 2776, 2777, 2779, 2781, 2783, 2785, 2787, 2789, 2793, 2799, 2807, 2817, 2829, 2842, 2843, 2844, 2845, 2846, 2847, 2848, 2849, 2850, 2862, 2872, 2880, 2886, 2890, 2892, 2894, 2896, 2898, 2900, 2919, 2925, 2927, 2928, 2929, 2930, 2931, 2932, 2933, 2934, 2935, 2937, 2939, 2941, 2943, 2945, 2949, 2955, 2963, 2973, 2985, 2999, 3014, 3015, 3016, 3017, 3018, 3019, 3020, 3021, 3022, 3036, 3048, 3058, 3066, 3072, 3076, 3078, 3080, 3082, 3084, 3103, 3109, 3111, 3112, 3113, 3114, 3115, 3116, 3117, 3118, 3119, 3121, 3123, 3125, 3127, 3131, 3137, 3145, 3155, 3167, 3181, 3197, 3214, 3215, 3216, 3217, 3218, 3219, 3220, 3221, 3222, 3238, 3252, 3264, 3274, 3282, 3288, 3292, 3294, 3296, 3298, 3317, 3323, 3325, 3326, 3327, 3328, 3329, 3330, 3331, 3332, 3333, 3335, 3337, 3339, 3343, 3349, 3357, 3367, 3379, 3393, 3409, 3427, 3446, 3447, 3448, 3449, 3450, 3451, 3452, 3454, 3472, 3488, 3502, 3514, 3524, 3532, 3539, 3543, 3545, 3547, 3566, 3572, 3574, 3575, 3576, 3577, 3578, 3579, 3580, 3581, 3582, 3584, 3586, 3590, 3596, 3604, 3614, 3626, 3640, 3656, 3674, 3694, 3715, 3716, 3717, 3718, 3719, 3720, 3721, 3722, 3723, 3743, 3761, 3777, 3791, 3803, 3813, 3821, 3827, 3831, 3833, 3852, 3854, 3857, 3859, 3860, 3861, 3862, 3863, 3864, 3865, 3866, 3867, 3869, 3873, 3879, 3887, 3897, 3909, 3923, 3939, 3957, 3977, 3999, 4022, 4023, 4024, 4025, 4026, 4027, 4028, 4029, 4030, 4052, 4072, 4090, 4106, 4120, 4132, 4142, 4150, 4156, 4160, 4179]
[2024-05-25 01:41:44] [INFO ] Actually due to overlaps returned [329, 616, 864, 1079, 1263, 1421, 1557, 1675, 1779, 1873, 1961, 2048, 2134, 2221, 2309, 2403, 2507, 2625, 2761, 2919, 3103, 3317, 3566, 3852, 4179, 4, 9, 10, 11, 12, 13, 14, 15, 16, 192, 193, 194, 195, 196, 197, 198, 199, 337, 338, 339, 340, 341, 342, 344, 497, 498, 499, 500, 501, 502, 503, 504, 624, 625, 626, 627, 628, 629, 630, 631, 761, 762, 763, 764, 765, 766, 767, 768, 872, 873, 874, 875, 876, 877, 878, 990, 991, 992, 993, 994, 995, 996, 997, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1354, 1355, 1356, 1357, 1358, 1359, 1360, 1361, 1429, 1430, 1431, 1432, 1433, 1434, 1435, 1436, 1498, 1499, 1500, 1501, 1502, 1503, 1504, 1505, 1565, 1566, 1567, 1568, 1569, 1570, 1571, 1572, 1622, 1623, 1624, 1625, 1626, 1627, 1628, 1629, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1787, 1788, 1789, 1790, 1791, 1792, 1793, 1794, 1826, 1827, 1828, 1829, 1830, 1831, 1832, 1833, 1881, 1882, 1883, 1884, 1885, 1886, 1887, 1888, 1914, 1915, 1916, 1917, 1918, 1919, 1920, 1921, 1969, 1970, 1971, 1972, 1973, 1974, 1975, 1976, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2050, 2055, 2056, 2057, 2058, 2059, 2060, 2061, 2062, 2087, 2088, 2089, 2090, 2091, 2092, 2093, 2094, 2142, 2143, 2144, 2145, 2146, 2147, 2148, 2149, 2174, 2175, 2176, 2177, 2178, 2179, 2180, 2181, 2229, 2230, 2231, 2232, 2233, 2234, 2235, 2236, 2262, 2263, 2264, 2265, 2266, 2267, 2268, 2269, 2317, 2318, 2319, 2320, 2321, 2322, 2323, 2324, 2354, 2355, 2356, 2357, 2358, 2359, 2360, 2361, 2411, 2412, 2413, 2414, 2415, 2416, 2417, 2418, 2454, 2455, 2456, 2457, 2458, 2459, 2460, 2461, 2515, 2516, 2517, 2518, 2519, 2520, 2521, 2522, 2566, 2567, 2568, 2569, 2570, 2571, 2572, 2573, 2633, 2634, 2635, 2636, 2637, 2638, 2639, 2640, 2694, 2695, 2696, 2697, 2698, 2699, 2700, 2701, 2769, 2770, 2771, 2772, 2773, 2774, 2775, 2776, 2842, 2843, 2844, 2845, 2846, 2847, 2848, 2849, 2927, 2928, 2929, 2930, 2931, 2932, 2933, 2934, 3014, 3015, 3016, 3017, 3018, 3019, 3020, 3021, 3111, 3112, 3113, 3114, 3115, 3116, 3117, 3118, 3214, 3215, 3216, 3217, 3218, 3219, 3220, 3221, 3325, 3326, 3327, 3328, 3329, 3330, 3331, 3332, 3446, 3447, 3448, 3449, 3450, 3451, 3452, 3574, 3575, 3576, 3577, 3578, 3579, 3580, 3581, 3715, 3716, 3717, 3718, 3719, 3720, 3721, 3722, 3854, 3859, 3860, 3861, 3862, 3863, 3864, 3865, 3866, 4022, 4023, 4024, 4025, 4026, 4027, 4028, 4029]
Discarding 425 places :
Implicit Place search using SMT only with invariants took 16378 ms to find 425 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 4190/4615 places, 11746/11746 transitions.
Discarding 381 places :
Symmetric choice reduction at 0 with 381 rule applications. Total rules 381 place count 3809 transition count 11365
Iterating global reduction 0 with 381 rules applied. Total rules applied 762 place count 3809 transition count 11365
Discarding 381 places :
Symmetric choice reduction at 0 with 381 rule applications. Total rules 1143 place count 3428 transition count 10984
Iterating global reduction 0 with 381 rules applied. Total rules applied 1524 place count 3428 transition count 10984
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 1527 place count 3428 transition count 10981
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 1530 place count 3425 transition count 10981
Applied a total of 1530 rules in 1577 ms. Remains 3425 /4190 variables (removed 765) and now considering 10981/11746 (removed 765) transitions.
[2024-05-25 01:41:45] [INFO ] Flow matrix only has 10095 transitions (discarded 886 similar events)
// Phase 1: matrix 10095 rows 3425 cols
[2024-05-25 01:41:45] [INFO ] Computed 668 invariants in 192 ms
[2024-05-25 01:41:56] [INFO ] Implicit Places using invariants in 10504 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, 316, 319, 321, 325, 331, 339, 349, 361, 375, 391, 409, 430, 451, 471, 489, 505, 519, 531, 541, 549, 555, 559, 561, 563, 572, 574, 576, 578, 582, 588, 596, 606, 618, 632, 648, 666, 685, 703, 719, 733, 745, 755, 763, 769, 773, 775, 777, 779, 787, 790, 792, 794, 796, 800, 806, 814, 825, 837, 851, 867, 884, 900, 914, 926, 936, 944, 950, 954, 956, 958, 960, 962, 971, 973, 975, 977, 979, 981, 985, 991, 999, 1009, 1021, 1035, 1050, 1064, 1076, 1086, 1094, 1100, 1104, 1106, 1108, 1110, 1112, 1114, 1122, 1124, 1126, 1128, 1130, 1132, 1134, 1138, 1144, 1152, 1162, 1174, 1187, 1199, 1209, 1217, 1223, 1227, 1229, 1231, 1233, 1235, 1237, 1239, 1247, 1249, 1251, 1253, 1255, 1257, 1259, 1261, 1265, 1271, 1279, 1289, 1300, 1310, 1318, 1324, 1328, 1330, 1332, 1334, 1336, 1338, 1340, 1342, 1350, 1352, 1354, 1356, 1358, 1360, 1362, 1364, 1366, 1370, 1376, 1384, 1393, 1401, 1407, 1411, 1413, 1415, 1417, 1419, 1421, 1423, 1425, 1427, 1435, 1437, 1439, 1441, 1443, 1445, 1447, 1449, 1451, 1453, 1457, 1463, 1470, 1476, 1480, 1482, 1484, 1486, 1488, 1490, 1492, 1494, 1496, 1498, 1506, 1508, 1510, 1512, 1514, 1516, 1518, 1520, 1522, 1524, 1526, 1530, 1535, 1539, 1541, 1543, 1545, 1547, 1549, 1551, 1553, 1555, 1557, 1559, 1567, 1569, 1571, 1573, 1575, 1577, 1579, 1581, 1583, 1585, 1587, 1589, 1592, 1594, 1596, 1598, 1600, 1602, 1604, 1606, 1608, 1610, 1612, 1614, 1622, 1624, 1626, 1628, 1630, 1632, 1634, 1636, 1638, 1640, 1642, 1644, 1646, 1648, 1650, 1652, 1654, 1656, 1658, 1660, 1662, 1664, 1666, 1668, 1674, 1676, 1678, 1680, 1682, 1684, 1686, 1688, 1690, 1692, 1694, 1696, 1698, 1700, 1702, 1704, 1706, 1708, 1710, 1712, 1714, 1716, 1718, 1720, 1727, 1729, 1731, 1733, 1735, 1737, 1739, 1741, 1743, 1745, 1747, 1749, 1751, 1753, 1755, 1757, 1759, 1761, 1763, 1765, 1767, 1769, 1771, 1773, 1781, 1783, 1785, 1787, 1789, 1791, 1793, 1795, 1797, 1799, 1801, 1803, 1805, 1808, 1810, 1812, 1814, 1816, 1818, 1820, 1822, 1824, 1826, 1828, 1836, 1838, 1840, 1842, 1844, 1846, 1848, 1850, 1852, 1854, 1856, 1858, 1862, 1867, 1871, 1873, 1875, 1877, 1879, 1881, 1883, 1885, 1887, 1889, 1897, 1899, 1901, 1903, 1905, 1907, 1909, 1911, 1913, 1915, 1917, 1921, 1927, 1934, 1940, 1944, 1946, 1948, 1950, 1952, 1954, 1956, 1958, 1960, 1968, 1970, 1972, 1974, 1976, 1978, 1980, 1982, 1984, 1986, 1990, 1996, 2004, 2013, 2021, 2027, 2031, 2033, 2035, 2037, 2039, 2041, 2043, 2045, 2053, 2055, 2057, 2059, 2061, 2063, 2065, 2067, 2069, 2073, 2079, 2087, 2097, 2108, 2118, 2126, 2132, 2136, 2138, 2140, 2142, 2144, 2146, 2148, 2156, 2158, 2160, 2162, 2164, 2166, 2168, 2170, 2174, 2180, 2188, 2198, 2210, 2223, 2235, 2245, 2253, 2259, 2263, 2265, 2267, 2269, 2271, 2273, 2281, 2283, 2285, 2287, 2289, 2291, 2293, 2297, 2303, 2311, 2321, 2333, 2347, 2362, 2376, 2388, 2398, 2406, 2412, 2416, 2418, 2420, 2422, 2424, 2432, 2434, 2436, 2438, 2440, 2442, 2446, 2452, 2460, 2470, 2482, 2496, 2512, 2529, 2545, 2559, 2571, 2581, 2589, 2595, 2599, 2601, 2603, 2605, 2613, 2615, 2617, 2619, 2621, 2625, 2631, 2639, 2649, 2661, 2675, 2691, 2709, 2729, 2747, 2763, 2777, 2789, 2799, 2807, 2814, 2818, 2820, 2822, 2831, 2833, 2835, 2837, 2841, 2847, 2855, 2865, 2877, 2891, 2907, 2925, 2945, 2966, 2986, 3004, 3020, 3034, 3046, 3056, 3064, 3070, 3074, 3076, 3082, 3084, 3086, 3090, 3096, 3104, 3114, 3126, 3140, 3156, 3174, 3194, 3216, 3239, 3261, 3281, 3299, 3315, 3329, 3341, 3351, 3359, 3365, 3369]
Discarding 600 places :
Implicit Place search using SMT only with invariants took 10538 ms to find 600 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2825/4615 places, 10981/11746 transitions.
Applied a total of 0 rules in 575 ms. Remains 2825 /2825 variables (removed 0) and now considering 10981/10981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 29697 ms. Remains : 2825/4615 places, 10981/11746 transitions.
[2024-05-25 01:41:56] [INFO ] Flow matrix only has 10095 transitions (discarded 886 similar events)
// Phase 1: matrix 10095 rows 2825 cols
[2024-05-25 01:41:56] [INFO ] Computed 68 invariants in 145 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[2, 2, 2]
RANDOM walk for 710899 steps (15025 resets) in 30001 ms. (23 steps per ms)
BEST_FIRST walk for 2995995 steps (5909 resets) in 14978 ms. (200 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[2, 2, 2]
[2024-05-25 01:42:41] [INFO ] Flow matrix only has 10095 transitions (discarded 886 similar events)
[2024-05-25 01:42:41] [INFO ] Invariant cache hit.
[2024-05-25 01:42:42] [INFO ] [Real]Absence check using 47 positive place invariants in 54 ms returned sat
[2024-05-25 01:42:42] [INFO ] [Real]Absence check using 47 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-25 01:42:46] [INFO ] [Real]Absence check using state equation in 3862 ms returned sat
[2024-05-25 01:42:46] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2024-05-25 01:42:47] [INFO ] [Real]Added 6802 Read/Feed constraints in 1271 ms returned sat
[2024-05-25 01:42:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:42:48] [INFO ] [Nat]Absence check using 47 positive place invariants in 54 ms returned sat
[2024-05-25 01:42:48] [INFO ] [Nat]Absence check using 47 positive and 21 generalized place invariants in 4 ms returned sat
[2024-05-25 01:42:51] [INFO ] [Nat]Absence check using state equation in 3692 ms returned sat
[2024-05-25 01:42:56] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 01:42:57] [INFO ] [Nat]Added 6802 Read/Feed constraints in 6161 ms returned sat
[2024-05-25 01:43:00] [INFO ] Deduced a trap composed of 261 places in 1974 ms of which 19 ms to minimize.
[2024-05-25 01:43:03] [INFO ] Deduced a trap composed of 285 places in 1980 ms of which 18 ms to minimize.
[2024-05-25 01:43:08] [INFO ] Deduced a trap composed of 307 places in 1944 ms of which 19 ms to minimize.
[2024-05-25 01:43:12] [INFO ] Deduced a trap composed of 337 places in 2036 ms of which 20 ms to minimize.
[2024-05-25 01:43:15] [INFO ] Deduced a trap composed of 300 places in 2099 ms of which 18 ms to minimize.
[2024-05-25 01:43:18] [INFO ] Deduced a trap composed of 210 places in 2152 ms of which 18 ms to minimize.
[2024-05-25 01:43:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 21782 ms
[2024-05-25 01:43:20] [INFO ] Computed and/alt/rep : 4560/6616/4560 causal constraints (skipped 5441 transitions) in 650 ms.
[2024-05-25 01:43:22] [INFO ] Added : 15 causal constraints over 3 iterations in 2371 ms. Result :sat
Minimization took 10658 ms.
[2024-05-25 01:43:33] [INFO ] [Real]Absence check using 47 positive place invariants in 53 ms returned sat
[2024-05-25 01:43:33] [INFO ] [Real]Absence check using 47 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-25 01:43:36] [INFO ] [Real]Absence check using state equation in 2939 ms returned sat
[2024-05-25 01:43:37] [INFO ] [Real]Added 6802 Read/Feed constraints in 874 ms returned sat
[2024-05-25 01:43:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:43:37] [INFO ] [Nat]Absence check using 47 positive place invariants in 53 ms returned sat
[2024-05-25 01:43:37] [INFO ] [Nat]Absence check using 47 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-25 01:43:40] [INFO ] [Nat]Absence check using state equation in 3075 ms returned sat
[2024-05-25 01:43:45] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 01:43:47] [INFO ] [Nat]Added 6802 Read/Feed constraints in 6508 ms returned sat
[2024-05-25 01:43:48] [INFO ] Computed and/alt/rep : 4560/6616/4560 causal constraints (skipped 5441 transitions) in 654 ms.
[2024-05-25 01:43:49] [INFO ] Added : 14 causal constraints over 3 iterations in 2362 ms. Result :sat
Minimization took 18527 ms.
[2024-05-25 01:44:08] [INFO ] [Real]Absence check using 47 positive place invariants in 50 ms returned sat
[2024-05-25 01:44:08] [INFO ] [Real]Absence check using 47 positive and 21 generalized place invariants in 8 ms returned sat
[2024-05-25 01:44:10] [INFO ] [Real]Absence check using state equation in 2353 ms returned sat
[2024-05-25 01:44:12] [INFO ] [Real]Added 6802 Read/Feed constraints in 1089 ms returned sat
[2024-05-25 01:44:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:44:12] [INFO ] [Nat]Absence check using 47 positive place invariants in 52 ms returned sat
[2024-05-25 01:44:12] [INFO ] [Nat]Absence check using 47 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-25 01:44:15] [INFO ] [Nat]Absence check using state equation in 2461 ms returned sat
[2024-05-25 01:44:20] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 01:44:20] [INFO ] [Nat]Added 6802 Read/Feed constraints in 5505 ms returned sat
[2024-05-25 01:44:23] [INFO ] Deduced a trap composed of 284 places in 2201 ms of which 19 ms to minimize.
[2024-05-25 01:44:28] [INFO ] Deduced a trap composed of 317 places in 2057 ms of which 19 ms to minimize.
[2024-05-25 01:44:33] [INFO ] Deduced a trap composed of 305 places in 2030 ms of which 18 ms to minimize.
[2024-05-25 01:44:39] [INFO ] Deduced a trap composed of 317 places in 2009 ms of which 19 ms to minimize.
[2024-05-25 01:44:43] [INFO ] Deduced a trap composed of 316 places in 2051 ms of which 19 ms to minimize.
[2024-05-25 01:44:48] [INFO ] Deduced a trap composed of 315 places in 2017 ms of which 18 ms to minimize.
[2024-05-25 01:44:52] [INFO ] Deduced a trap composed of 316 places in 1960 ms of which 18 ms to minimize.
[2024-05-25 01:44:57] [INFO ] Deduced a trap composed of 315 places in 2097 ms of which 18 ms to minimize.
[2024-05-25 01:44:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[2, 2, 2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[2, 2, 2]
Support contains 3 out of 2825 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2825/2825 places, 10981/10981 transitions.
Applied a total of 0 rules in 576 ms. Remains 2825 /2825 variables (removed 0) and now considering 10981/10981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 577 ms. Remains : 2825/2825 places, 10981/10981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2825/2825 places, 10981/10981 transitions.
Applied a total of 0 rules in 571 ms. Remains 2825 /2825 variables (removed 0) and now considering 10981/10981 (removed 0) transitions.
[2024-05-25 01:44:58] [INFO ] Flow matrix only has 10095 transitions (discarded 886 similar events)
[2024-05-25 01:44:58] [INFO ] Invariant cache hit.
[2024-05-25 01:45:04] [INFO ] Implicit Places using invariants in 5731 ms returned []
Implicit Place search using SMT only with invariants took 5733 ms to find 0 implicit places.
Running 10887 sub problems to find dead transitions.
[2024-05-25 01:45:04] [INFO ] Flow matrix only has 10095 transitions (discarded 886 similar events)
[2024-05-25 01:45:04] [INFO ] Invariant cache hit.
[2024-05-25 01:45:04] [INFO ] State equation strengthened by 6802 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2823 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 10887 unsolved
SMT process timed out in 104803ms, After SMT, problems are : Problem set: 0 solved, 10887 unsolved
Search for dead transitions found 0 dead transitions in 104922ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111281 ms. Remains : 2825/2825 places, 10981/10981 transitions.
RANDOM walk for 40000 steps (843 resets) in 2023 ms. (19 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (80 resets) in 429 ms. (93 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (78 resets) in 487 ms. (81 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (77 resets) in 424 ms. (94 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (76 resets) in 343 ms. (116 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (77 resets) in 340 ms. (117 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (77 resets) in 340 ms. (117 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 22701 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :0 out of 6
Probabilistic random walk after 22701 steps, saw 9803 distinct states, run finished after 3007 ms. (steps per millisecond=7 ) properties seen :0
[2024-05-25 01:46:53] [INFO ] Flow matrix only has 10095 transitions (discarded 886 similar events)
[2024-05-25 01:46:53] [INFO ] Invariant cache hit.
[2024-05-25 01:46:53] [INFO ] State equation strengthened by 6802 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) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2686/2698 variables, 2/5 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2698 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 25/2723 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2723 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 42/2765 variables, 2/8 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2765 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 44/2809 variables, 44/52 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2809 variables, 0/52 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 16/2825 variables, 16/68 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2825 variables, 0/68 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 12920/12920 variables, and 2893 constraints, problems are : Problem set: 3 solved, 3 unsolved in 5030 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 2825/2825 constraints, ReadFeed: 0/6802 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2686/2698 variables, 2/5 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2698 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 25/2723 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2723 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 42/2765 variables, 2/8 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-25 01:47:01] [INFO ] Deduced a trap composed of 5 places in 2328 ms of which 18 ms to minimize.
[2024-05-25 01:47:04] [INFO ] Deduced a trap composed of 170 places in 2325 ms of which 21 ms to minimize.
SMT process timed out in 10609ms, After SMT, problems are : Problem set: 3 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 2825 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2825/2825 places, 10981/10981 transitions.
Applied a total of 0 rules in 686 ms. Remains 2825 /2825 variables (removed 0) and now considering 10981/10981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 689 ms. Remains : 2825/2825 places, 10981/10981 transitions.
RANDOM walk for 40000 steps (844 resets) in 2436 ms. (16 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (78 resets) in 308 ms. (129 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (77 resets) in 278 ms. (143 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (76 resets) in 257 ms. (155 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 23367 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :0 out of 3
Probabilistic random walk after 23367 steps, saw 10086 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
[2024-05-25 01:47:09] [INFO ] Flow matrix only has 10095 transitions (discarded 886 similar events)
[2024-05-25 01:47:09] [INFO ] Invariant cache hit.
[2024-05-25 01:47:09] [INFO ] State equation strengthened by 6802 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2686/2698 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2698 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 25/2723 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2723 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 42/2765 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2765 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 44/2809 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2809 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 16/2825 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2825 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 10095/12920 variables, 2825/2893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/12920 variables, 6802/9695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/12920 variables, 0/9695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/12920 variables, 0/9695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12920/12920 variables, and 9695 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6468 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 2825/2825 constraints, ReadFeed: 6802/6802 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2686/2698 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2698 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 25/2723 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2723 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 42/2765 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-25 01:47:18] [INFO ] Deduced a trap composed of 5 places in 2333 ms of which 19 ms to minimize.
[2024-05-25 01:47:21] [INFO ] Deduced a trap composed of 170 places in 2342 ms of which 19 ms to minimize.
[2024-05-25 01:47:23] [INFO ] Deduced a trap composed of 100 places in 2200 ms of which 18 ms to minimize.
[2024-05-25 01:47:25] [INFO ] Deduced a trap composed of 102 places in 2404 ms of which 21 ms to minimize.
[2024-05-25 01:47:28] [INFO ] Deduced a trap composed of 174 places in 2253 ms of which 18 ms to minimize.
[2024-05-25 01:47:30] [INFO ] Deduced a trap composed of 109 places in 2256 ms of which 18 ms to minimize.
[2024-05-25 01:47:32] [INFO ] Deduced a trap composed of 107 places in 2337 ms of which 18 ms to minimize.
[2024-05-25 01:47:35] [INFO ] Deduced a trap composed of 100 places in 2270 ms of which 17 ms to minimize.
[2024-05-25 01:47:37] [INFO ] Deduced a trap composed of 114 places in 2284 ms of which 19 ms to minimize.
[2024-05-25 01:47:39] [INFO ] Deduced a trap composed of 106 places in 2374 ms of which 20 ms to minimize.
[2024-05-25 01:47:42] [INFO ] Deduced a trap composed of 88 places in 2345 ms of which 19 ms to minimize.
[2024-05-25 01:47:44] [INFO ] Deduced a trap composed of 105 places in 2356 ms of which 20 ms to minimize.
[2024-05-25 01:47:46] [INFO ] Deduced a trap composed of 93 places in 2293 ms of which 20 ms to minimize.
[2024-05-25 01:47:49] [INFO ] Deduced a trap composed of 101 places in 2327 ms of which 18 ms to minimize.
[2024-05-25 01:47:51] [INFO ] Deduced a trap composed of 108 places in 2452 ms of which 18 ms to minimize.
[2024-05-25 01:47:54] [INFO ] Deduced a trap composed of 107 places in 2392 ms of which 19 ms to minimize.
[2024-05-25 01:47:56] [INFO ] Deduced a trap composed of 100 places in 2401 ms of which 19 ms to minimize.
[2024-05-25 01:47:59] [INFO ] Deduced a trap composed of 108 places in 2403 ms of which 20 ms to minimize.
[2024-05-25 01:48:01] [INFO ] Deduced a trap composed of 142 places in 2356 ms of which 19 ms to minimize.
SMT process timed out in 52394ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 2825 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2825/2825 places, 10981/10981 transitions.
Applied a total of 0 rules in 584 ms. Remains 2825 /2825 variables (removed 0) and now considering 10981/10981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 585 ms. Remains : 2825/2825 places, 10981/10981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2825/2825 places, 10981/10981 transitions.
Applied a total of 0 rules in 574 ms. Remains 2825 /2825 variables (removed 0) and now considering 10981/10981 (removed 0) transitions.
[2024-05-25 01:48:02] [INFO ] Flow matrix only has 10095 transitions (discarded 886 similar events)
[2024-05-25 01:48:02] [INFO ] Invariant cache hit.
[2024-05-25 01:48:08] [INFO ] Implicit Places using invariants in 5781 ms returned []
Implicit Place search using SMT only with invariants took 5783 ms to find 0 implicit places.
Running 10887 sub problems to find dead transitions.
[2024-05-25 01:48:08] [INFO ] Flow matrix only has 10095 transitions (discarded 886 similar events)
[2024-05-25 01:48:08] [INFO ] Invariant cache hit.
[2024-05-25 01:48:08] [INFO ] State equation strengthened by 6802 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2823 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 10887 unsolved
SMT process timed out in 115493ms, After SMT, problems are : Problem set: 0 solved, 10887 unsolved
Search for dead transitions found 0 dead transitions in 115595ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122009 ms. Remains : 2825/2825 places, 10981/10981 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0] Max Struct:[2, 2, 2]
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[2]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[2]
[2024-05-25 01:50:04] [INFO ] Flow matrix only has 10095 transitions (discarded 886 similar events)
[2024-05-25 01:50:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2]
RANDOM walk for 10000 steps (211 resets) in 423 ms. (23 steps per ms)
BEST_FIRST walk for 10001 steps (19 resets) in 50 ms. (196 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2]
[2024-05-25 01:50:04] [INFO ] Flow matrix only has 10095 transitions (discarded 886 similar events)
[2024-05-25 01:50:04] [INFO ] Invariant cache hit.
[2024-05-25 01:50:04] [INFO ] [Real]Absence check using 47 positive place invariants in 54 ms returned sat
[2024-05-25 01:50:04] [INFO ] [Real]Absence check using 47 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-25 01:50:08] [INFO ] [Real]Absence check using state equation in 3659 ms returned sat
[2024-05-25 01:50:08] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2024-05-25 01:50:09] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 01:50:09] [INFO ] [Real]Added 6802 Read/Feed constraints in 783 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 2825 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2825/2825 places, 10981/10981 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2825 transition count 10979
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 2823 transition count 10979
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 2821 transition count 10977
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 2821 transition count 10977
Applied a total of 8 rules in 1315 ms. Remains 2821 /2825 variables (removed 4) and now considering 10977/10981 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1316 ms. Remains : 2821/2825 places, 10977/10981 transitions.
[2024-05-25 01:50:11] [INFO ] Flow matrix only has 10091 transitions (discarded 886 similar events)
// Phase 1: matrix 10091 rows 2821 cols
[2024-05-25 01:50:11] [INFO ] Computed 68 invariants in 290 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2]
RANDOM walk for 695224 steps (14695 resets) in 30001 ms. (23 steps per ms)
BEST_FIRST walk for 988186 steps (1951 resets) in 5001 ms. (197 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[2]
[2024-05-25 01:50:46] [INFO ] Flow matrix only has 10091 transitions (discarded 886 similar events)
[2024-05-25 01:50:46] [INFO ] Invariant cache hit.
[2024-05-25 01:50:46] [INFO ] [Real]Absence check using 47 positive place invariants in 54 ms returned sat
[2024-05-25 01:50:46] [INFO ] [Real]Absence check using 47 positive and 21 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[1]
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-02 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 6 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-S24C08-UpperBounds-02 in 42856 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C08-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:[2]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[2]
[2024-05-25 01:50:46] [INFO ] Flow matrix only has 10095 transitions (discarded 886 similar events)
// Phase 1: matrix 10095 rows 2825 cols
[2024-05-25 01:50:47] [INFO ] Computed 68 invariants in 161 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2]
RANDOM walk for 10000 steps (211 resets) in 432 ms. (23 steps per ms)
BEST_FIRST walk for 10001 steps (18 resets) in 50 ms. (196 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2]
[2024-05-25 01:50:47] [INFO ] Flow matrix only has 10095 transitions (discarded 886 similar events)
[2024-05-25 01:50:47] [INFO ] Invariant cache hit.
[2024-05-25 01:50:47] [INFO ] [Real]Absence check using 47 positive place invariants in 52 ms returned sat
[2024-05-25 01:50:47] [INFO ] [Real]Absence check using 47 positive and 21 generalized place invariants in 4 ms returned sat
[2024-05-25 01:50:51] [INFO ] [Real]Absence check using state equation in 3091 ms returned sat
[2024-05-25 01:50:51] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2024-05-25 01:50:52] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 01:50:52] [INFO ] [Real]Added 6802 Read/Feed constraints in 975 ms returned sat
[2024-05-25 01:50:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:50:52] [INFO ] [Nat]Absence check using 47 positive place invariants in 55 ms returned sat
[2024-05-25 01:50:52] [INFO ] [Nat]Absence check using 47 positive and 21 generalized place invariants in 4 ms returned sat
[2024-05-25 01:50:55] [INFO ] [Nat]Absence check using state equation in 3091 ms returned sat
[2024-05-25 01:50:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 01:50:57] [INFO ] [Nat]Added 6802 Read/Feed constraints in 1607 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 2825 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2825/2825 places, 10981/10981 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2825 transition count 10979
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 2823 transition count 10979
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 2821 transition count 10977
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 2821 transition count 10977
Applied a total of 8 rules in 1386 ms. Remains 2821 /2825 variables (removed 4) and now considering 10977/10981 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1388 ms. Remains : 2821/2825 places, 10977/10981 transitions.
[2024-05-25 01:50:58] [INFO ] Flow matrix only has 10091 transitions (discarded 886 similar events)
// Phase 1: matrix 10091 rows 2821 cols
[2024-05-25 01:50:59] [INFO ] Computed 68 invariants in 147 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2]
RANDOM walk for 698920 steps (14769 resets) in 30001 ms. (23 steps per ms)
BEST_FIRST walk for 996059 steps (1973 resets) in 5001 ms. (199 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2]
[2024-05-25 01:51:34] [INFO ] Flow matrix only has 10091 transitions (discarded 886 similar events)
[2024-05-25 01:51:34] [INFO ] Invariant cache hit.
[2024-05-25 01:51:34] [INFO ] [Real]Absence check using 47 positive place invariants in 50 ms returned sat
[2024-05-25 01:51:34] [INFO ] [Real]Absence check using 47 positive and 21 generalized place invariants in 4 ms returned sat
[2024-05-25 01:51:37] [INFO ] [Real]Absence check using state equation in 3380 ms returned sat
[2024-05-25 01:51:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:51:38] [INFO ] [Nat]Absence check using 47 positive place invariants in 53 ms returned sat
[2024-05-25 01:51:38] [INFO ] [Nat]Absence check using 47 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-25 01:51:41] [INFO ] [Nat]Absence check using state equation in 3300 ms returned sat
[2024-05-25 01:51:41] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2024-05-25 01:51:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 01:51:47] [INFO ] [Nat]Added 6802 Read/Feed constraints in 6276 ms returned sat
[2024-05-25 01:51:48] [INFO ] Computed and/alt/rep : 4556/6605/4556 causal constraints (skipped 5441 transitions) in 623 ms.
[2024-05-25 01:51:50] [INFO ] Added : 14 causal constraints over 3 iterations in 2333 ms. Result :sat
Minimization took 18652 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2]
Support contains 1 out of 2821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2821/2821 places, 10977/10977 transitions.
Applied a total of 0 rules in 566 ms. Remains 2821 /2821 variables (removed 0) and now considering 10977/10977 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 566 ms. Remains : 2821/2821 places, 10977/10977 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2821/2821 places, 10977/10977 transitions.
Applied a total of 0 rules in 574 ms. Remains 2821 /2821 variables (removed 0) and now considering 10977/10977 (removed 0) transitions.
[2024-05-25 01:52:10] [INFO ] Flow matrix only has 10091 transitions (discarded 886 similar events)
[2024-05-25 01:52:10] [INFO ] Invariant cache hit.
[2024-05-25 01:52:15] [INFO ] Implicit Places using invariants in 5654 ms returned [293, 715]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 5667 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2819/2821 places, 10977/10977 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2817 transition count 10975
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2817 transition count 10975
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 2815 transition count 10973
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 2815 transition count 10973
Applied a total of 8 rules in 938 ms. Remains 2815 /2819 variables (removed 4) and now considering 10973/10977 (removed 4) transitions.
[2024-05-25 01:52:16] [INFO ] Flow matrix only has 10087 transitions (discarded 886 similar events)
// Phase 1: matrix 10087 rows 2815 cols
[2024-05-25 01:52:17] [INFO ] Computed 66 invariants in 182 ms
[2024-05-25 01:52:22] [INFO ] Implicit Places using invariants in 5829 ms returned []
Implicit Place search using SMT only with invariants took 5831 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2815/2821 places, 10973/10977 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 13014 ms. Remains : 2815/2821 places, 10973/10977 transitions.
[2024-05-25 01:52:22] [INFO ] Flow matrix only has 10087 transitions (discarded 886 similar events)
[2024-05-25 01:52:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2]
RANDOM walk for 703564 steps (14869 resets) in 30001 ms. (23 steps per ms)
BEST_FIRST walk for 1000001 steps (1981 resets) in 4993 ms. (200 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2]
[2024-05-25 01:52:57] [INFO ] Flow matrix only has 10087 transitions (discarded 886 similar events)
[2024-05-25 01:52:57] [INFO ] Invariant cache hit.
[2024-05-25 01:52:57] [INFO ] [Real]Absence check using 47 positive place invariants in 51 ms returned sat
[2024-05-25 01:52:58] [INFO ] [Real]Absence check using 47 positive and 19 generalized place invariants in 10 ms returned sat
[2024-05-25 01:53:01] [INFO ] [Real]Absence check using state equation in 3500 ms returned sat
[2024-05-25 01:53:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:53:02] [INFO ] [Nat]Absence check using 47 positive place invariants in 52 ms returned sat
[2024-05-25 01:53:02] [INFO ] [Nat]Absence check using 47 positive and 19 generalized place invariants in 9 ms returned sat
[2024-05-25 01:53:05] [INFO ] [Nat]Absence check using state equation in 3592 ms returned sat
[2024-05-25 01:53:05] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2024-05-25 01:53:10] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 01:53:13] [INFO ] [Nat]Added 6802 Read/Feed constraints in 7753 ms returned sat
[2024-05-25 01:53:14] [INFO ] Computed and/alt/rep : 4556/6604/4556 causal constraints (skipped 5437 transitions) in 625 ms.
[2024-05-25 01:53:16] [INFO ] Added : 14 causal constraints over 3 iterations in 2356 ms. Result :sat
Minimization took 18821 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2]
Support contains 1 out of 2815 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2815/2815 places, 10973/10973 transitions.
Applied a total of 0 rules in 594 ms. Remains 2815 /2815 variables (removed 0) and now considering 10973/10973 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 594 ms. Remains : 2815/2815 places, 10973/10973 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2815/2815 places, 10973/10973 transitions.
Applied a total of 0 rules in 567 ms. Remains 2815 /2815 variables (removed 0) and now considering 10973/10973 (removed 0) transitions.
[2024-05-25 01:53:35] [INFO ] Flow matrix only has 10087 transitions (discarded 886 similar events)
[2024-05-25 01:53:35] [INFO ] Invariant cache hit.
[2024-05-25 01:53:41] [INFO ] Implicit Places using invariants in 5636 ms returned []
Implicit Place search using SMT only with invariants took 5637 ms to find 0 implicit places.
Running 10879 sub problems to find dead transitions.
[2024-05-25 01:53:41] [INFO ] Flow matrix only has 10087 transitions (discarded 886 similar events)
[2024-05-25 01:53:41] [INFO ] Invariant cache hit.
[2024-05-25 01:53:41] [INFO ] State equation strengthened by 6802 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/2813 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 10879 unsolved
SMT process timed out in 101638ms, After SMT, problems are : Problem set: 0 solved, 10879 unsolved
Search for dead transitions found 0 dead transitions in 101730ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107960 ms. Remains : 2815/2815 places, 10973/10973 transitions.
RANDOM walk for 40000 steps (844 resets) in 1876 ms. (21 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (76 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (77 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 24232 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 24232 steps, saw 10439 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-25 01:55:27] [INFO ] Flow matrix only has 10087 transitions (discarded 886 similar events)
[2024-05-25 01:55:27] [INFO ] Invariant cache hit.
[2024-05-25 01:55:27] [INFO ] State equation strengthened by 6802 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 2684/2688 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2688 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/2713 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2713 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/2755 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2755 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 44/2799 variables, 44/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2799 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/2815 variables, 16/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2815 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 12902/12902 variables, and 2881 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3291 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 2815/2815 constraints, ReadFeed: 0/6802 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2684/2688 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2688 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/2713 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2713 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/2755 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-25 01:55:33] [INFO ] Deduced a trap composed of 146 places in 2171 ms of which 19 ms to minimize.
[2024-05-25 01:55:35] [INFO ] Deduced a trap composed of 167 places in 2104 ms of which 17 ms to minimize.
[2024-05-25 01:55:37] [INFO ] Deduced a trap composed of 168 places in 2249 ms of which 19 ms to minimize.
SMT process timed out in 10434ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2815 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2815/2815 places, 10973/10973 transitions.
Applied a total of 0 rules in 566 ms. Remains 2815 /2815 variables (removed 0) and now considering 10973/10973 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 567 ms. Remains : 2815/2815 places, 10973/10973 transitions.
RANDOM walk for 40000 steps (844 resets) in 1787 ms. (22 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (78 resets) in 220 ms. (181 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 25204 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 1
Probabilistic random walk after 25204 steps, saw 10839 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-25 01:55:41] [INFO ] Flow matrix only has 10087 transitions (discarded 886 similar events)
[2024-05-25 01:55:41] [INFO ] Invariant cache hit.
[2024-05-25 01:55:41] [INFO ] State equation strengthened by 6802 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2684/2688 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2688 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/2713 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2713 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/2755 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2755 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 44/2799 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2799 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/2815 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2815 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10087/12902 variables, 2815/2881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/12902 variables, 6802/9683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/12902 variables, 0/9683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/12902 variables, 0/9683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12902/12902 variables, and 9683 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5501 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 2815/2815 constraints, ReadFeed: 6802/6802 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2684/2688 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2688 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/2713 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2713 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/2755 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 01:55:49] [INFO ] Deduced a trap composed of 146 places in 2120 ms of which 19 ms to minimize.
[2024-05-25 01:55:51] [INFO ] Deduced a trap composed of 167 places in 2064 ms of which 18 ms to minimize.
[2024-05-25 01:55:54] [INFO ] Deduced a trap composed of 168 places in 2125 ms of which 18 ms to minimize.
[2024-05-25 01:55:56] [INFO ] Deduced a trap composed of 170 places in 2107 ms of which 25 ms to minimize.
[2024-05-25 01:55:58] [INFO ] Deduced a trap composed of 166 places in 2153 ms of which 20 ms to minimize.
[2024-05-25 01:56:00] [INFO ] Deduced a trap composed of 166 places in 2126 ms of which 20 ms to minimize.
[2024-05-25 01:56:02] [INFO ] Deduced a trap composed of 167 places in 2198 ms of which 20 ms to minimize.
[2024-05-25 01:56:04] [INFO ] Deduced a trap composed of 167 places in 2154 ms of which 19 ms to minimize.
[2024-05-25 01:56:07] [INFO ] Deduced a trap composed of 168 places in 2075 ms of which 20 ms to minimize.
[2024-05-25 01:56:09] [INFO ] Deduced a trap composed of 179 places in 2195 ms of which 21 ms to minimize.
[2024-05-25 01:56:11] [INFO ] Deduced a trap composed of 168 places in 2093 ms of which 18 ms to minimize.
[2024-05-25 01:56:13] [INFO ] Deduced a trap composed of 169 places in 2041 ms of which 18 ms to minimize.
[2024-05-25 01:56:15] [INFO ] Deduced a trap composed of 167 places in 2102 ms of which 18 ms to minimize.
[2024-05-25 01:56:17] [INFO ] Deduced a trap composed of 173 places in 2064 ms of which 19 ms to minimize.
[2024-05-25 01:56:19] [INFO ] Deduced a trap composed of 169 places in 2076 ms of which 17 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2755 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2755 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/2799 variables, 44/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2799 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 16/2815 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2815 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 12902/12902 variables, and 2896 constraints, problems are : Problem set: 0 solved, 1 unsolved in 39898 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 2815/2815 constraints, ReadFeed: 0/6802 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 15/15 constraints]
After SMT, in 45473ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 2815 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2815/2815 places, 10973/10973 transitions.
Applied a total of 0 rules in 626 ms. Remains 2815 /2815 variables (removed 0) and now considering 10973/10973 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 626 ms. Remains : 2815/2815 places, 10973/10973 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2815/2815 places, 10973/10973 transitions.
Applied a total of 0 rules in 557 ms. Remains 2815 /2815 variables (removed 0) and now considering 10973/10973 (removed 0) transitions.
[2024-05-25 01:56:28] [INFO ] Flow matrix only has 10087 transitions (discarded 886 similar events)
[2024-05-25 01:56:28] [INFO ] Invariant cache hit.
[2024-05-25 01:56:33] [INFO ] Implicit Places using invariants in 5681 ms returned []
Implicit Place search using SMT only with invariants took 5684 ms to find 0 implicit places.
Running 10879 sub problems to find dead transitions.
[2024-05-25 01:56:34] [INFO ] Flow matrix only has 10087 transitions (discarded 886 similar events)
[2024-05-25 01:56:34] [INFO ] Invariant cache hit.
[2024-05-25 01:56:34] [INFO ] State equation strengthened by 6802 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2813 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 10879 unsolved
SMT process timed out in 111547ms, After SMT, problems are : Problem set: 0 solved, 10879 unsolved
Search for dead transitions found 0 dead transitions in 111637ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117906 ms. Remains : 2815/2815 places, 10973/10973 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[2]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-08 in 458718 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[2]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[2]
[2024-05-25 01:58:25] [INFO ] Flow matrix only has 10095 transitions (discarded 886 similar events)
// Phase 1: matrix 10095 rows 2825 cols
[2024-05-25 01:58:25] [INFO ] Computed 68 invariants in 146 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2]
RANDOM walk for 10000 steps (211 resets) in 424 ms. (23 steps per ms)
BEST_FIRST walk for 10001 steps (19 resets) in 51 ms. (192 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2]
[2024-05-25 01:58:26] [INFO ] Flow matrix only has 10095 transitions (discarded 886 similar events)
[2024-05-25 01:58:26] [INFO ] Invariant cache hit.
[2024-05-25 01:58:26] [INFO ] [Real]Absence check using 47 positive place invariants in 53 ms returned sat
[2024-05-25 01:58:26] [INFO ] [Real]Absence check using 47 positive and 21 generalized place invariants in 4 ms returned sat
[2024-05-25 01:58:29] [INFO ] [Real]Absence check using state equation in 2474 ms returned sat
[2024-05-25 01:58:29] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2024-05-25 01:58:30] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 01:58:30] [INFO ] [Real]Added 6802 Read/Feed constraints in 1180 ms returned sat
[2024-05-25 01:58:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:58:30] [INFO ] [Nat]Absence check using 47 positive place invariants in 53 ms returned sat
[2024-05-25 01:58:30] [INFO ] [Nat]Absence check using 47 positive and 21 generalized place invariants in 4 ms returned sat
[2024-05-25 01:58:33] [INFO ] [Nat]Absence check using state equation in 2479 ms returned sat
[2024-05-25 01:58:34] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 01:58:35] [INFO ] [Nat]Added 6802 Read/Feed constraints in 2228 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 2825 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2825/2825 places, 10981/10981 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2825 transition count 10979
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 2823 transition count 10979
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 2821 transition count 10977
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 2821 transition count 10977
Applied a total of 8 rules in 1312 ms. Remains 2821 /2825 variables (removed 4) and now considering 10977/10981 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1312 ms. Remains : 2821/2825 places, 10977/10981 transitions.
[2024-05-25 01:58:37] [INFO ] Flow matrix only has 10091 transitions (discarded 886 similar events)
// Phase 1: matrix 10091 rows 2821 cols
[2024-05-25 01:58:37] [INFO ] Computed 68 invariants in 147 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2]
RANDOM walk for 700199 steps (14799 resets) in 30001 ms. (23 steps per ms)
BEST_FIRST walk for 1000001 steps (1968 resets) in 4950 ms. (201 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2]
[2024-05-25 01:59:12] [INFO ] Flow matrix only has 10091 transitions (discarded 886 similar events)
[2024-05-25 01:59:12] [INFO ] Invariant cache hit.
[2024-05-25 01:59:12] [INFO ] [Real]Absence check using 47 positive place invariants in 53 ms returned sat
[2024-05-25 01:59:12] [INFO ] [Real]Absence check using 47 positive and 21 generalized place invariants in 4 ms returned sat
[2024-05-25 01:59:16] [INFO ] [Real]Absence check using state equation in 3711 ms returned sat
[2024-05-25 01:59:16] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2024-05-25 01:59:17] [INFO ] [Real]Added 6802 Read/Feed constraints in 778 ms returned sat
[2024-05-25 01:59:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 01:59:17] [INFO ] [Nat]Absence check using 47 positive place invariants in 52 ms returned sat
[2024-05-25 01:59:17] [INFO ] [Nat]Absence check using 47 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-25 01:59:21] [INFO ] [Nat]Absence check using state equation in 3619 ms returned sat
[2024-05-25 01:59:25] [INFO ] [Nat]Added 6802 Read/Feed constraints in 3902 ms returned sat
[2024-05-25 01:59:27] [INFO ] Deduced a trap composed of 276 places in 2080 ms of which 19 ms to minimize.
[2024-05-25 01:59:32] [INFO ] Deduced a trap composed of 308 places in 2018 ms of which 18 ms to minimize.
[2024-05-25 01:59:38] [INFO ] Deduced a trap composed of 315 places in 1956 ms of which 19 ms to minimize.
[2024-05-25 01:59:43] [INFO ] Deduced a trap composed of 305 places in 2089 ms of which 19 ms to minimize.
[2024-05-25 01:59:47] [INFO ] Deduced a trap composed of 305 places in 1993 ms of which 18 ms to minimize.
[2024-05-25 01:59:53] [INFO ] Deduced a trap composed of 212 places in 2232 ms of which 21 ms to minimize.
[2024-05-25 01:59:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 30696 ms
[2024-05-25 01:59:56] [INFO ] Computed and/alt/rep : 4556/6606/4556 causal constraints (skipped 5441 transitions) in 615 ms.
[2024-05-25 01:59:58] [INFO ] Added : 14 causal constraints over 3 iterations in 2410 ms. Result :sat
Minimization took 4069 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2]
Support contains 1 out of 2821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2821/2821 places, 10977/10977 transitions.
Applied a total of 0 rules in 557 ms. Remains 2821 /2821 variables (removed 0) and now considering 10977/10977 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 557 ms. Remains : 2821/2821 places, 10977/10977 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2821/2821 places, 10977/10977 transitions.
Applied a total of 0 rules in 554 ms. Remains 2821 /2821 variables (removed 0) and now considering 10977/10977 (removed 0) transitions.
[2024-05-25 02:00:03] [INFO ] Flow matrix only has 10091 transitions (discarded 886 similar events)
[2024-05-25 02:00:03] [INFO ] Invariant cache hit.
[2024-05-25 02:00:09] [INFO ] Implicit Places using invariants in 5578 ms returned [293, 2186]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 5592 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2819/2821 places, 10977/10977 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2817 transition count 10975
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2817 transition count 10975
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 2815 transition count 10973
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 2815 transition count 10973
Applied a total of 8 rules in 934 ms. Remains 2815 /2819 variables (removed 4) and now considering 10973/10977 (removed 4) transitions.
[2024-05-25 02:00:10] [INFO ] Flow matrix only has 10087 transitions (discarded 886 similar events)
// Phase 1: matrix 10087 rows 2815 cols
[2024-05-25 02:00:10] [INFO ] Computed 66 invariants in 140 ms
[2024-05-25 02:00:15] [INFO ] Implicit Places using invariants in 5695 ms returned []
Implicit Place search using SMT only with invariants took 5697 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2815/2821 places, 10973/10977 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12787 ms. Remains : 2815/2821 places, 10973/10977 transitions.
[2024-05-25 02:00:15] [INFO ] Flow matrix only has 10087 transitions (discarded 886 similar events)
[2024-05-25 02:00:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2]
RANDOM walk for 706513 steps (14928 resets) in 30001 ms. (23 steps per ms)
BEST_FIRST walk for 1000001 steps (1968 resets) in 4934 ms. (202 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2]
[2024-05-25 02:00:50] [INFO ] Flow matrix only has 10087 transitions (discarded 886 similar events)
[2024-05-25 02:00:50] [INFO ] Invariant cache hit.
[2024-05-25 02:00:51] [INFO ] [Real]Absence check using 47 positive place invariants in 51 ms returned sat
[2024-05-25 02:00:51] [INFO ] [Real]Absence check using 47 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-25 02:00:54] [INFO ] [Real]Absence check using state equation in 3861 ms returned sat
[2024-05-25 02:00:55] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2024-05-25 02:00:56] [INFO ] [Real]Added 6802 Read/Feed constraints in 968 ms returned sat
[2024-05-25 02:00:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 02:00:56] [INFO ] [Nat]Absence check using 47 positive place invariants in 59 ms returned sat
[2024-05-25 02:00:56] [INFO ] [Nat]Absence check using 47 positive and 19 generalized place invariants in 5 ms returned sat
[2024-05-25 02:01:01] [INFO ] [Nat]Absence check using state equation in 4394 ms returned sat
[2024-05-25 02:01:04] [INFO ] [Nat]Added 6802 Read/Feed constraints in 3270 ms returned sat
[2024-05-25 02:01:06] [INFO ] Deduced a trap composed of 281 places in 2244 ms of which 18 ms to minimize.
[2024-05-25 02:01:11] [INFO ] Deduced a trap composed of 304 places in 2104 ms of which 20 ms to minimize.
[2024-05-25 02:01:17] [INFO ] Deduced a trap composed of 234 places in 2083 ms of which 19 ms to minimize.
[2024-05-25 02:01:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 14898 ms
[2024-05-25 02:01:19] [INFO ] Computed and/alt/rep : 4556/6604/4556 causal constraints (skipped 5437 transitions) in 621 ms.
[2024-05-25 02:01:21] [INFO ] Added : 14 causal constraints over 3 iterations in 2334 ms. Result :sat
Minimization took 18390 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2]
Support contains 1 out of 2815 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2815/2815 places, 10973/10973 transitions.
Applied a total of 0 rules in 590 ms. Remains 2815 /2815 variables (removed 0) and now considering 10973/10973 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 591 ms. Remains : 2815/2815 places, 10973/10973 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2815/2815 places, 10973/10973 transitions.
Applied a total of 0 rules in 551 ms. Remains 2815 /2815 variables (removed 0) and now considering 10973/10973 (removed 0) transitions.
[2024-05-25 02:01:41] [INFO ] Flow matrix only has 10087 transitions (discarded 886 similar events)
[2024-05-25 02:01:41] [INFO ] Invariant cache hit.
[2024-05-25 02:01:46] [INFO ] Implicit Places using invariants in 5535 ms returned []
Implicit Place search using SMT only with invariants took 5535 ms to find 0 implicit places.
Running 10879 sub problems to find dead transitions.
[2024-05-25 02:01:46] [INFO ] Flow matrix only has 10087 transitions (discarded 886 similar events)
[2024-05-25 02:01:46] [INFO ] Invariant cache hit.
[2024-05-25 02:01:46] [INFO ] State equation strengthened by 6802 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2813 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 10879 unsolved
SMT process timed out in 101947ms, After SMT, problems are : Problem set: 0 solved, 10879 unsolved
Search for dead transitions found 0 dead transitions in 102038ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108151 ms. Remains : 2815/2815 places, 10973/10973 transitions.
RANDOM walk for 40000 steps (844 resets) in 2438 ms. (16 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (78 resets) in 247 ms. (161 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (76 resets) in 253 ms. (157 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 25325 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 25325 steps, saw 10889 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-25 02:03:32] [INFO ] Flow matrix only has 10087 transitions (discarded 886 similar events)
[2024-05-25 02:03:32] [INFO ] Invariant cache hit.
[2024-05-25 02:03:32] [INFO ] State equation strengthened by 6802 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 2684/2688 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2688 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/2713 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2713 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/2755 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2755 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 44/2799 variables, 44/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2799 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/2815 variables, 16/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2815 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 12902/12902 variables, and 2881 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3828 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 2815/2815 constraints, ReadFeed: 0/6802 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2684/2688 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2688 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/2713 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2713 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/2755 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-25 02:03:39] [INFO ] Deduced a trap composed of 145 places in 2038 ms of which 19 ms to minimize.
[2024-05-25 02:03:41] [INFO ] Deduced a trap composed of 146 places in 2170 ms of which 18 ms to minimize.
[2024-05-25 02:03:43] [INFO ] Deduced a trap composed of 144 places in 1945 ms of which 19 ms to minimize.
SMT process timed out in 10586ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2815 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2815/2815 places, 10973/10973 transitions.
Applied a total of 0 rules in 644 ms. Remains 2815 /2815 variables (removed 0) and now considering 10973/10973 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 644 ms. Remains : 2815/2815 places, 10973/10973 transitions.
RANDOM walk for 40000 steps (843 resets) in 1895 ms. (21 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (77 resets) in 225 ms. (177 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 26116 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 1
Probabilistic random walk after 26116 steps, saw 11213 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-25 02:03:47] [INFO ] Flow matrix only has 10087 transitions (discarded 886 similar events)
[2024-05-25 02:03:47] [INFO ] Invariant cache hit.
[2024-05-25 02:03:47] [INFO ] State equation strengthened by 6802 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2684/2688 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2688 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/2713 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2713 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/2755 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2755 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 44/2799 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2799 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/2815 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2815 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10087/12902 variables, 2815/2881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/12902 variables, 6802/9683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/12902 variables, 0/9683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/12902 variables, 0/9683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12902/12902 variables, and 9683 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6011 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 2815/2815 constraints, ReadFeed: 6802/6802 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2684/2688 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2688 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/2713 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2713 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/2755 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 02:03:56] [INFO ] Deduced a trap composed of 145 places in 1992 ms of which 18 ms to minimize.
[2024-05-25 02:03:58] [INFO ] Deduced a trap composed of 146 places in 2185 ms of which 18 ms to minimize.
[2024-05-25 02:04:00] [INFO ] Deduced a trap composed of 144 places in 2010 ms of which 19 ms to minimize.
[2024-05-25 02:04:02] [INFO ] Deduced a trap composed of 145 places in 1902 ms of which 18 ms to minimize.
[2024-05-25 02:04:04] [INFO ] Deduced a trap composed of 145 places in 2065 ms of which 18 ms to minimize.
[2024-05-25 02:04:06] [INFO ] Deduced a trap composed of 146 places in 2034 ms of which 19 ms to minimize.
[2024-05-25 02:04:08] [INFO ] Deduced a trap composed of 144 places in 2049 ms of which 19 ms to minimize.
[2024-05-25 02:04:10] [INFO ] Deduced a trap composed of 145 places in 1984 ms of which 19 ms to minimize.
[2024-05-25 02:04:12] [INFO ] Deduced a trap composed of 142 places in 2121 ms of which 18 ms to minimize.
[2024-05-25 02:04:14] [INFO ] Deduced a trap composed of 144 places in 2022 ms of which 18 ms to minimize.
[2024-05-25 02:04:16] [INFO ] Deduced a trap composed of 143 places in 2066 ms of which 19 ms to minimize.
[2024-05-25 02:04:18] [INFO ] Deduced a trap composed of 145 places in 2057 ms of which 18 ms to minimize.
[2024-05-25 02:04:21] [INFO ] Deduced a trap composed of 143 places in 2022 ms of which 18 ms to minimize.
[2024-05-25 02:04:23] [INFO ] Deduced a trap composed of 147 places in 2065 ms of which 18 ms to minimize.
[2024-05-25 02:04:25] [INFO ] Deduced a trap composed of 147 places in 2051 ms of which 17 ms to minimize.
[2024-05-25 02:04:27] [INFO ] Deduced a trap composed of 143 places in 2007 ms of which 19 ms to minimize.
[2024-05-25 02:04:29] [INFO ] Deduced a trap composed of 147 places in 2042 ms of which 18 ms to minimize.
[2024-05-25 02:04:31] [INFO ] Deduced a trap composed of 169 places in 2009 ms of which 18 ms to minimize.
[2024-05-25 02:04:33] [INFO ] Deduced a trap composed of 147 places in 2027 ms of which 19 ms to minimize.
[2024-05-25 02:04:35] [INFO ] Deduced a trap composed of 149 places in 2032 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2755 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 02:04:37] [INFO ] Deduced a trap composed of 150 places in 2041 ms of which 19 ms to minimize.
[2024-05-25 02:04:39] [INFO ] Deduced a trap composed of 148 places in 1949 ms of which 17 ms to minimize.
SMT process timed out in 52120ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2815 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2815/2815 places, 10973/10973 transitions.
Applied a total of 0 rules in 642 ms. Remains 2815 /2815 variables (removed 0) and now considering 10973/10973 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 642 ms. Remains : 2815/2815 places, 10973/10973 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2815/2815 places, 10973/10973 transitions.
Applied a total of 0 rules in 556 ms. Remains 2815 /2815 variables (removed 0) and now considering 10973/10973 (removed 0) transitions.
[2024-05-25 02:04:40] [INFO ] Flow matrix only has 10087 transitions (discarded 886 similar events)
[2024-05-25 02:04:40] [INFO ] Invariant cache hit.
[2024-05-25 02:04:46] [INFO ] Implicit Places using invariants in 5604 ms returned []
Implicit Place search using SMT only with invariants took 5604 ms to find 0 implicit places.
Running 10879 sub problems to find dead transitions.
[2024-05-25 02:04:46] [INFO ] Flow matrix only has 10087 transitions (discarded 886 similar events)
[2024-05-25 02:04:46] [INFO ] Invariant cache hit.
[2024-05-25 02:04:46] [INFO ] State equation strengthened by 6802 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2813 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 10879 unsolved
SMT process timed out in 101024ms, After SMT, problems are : Problem set: 0 solved, 10879 unsolved
Search for dead transitions found 0 dead transitions in 101109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107283 ms. Remains : 2815/2815 places, 10973/10973 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[2]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-15 in 481906 ms.
[2024-05-25 02:06:28] [INFO ] Flatten gal took : 642 ms
[2024-05-25 02:06:28] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-25 02:06:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2825 places, 10981 transitions and 53960 arcs took 50 ms.
Total runtime 1875127 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running MultiCrashLeafsetExtension-PT-S24C08
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/409/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 2825
TRANSITIONS: 10981
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.263s, Sys 0.023s]
SAVING FILE /home/mcc/execution/409/model (.net / .def) ...
EXPORT TIME: [User 0.039s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1184
MODEL NAME: /home/mcc/execution/409/model
2825 places, 10981 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
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
Error in allocating array of size 33554432 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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-S24C08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is MultiCrashLeafsetExtension-PT-S24C08, 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 r245-tall-171654349200109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C08.tgz
mv MultiCrashLeafsetExtension-PT-S24C08 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 ;