About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S32C08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16214.768 | 3600000.00 | 3327890.00 | 216568.80 | 1 ? ? 1 0 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/mcc2022-input.r132-tall-165271821400845.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S32C08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821400845
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 29M
-rw-r--r-- 1 mcc users 14K Apr 29 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 29 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 29 16:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 29 16:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 9 08:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 9 08:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 28M May 10 09:34 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-S32C08-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652885162891
Running Version 202205111006
[2022-05-18 14:46:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 14:46:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 14:46:05] [INFO ] Load time of PNML (sax parser for PT used): 1120 ms
[2022-05-18 14:46:05] [INFO ] Transformed 27452 places.
[2022-05-18 14:46:05] [INFO ] Transformed 41619 transitions.
[2022-05-18 14:46:05] [INFO ] Parsed PT model containing 27452 places and 41619 transitions in 1357 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Normalized transition count is 40563 out of 41619 initially.
// Phase 1: matrix 40563 rows 27452 cols
[2022-05-18 14:46:11] [INFO ] Computed 1753 place invariants in 5490 ms
Incomplete random walk after 10000 steps, including 122 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :1
[2022-05-18 14:46:13] [INFO ] Flow matrix only has 40563 transitions (discarded 1056 similar events)
// Phase 1: matrix 40563 rows 27452 cols
[2022-05-18 14:46:18] [INFO ] Computed 1753 place invariants in 5034 ms
[2022-05-18 14:46:23] [INFO ] [Real]Absence check using 86 positive place invariants in 1297 ms returned unknown
[2022-05-18 14:46:27] [INFO ] [Real]Absence check using 86 positive place invariants in 1399 ms returned sat
[2022-05-18 14:46:28] [INFO ] [Real]Absence check using 86 positive and 1667 generalized place invariants in 265 ms returned unknown
[2022-05-18 14:46:32] [INFO ] [Real]Absence check using 86 positive place invariants in 1412 ms returned sat
[2022-05-18 14:46:33] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:46:33] [INFO ] [Real]Absence check using 86 positive and 1667 generalized place invariants in 236 ms returned unknown
[2022-05-18 14:46:37] [INFO ] [Real]Absence check using 86 positive place invariants in 1352 ms returned sat
[2022-05-18 14:46:38] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:46:38] [INFO ] [Real]Absence check using 86 positive and 1667 generalized place invariants in 304 ms returned unknown
[2022-05-18 14:46:43] [INFO ] [Real]Absence check using 86 positive place invariants in 1362 ms returned sat
[2022-05-18 14:46:43] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:46:43] [INFO ] [Real]Absence check using 86 positive and 1667 generalized place invariants in 129 ms returned unknown
[2022-05-18 14:46:47] [INFO ] [Real]Absence check using 86 positive place invariants in 1346 ms returned sat
[2022-05-18 14:46:48] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2349)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:888)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 14:46:52] [INFO ] [Real]Absence check using 86 positive place invariants in 1400 ms returned sat
[2022-05-18 14:46:53] [INFO ] [Real]Absence check using 86 positive and 1667 generalized place invariants in 301 ms returned unknown
[2022-05-18 14:46:57] [INFO ] [Real]Absence check using 86 positive place invariants in 1355 ms returned sat
[2022-05-18 14:46:58] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:46:58] [INFO ] [Real]Absence check using 86 positive and 1667 generalized place invariants in 423 ms returned unknown
[2022-05-18 14:47:02] [INFO ] [Real]Absence check using 86 positive place invariants in 1381 ms returned sat
[2022-05-18 14:47:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:47:03] [INFO ] [Real]Absence check using 86 positive and 1667 generalized place invariants in 295 ms returned unknown
[2022-05-18 14:47:07] [INFO ] [Real]Absence check using 86 positive place invariants in 1367 ms returned sat
[2022-05-18 14:47:08] [INFO ] [Real]Absence check using 86 positive and 1667 generalized place invariants in 402 ms returned unknown
[2022-05-18 14:47:13] [INFO ] [Real]Absence check using 86 positive place invariants in 1425 ms returned sat
[2022-05-18 14:47:13] [INFO ] [Real]Absence check using 86 positive and 1667 generalized place invariants in 271 ms returned unknown
[2022-05-18 14:47:17] [INFO ] [Real]Absence check using 86 positive place invariants in 1364 ms returned sat
[2022-05-18 14:47:18] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:47:18] [INFO ] [Real]Absence check using 86 positive and 1667 generalized place invariants in 369 ms returned unknown
[2022-05-18 14:47:22] [INFO ] [Real]Absence check using 86 positive place invariants in 1346 ms returned sat
[2022-05-18 14:47:23] [INFO ] [Real]Absence check using 86 positive and 1667 generalized place invariants in 387 ms returned unknown
[2022-05-18 14:47:27] [INFO ] [Real]Absence check using 86 positive place invariants in 1355 ms returned sat
[2022-05-18 14:47:28] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:47:28] [INFO ] [Real]Absence check using 86 positive and 1667 generalized place invariants in 409 ms returned unknown
[2022-05-18 14:47:33] [INFO ] [Real]Absence check using 86 positive place invariants in 1413 ms returned sat
[2022-05-18 14:47:33] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:47:33] [INFO ] [Real]Absence check using 86 positive and 1667 generalized place invariants in 335 ms returned unknown
[2022-05-18 14:47:38] [INFO ] [Real]Absence check using 86 positive place invariants in 1364 ms returned sat
[2022-05-18 14:47:38] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2349)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:888)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [33, 1, 99, 33, 1, 33, 33, 33, 33, 33, 1, 1, 1, 33, 99, 33] Max seen :[1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1]
Support contains 16 out of 27452 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 27452/27452 places, 41619/41619 transitions.
Graph (complete) has 92537 edges and 27452 vertex of which 27400 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.75 ms
Discarding 52 places :
Also discarding 0 output transitions
Drop transitions removed 8425 transitions
Trivial Post-agglo rules discarded 8425 transitions
Performed 8425 trivial Post agglomeration. Transition count delta: 8425
Iterating post reduction 0 with 8425 rules applied. Total rules applied 8426 place count 27400 transition count 33194
Reduce places removed 8425 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 8443 rules applied. Total rules applied 16869 place count 18975 transition count 33176
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 16887 place count 18957 transition count 33176
Performed 527 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 527 Pre rules applied. Total rules applied 16887 place count 18957 transition count 32649
Deduced a syphon composed of 527 places in 37 ms
Reduce places removed 527 places and 0 transitions.
Iterating global reduction 3 with 1054 rules applied. Total rules applied 17941 place count 18430 transition count 32649
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 40 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 18007 place count 18397 transition count 32616
Free-agglomeration rule (complex) applied 1573 times.
Iterating global reduction 3 with 1573 rules applied. Total rules applied 19580 place count 18397 transition count 31043
Reduce places removed 1573 places and 0 transitions.
Iterating post reduction 3 with 1573 rules applied. Total rules applied 21153 place count 16824 transition count 31043
Discarding 7913 places :
Symmetric choice reduction at 4 with 7913 rule applications. Total rules 29066 place count 8911 transition count 23130
Iterating global reduction 4 with 7913 rules applied. Total rules applied 36979 place count 8911 transition count 23130
Partial Free-agglomeration rule applied 230 times.
Drop transitions removed 230 transitions
Iterating global reduction 4 with 230 rules applied. Total rules applied 37209 place count 8911 transition count 23130
Applied a total of 37209 rules in 12846 ms. Remains 8911 /27452 variables (removed 18541) and now considering 23130/41619 (removed 18489) transitions.
Finished structural reductions, in 1 iterations. Remains : 8911/27452 places, 23130/41619 transitions.
Normalized transition count is 21564 out of 23130 initially.
// Phase 1: matrix 21564 rows 8911 cols
[2022-05-18 14:47:52] [INFO ] Computed 1701 place invariants in 992 ms
FORMULA MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Interrupted random walk after 372154 steps, including 7538 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen 0
Interrupted Best-First random walk after 557409 steps, including 1085 resets, run timeout after 5001 ms. (steps per millisecond=111 ) properties seen 1
FORMULA MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 556669 steps, including 1084 resets, run timeout after 5001 ms. (steps per millisecond=111 ) properties seen 0
Interrupted Best-First random walk after 557175 steps, including 1085 resets, run timeout after 5001 ms. (steps per millisecond=111 ) properties seen 0
Interrupted Best-First random walk after 562817 steps, including 1096 resets, run timeout after 5001 ms. (steps per millisecond=112 ) properties seen 0
Interrupted Best-First random walk after 563281 steps, including 1097 resets, run timeout after 5001 ms. (steps per millisecond=112 ) properties seen 0
Interrupted Best-First random walk after 555690 steps, including 1082 resets, run timeout after 5001 ms. (steps per millisecond=111 ) properties seen 0
Interrupted Best-First random walk after 564751 steps, including 1100 resets, run timeout after 5001 ms. (steps per millisecond=112 ) properties seen 0
Interrupted Best-First random walk after 564199 steps, including 1098 resets, run timeout after 5001 ms. (steps per millisecond=112 ) properties seen 0
Interrupted Best-First random walk after 556754 steps, including 1084 resets, run timeout after 5001 ms. (steps per millisecond=111 ) properties seen 1
FORMULA MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-05-18 14:49:07] [INFO ] Flow matrix only has 21564 transitions (discarded 1566 similar events)
// Phase 1: matrix 21564 rows 8911 cols
[2022-05-18 14:49:08] [INFO ] Computed 1701 place invariants in 1037 ms
[2022-05-18 14:49:09] [INFO ] [Real]Absence check using 65 positive place invariants in 253 ms returned sat
[2022-05-18 14:49:10] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 828 ms returned sat
[2022-05-18 14:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:49:30] [INFO ] [Real]Absence check using state equation in 20574 ms returned sat
[2022-05-18 14:49:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:49:32] [INFO ] [Nat]Absence check using 65 positive place invariants in 246 ms returned sat
[2022-05-18 14:49:33] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 756 ms returned sat
[2022-05-18 14:49:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:49:53] [INFO ] [Nat]Absence check using state equation in 20404 ms returned sat
[2022-05-18 14:49:54] [INFO ] State equation strengthened by 13378 read => feed constraints.
[2022-05-18 14:49:57] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:50:00] [INFO ] [Nat]Added 13378 Read/Feed constraints in 6839 ms returned unknown
[2022-05-18 14:50:01] [INFO ] [Real]Absence check using 65 positive place invariants in 225 ms returned sat
[2022-05-18 14:50:02] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 604 ms returned sat
[2022-05-18 14:50:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:50:20] [INFO ] [Real]Absence check using state equation in 18275 ms returned sat
[2022-05-18 14:50:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:50:22] [INFO ] [Nat]Absence check using 65 positive place invariants in 226 ms returned sat
[2022-05-18 14:50:23] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 717 ms returned sat
[2022-05-18 14:50:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:50:44] [INFO ] [Nat]Absence check using state equation in 21200 ms returned sat
[2022-05-18 14:50:48] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:50:49] [INFO ] [Nat]Added 13378 Read/Feed constraints in 4726 ms returned sat
[2022-05-18 14:50:51] [INFO ] Computed and/alt/rep : 10938/15905/10938 causal constraints (skipped 10593 transitions) in 1839 ms.
[2022-05-18 14:50:56] [INFO ] Added : 8 causal constraints over 2 iterations in 6215 ms. Result :sat
[2022-05-18 14:50:58] [INFO ] [Real]Absence check using 65 positive place invariants in 253 ms returned sat
[2022-05-18 14:50:58] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 666 ms returned sat
[2022-05-18 14:50:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:51:18] [INFO ] [Real]Absence check using state equation in 20311 ms returned sat
[2022-05-18 14:51:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:51:20] [INFO ] [Nat]Absence check using 65 positive place invariants in 235 ms returned sat
[2022-05-18 14:51:21] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 651 ms returned sat
[2022-05-18 14:51:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:51:43] [INFO ] [Nat]Absence check using state equation in 21985 ms returned sat
[2022-05-18 14:51:47] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:51:51] [INFO ] [Nat]Added 13378 Read/Feed constraints in 8379 ms returned unknown
[2022-05-18 14:51:52] [INFO ] [Real]Absence check using 65 positive place invariants in 231 ms returned sat
[2022-05-18 14:51:53] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 723 ms returned sat
[2022-05-18 14:51:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:52:13] [INFO ] [Real]Absence check using state equation in 20078 ms returned sat
[2022-05-18 14:52:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:52:15] [INFO ] [Nat]Absence check using 65 positive place invariants in 217 ms returned sat
[2022-05-18 14:52:15] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 695 ms returned sat
[2022-05-18 14:52:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:52:37] [INFO ] [Nat]Absence check using state equation in 21734 ms returned sat
[2022-05-18 14:52:41] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:52:43] [INFO ] [Nat]Added 13378 Read/Feed constraints in 5794 ms returned sat
[2022-05-18 14:53:03] [INFO ] Deduced a trap composed of 685 places in 19721 ms of which 16 ms to minimize.
[2022-05-18 14:53:03] [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 3
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 14:53:04] [INFO ] [Real]Absence check using 65 positive place invariants in 220 ms returned sat
[2022-05-18 14:53:05] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 659 ms returned sat
[2022-05-18 14:53:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:53:26] [INFO ] [Real]Absence check using state equation in 20656 ms returned sat
[2022-05-18 14:53:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:53:27] [INFO ] [Nat]Absence check using 65 positive place invariants in 218 ms returned sat
[2022-05-18 14:53:28] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 696 ms returned sat
[2022-05-18 14:53:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:53:49] [INFO ] [Nat]Absence check using state equation in 21097 ms returned sat
[2022-05-18 14:53:53] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:53:56] [INFO ] [Nat]Added 13378 Read/Feed constraints in 6767 ms returned unknown
[2022-05-18 14:53:57] [INFO ] [Real]Absence check using 65 positive place invariants in 210 ms returned sat
[2022-05-18 14:53:57] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 583 ms returned sat
[2022-05-18 14:53:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:54:17] [INFO ] [Real]Absence check using state equation in 19985 ms returned sat
[2022-05-18 14:54:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:54:19] [INFO ] [Nat]Absence check using 65 positive place invariants in 221 ms returned sat
[2022-05-18 14:54:20] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 703 ms returned sat
[2022-05-18 14:54:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:54:39] [INFO ] [Nat]Absence check using state equation in 19695 ms returned sat
[2022-05-18 14:54:43] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:54:46] [INFO ] [Nat]Added 13378 Read/Feed constraints in 6739 ms returned unknown
[2022-05-18 14:54:47] [INFO ] [Real]Absence check using 65 positive place invariants in 225 ms returned sat
[2022-05-18 14:54:48] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 564 ms returned sat
[2022-05-18 14:54:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:55:06] [INFO ] [Real]Absence check using state equation in 18670 ms returned sat
[2022-05-18 14:55:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:55:08] [INFO ] [Nat]Absence check using 65 positive place invariants in 234 ms returned sat
[2022-05-18 14:55:09] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 765 ms returned sat
[2022-05-18 14:55:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:55:27] [INFO ] [Nat]Absence check using state equation in 18545 ms returned sat
[2022-05-18 14:55:31] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:55:34] [INFO ] [Nat]Added 13378 Read/Feed constraints in 6808 ms returned unknown
[2022-05-18 14:55:35] [INFO ] [Real]Absence check using 65 positive place invariants in 229 ms returned sat
[2022-05-18 14:55:36] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 729 ms returned sat
[2022-05-18 14:55:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:55:56] [INFO ] [Real]Absence check using state equation in 19801 ms returned sat
[2022-05-18 14:55:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:55:57] [INFO ] [Nat]Absence check using 65 positive place invariants in 209 ms returned sat
[2022-05-18 14:55:58] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 569 ms returned sat
[2022-05-18 14:55:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:56:17] [INFO ] [Nat]Absence check using state equation in 19181 ms returned sat
[2022-05-18 14:56:21] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:56:24] [INFO ] [Nat]Added 13378 Read/Feed constraints in 6741 ms returned unknown
[2022-05-18 14:56:25] [INFO ] [Real]Absence check using 65 positive place invariants in 219 ms returned sat
[2022-05-18 14:56:25] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 611 ms returned sat
[2022-05-18 14:56:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:56:41] [INFO ] [Real]Absence check using state equation in 15841 ms returned sat
[2022-05-18 14:56:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:56:43] [INFO ] [Nat]Absence check using 65 positive place invariants in 235 ms returned sat
[2022-05-18 14:56:43] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 601 ms returned sat
[2022-05-18 14:56:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:57:04] [INFO ] [Nat]Absence check using state equation in 20848 ms returned sat
[2022-05-18 14:57:08] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:57:10] [INFO ] [Nat]Added 13378 Read/Feed constraints in 6016 ms returned sat
[2022-05-18 14:57:13] [INFO ] Computed and/alt/rep : 10938/15905/10938 causal constraints (skipped 10593 transitions) in 1571 ms.
[2022-05-18 14:57:17] [INFO ] Added : 8 causal constraints over 2 iterations in 5610 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 2, 1, 1, 1, 1, 1, 1, 2] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 8911 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8911/8911 places, 23130/23130 transitions.
Drop transitions 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 8911 transition count 23127
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 8908 transition count 23127
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 8908 transition count 23125
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 8906 transition count 23125
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 15 place count 8906 transition count 23120
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 20 place count 8901 transition count 23120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 23 place count 8898 transition count 23117
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 8898 transition count 23117
Applied a total of 26 rules in 4096 ms. Remains 8898 /8911 variables (removed 13) and now considering 23117/23130 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 8898/8911 places, 23117/23130 transitions.
Normalized transition count is 21551 out of 23117 initially.
// Phase 1: matrix 21551 rows 8898 cols
[2022-05-18 14:57:23] [INFO ] Computed 1701 place invariants in 988 ms
Interrupted random walk after 376709 steps, including 7640 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen 1
FORMULA MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 548354 steps, including 1068 resets, run timeout after 5001 ms. (steps per millisecond=109 ) properties seen 0
Interrupted Best-First random walk after 548947 steps, including 1069 resets, run timeout after 5001 ms. (steps per millisecond=109 ) properties seen 0
Interrupted Best-First random walk after 559852 steps, including 1090 resets, run timeout after 5001 ms. (steps per millisecond=111 ) properties seen 0
Interrupted Best-First random walk after 548143 steps, including 1067 resets, run timeout after 5001 ms. (steps per millisecond=109 ) properties seen 0
Interrupted Best-First random walk after 554221 steps, including 1079 resets, run timeout after 5001 ms. (steps per millisecond=110 ) properties seen 0
Interrupted Best-First random walk after 543499 steps, including 1058 resets, run timeout after 5001 ms. (steps per millisecond=108 ) properties seen 0
Interrupted Best-First random walk after 546510 steps, including 1064 resets, run timeout after 5001 ms. (steps per millisecond=109 ) properties seen 0
Interrupted Best-First random walk after 550911 steps, including 1073 resets, run timeout after 5001 ms. (steps per millisecond=110 ) properties seen 0
[2022-05-18 14:58:33] [INFO ] Flow matrix only has 21551 transitions (discarded 1566 similar events)
// Phase 1: matrix 21551 rows 8898 cols
[2022-05-18 14:58:34] [INFO ] Computed 1701 place invariants in 1055 ms
[2022-05-18 14:58:35] [INFO ] [Real]Absence check using 65 positive place invariants in 232 ms returned sat
[2022-05-18 14:58:36] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 577 ms returned sat
[2022-05-18 14:58:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:58:56] [INFO ] [Real]Absence check using state equation in 20520 ms returned sat
[2022-05-18 14:58:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:58:58] [INFO ] [Nat]Absence check using 65 positive place invariants in 194 ms returned sat
[2022-05-18 14:58:58] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 554 ms returned sat
[2022-05-18 14:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:59:15] [INFO ] [Nat]Absence check using state equation in 16233 ms returned sat
[2022-05-18 14:59:15] [INFO ] State equation strengthened by 13378 read => feed constraints.
[2022-05-18 14:59:19] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:59:22] [INFO ] [Nat]Added 13378 Read/Feed constraints in 6747 ms returned unknown
[2022-05-18 14:59:23] [INFO ] [Real]Absence check using 65 positive place invariants in 229 ms returned sat
[2022-05-18 14:59:23] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 557 ms returned sat
[2022-05-18 14:59:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:59:40] [INFO ] [Real]Absence check using state equation in 16807 ms returned sat
[2022-05-18 14:59:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:59:41] [INFO ] [Nat]Absence check using 65 positive place invariants in 222 ms returned sat
[2022-05-18 14:59:42] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 561 ms returned sat
[2022-05-18 14:59:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 15:00:00] [INFO ] [Nat]Absence check using state equation in 17616 ms returned sat
[2022-05-18 15:00:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 15:00:06] [INFO ] [Nat]Added 13378 Read/Feed constraints in 6761 ms returned unknown
[2022-05-18 15:00:07] [INFO ] [Real]Absence check using 65 positive place invariants in 227 ms returned sat
[2022-05-18 15:00:08] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 607 ms returned sat
[2022-05-18 15:00:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:00:23] [INFO ] [Real]Absence check using state equation in 14948 ms returned sat
[2022-05-18 15:00:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 15:00:24] [INFO ] [Nat]Absence check using 65 positive place invariants in 191 ms returned sat
[2022-05-18 15:00:25] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 549 ms returned sat
[2022-05-18 15:00:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 15:00:40] [INFO ] [Nat]Absence check using state equation in 15194 ms returned sat
[2022-05-18 15:00:45] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 15:00:45] [INFO ] [Nat]Added 13378 Read/Feed constraints in 5230 ms returned unsat
[2022-05-18 15:00:46] [INFO ] [Real]Absence check using 65 positive place invariants in 214 ms returned sat
[2022-05-18 15:00:47] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 559 ms returned sat
[2022-05-18 15:00:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:01:01] [INFO ] [Real]Absence check using state equation in 14281 ms returned sat
[2022-05-18 15:01:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 15:01:02] [INFO ] [Nat]Absence check using 65 positive place invariants in 220 ms returned sat
[2022-05-18 15:01:03] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 545 ms returned sat
[2022-05-18 15:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 15:01:19] [INFO ] [Nat]Absence check using state equation in 15974 ms returned sat
[2022-05-18 15:01:23] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 15:01:26] [INFO ] [Nat]Added 13378 Read/Feed constraints in 6741 ms returned unknown
[2022-05-18 15:01:27] [INFO ] [Real]Absence check using 65 positive place invariants in 212 ms returned sat
[2022-05-18 15:01:27] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 566 ms returned sat
[2022-05-18 15:01:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:01:43] [INFO ] [Real]Absence check using state equation in 15597 ms returned sat
[2022-05-18 15:01:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 15:01:44] [INFO ] [Nat]Absence check using 65 positive place invariants in 210 ms returned sat
[2022-05-18 15:01:45] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 569 ms returned sat
[2022-05-18 15:01:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 15:01:58] [INFO ] [Nat]Absence check using state equation in 13028 ms returned sat
[2022-05-18 15:02:01] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 15:02:05] [INFO ] [Nat]Added 13378 Read/Feed constraints in 7755 ms returned unknown
[2022-05-18 15:02:06] [INFO ] [Real]Absence check using 65 positive place invariants in 228 ms returned sat
[2022-05-18 15:02:07] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 563 ms returned sat
[2022-05-18 15:02:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:02:24] [INFO ] [Real]Absence check using state equation in 17079 ms returned sat
[2022-05-18 15:02:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 15:02:25] [INFO ] [Nat]Absence check using 65 positive place invariants in 191 ms returned sat
[2022-05-18 15:02:26] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 546 ms returned sat
[2022-05-18 15:02:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 15:02:41] [INFO ] [Nat]Absence check using state equation in 15323 ms returned sat
[2022-05-18 15:02:45] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 15:02:48] [INFO ] [Nat]Added 13378 Read/Feed constraints in 6750 ms returned unknown
[2022-05-18 15:02:49] [INFO ] [Real]Absence check using 65 positive place invariants in 226 ms returned sat
[2022-05-18 15:02:50] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 565 ms returned sat
[2022-05-18 15:02:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:03:04] [INFO ] [Real]Absence check using state equation in 14386 ms returned sat
[2022-05-18 15:03:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 15:03:05] [INFO ] [Nat]Absence check using 65 positive place invariants in 206 ms returned sat
[2022-05-18 15:03:06] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 558 ms returned sat
[2022-05-18 15:03:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 15:03:23] [INFO ] [Nat]Absence check using state equation in 16519 ms returned sat
[2022-05-18 15:03:26] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 15:03:29] [INFO ] [Nat]Added 13378 Read/Feed constraints in 6782 ms returned unknown
[2022-05-18 15:03:30] [INFO ] [Real]Absence check using 65 positive place invariants in 214 ms returned sat
[2022-05-18 15:03:31] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 538 ms returned sat
[2022-05-18 15:03:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:03:45] [INFO ] [Real]Absence check using state equation in 14411 ms returned sat
[2022-05-18 15:03:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 15:03:47] [INFO ] [Nat]Absence check using 65 positive place invariants in 218 ms returned sat
[2022-05-18 15:03:47] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 552 ms returned sat
[2022-05-18 15:03:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 15:04:03] [INFO ] [Nat]Absence check using state equation in 16172 ms returned sat
[2022-05-18 15:04:07] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 15:04:08] [INFO ] [Nat]Added 13378 Read/Feed constraints in 4430 ms returned sat
[2022-05-18 15:04:10] [INFO ] Computed and/alt/rep : 10928/15892/10928 causal constraints (skipped 10590 transitions) in 1924 ms.
[2022-05-18 15:04:15] [INFO ] Added : 8 causal constraints over 2 iterations in 6057 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 2, 0, 1, 1, 1, 1, 2] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 8898 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8898/8898 places, 23117/23117 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8898 transition count 23116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8897 transition count 23116
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 8897 transition count 23115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 8896 transition count 23115
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 8895 transition count 23114
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 8895 transition count 23114
Applied a total of 6 rules in 3792 ms. Remains 8895 /8898 variables (removed 3) and now considering 23114/23117 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 8895/8898 places, 23114/23117 transitions.
Normalized transition count is 21548 out of 23114 initially.
// Phase 1: matrix 21548 rows 8895 cols
[2022-05-18 15:04:20] [INFO ] Computed 1701 place invariants in 953 ms
Interrupted random walk after 379615 steps, including 7697 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen 0
Interrupted Best-First random walk after 548506 steps, including 1068 resets, run timeout after 5001 ms. (steps per millisecond=109 ) properties seen 0
Interrupted Best-First random walk after 554890 steps, including 1080 resets, run timeout after 5001 ms. (steps per millisecond=110 ) properties seen 0
Interrupted Best-First random walk after 551191 steps, including 1073 resets, run timeout after 5001 ms. (steps per millisecond=110 ) properties seen 0
Interrupted Best-First random walk after 557799 steps, including 1086 resets, run timeout after 5001 ms. (steps per millisecond=111 ) properties seen 0
Interrupted Best-First random walk after 549779 steps, including 1070 resets, run timeout after 5001 ms. (steps per millisecond=109 ) properties seen 0
Interrupted Best-First random walk after 560868 steps, including 1092 resets, run timeout after 5001 ms. (steps per millisecond=112 ) properties seen 0
Interrupted Best-First random walk after 559502 steps, including 1089 resets, run timeout after 5001 ms. (steps per millisecond=111 ) properties seen 0
[2022-05-18 15:05:25] [INFO ] Flow matrix only has 21548 transitions (discarded 1566 similar events)
// Phase 1: matrix 21548 rows 8895 cols
[2022-05-18 15:05:26] [INFO ] Computed 1701 place invariants in 987 ms
[2022-05-18 15:05:27] [INFO ] [Real]Absence check using 65 positive place invariants in 209 ms returned sat
[2022-05-18 15:05:28] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 563 ms returned sat
[2022-05-18 15:05:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:05:42] [INFO ] [Real]Absence check using state equation in 14269 ms returned sat
[2022-05-18 15:05:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 15:05:44] [INFO ] [Nat]Absence check using 65 positive place invariants in 202 ms returned sat
[2022-05-18 15:05:44] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 558 ms returned sat
[2022-05-18 15:05:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 15:05:59] [INFO ] [Nat]Absence check using state equation in 14662 ms returned sat
[2022-05-18 15:05:59] [INFO ] State equation strengthened by 13378 read => feed constraints.
[2022-05-18 15:06:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 15:06:06] [INFO ] [Nat]Added 13378 Read/Feed constraints in 6874 ms returned unknown
[2022-05-18 15:06:07] [INFO ] [Real]Absence check using 65 positive place invariants in 211 ms returned sat
[2022-05-18 15:06:07] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 559 ms returned sat
[2022-05-18 15:06:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:06:23] [INFO ] [Real]Absence check using state equation in 15447 ms returned sat
[2022-05-18 15:06:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 15:06:24] [INFO ] [Nat]Absence check using 65 positive place invariants in 208 ms returned sat
[2022-05-18 15:06:25] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 573 ms returned sat
[2022-05-18 15:06:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 15:06:41] [INFO ] [Nat]Absence check using state equation in 15698 ms returned sat
[2022-05-18 15:06:44] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 15:06:45] [INFO ] [Nat]Added 13378 Read/Feed constraints in 4359 ms returned sat
[2022-05-18 15:07:03] [INFO ] Deduced a trap composed of 340 places in 17812 ms of which 11 ms to minimize.
[2022-05-18 15:07:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19812 ms
[2022-05-18 15:07:06] [INFO ] Computed and/alt/rep : 10926/15889/10926 causal constraints (skipped 10589 transitions) in 1654 ms.
[2022-05-18 15:07:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 15:07:09] [INFO ] [Real]Absence check using 65 positive place invariants in 209 ms returned sat
[2022-05-18 15:07:10] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 568 ms returned sat
[2022-05-18 15:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:07:26] [INFO ] [Real]Absence check using state equation in 15654 ms returned sat
[2022-05-18 15:07:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 15:07:27] [INFO ] [Nat]Absence check using 65 positive place invariants in 197 ms returned sat
[2022-05-18 15:07:28] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 551 ms returned sat
[2022-05-18 15:07:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 15:07:45] [INFO ] [Nat]Absence check using state equation in 17290 ms returned sat
[2022-05-18 15:07:49] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 15:07:49] [INFO ] [Nat]Added 13378 Read/Feed constraints in 4607 ms returned sat
[2022-05-18 15:08:08] [INFO ] Deduced a trap composed of 903 places in 17860 ms of which 9 ms to minimize.
[2022-05-18 15:08:27] [INFO ] Deduced a trap composed of 878 places in 16703 ms of which 8 ms to minimize.
[2022-05-18 15:08:27] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 15:08:28] [INFO ] [Real]Absence check using 65 positive place invariants in 224 ms returned sat
[2022-05-18 15:08:28] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 574 ms returned sat
[2022-05-18 15:08:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:08:43] [INFO ] [Real]Absence check using state equation in 14901 ms returned sat
[2022-05-18 15:08:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 15:08:44] [INFO ] [Nat]Absence check using 65 positive place invariants in 230 ms returned sat
[2022-05-18 15:08:45] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 590 ms returned sat
[2022-05-18 15:08:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 15:09:04] [INFO ] [Nat]Absence check using state equation in 18867 ms returned sat
[2022-05-18 15:09:08] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 15:09:11] [INFO ] [Nat]Added 13378 Read/Feed constraints in 6720 ms returned unknown
[2022-05-18 15:09:12] [INFO ] [Real]Absence check using 65 positive place invariants in 228 ms returned sat
[2022-05-18 15:09:12] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 594 ms returned sat
[2022-05-18 15:09:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:09:30] [INFO ] [Real]Absence check using state equation in 17798 ms returned sat
[2022-05-18 15:09:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 15:09:31] [INFO ] [Nat]Absence check using 65 positive place invariants in 228 ms returned sat
[2022-05-18 15:09:32] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 600 ms returned sat
[2022-05-18 15:09:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 15:09:50] [INFO ] [Nat]Absence check using state equation in 18007 ms returned sat
[2022-05-18 15:09:54] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 15:09:57] [INFO ] [Nat]Added 13378 Read/Feed constraints in 6811 ms returned unknown
[2022-05-18 15:09:58] [INFO ] [Real]Absence check using 65 positive place invariants in 232 ms returned sat
[2022-05-18 15:09:59] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 612 ms returned sat
[2022-05-18 15:09:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:10:15] [INFO ] [Real]Absence check using state equation in 16840 ms returned sat
[2022-05-18 15:10:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 15:10:17] [INFO ] [Nat]Absence check using 65 positive place invariants in 235 ms returned sat
[2022-05-18 15:10:18] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 658 ms returned sat
[2022-05-18 15:10:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 15:10:36] [INFO ] [Nat]Absence check using state equation in 18565 ms returned sat
[2022-05-18 15:10:40] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 15:10:43] [INFO ] [Nat]Added 13378 Read/Feed constraints in 6689 ms returned unknown
[2022-05-18 15:10:44] [INFO ] [Real]Absence check using 65 positive place invariants in 218 ms returned sat
[2022-05-18 15:10:44] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 560 ms returned sat
[2022-05-18 15:10:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:11:03] [INFO ] [Real]Absence check using state equation in 18405 ms returned sat
[2022-05-18 15:11:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 15:11:04] [INFO ] [Nat]Absence check using 65 positive place invariants in 255 ms returned sat
[2022-05-18 15:11:05] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 623 ms returned sat
[2022-05-18 15:11:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 15:11:26] [INFO ] [Nat]Absence check using state equation in 20779 ms returned sat
[2022-05-18 15:11:29] [INFO ] [Nat]Added 13378 Read/Feed constraints in 3749 ms returned sat
[2022-05-18 15:11:32] [INFO ] Computed and/alt/rep : 10926/15889/10926 causal constraints (skipped 10589 transitions) in 1591 ms.
[2022-05-18 15:11:36] [INFO ] Added : 8 causal constraints over 2 iterations in 5886 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 2, 1, 1, 1, 1, 2] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 8895 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8895/8895 places, 23114/23114 transitions.
Applied a total of 0 rules in 1290 ms. Remains 8895 /8895 variables (removed 0) and now considering 23114/23114 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8895/8895 places, 23114/23114 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8895/8895 places, 23114/23114 transitions.
Applied a total of 0 rules in 1304 ms. Remains 8895 /8895 variables (removed 0) and now considering 23114/23114 (removed 0) transitions.
[2022-05-18 15:11:40] [INFO ] Flow matrix only has 21548 transitions (discarded 1566 similar events)
// Phase 1: matrix 21548 rows 8895 cols
[2022-05-18 15:11:41] [INFO ] Computed 1701 place invariants in 1157 ms
[2022-05-18 15:11:42] [INFO ] Implicit Places using invariants in 1976 ms returned []
Implicit Place search using SMT only with invariants took 1977 ms to find 0 implicit places.
[2022-05-18 15:11:42] [INFO ] Flow matrix only has 21548 transitions (discarded 1566 similar events)
// Phase 1: matrix 21548 rows 8895 cols
[2022-05-18 15:11:43] [INFO ] Computed 1701 place invariants in 1011 ms
[2022-05-18 15:11:44] [INFO ] Dead Transitions using invariants and state equation in 1910 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8895/8895 places, 23114/23114 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-01
Normalized transition count is 21548 out of 23114 initially.
// Phase 1: matrix 21548 rows 8895 cols
[2022-05-18 15:11:45] [INFO ] Computed 1701 place invariants in 1008 ms
Incomplete random walk after 10000 steps, including 202 resets, run finished after 839 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
[2022-05-18 15:11:46] [INFO ] Flow matrix only has 21548 transitions (discarded 1566 similar events)
// Phase 1: matrix 21548 rows 8895 cols
[2022-05-18 15:11:47] [INFO ] Computed 1701 place invariants in 1108 ms
[2022-05-18 15:11:48] [INFO ] [Real]Absence check using 65 positive place invariants in 231 ms returned sat
[2022-05-18 15:11:49] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 696 ms returned sat
[2022-05-18 15:11:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:11:52] [INFO ] [Real]Absence check using state equation in 3290 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8895 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8895/8895 places, 23114/23114 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8895 transition count 23113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8894 transition count 23113
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 8894 transition count 23111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 8892 transition count 23111
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 9 place count 8889 transition count 23108
Iterating global reduction 3 with 3 rules applied. Total rules applied 12 place count 8889 transition count 23108
Applied a total of 12 rules in 3999 ms. Remains 8889 /8895 variables (removed 6) and now considering 23108/23114 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 8889/8895 places, 23108/23114 transitions.
Normalized transition count is 21542 out of 23108 initially.
// Phase 1: matrix 21542 rows 8889 cols
[2022-05-18 15:11:57] [INFO ] Computed 1701 place invariants in 1019 ms
Interrupted random walk after 363333 steps, including 7368 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen 0
Interrupted Best-First random walk after 530990 steps, including 1034 resets, run timeout after 5001 ms. (steps per millisecond=106 ) properties seen 0
[2022-05-18 15:12:32] [INFO ] Flow matrix only has 21542 transitions (discarded 1566 similar events)
// Phase 1: matrix 21542 rows 8889 cols
[2022-05-18 15:12:33] [INFO ] Computed 1701 place invariants in 1042 ms
[2022-05-18 15:12:34] [INFO ] [Real]Absence check using 63 positive place invariants in 182 ms returned sat
[2022-05-18 15:12:35] [INFO ] [Real]Absence check using 63 positive and 1638 generalized place invariants in 687 ms returned sat
[2022-05-18 15:12:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:12:53] [INFO ] [Real]Absence check using state equation in 18271 ms returned sat
[2022-05-18 15:12:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 15:12:54] [INFO ] [Nat]Absence check using 63 positive place invariants in 180 ms returned sat
[2022-05-18 15:12:55] [INFO ] [Nat]Absence check using 63 positive and 1638 generalized place invariants in 632 ms returned sat
[2022-05-18 15:12:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 15:13:16] [INFO ] [Nat]Absence check using state equation in 21056 ms returned sat
[2022-05-18 15:13:16] [INFO ] State equation strengthened by 13378 read => feed constraints.
[2022-05-18 15:13:20] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 15:13:23] [INFO ] [Nat]Added 13378 Read/Feed constraints in 6816 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8889 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8889/8889 places, 23108/23108 transitions.
Applied a total of 0 rules in 1263 ms. Remains 8889 /8889 variables (removed 0) and now considering 23108/23108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8889/8889 places, 23108/23108 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8889/8889 places, 23108/23108 transitions.
Applied a total of 0 rules in 1263 ms. Remains 8889 /8889 variables (removed 0) and now considering 23108/23108 (removed 0) transitions.
[2022-05-18 15:13:26] [INFO ] Flow matrix only has 21542 transitions (discarded 1566 similar events)
// Phase 1: matrix 21542 rows 8889 cols
[2022-05-18 15:13:27] [INFO ] Computed 1701 place invariants in 988 ms
[2022-05-18 15:13:27] [INFO ] Implicit Places using invariants in 1799 ms returned []
Implicit Place search using SMT only with invariants took 1800 ms to find 0 implicit places.
[2022-05-18 15:13:27] [INFO ] Flow matrix only has 21542 transitions (discarded 1566 similar events)
// Phase 1: matrix 21542 rows 8889 cols
[2022-05-18 15:13:28] [INFO ] Computed 1701 place invariants in 990 ms
[2022-05-18 15:13:29] [INFO ] Dead Transitions using invariants and state equation in 1773 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8889/8889 places, 23108/23108 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-01 in 105444 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-02
Normalized transition count is 21548 out of 23114 initially.
// Phase 1: matrix 21548 rows 8895 cols
[2022-05-18 15:13:30] [INFO ] Computed 1701 place invariants in 1003 ms
Incomplete random walk after 10000 steps, including 202 resets, run finished after 858 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
[2022-05-18 15:13:31] [INFO ] Flow matrix only has 21548 transitions (discarded 1566 similar events)
// Phase 1: matrix 21548 rows 8895 cols
[2022-05-18 15:13:32] [INFO ] Computed 1701 place invariants in 1021 ms
[2022-05-18 15:13:33] [INFO ] [Real]Absence check using 65 positive place invariants in 237 ms returned sat
[2022-05-18 15:13:34] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 709 ms returned sat
[2022-05-18 15:13:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:13:37] [INFO ] [Real]Absence check using state equation in 3279 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 8895 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8895/8895 places, 23114/23114 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8895 transition count 23113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8894 transition count 23113
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 8894 transition count 23112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 8893 transition count 23112
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 6 place count 8891 transition count 23110
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 8891 transition count 23110
Applied a total of 8 rules in 3930 ms. Remains 8891 /8895 variables (removed 4) and now considering 23110/23114 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 8891/8895 places, 23110/23114 transitions.
Normalized transition count is 21544 out of 23110 initially.
// Phase 1: matrix 21544 rows 8891 cols
[2022-05-18 15:13:42] [INFO ] Computed 1701 place invariants in 1009 ms
Interrupted random walk after 361102 steps, including 7324 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen 0
Interrupted Best-First random walk after 537487 steps, including 1047 resets, run timeout after 5001 ms. (steps per millisecond=107 ) properties seen 0
[2022-05-18 15:14:17] [INFO ] Flow matrix only has 21544 transitions (discarded 1566 similar events)
// Phase 1: matrix 21544 rows 8891 cols
[2022-05-18 15:14:18] [INFO ] Computed 1701 place invariants in 1030 ms
[2022-05-18 15:14:19] [INFO ] [Real]Absence check using 65 positive place invariants in 235 ms returned sat
[2022-05-18 15:14:20] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 676 ms returned sat
[2022-05-18 15:14:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:14:39] [INFO ] [Real]Absence check using state equation in 18906 ms returned sat
[2022-05-18 15:14:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 15:14:40] [INFO ] [Nat]Absence check using 65 positive place invariants in 237 ms returned sat
[2022-05-18 15:14:41] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 786 ms returned sat
[2022-05-18 15:14:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 15:15:05] [INFO ] [Nat]Absence check using state equation in 23469 ms returned sat
[2022-05-18 15:15:05] [INFO ] State equation strengthened by 13378 read => feed constraints.
[2022-05-18 15:15:09] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 15:15:10] [INFO ] [Nat]Added 13378 Read/Feed constraints in 4766 ms returned sat
[2022-05-18 15:15:31] [INFO ] Deduced a trap composed of 325 places in 20433 ms of which 10 ms to minimize.
[2022-05-18 15:15:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 8891 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8891/8891 places, 23110/23110 transitions.
Applied a total of 0 rules in 1281 ms. Remains 8891 /8891 variables (removed 0) and now considering 23110/23110 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8891/8891 places, 23110/23110 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8891/8891 places, 23110/23110 transitions.
Applied a total of 0 rules in 1328 ms. Remains 8891 /8891 variables (removed 0) and now considering 23110/23110 (removed 0) transitions.
[2022-05-18 15:15:33] [INFO ] Flow matrix only has 21544 transitions (discarded 1566 similar events)
// Phase 1: matrix 21544 rows 8891 cols
[2022-05-18 15:15:34] [INFO ] Computed 1701 place invariants in 1019 ms
[2022-05-18 15:15:35] [INFO ] Implicit Places using invariants in 1852 ms returned []
Implicit Place search using SMT only with invariants took 1852 ms to find 0 implicit places.
[2022-05-18 15:15:35] [INFO ] Flow matrix only has 21544 transitions (discarded 1566 similar events)
// Phase 1: matrix 21544 rows 8891 cols
[2022-05-18 15:15:36] [INFO ] Computed 1701 place invariants in 1027 ms
[2022-05-18 15:15:37] [INFO ] Dead Transitions using invariants and state equation in 1860 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8891/8891 places, 23110/23110 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-02 in 127807 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-06
Normalized transition count is 21548 out of 23114 initially.
// Phase 1: matrix 21548 rows 8895 cols
[2022-05-18 15:15:38] [INFO ] Computed 1701 place invariants in 1025 ms
Incomplete random walk after 10000 steps, including 202 resets, run finished after 851 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
[2022-05-18 15:15:39] [INFO ] Flow matrix only has 21548 transitions (discarded 1566 similar events)
// Phase 1: matrix 21548 rows 8895 cols
[2022-05-18 15:15:40] [INFO ] Computed 1701 place invariants in 1053 ms
[2022-05-18 15:15:41] [INFO ] [Real]Absence check using 65 positive place invariants in 232 ms returned sat
[2022-05-18 15:15:42] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 693 ms returned sat
[2022-05-18 15:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:15:45] [INFO ] [Real]Absence check using state equation in 3286 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8895 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8895/8895 places, 23114/23114 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 8895 transition count 23113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 8894 transition count 23113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 8893 transition count 23112
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 8893 transition count 23112
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 8893 transition count 23112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 8892 transition count 23111
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 8892 transition count 23111
Applied a total of 7 rules in 6315 ms. Remains 8892 /8895 variables (removed 3) and now considering 23111/23114 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 8892/8895 places, 23111/23114 transitions.
Normalized transition count is 21545 out of 23111 initially.
// Phase 1: matrix 21545 rows 8892 cols
[2022-05-18 15:15:53] [INFO ] Computed 1701 place invariants in 1018 ms
Interrupted random walk after 367856 steps, including 7461 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen 0
Interrupted Best-First random walk after 537549 steps, including 1047 resets, run timeout after 5001 ms. (steps per millisecond=107 ) properties seen 0
[2022-05-18 15:16:28] [INFO ] Flow matrix only has 21545 transitions (discarded 1566 similar events)
// Phase 1: matrix 21545 rows 8892 cols
[2022-05-18 15:16:29] [INFO ] Computed 1701 place invariants in 1041 ms
[2022-05-18 15:16:30] [INFO ] [Real]Absence check using 65 positive place invariants in 207 ms returned sat
[2022-05-18 15:16:30] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 696 ms returned sat
[2022-05-18 15:16:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:16:51] [INFO ] [Real]Absence check using state equation in 20802 ms returned sat
[2022-05-18 15:16:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 15:16:53] [INFO ] [Nat]Absence check using 65 positive place invariants in 196 ms returned sat
[2022-05-18 15:16:53] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 670 ms returned sat
[2022-05-18 15:16:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 15:17:15] [INFO ] [Nat]Absence check using state equation in 21502 ms returned sat
[2022-05-18 15:17:15] [INFO ] State equation strengthened by 13378 read => feed constraints.
[2022-05-18 15:17:19] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 15:17:22] [INFO ] [Nat]Added 13378 Read/Feed constraints in 7582 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8892 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8892/8892 places, 23111/23111 transitions.
Applied a total of 0 rules in 1313 ms. Remains 8892 /8892 variables (removed 0) and now considering 23111/23111 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8892/8892 places, 23111/23111 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8892/8892 places, 23111/23111 transitions.
Applied a total of 0 rules in 1283 ms. Remains 8892 /8892 variables (removed 0) and now considering 23111/23111 (removed 0) transitions.
[2022-05-18 15:17:25] [INFO ] Flow matrix only has 21545 transitions (discarded 1566 similar events)
// Phase 1: matrix 21545 rows 8892 cols
[2022-05-18 15:17:26] [INFO ] Computed 1701 place invariants in 1011 ms
[2022-05-18 15:17:27] [INFO ] Implicit Places using invariants in 1831 ms returned []
Implicit Place search using SMT only with invariants took 1832 ms to find 0 implicit places.
[2022-05-18 15:17:27] [INFO ] Flow matrix only has 21545 transitions (discarded 1566 similar events)
// Phase 1: matrix 21545 rows 8892 cols
[2022-05-18 15:17:28] [INFO ] Computed 1701 place invariants in 1027 ms
[2022-05-18 15:17:29] [INFO ] Dead Transitions using invariants and state equation in 1825 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8892/8892 places, 23111/23111 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-06 in 111684 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-10
Normalized transition count is 21548 out of 23114 initially.
// Phase 1: matrix 21548 rows 8895 cols
[2022-05-18 15:17:30] [INFO ] Computed 1701 place invariants in 1003 ms
Incomplete random walk after 10000 steps, including 202 resets, run finished after 842 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
[2022-05-18 15:17:31] [INFO ] Flow matrix only has 21548 transitions (discarded 1566 similar events)
// Phase 1: matrix 21548 rows 8895 cols
[2022-05-18 15:17:32] [INFO ] Computed 1701 place invariants in 1035 ms
[2022-05-18 15:17:33] [INFO ] [Real]Absence check using 65 positive place invariants in 244 ms returned sat
[2022-05-18 15:17:34] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 859 ms returned sat
[2022-05-18 15:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:17:37] [INFO ] [Real]Absence check using state equation in 3081 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8895 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8895/8895 places, 23114/23114 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8895 transition count 23113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8894 transition count 23113
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 8894 transition count 23111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 8892 transition count 23111
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 9 place count 8889 transition count 23108
Iterating global reduction 3 with 3 rules applied. Total rules applied 12 place count 8889 transition count 23108
Applied a total of 12 rules in 4000 ms. Remains 8889 /8895 variables (removed 6) and now considering 23108/23114 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 8889/8895 places, 23108/23114 transitions.
Normalized transition count is 21542 out of 23108 initially.
// Phase 1: matrix 21542 rows 8889 cols
[2022-05-18 15:17:42] [INFO ] Computed 1701 place invariants in 1053 ms
Interrupted random walk after 360109 steps, including 7305 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen 0
Interrupted Best-First random walk after 531588 steps, including 1035 resets, run timeout after 5001 ms. (steps per millisecond=106 ) properties seen 0
[2022-05-18 15:18:17] [INFO ] Flow matrix only has 21542 transitions (discarded 1566 similar events)
// Phase 1: matrix 21542 rows 8889 cols
[2022-05-18 15:18:18] [INFO ] Computed 1701 place invariants in 1040 ms
[2022-05-18 15:18:19] [INFO ] [Real]Absence check using 63 positive place invariants in 186 ms returned sat
[2022-05-18 15:18:20] [INFO ] [Real]Absence check using 63 positive and 1638 generalized place invariants in 817 ms returned sat
[2022-05-18 15:18:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:18:43] [INFO ] [Real]Absence check using state equation in 23158 ms returned sat
[2022-05-18 15:18:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 15:18:44] [INFO ] [Nat]Absence check using 63 positive place invariants in 192 ms returned sat
[2022-05-18 15:18:45] [INFO ] [Nat]Absence check using 63 positive and 1638 generalized place invariants in 803 ms returned sat
[2022-05-18 15:18:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 15:19:05] [INFO ] [Nat]Absence check using state equation in 19803 ms returned sat
[2022-05-18 15:19:05] [INFO ] State equation strengthened by 13378 read => feed constraints.
[2022-05-18 15:19:09] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 15:19:13] [INFO ] [Nat]Added 13378 Read/Feed constraints in 7261 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8889 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8889/8889 places, 23108/23108 transitions.
Applied a total of 0 rules in 1288 ms. Remains 8889 /8889 variables (removed 0) and now considering 23108/23108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8889/8889 places, 23108/23108 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8889/8889 places, 23108/23108 transitions.
Applied a total of 0 rules in 1228 ms. Remains 8889 /8889 variables (removed 0) and now considering 23108/23108 (removed 0) transitions.
[2022-05-18 15:19:15] [INFO ] Flow matrix only has 21542 transitions (discarded 1566 similar events)
// Phase 1: matrix 21542 rows 8889 cols
[2022-05-18 15:19:16] [INFO ] Computed 1701 place invariants in 990 ms
[2022-05-18 15:19:17] [INFO ] Implicit Places using invariants in 1788 ms returned []
Implicit Place search using SMT only with invariants took 1793 ms to find 0 implicit places.
[2022-05-18 15:19:17] [INFO ] Flow matrix only has 21542 transitions (discarded 1566 similar events)
// Phase 1: matrix 21542 rows 8889 cols
[2022-05-18 15:19:18] [INFO ] Computed 1701 place invariants in 996 ms
[2022-05-18 15:19:19] [INFO ] Dead Transitions using invariants and state equation in 1784 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8889/8889 places, 23108/23108 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-10 in 109907 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-11
Normalized transition count is 21548 out of 23114 initially.
// Phase 1: matrix 21548 rows 8895 cols
[2022-05-18 15:19:20] [INFO ] Computed 1701 place invariants in 1025 ms
Incomplete random walk after 10000 steps, including 202 resets, run finished after 831 ms. (steps per millisecond=12 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
[2022-05-18 15:19:21] [INFO ] Flow matrix only has 21548 transitions (discarded 1566 similar events)
// Phase 1: matrix 21548 rows 8895 cols
[2022-05-18 15:19:22] [INFO ] Computed 1701 place invariants in 1009 ms
[2022-05-18 15:19:23] [INFO ] [Real]Absence check using 65 positive place invariants in 232 ms returned sat
[2022-05-18 15:19:23] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 679 ms returned sat
[2022-05-18 15:19:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:19:27] [INFO ] [Real]Absence check using state equation in 3347 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8895 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8895/8895 places, 23114/23114 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8895 transition count 23113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8894 transition count 23113
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 8894 transition count 23111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 8892 transition count 23111
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 9 place count 8889 transition count 23108
Iterating global reduction 3 with 3 rules applied. Total rules applied 12 place count 8889 transition count 23108
Applied a total of 12 rules in 3810 ms. Remains 8889 /8895 variables (removed 6) and now considering 23108/23114 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 8889/8895 places, 23108/23114 transitions.
Normalized transition count is 21542 out of 23108 initially.
// Phase 1: matrix 21542 rows 8889 cols
[2022-05-18 15:19:31] [INFO ] Computed 1701 place invariants in 986 ms
Interrupted random walk after 350451 steps, including 7107 resets, run timeout after 30001 ms. (steps per millisecond=11 ) properties seen 0
Interrupted Best-First random walk after 474298 steps, including 923 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen 0
[2022-05-18 15:20:07] [INFO ] Flow matrix only has 21542 transitions (discarded 1566 similar events)
// Phase 1: matrix 21542 rows 8889 cols
[2022-05-18 15:20:08] [INFO ] Computed 1701 place invariants in 995 ms
[2022-05-18 15:20:09] [INFO ] [Real]Absence check using 63 positive place invariants in 190 ms returned sat
[2022-05-18 15:20:09] [INFO ] [Real]Absence check using 63 positive and 1638 generalized place invariants in 832 ms returned sat
[2022-05-18 15:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:20:33] [INFO ] [Real]Absence check using state equation in 23216 ms returned sat
[2022-05-18 15:20:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 15:20:34] [INFO ] [Nat]Absence check using 63 positive place invariants in 183 ms returned sat
[2022-05-18 15:20:35] [INFO ] [Nat]Absence check using 63 positive and 1638 generalized place invariants in 749 ms returned sat
[2022-05-18 15:20:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 15:20:57] [INFO ] [Nat]Absence check using state equation in 21920 ms returned sat
[2022-05-18 15:20:57] [INFO ] State equation strengthened by 13378 read => feed constraints.
[2022-05-18 15:21:01] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 15:21:04] [INFO ] [Nat]Added 13378 Read/Feed constraints in 6780 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8889 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8889/8889 places, 23108/23108 transitions.
Applied a total of 0 rules in 1267 ms. Remains 8889 /8889 variables (removed 0) and now considering 23108/23108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8889/8889 places, 23108/23108 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8889/8889 places, 23108/23108 transitions.
Applied a total of 0 rules in 1265 ms. Remains 8889 /8889 variables (removed 0) and now considering 23108/23108 (removed 0) transitions.
[2022-05-18 15:21:06] [INFO ] Flow matrix only has 21542 transitions (discarded 1566 similar events)
// Phase 1: matrix 21542 rows 8889 cols
[2022-05-18 15:21:07] [INFO ] Computed 1701 place invariants in 1003 ms
[2022-05-18 15:21:08] [INFO ] Implicit Places using invariants in 1803 ms returned []
Implicit Place search using SMT only with invariants took 1804 ms to find 0 implicit places.
[2022-05-18 15:21:08] [INFO ] Flow matrix only has 21542 transitions (discarded 1566 similar events)
// Phase 1: matrix 21542 rows 8889 cols
[2022-05-18 15:21:09] [INFO ] Computed 1701 place invariants in 1024 ms
[2022-05-18 15:21:10] [INFO ] Dead Transitions using invariants and state equation in 1805 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8889/8889 places, 23108/23108 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-11 in 111181 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-12
Normalized transition count is 21548 out of 23114 initially.
// Phase 1: matrix 21548 rows 8895 cols
[2022-05-18 15:21:11] [INFO ] Computed 1701 place invariants in 1060 ms
Incomplete random walk after 10000 steps, including 202 resets, run finished after 854 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
[2022-05-18 15:21:12] [INFO ] Flow matrix only has 21548 transitions (discarded 1566 similar events)
// Phase 1: matrix 21548 rows 8895 cols
[2022-05-18 15:21:13] [INFO ] Computed 1701 place invariants in 1022 ms
[2022-05-18 15:21:14] [INFO ] [Real]Absence check using 65 positive place invariants in 242 ms returned sat
[2022-05-18 15:21:15] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 727 ms returned sat
[2022-05-18 15:21:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:21:18] [INFO ] [Real]Absence check using state equation in 3279 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8895 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8895/8895 places, 23114/23114 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8895 transition count 23113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8894 transition count 23113
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 8894 transition count 23111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 8892 transition count 23111
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 9 place count 8889 transition count 23108
Iterating global reduction 3 with 3 rules applied. Total rules applied 12 place count 8889 transition count 23108
Applied a total of 12 rules in 3822 ms. Remains 8889 /8895 variables (removed 6) and now considering 23108/23114 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 8889/8895 places, 23108/23114 transitions.
Normalized transition count is 21542 out of 23108 initially.
// Phase 1: matrix 21542 rows 8889 cols
[2022-05-18 15:21:23] [INFO ] Computed 1701 place invariants in 1012 ms
Interrupted random walk after 359894 steps, including 7300 resets, run timeout after 30001 ms. (steps per millisecond=11 ) properties seen 0
Interrupted Best-First random walk after 522923 steps, including 1018 resets, run timeout after 5001 ms. (steps per millisecond=104 ) properties seen 0
[2022-05-18 15:21:58] [INFO ] Flow matrix only has 21542 transitions (discarded 1566 similar events)
// Phase 1: matrix 21542 rows 8889 cols
[2022-05-18 15:21:59] [INFO ] Computed 1701 place invariants in 1012 ms
[2022-05-18 15:22:00] [INFO ] [Real]Absence check using 63 positive place invariants in 190 ms returned sat
[2022-05-18 15:22:00] [INFO ] [Real]Absence check using 63 positive and 1638 generalized place invariants in 687 ms returned sat
[2022-05-18 15:22:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:22:22] [INFO ] [Real]Absence check using state equation in 21589 ms returned sat
[2022-05-18 15:22:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 15:22:24] [INFO ] [Nat]Absence check using 63 positive place invariants in 190 ms returned sat
[2022-05-18 15:22:24] [INFO ] [Nat]Absence check using 63 positive and 1638 generalized place invariants in 699 ms returned sat
[2022-05-18 15:22:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 15:22:45] [INFO ] [Nat]Absence check using state equation in 21148 ms returned sat
[2022-05-18 15:22:46] [INFO ] State equation strengthened by 13378 read => feed constraints.
[2022-05-18 15:22:49] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 15:22:52] [INFO ] [Nat]Added 13378 Read/Feed constraints in 6787 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8889 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8889/8889 places, 23108/23108 transitions.
Applied a total of 0 rules in 1265 ms. Remains 8889 /8889 variables (removed 0) and now considering 23108/23108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8889/8889 places, 23108/23108 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8889/8889 places, 23108/23108 transitions.
Applied a total of 0 rules in 1266 ms. Remains 8889 /8889 variables (removed 0) and now considering 23108/23108 (removed 0) transitions.
[2022-05-18 15:22:55] [INFO ] Flow matrix only has 21542 transitions (discarded 1566 similar events)
// Phase 1: matrix 21542 rows 8889 cols
[2022-05-18 15:22:56] [INFO ] Computed 1701 place invariants in 988 ms
[2022-05-18 15:22:57] [INFO ] Implicit Places using invariants in 1779 ms returned []
Implicit Place search using SMT only with invariants took 1780 ms to find 0 implicit places.
[2022-05-18 15:22:57] [INFO ] Flow matrix only has 21542 transitions (discarded 1566 similar events)
// Phase 1: matrix 21542 rows 8889 cols
[2022-05-18 15:22:58] [INFO ] Computed 1701 place invariants in 972 ms
[2022-05-18 15:22:58] [INFO ] Dead Transitions using invariants and state equation in 1742 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8889/8889 places, 23108/23108 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-12 in 108563 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-14
Normalized transition count is 21548 out of 23114 initially.
// Phase 1: matrix 21548 rows 8895 cols
[2022-05-18 15:22:59] [INFO ] Computed 1701 place invariants in 1017 ms
Incomplete random walk after 10000 steps, including 202 resets, run finished after 832 ms. (steps per millisecond=12 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
[2022-05-18 15:23:00] [INFO ] Flow matrix only has 21548 transitions (discarded 1566 similar events)
// Phase 1: matrix 21548 rows 8895 cols
[2022-05-18 15:23:01] [INFO ] Computed 1701 place invariants in 997 ms
[2022-05-18 15:23:02] [INFO ] [Real]Absence check using 65 positive place invariants in 219 ms returned sat
[2022-05-18 15:23:03] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 606 ms returned sat
[2022-05-18 15:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:23:06] [INFO ] [Real]Absence check using state equation in 3410 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 8895 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8895/8895 places, 23114/23114 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8895 transition count 23113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8894 transition count 23113
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 8894 transition count 23112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 8893 transition count 23112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 8892 transition count 23111
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 8892 transition count 23111
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 8892 transition count 23111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 8 place count 8891 transition count 23110
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 8891 transition count 23110
Applied a total of 9 rules in 6383 ms. Remains 8891 /8895 variables (removed 4) and now considering 23110/23114 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 8891/8895 places, 23110/23114 transitions.
Normalized transition count is 21544 out of 23110 initially.
// Phase 1: matrix 21544 rows 8891 cols
[2022-05-18 15:23:14] [INFO ] Computed 1701 place invariants in 1021 ms
Interrupted random walk after 366532 steps, including 7432 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen 0
Interrupted Best-First random walk after 537021 steps, including 1046 resets, run timeout after 5001 ms. (steps per millisecond=107 ) properties seen 0
[2022-05-18 15:23:49] [INFO ] Flow matrix only has 21544 transitions (discarded 1566 similar events)
// Phase 1: matrix 21544 rows 8891 cols
[2022-05-18 15:23:50] [INFO ] Computed 1701 place invariants in 1022 ms
[2022-05-18 15:23:51] [INFO ] [Real]Absence check using 65 positive place invariants in 217 ms returned sat
[2022-05-18 15:23:52] [INFO ] [Real]Absence check using 65 positive and 1636 generalized place invariants in 651 ms returned sat
[2022-05-18 15:23:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 15:24:12] [INFO ] [Real]Absence check using state equation in 20793 ms returned sat
[2022-05-18 15:24:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 15:24:14] [INFO ] [Nat]Absence check using 65 positive place invariants in 220 ms returned sat
[2022-05-18 15:24:15] [INFO ] [Nat]Absence check using 65 positive and 1636 generalized place invariants in 642 ms returned sat
[2022-05-18 15:24:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 15:24:36] [INFO ] [Nat]Absence check using state equation in 21910 ms returned sat
[2022-05-18 15:24:37] [INFO ] State equation strengthened by 13378 read => feed constraints.
[2022-05-18 15:24:40] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 15:24:41] [INFO ] [Nat]Added 13378 Read/Feed constraints in 4358 ms returned sat
[2022-05-18 15:24:43] [INFO ] Computed and/alt/rep : 10923/15884/10923 causal constraints (skipped 10588 transitions) in 1697 ms.
[2022-05-18 15:24:48] [INFO ] Added : 8 causal constraints over 2 iterations in 5963 ms. Result :sat
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 8891 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8891/8891 places, 23110/23110 transitions.
Applied a total of 0 rules in 1308 ms. Remains 8891 /8891 variables (removed 0) and now considering 23110/23110 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8891/8891 places, 23110/23110 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8891/8891 places, 23110/23110 transitions.
Applied a total of 0 rules in 1315 ms. Remains 8891 /8891 variables (removed 0) and now considering 23110/23110 (removed 0) transitions.
[2022-05-18 15:24:51] [INFO ] Flow matrix only has 21544 transitions (discarded 1566 similar events)
// Phase 1: matrix 21544 rows 8891 cols
[2022-05-18 15:24:52] [INFO ] Computed 1701 place invariants in 1018 ms
[2022-05-18 15:24:53] [INFO ] Implicit Places using invariants in 1830 ms returned []
Implicit Place search using SMT only with invariants took 1831 ms to find 0 implicit places.
[2022-05-18 15:24:53] [INFO ] Flow matrix only has 21544 transitions (discarded 1566 similar events)
// Phase 1: matrix 21544 rows 8891 cols
[2022-05-18 15:24:54] [INFO ] Computed 1701 place invariants in 1046 ms
[2022-05-18 15:24:55] [INFO ] Dead Transitions using invariants and state equation in 1849 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8891/8891 places, 23110/23110 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C08-UpperBounds-14 in 116678 ms.
[2022-05-18 15:24:57] [INFO ] Flatten gal took : 1325 ms
[2022-05-18 15:24:58] [INFO ] Applying decomposition
[2022-05-18 15:24:59] [INFO ] Flatten gal took : 1070 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2016593616128350905.txt' '-o' '/tmp/graph2016593616128350905.bin' '-w' '/tmp/graph2016593616128350905.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2016593616128350905.bin' '-l' '-1' '-v' '-w' '/tmp/graph2016593616128350905.weights' '-q' '0' '-e' '0.001'
[2022-05-18 15:25:01] [INFO ] Decomposing Gal with order
[2022-05-18 15:25:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 15:25:13] [INFO ] Removed a total of 48246 redundant transitions.
[2022-05-18 15:25:14] [INFO ] Flatten gal took : 10504 ms
[2022-05-18 15:25:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 14058 labels/synchronizations in 3177 ms.
[2022-05-18 15:25:19] [INFO ] Time to serialize gal into /tmp/UpperBounds15355435788663250346.gal : 253 ms
[2022-05-18 15:25:19] [INFO ] Time to serialize properties into /tmp/UpperBounds8366717347939352700.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15355435788663250346.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8366717347939352700.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds8366717347939352700.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-S32C08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S32C08, 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 r132-tall-165271821400845"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S32C08.tgz
mv MultiCrashLeafsetExtension-PT-S32C08 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 ;