About the Execution of ITS-Tools for CANInsertWithFailure-PT-080
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4447.371 | 3600000.00 | 3715825.00 | 9860.70 | [undef] | Time out reached |
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.r294-smll-165463872400069.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 CANInsertWithFailure-PT-080, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872400069
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 7.3K May 30 15:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 30 15:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 30 15:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 30 15:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 25 12:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 25 12:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 25 12:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 25 12:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 17K May 30 15:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K May 30 15:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 30 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 30 15:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 25 12:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 25 12:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 39M May 29 12:20 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 CANInsertWithFailure-PT-080-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-080-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-080-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-080-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-080-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-080-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-080-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-080-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-080-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-080-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-080-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-080-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-080-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-080-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-080-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-080-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1654734791115
Running Version 202205111006
[2022-06-09 00:33:13] [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-06-09 00:33:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 00:33:15] [INFO ] Load time of PNML (sax parser for PT used): 1789 ms
[2022-06-09 00:33:15] [INFO ] Transformed 13764 places.
[2022-06-09 00:33:15] [INFO ] Transformed 38880 transitions.
[2022-06-09 00:33:15] [INFO ] Parsed PT model containing 13764 places and 38880 transitions in 2145 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
// Phase 1: matrix 38880 rows 13764 cols
[2022-06-09 00:33:30] [INFO ] Computed 83 place invariants in 14433 ms
Incomplete random walk after 10000 steps, including 5 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
// Phase 1: matrix 38880 rows 13764 cols
[2022-06-09 00:33:45] [INFO ] Computed 83 place invariants in 13770 ms
[2022-06-09 00:33:49] [INFO ] [Real]Absence check using 81 positive place invariants in 692 ms returned sat
[2022-06-09 00:33:49] [INFO ] [Real]Absence check using 81 positive and 2 generalized place invariants in 360 ms returned sat
[2022-06-09 00:33:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:33:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
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-06-09 00:33:53] [INFO ] [Real]Absence check using 81 positive place invariants in 746 ms returned sat
[2022-06-09 00:33:54] [INFO ] [Real]Absence check using 81 positive and 2 generalized place invariants in 500 ms returned sat
[2022-06-09 00:33:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:33:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
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-06-09 00:33:58] [INFO ] [Real]Absence check using 81 positive place invariants in 756 ms returned sat
[2022-06-09 00:33:58] [INFO ] [Real]Absence check using 81 positive and 2 generalized place invariants in 345 ms returned sat
[2022-06-09 00:33:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:34:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
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-06-09 00:34:03] [INFO ] [Real]Absence check using 81 positive place invariants in 752 ms returned sat
[2022-06-09 00:34:03] [INFO ] [Real]Absence check using 81 positive and 2 generalized place invariants in 349 ms returned sat
[2022-06-09 00:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:34:05] [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 3
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.verifyPossible(DeadlockTester.java:901)
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-06-09 00:34:08] [INFO ] [Real]Absence check using 81 positive place invariants in 646 ms returned sat
[2022-06-09 00:34:08] [INFO ] [Real]Absence check using 81 positive and 2 generalized place invariants in 357 ms returned sat
[2022-06-09 00:34:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:34:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:901)
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-06-09 00:34:13] [INFO ] [Real]Absence check using 81 positive place invariants in 761 ms returned sat
[2022-06-09 00:34:14] [INFO ] [Real]Absence check using 81 positive and 2 generalized place invariants in 348 ms returned sat
[2022-06-09 00:34:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:34:15] [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 5
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.verifyPossible(DeadlockTester.java:901)
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-06-09 00:34:18] [INFO ] [Real]Absence check using 81 positive place invariants in 625 ms returned sat
[2022-06-09 00:34:18] [INFO ] [Real]Absence check using 81 positive and 2 generalized place invariants in 372 ms returned sat
[2022-06-09 00:34:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:34:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:901)
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-06-09 00:34:23] [INFO ] [Real]Absence check using 81 positive place invariants in 707 ms returned sat
[2022-06-09 00:34:24] [INFO ] [Real]Absence check using 81 positive and 2 generalized place invariants in 368 ms returned sat
[2022-06-09 00:34:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:34:25] [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 7
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.verifyPossible(DeadlockTester.java:901)
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-06-09 00:34:28] [INFO ] [Real]Absence check using 81 positive place invariants in 604 ms returned sat
[2022-06-09 00:34:29] [INFO ] [Real]Absence check using 81 positive and 2 generalized place invariants in 348 ms returned sat
[2022-06-09 00:34:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:34:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:901)
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-06-09 00:34:33] [INFO ] [Real]Absence check using 81 positive place invariants in 779 ms returned sat
[2022-06-09 00:34:34] [INFO ] [Real]Absence check using 81 positive and 2 generalized place invariants in 342 ms returned sat
[2022-06-09 00:34:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:34:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
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-06-09 00:34:38] [INFO ] [Real]Absence check using 81 positive place invariants in 597 ms returned sat
[2022-06-09 00:34:38] [INFO ] [Real]Absence check using 81 positive and 2 generalized place invariants in 345 ms returned sat
[2022-06-09 00:34:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:34:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:901)
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-06-09 00:34:43] [INFO ] [Real]Absence check using 81 positive place invariants in 603 ms returned sat
[2022-06-09 00:34:43] [INFO ] [Real]Absence check using 81 positive and 2 generalized place invariants in 345 ms returned sat
[2022-06-09 00:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:34:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:901)
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-06-09 00:34:48] [INFO ] [Real]Absence check using 81 positive place invariants in 596 ms returned sat
[2022-06-09 00:34:48] [INFO ] [Real]Absence check using 81 positive and 2 generalized place invariants in 345 ms returned sat
[2022-06-09 00:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:34:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
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-06-09 00:34:53] [INFO ] [Real]Absence check using 81 positive place invariants in 601 ms returned sat
[2022-06-09 00:34:53] [INFO ] [Real]Absence check using 81 positive and 2 generalized place invariants in 344 ms returned sat
[2022-06-09 00:34:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:34:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
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-06-09 00:34:58] [INFO ] [Real]Absence check using 81 positive place invariants in 596 ms returned sat
[2022-06-09 00:34:58] [INFO ] [Real]Absence check using 81 positive and 2 generalized place invariants in 372 ms returned sat
[2022-06-09 00:34:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:35:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:901)
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-06-09 00:35:03] [INFO ] [Real]Absence check using 81 positive place invariants in 594 ms returned sat
[2022-06-09 00:35:03] [INFO ] [Real]Absence check using 81 positive and 2 generalized place invariants in 342 ms returned sat
[2022-06-09 00:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:35:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 15
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
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) : [80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80] Max seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 13764 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 13764/13764 places, 38880/38880 transitions.
Graph (complete) has 52401 edges and 13764 vertex of which 13763 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.79 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 561 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1121 place count 13203 transition count 38320
Performed 6234 Post agglomeration using F-continuation condition.Transition count delta: 6234
Deduced a syphon composed of 6234 places in 26 ms
Reduce places removed 6234 places and 0 transitions.
Iterating global reduction 2 with 12468 rules applied. Total rules applied 13589 place count 6969 transition count 32086
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13590 place count 6969 transition count 32085
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13591 place count 6968 transition count 32085
Partial Free-agglomeration rule applied 6631 times.
Drop transitions removed 6631 transitions
Iterating global reduction 3 with 6631 rules applied. Total rules applied 20222 place count 6968 transition count 32085
Applied a total of 20222 rules in 24119 ms. Remains 6968 /13764 variables (removed 6796) and now considering 32085/38880 (removed 6795) transitions.
Finished structural reductions, in 1 iterations. Remains : 6968/13764 places, 32085/38880 transitions.
Normalized transition count is 32077 out of 32085 initially.
// Phase 1: matrix 32077 rows 6968 cols
[2022-06-09 00:35:32] [INFO ] Computed 82 place invariants in 2532 ms
Finished random walk after 831486 steps, including 1709 resets, run visited all 16 properties in 30001 ms. (steps per millisecond=27 )
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 2544 ms. (steps per millisecond=393 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2567 ms. (steps per millisecond=389 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 1000001 steps, including 18 resets, run finished after 2566 ms. (steps per millisecond=389 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2549 ms. (steps per millisecond=392 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 2537 ms. (steps per millisecond=394 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2533 ms. (steps per millisecond=394 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2668 ms. (steps per millisecond=374 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 18 resets, run finished after 2572 ms. (steps per millisecond=388 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2576 ms. (steps per millisecond=388 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2588 ms. (steps per millisecond=386 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 2548 ms. (steps per millisecond=392 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 2685 ms. (steps per millisecond=372 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2695 ms. (steps per millisecond=371 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2583 ms. (steps per millisecond=387 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2557 ms. (steps per millisecond=391 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2708 ms. (steps per millisecond=369 ) properties (out of 16) seen :8
[2022-06-09 00:36:43] [INFO ] Flow matrix only has 32077 transitions (discarded 8 similar events)
// Phase 1: matrix 32077 rows 6968 cols
[2022-06-09 00:36:46] [INFO ] Computed 82 place invariants in 2705 ms
[2022-06-09 00:36:47] [INFO ] [Real]Absence check using 80 positive place invariants in 189 ms returned sat
[2022-06-09 00:36:48] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 124 ms returned sat
[2022-06-09 00:36:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:37:09] [INFO ] [Real]Absence check using state equation in 21210 ms returned sat
[2022-06-09 00:37:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:37:12] [INFO ] [Nat]Absence check using 80 positive place invariants in 260 ms returned sat
[2022-06-09 00:37:12] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 190 ms returned sat
[2022-06-09 00:37:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:37:33] [INFO ] [Nat]Absence check using state equation in 21675 ms returned sat
[2022-06-09 00:37:34] [INFO ] State equation strengthened by 31730 read => feed constraints.
[2022-06-09 00:37:40] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 00:37:43] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8731 ms returned unknown
[2022-06-09 00:37:44] [INFO ] [Real]Absence check using 80 positive place invariants in 192 ms returned sat
[2022-06-09 00:37:44] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 124 ms returned sat
[2022-06-09 00:37:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:38:07] [INFO ] [Real]Absence check using state equation in 22661 ms returned sat
[2022-06-09 00:38:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:38:09] [INFO ] [Nat]Absence check using 80 positive place invariants in 197 ms returned sat
[2022-06-09 00:38:10] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 122 ms returned sat
[2022-06-09 00:38:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:38:32] [INFO ] [Nat]Absence check using state equation in 22220 ms returned sat
[2022-06-09 00:38:37] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 00:38:40] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8353 ms returned unknown
[2022-06-09 00:38:42] [INFO ] [Real]Absence check using 80 positive place invariants in 185 ms returned sat
[2022-06-09 00:38:42] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 125 ms returned sat
[2022-06-09 00:38:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:39:03] [INFO ] [Real]Absence check using state equation in 21117 ms returned sat
[2022-06-09 00:39:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:39:06] [INFO ] [Nat]Absence check using 80 positive place invariants in 192 ms returned sat
[2022-06-09 00:39:06] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 121 ms returned sat
[2022-06-09 00:39:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:39:28] [INFO ] [Nat]Absence check using state equation in 22390 ms returned sat
[2022-06-09 00:39:33] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 00:39:36] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8267 ms returned unknown
[2022-06-09 00:39:37] [INFO ] [Real]Absence check using 80 positive place invariants in 183 ms returned sat
[2022-06-09 00:39:38] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 119 ms returned sat
[2022-06-09 00:39:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:39:57] [INFO ] [Real]Absence check using state equation in 19111 ms returned sat
[2022-06-09 00:39:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:39:59] [INFO ] [Nat]Absence check using 80 positive place invariants in 187 ms returned sat
[2022-06-09 00:39:59] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 120 ms returned sat
[2022-06-09 00:39:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:40:21] [INFO ] [Nat]Absence check using state equation in 21170 ms returned sat
[2022-06-09 00:40:26] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 00:40:29] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8380 ms returned unknown
[2022-06-09 00:40:30] [INFO ] [Real]Absence check using 80 positive place invariants in 183 ms returned sat
[2022-06-09 00:40:30] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 137 ms returned sat
[2022-06-09 00:40:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:41:07] [INFO ] [Real]Absence check using state equation in 36805 ms returned sat
[2022-06-09 00:41:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:41:10] [INFO ] [Nat]Absence check using 80 positive place invariants in 193 ms returned sat
[2022-06-09 00:41:10] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 124 ms returned sat
[2022-06-09 00:41:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:41:39] [INFO ] [Nat]Absence check using state equation in 28735 ms returned sat
[2022-06-09 00:41:45] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 00:41:48] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8973 ms returned unknown
[2022-06-09 00:41:49] [INFO ] [Real]Absence check using 80 positive place invariants in 189 ms returned sat
[2022-06-09 00:41:49] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 126 ms returned sat
[2022-06-09 00:41:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:42:10] [INFO ] [Real]Absence check using state equation in 21455 ms returned sat
[2022-06-09 00:42:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:42:13] [INFO ] [Nat]Absence check using 80 positive place invariants in 194 ms returned sat
[2022-06-09 00:42:13] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 122 ms returned sat
[2022-06-09 00:42:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:42:35] [INFO ] [Nat]Absence check using state equation in 21805 ms returned sat
[2022-06-09 00:42:40] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 00:42:43] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8336 ms returned unknown
[2022-06-09 00:42:44] [INFO ] [Real]Absence check using 80 positive place invariants in 194 ms returned sat
[2022-06-09 00:42:45] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 126 ms returned sat
[2022-06-09 00:42:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:43:05] [INFO ] [Real]Absence check using state equation in 20868 ms returned sat
[2022-06-09 00:43:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:43:08] [INFO ] [Nat]Absence check using 80 positive place invariants in 194 ms returned sat
[2022-06-09 00:43:08] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 121 ms returned sat
[2022-06-09 00:43:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:43:29] [INFO ] [Nat]Absence check using state equation in 21479 ms returned sat
[2022-06-09 00:43:35] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 00:43:38] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8335 ms returned unknown
[2022-06-09 00:43:39] [INFO ] [Real]Absence check using 80 positive place invariants in 193 ms returned sat
[2022-06-09 00:43:39] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 126 ms returned sat
[2022-06-09 00:43:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:44:05] [INFO ] [Real]Absence check using state equation in 25897 ms returned sat
[2022-06-09 00:44:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:44:07] [INFO ] [Nat]Absence check using 80 positive place invariants in 197 ms returned sat
[2022-06-09 00:44:08] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 122 ms returned sat
[2022-06-09 00:44:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:44:32] [INFO ] [Nat]Absence check using state equation in 24535 ms returned sat
[2022-06-09 00:44:37] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 00:44:51] [INFO ] [Nat]Added 31730 Read/Feed constraints in 19103 ms returned unknown
[2022-06-09 00:44:53] [INFO ] [Real]Absence check using 80 positive place invariants in 192 ms returned sat
[2022-06-09 00:44:53] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 126 ms returned sat
[2022-06-09 00:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:45:14] [INFO ] [Real]Absence check using state equation in 20730 ms returned sat
[2022-06-09 00:45:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:45:16] [INFO ] [Nat]Absence check using 80 positive place invariants in 195 ms returned sat
[2022-06-09 00:45:16] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 124 ms returned sat
[2022-06-09 00:45:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:45:39] [INFO ] [Nat]Absence check using state equation in 22854 ms returned sat
[2022-06-09 00:45:44] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 00:46:00] [INFO ] [Nat]Added 31730 Read/Feed constraints in 20771 ms returned unknown
[2022-06-09 00:46:01] [INFO ] [Real]Absence check using 80 positive place invariants in 189 ms returned sat
[2022-06-09 00:46:01] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 124 ms returned sat
[2022-06-09 00:46:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:46:22] [INFO ] [Real]Absence check using state equation in 20784 ms returned sat
[2022-06-09 00:46:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:46:25] [INFO ] [Nat]Absence check using 80 positive place invariants in 195 ms returned sat
[2022-06-09 00:46:25] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 123 ms returned sat
[2022-06-09 00:46:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:46:47] [INFO ] [Nat]Absence check using state equation in 22449 ms returned sat
[2022-06-09 00:46:53] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 00:46:56] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8413 ms returned unknown
[2022-06-09 00:46:57] [INFO ] [Real]Absence check using 80 positive place invariants in 191 ms returned sat
[2022-06-09 00:46:57] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 125 ms returned sat
[2022-06-09 00:46:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:47:25] [INFO ] [Real]Absence check using state equation in 28005 ms returned sat
[2022-06-09 00:47:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:47:28] [INFO ] [Nat]Absence check using 80 positive place invariants in 193 ms returned sat
[2022-06-09 00:47:28] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 173 ms returned sat
[2022-06-09 00:47:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:47:55] [INFO ] [Nat]Absence check using state equation in 26859 ms returned sat
[2022-06-09 00:48:00] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 00:48:03] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8297 ms returned unknown
[2022-06-09 00:48:05] [INFO ] [Real]Absence check using 80 positive place invariants in 192 ms returned sat
[2022-06-09 00:48:05] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 126 ms returned sat
[2022-06-09 00:48:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:48:27] [INFO ] [Real]Absence check using state equation in 22349 ms returned sat
[2022-06-09 00:48:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:48:30] [INFO ] [Nat]Absence check using 80 positive place invariants in 196 ms returned sat
[2022-06-09 00:48:30] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 122 ms returned sat
[2022-06-09 00:48:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:48:52] [INFO ] [Nat]Absence check using state equation in 22402 ms returned sat
[2022-06-09 00:48:57] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 00:49:00] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8378 ms returned unknown
[2022-06-09 00:49:02] [INFO ] [Real]Absence check using 80 positive place invariants in 192 ms returned sat
[2022-06-09 00:49:02] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 123 ms returned sat
[2022-06-09 00:49:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:49:25] [INFO ] [Real]Absence check using state equation in 22893 ms returned sat
[2022-06-09 00:49:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:49:27] [INFO ] [Nat]Absence check using 80 positive place invariants in 194 ms returned sat
[2022-06-09 00:49:27] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 123 ms returned sat
[2022-06-09 00:49:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:49:49] [INFO ] [Nat]Absence check using state equation in 22065 ms returned sat
[2022-06-09 00:49:55] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 00:49:58] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8480 ms returned unknown
[2022-06-09 00:49:59] [INFO ] [Real]Absence check using 80 positive place invariants in 195 ms returned sat
[2022-06-09 00:49:59] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 126 ms returned sat
[2022-06-09 00:49:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:50:24] [INFO ] [Real]Absence check using state equation in 25129 ms returned sat
[2022-06-09 00:50:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:50:27] [INFO ] [Nat]Absence check using 80 positive place invariants in 196 ms returned sat
[2022-06-09 00:50:27] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 123 ms returned sat
[2022-06-09 00:50:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:50:54] [INFO ] [Nat]Absence check using state equation in 26882 ms returned sat
[2022-06-09 00:50:59] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 00:51:02] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8616 ms returned unknown
[2022-06-09 00:51:04] [INFO ] [Real]Absence check using 80 positive place invariants in 189 ms returned sat
[2022-06-09 00:51:04] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 155 ms returned sat
[2022-06-09 00:51:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:51:26] [INFO ] [Real]Absence check using state equation in 22356 ms returned sat
[2022-06-09 00:51:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:51:29] [INFO ] [Nat]Absence check using 80 positive place invariants in 197 ms returned sat
[2022-06-09 00:51:29] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 128 ms returned sat
[2022-06-09 00:51:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:51:52] [INFO ] [Nat]Absence check using state equation in 23536 ms returned sat
[2022-06-09 00:51:58] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 00:52:01] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8298 ms returned unknown
[2022-06-09 00:52:02] [INFO ] [Real]Absence check using 80 positive place invariants in 192 ms returned sat
[2022-06-09 00:52:02] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 123 ms returned sat
[2022-06-09 00:52:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:52:45] [INFO ] [Real]Absence check using state equation in 42664 ms returned sat
[2022-06-09 00:52:46] [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 15
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.verifyPossible(DeadlockTester.java:910)
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) : [80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80] Max seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 16 out of 6968 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6968/6968 places, 32085/32085 transitions.
Applied a total of 0 rules in 3772 ms. Remains 6968 /6968 variables (removed 0) and now considering 32085/32085 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 6968/6968 places, 32085/32085 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 6968/6968 places, 32085/32085 transitions.
Applied a total of 0 rules in 3648 ms. Remains 6968 /6968 variables (removed 0) and now considering 32085/32085 (removed 0) transitions.
[2022-06-09 00:52:53] [INFO ] Flow matrix only has 32077 transitions (discarded 8 similar events)
// Phase 1: matrix 32077 rows 6968 cols
[2022-06-09 00:52:56] [INFO ] Computed 82 place invariants in 2552 ms
[2022-06-09 00:52:57] [INFO ] Implicit Places using invariants in 3682 ms returned []
Implicit Place search using SMT only with invariants took 3692 ms to find 0 implicit places.
[2022-06-09 00:52:57] [INFO ] Flow matrix only has 32077 transitions (discarded 8 similar events)
// Phase 1: matrix 32077 rows 6968 cols
[2022-06-09 00:53:00] [INFO ] Computed 82 place invariants in 2698 ms
[2022-06-09 00:53:01] [INFO ] Dead Transitions using invariants and state equation in 3891 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6968/6968 places, 32085/32085 transitions.
Normalized transition count is 32077 out of 32085 initially.
// Phase 1: matrix 32077 rows 6968 cols
[2022-06-09 00:53:04] [INFO ] Computed 82 place invariants in 2635 ms
Finished random walk after 800437 steps, including 1645 resets, run visited all 16 properties in 30001 ms. (steps per millisecond=26 )
Incomplete Best-First random walk after 1000001 steps, including 18 resets, run finished after 2610 ms. (steps per millisecond=383 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2601 ms. (steps per millisecond=384 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2791 ms. (steps per millisecond=358 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2608 ms. (steps per millisecond=383 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2785 ms. (steps per millisecond=359 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 2796 ms. (steps per millisecond=357 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 2599 ms. (steps per millisecond=384 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2596 ms. (steps per millisecond=385 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2838 ms. (steps per millisecond=352 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2819 ms. (steps per millisecond=354 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2582 ms. (steps per millisecond=387 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2767 ms. (steps per millisecond=361 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2617 ms. (steps per millisecond=382 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2589 ms. (steps per millisecond=386 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2602 ms. (steps per millisecond=384 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 1000001 steps, including 18 resets, run finished after 2609 ms. (steps per millisecond=383 ) properties (out of 16) seen :6
[2022-06-09 00:54:16] [INFO ] Flow matrix only has 32077 transitions (discarded 8 similar events)
// Phase 1: matrix 32077 rows 6968 cols
[2022-06-09 00:54:19] [INFO ] Computed 82 place invariants in 2653 ms
[2022-06-09 00:54:20] [INFO ] [Real]Absence check using 80 positive place invariants in 194 ms returned sat
[2022-06-09 00:54:21] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 127 ms returned sat
[2022-06-09 00:54:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:54:42] [INFO ] [Real]Absence check using state equation in 21635 ms returned sat
[2022-06-09 00:54:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:54:45] [INFO ] [Nat]Absence check using 80 positive place invariants in 197 ms returned sat
[2022-06-09 00:54:45] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 121 ms returned sat
[2022-06-09 00:54:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:55:08] [INFO ] [Nat]Absence check using state equation in 22850 ms returned sat
[2022-06-09 00:55:08] [INFO ] State equation strengthened by 31730 read => feed constraints.
[2022-06-09 00:55:14] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 00:55:17] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8551 ms returned unknown
[2022-06-09 00:55:18] [INFO ] [Real]Absence check using 80 positive place invariants in 211 ms returned sat
[2022-06-09 00:55:18] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 152 ms returned sat
[2022-06-09 00:55:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:55:40] [INFO ] [Real]Absence check using state equation in 22278 ms returned sat
[2022-06-09 00:55:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:55:43] [INFO ] [Nat]Absence check using 80 positive place invariants in 196 ms returned sat
[2022-06-09 00:55:43] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 121 ms returned sat
[2022-06-09 00:55:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:56:06] [INFO ] [Nat]Absence check using state equation in 22956 ms returned sat
[2022-06-09 00:56:11] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 00:56:14] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8293 ms returned unknown
[2022-06-09 00:56:15] [INFO ] [Real]Absence check using 80 positive place invariants in 191 ms returned sat
[2022-06-09 00:56:16] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 123 ms returned sat
[2022-06-09 00:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:56:36] [INFO ] [Real]Absence check using state equation in 20618 ms returned sat
[2022-06-09 00:56:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:56:39] [INFO ] [Nat]Absence check using 80 positive place invariants in 197 ms returned sat
[2022-06-09 00:56:39] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 122 ms returned sat
[2022-06-09 00:56:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:57:01] [INFO ] [Nat]Absence check using state equation in 22189 ms returned sat
[2022-06-09 00:57:07] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 00:57:10] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8458 ms returned unknown
[2022-06-09 00:57:11] [INFO ] [Real]Absence check using 80 positive place invariants in 196 ms returned sat
[2022-06-09 00:57:11] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 125 ms returned sat
[2022-06-09 00:57:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:57:33] [INFO ] [Real]Absence check using state equation in 21761 ms returned sat
[2022-06-09 00:57:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:57:36] [INFO ] [Nat]Absence check using 80 positive place invariants in 199 ms returned sat
[2022-06-09 00:57:36] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 122 ms returned sat
[2022-06-09 00:57:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:57:57] [INFO ] [Nat]Absence check using state equation in 21825 ms returned sat
[2022-06-09 00:58:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 00:58:06] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8412 ms returned unknown
[2022-06-09 00:58:07] [INFO ] [Real]Absence check using 80 positive place invariants in 194 ms returned sat
[2022-06-09 00:58:07] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 124 ms returned sat
[2022-06-09 00:58:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:58:47] [INFO ] [Real]Absence check using state equation in 39793 ms returned sat
[2022-06-09 00:58:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:58:50] [INFO ] [Nat]Absence check using 80 positive place invariants in 198 ms returned sat
[2022-06-09 00:58:50] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 122 ms returned sat
[2022-06-09 00:58:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:59:16] [INFO ] [Nat]Absence check using state equation in 26582 ms returned sat
[2022-06-09 00:59:23] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 00:59:26] [INFO ] [Nat]Added 31730 Read/Feed constraints in 9388 ms returned unknown
[2022-06-09 00:59:27] [INFO ] [Real]Absence check using 80 positive place invariants in 192 ms returned sat
[2022-06-09 00:59:27] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 123 ms returned sat
[2022-06-09 00:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:59:49] [INFO ] [Real]Absence check using state equation in 21443 ms returned sat
[2022-06-09 00:59:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:59:51] [INFO ] [Nat]Absence check using 80 positive place invariants in 201 ms returned sat
[2022-06-09 00:59:51] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 124 ms returned sat
[2022-06-09 00:59:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:00:14] [INFO ] [Nat]Absence check using state equation in 22110 ms returned sat
[2022-06-09 01:00:19] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 01:00:22] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8613 ms returned unknown
[2022-06-09 01:00:24] [INFO ] [Real]Absence check using 80 positive place invariants in 200 ms returned sat
[2022-06-09 01:00:24] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 126 ms returned sat
[2022-06-09 01:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:00:46] [INFO ] [Real]Absence check using state equation in 22100 ms returned sat
[2022-06-09 01:00:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:00:48] [INFO ] [Nat]Absence check using 80 positive place invariants in 199 ms returned sat
[2022-06-09 01:00:48] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 122 ms returned sat
[2022-06-09 01:00:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:01:11] [INFO ] [Nat]Absence check using state equation in 22947 ms returned sat
[2022-06-09 01:01:17] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 01:01:20] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8393 ms returned unknown
[2022-06-09 01:01:21] [INFO ] [Real]Absence check using 80 positive place invariants in 195 ms returned sat
[2022-06-09 01:01:21] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 123 ms returned sat
[2022-06-09 01:01:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:01:46] [INFO ] [Real]Absence check using state equation in 24974 ms returned sat
[2022-06-09 01:01:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:01:48] [INFO ] [Nat]Absence check using 80 positive place invariants in 202 ms returned sat
[2022-06-09 01:01:49] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 124 ms returned sat
[2022-06-09 01:01:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:02:15] [INFO ] [Nat]Absence check using state equation in 26387 ms returned sat
[2022-06-09 01:02:21] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 01:02:24] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8493 ms returned unknown
[2022-06-09 01:02:25] [INFO ] [Real]Absence check using 80 positive place invariants in 222 ms returned sat
[2022-06-09 01:02:25] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 210 ms returned sat
[2022-06-09 01:02:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:02:48] [INFO ] [Real]Absence check using state equation in 22633 ms returned sat
[2022-06-09 01:02:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:02:50] [INFO ] [Nat]Absence check using 80 positive place invariants in 202 ms returned sat
[2022-06-09 01:02:50] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 122 ms returned sat
[2022-06-09 01:02:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:03:13] [INFO ] [Nat]Absence check using state equation in 22730 ms returned sat
[2022-06-09 01:03:18] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 01:03:21] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8403 ms returned unknown
[2022-06-09 01:03:23] [INFO ] [Real]Absence check using 80 positive place invariants in 199 ms returned sat
[2022-06-09 01:03:23] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 125 ms returned sat
[2022-06-09 01:03:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:03:44] [INFO ] [Real]Absence check using state equation in 21699 ms returned sat
[2022-06-09 01:03:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:03:47] [INFO ] [Nat]Absence check using 80 positive place invariants in 202 ms returned sat
[2022-06-09 01:03:47] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 121 ms returned sat
[2022-06-09 01:03:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:04:11] [INFO ] [Nat]Absence check using state equation in 23738 ms returned sat
[2022-06-09 01:04:16] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 01:04:19] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8380 ms returned unknown
[2022-06-09 01:04:21] [INFO ] [Real]Absence check using 80 positive place invariants in 196 ms returned sat
[2022-06-09 01:04:21] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 124 ms returned sat
[2022-06-09 01:04:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:04:48] [INFO ] [Real]Absence check using state equation in 27447 ms returned sat
[2022-06-09 01:04:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:04:51] [INFO ] [Nat]Absence check using 80 positive place invariants in 206 ms returned sat
[2022-06-09 01:04:51] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 187 ms returned sat
[2022-06-09 01:04:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:05:17] [INFO ] [Nat]Absence check using state equation in 25705 ms returned sat
[2022-06-09 01:05:22] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 01:05:25] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8604 ms returned unknown
[2022-06-09 01:05:26] [INFO ] [Real]Absence check using 80 positive place invariants in 195 ms returned sat
[2022-06-09 01:05:27] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 123 ms returned sat
[2022-06-09 01:05:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:05:49] [INFO ] [Real]Absence check using state equation in 21995 ms returned sat
[2022-06-09 01:05:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:05:51] [INFO ] [Nat]Absence check using 80 positive place invariants in 206 ms returned sat
[2022-06-09 01:05:52] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 123 ms returned sat
[2022-06-09 01:05:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:06:14] [INFO ] [Nat]Absence check using state equation in 22862 ms returned sat
[2022-06-09 01:06:20] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 01:06:23] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8351 ms returned unknown
[2022-06-09 01:06:24] [INFO ] [Real]Absence check using 80 positive place invariants in 198 ms returned sat
[2022-06-09 01:06:24] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 126 ms returned sat
[2022-06-09 01:06:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:06:46] [INFO ] [Real]Absence check using state equation in 22024 ms returned sat
[2022-06-09 01:06:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:06:49] [INFO ] [Nat]Absence check using 80 positive place invariants in 208 ms returned sat
[2022-06-09 01:06:49] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 127 ms returned sat
[2022-06-09 01:06:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:07:11] [INFO ] [Nat]Absence check using state equation in 21736 ms returned sat
[2022-06-09 01:07:16] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 01:07:19] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8519 ms returned unknown
[2022-06-09 01:07:21] [INFO ] [Real]Absence check using 80 positive place invariants in 205 ms returned sat
[2022-06-09 01:07:21] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 138 ms returned sat
[2022-06-09 01:07:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:07:49] [INFO ] [Real]Absence check using state equation in 28570 ms returned sat
[2022-06-09 01:07:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:07:52] [INFO ] [Nat]Absence check using 80 positive place invariants in 196 ms returned sat
[2022-06-09 01:07:52] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 120 ms returned sat
[2022-06-09 01:07:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:08:16] [INFO ] [Nat]Absence check using state equation in 24493 ms returned sat
[2022-06-09 01:08:22] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 01:08:25] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8665 ms returned unknown
[2022-06-09 01:08:27] [INFO ] [Real]Absence check using 80 positive place invariants in 216 ms returned sat
[2022-06-09 01:08:27] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 132 ms returned sat
[2022-06-09 01:08:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:08:50] [INFO ] [Real]Absence check using state equation in 23451 ms returned sat
[2022-06-09 01:08:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:08:53] [INFO ] [Nat]Absence check using 80 positive place invariants in 209 ms returned sat
[2022-06-09 01:08:53] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 124 ms returned sat
[2022-06-09 01:08:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:09:17] [INFO ] [Nat]Absence check using state equation in 23952 ms returned sat
[2022-06-09 01:09:22] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 01:09:25] [INFO ] [Nat]Added 31730 Read/Feed constraints in 8391 ms returned unknown
[2022-06-09 01:09:27] [INFO ] [Real]Absence check using 80 positive place invariants in 199 ms returned sat
[2022-06-09 01:09:27] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 126 ms returned sat
[2022-06-09 01:09:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:10:08] [INFO ] [Real]Absence check using state equation in 40899 ms returned sat
[2022-06-09 01:10:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:10:10] [INFO ] [Nat]Absence check using 80 positive place invariants in 199 ms returned sat
[2022-06-09 01:10:10] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 119 ms returned sat
[2022-06-09 01:10:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:10:38] [INFO ] [Nat]Absence check using state equation in 28230 ms returned sat
[2022-06-09 01:10:45] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 01:10:48] [INFO ] [Nat]Added 31730 Read/Feed constraints in 9466 ms returned unknown
Current structural bounds on expressions (after SMT) : [80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80] Max seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 16 out of 6968 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6968/6968 places, 32085/32085 transitions.
Applied a total of 0 rules in 3594 ms. Remains 6968 /6968 variables (removed 0) and now considering 32085/32085 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 6968/6968 places, 32085/32085 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 6968/6968 places, 32085/32085 transitions.
Applied a total of 0 rules in 3518 ms. Remains 6968 /6968 variables (removed 0) and now considering 32085/32085 (removed 0) transitions.
[2022-06-09 01:10:55] [INFO ] Flow matrix only has 32077 transitions (discarded 8 similar events)
// Phase 1: matrix 32077 rows 6968 cols
[2022-06-09 01:10:58] [INFO ] Computed 82 place invariants in 2848 ms
[2022-06-09 01:10:59] [INFO ] Implicit Places using invariants in 3811 ms returned []
Implicit Place search using SMT only with invariants took 3812 ms to find 0 implicit places.
[2022-06-09 01:10:59] [INFO ] Flow matrix only has 32077 transitions (discarded 8 similar events)
// Phase 1: matrix 32077 rows 6968 cols
[2022-06-09 01:11:01] [INFO ] Computed 82 place invariants in 2735 ms
[2022-06-09 01:11:03] [INFO ] Dead Transitions using invariants and state equation in 3874 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6968/6968 places, 32085/32085 transitions.
Starting property specific reduction for CANInsertWithFailure-PT-080-UpperBounds-00
Normalized transition count is 32077 out of 32085 initially.
// Phase 1: matrix 32077 rows 6968 cols
[2022-06-09 01:11:05] [INFO ] Computed 82 place invariants in 2829 ms
Incomplete random walk after 10000 steps, including 20 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
[2022-06-09 01:11:06] [INFO ] Flow matrix only has 32077 transitions (discarded 8 similar events)
// Phase 1: matrix 32077 rows 6968 cols
[2022-06-09 01:11:09] [INFO ] Computed 82 place invariants in 3215 ms
[2022-06-09 01:11:10] [INFO ] [Real]Absence check using 80 positive place invariants in 189 ms returned sat
[2022-06-09 01:11:11] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 120 ms returned sat
[2022-06-09 01:11:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:11:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:901)
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: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) : [80] Max seen :[0]
Support contains 1 out of 6968 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6968/6968 places, 32085/32085 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 7 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 6962 transition count 32079
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 6962 transition count 32078
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 6961 transition count 32078
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 22 place count 6961 transition count 32078
Applied a total of 22 rules in 14826 ms. Remains 6961 /6968 variables (removed 7) and now considering 32078/32085 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 6961/6968 places, 32078/32085 transitions.
// Phase 1: matrix 32078 rows 6961 cols
[2022-06-09 01:11:32] [INFO ] Computed 82 place invariants in 2783 ms
Finished random walk after 849207 steps, including 1750 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=28 )
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2792 ms. (steps per millisecond=358 ) properties (out of 1) seen :1
// Phase 1: matrix 32078 rows 6961 cols
[2022-06-09 01:12:08] [INFO ] Computed 82 place invariants in 2983 ms
[2022-06-09 01:12:09] [INFO ] [Real]Absence check using 80 positive place invariants in 213 ms returned sat
[2022-06-09 01:12:09] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 126 ms returned sat
[2022-06-09 01:12:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:12:42] [INFO ] [Real]Absence check using state equation in 32706 ms returned sat
[2022-06-09 01:12:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:12:45] [INFO ] [Nat]Absence check using 80 positive place invariants in 217 ms returned sat
[2022-06-09 01:12:45] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 124 ms returned sat
[2022-06-09 01:12:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:13:11] [INFO ] [Nat]Absence check using state equation in 26482 ms returned sat
[2022-06-09 01:13:12] [INFO ] State equation strengthened by 31758 read => feed constraints.
[2022-06-09 01:13:18] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 01:13:21] [INFO ] [Nat]Added 31758 Read/Feed constraints in 9497 ms returned unknown
Current structural bounds on expressions (after SMT) : [80] Max seen :[1]
Support contains 1 out of 6961 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6961/6961 places, 32078/32078 transitions.
Applied a total of 0 rules in 3711 ms. Remains 6961 /6961 variables (removed 0) and now considering 32078/32078 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 6961/6961 places, 32078/32078 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 6961/6961 places, 32078/32078 transitions.
Applied a total of 0 rules in 3709 ms. Remains 6961 /6961 variables (removed 0) and now considering 32078/32078 (removed 0) transitions.
// Phase 1: matrix 32078 rows 6961 cols
[2022-06-09 01:13:31] [INFO ] Computed 82 place invariants in 2722 ms
[2022-06-09 01:13:32] [INFO ] Implicit Places using invariants in 3670 ms returned []
Implicit Place search using SMT only with invariants took 3671 ms to find 0 implicit places.
// Phase 1: matrix 32078 rows 6961 cols
[2022-06-09 01:13:35] [INFO ] Computed 82 place invariants in 2646 ms
[2022-06-09 01:13:36] [INFO ] Dead Transitions using invariants and state equation in 3587 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6961/6961 places, 32078/32078 transitions.
// Phase 1: matrix 32078 rows 6961 cols
[2022-06-09 01:13:39] [INFO ] Computed 82 place invariants in 2766 ms
Finished random walk after 886686 steps, including 1826 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=29 )
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2646 ms. (steps per millisecond=377 ) properties (out of 1) seen :1
// Phase 1: matrix 32078 rows 6961 cols
[2022-06-09 01:14:14] [INFO ] Computed 82 place invariants in 3133 ms
[2022-06-09 01:14:16] [INFO ] [Real]Absence check using 80 positive place invariants in 208 ms returned sat
[2022-06-09 01:14:16] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 123 ms returned sat
[2022-06-09 01:14:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:14:46] [INFO ] [Real]Absence check using state equation in 30613 ms returned sat
[2022-06-09 01:14:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:14:49] [INFO ] [Nat]Absence check using 80 positive place invariants in 207 ms returned sat
[2022-06-09 01:14:49] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 118 ms returned sat
[2022-06-09 01:14:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:15:20] [INFO ] [Nat]Absence check using state equation in 30840 ms returned sat
[2022-06-09 01:15:20] [INFO ] State equation strengthened by 31758 read => feed constraints.
[2022-06-09 01:15:27] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 01:15:30] [INFO ] [Nat]Added 31758 Read/Feed constraints in 9701 ms returned unknown
Current structural bounds on expressions (after SMT) : [80] Max seen :[1]
Support contains 1 out of 6961 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6961/6961 places, 32078/32078 transitions.
Applied a total of 0 rules in 3806 ms. Remains 6961 /6961 variables (removed 0) and now considering 32078/32078 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 6961/6961 places, 32078/32078 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 6961/6961 places, 32078/32078 transitions.
Applied a total of 0 rules in 3587 ms. Remains 6961 /6961 variables (removed 0) and now considering 32078/32078 (removed 0) transitions.
// Phase 1: matrix 32078 rows 6961 cols
[2022-06-09 01:15:40] [INFO ] Computed 82 place invariants in 3081 ms
[2022-06-09 01:15:42] [INFO ] Implicit Places using invariants in 4189 ms returned []
Implicit Place search using SMT only with invariants took 4191 ms to find 0 implicit places.
// Phase 1: matrix 32078 rows 6961 cols
[2022-06-09 01:15:45] [INFO ] Computed 82 place invariants in 2979 ms
[2022-06-09 01:15:45] [INFO ] Dead Transitions using invariants and state equation in 3903 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6961/6961 places, 32078/32078 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-080-UpperBounds-00 in 282898 ms.
Starting property specific reduction for CANInsertWithFailure-PT-080-UpperBounds-01
Normalized transition count is 32077 out of 32085 initially.
// Phase 1: matrix 32077 rows 6968 cols
[2022-06-09 01:15:48] [INFO ] Computed 82 place invariants in 2632 ms
Incomplete random walk after 10000 steps, including 20 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
[2022-06-09 01:15:49] [INFO ] Flow matrix only has 32077 transitions (discarded 8 similar events)
// Phase 1: matrix 32077 rows 6968 cols
[2022-06-09 01:15:51] [INFO ] Computed 82 place invariants in 2658 ms
[2022-06-09 01:15:53] [INFO ] [Real]Absence check using 80 positive place invariants in 194 ms returned sat
[2022-06-09 01:15:53] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 122 ms returned sat
[2022-06-09 01:15:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:15:56] [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 0
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.verifyPossible(DeadlockTester.java:901)
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: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) : [80] Max seen :[1]
Support contains 1 out of 6968 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6968/6968 places, 32085/32085 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 6961 transition count 32078
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 22 place count 6961 transition count 32078
Applied a total of 22 rules in 10618 ms. Remains 6961 /6968 variables (removed 7) and now considering 32078/32085 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 6961/6968 places, 32078/32085 transitions.
// Phase 1: matrix 32078 rows 6961 cols
[2022-06-09 01:16:10] [INFO ] Computed 82 place invariants in 3131 ms
Finished random walk after 852290 steps, including 1758 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=28 )
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2758 ms. (steps per millisecond=362 ) properties (out of 1) seen :1
// Phase 1: matrix 32078 rows 6961 cols
[2022-06-09 01:16:46] [INFO ] Computed 82 place invariants in 2594 ms
[2022-06-09 01:16:47] [INFO ] [Real]Absence check using 80 positive place invariants in 210 ms returned sat
[2022-06-09 01:16:47] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 122 ms returned sat
[2022-06-09 01:16:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:17:09] [INFO ] [Real]Absence check using state equation in 22459 ms returned sat
[2022-06-09 01:17:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:17:12] [INFO ] [Nat]Absence check using 80 positive place invariants in 231 ms returned sat
[2022-06-09 01:17:12] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 209 ms returned sat
[2022-06-09 01:17:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:17:36] [INFO ] [Nat]Absence check using state equation in 24320 ms returned sat
[2022-06-09 01:17:37] [INFO ] State equation strengthened by 31760 read => feed constraints.
[2022-06-09 01:17:42] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 01:17:45] [INFO ] [Nat]Added 31760 Read/Feed constraints in 8376 ms returned unknown
Current structural bounds on expressions (after SMT) : [80] Max seen :[1]
Support contains 1 out of 6961 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6961/6961 places, 32078/32078 transitions.
Applied a total of 0 rules in 3638 ms. Remains 6961 /6961 variables (removed 0) and now considering 32078/32078 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 6961/6961 places, 32078/32078 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 6961/6961 places, 32078/32078 transitions.
Applied a total of 0 rules in 3645 ms. Remains 6961 /6961 variables (removed 0) and now considering 32078/32078 (removed 0) transitions.
// Phase 1: matrix 32078 rows 6961 cols
[2022-06-09 01:17:55] [INFO ] Computed 82 place invariants in 2752 ms
[2022-06-09 01:17:56] [INFO ] Implicit Places using invariants in 3693 ms returned []
Implicit Place search using SMT only with invariants took 3694 ms to find 0 implicit places.
// Phase 1: matrix 32078 rows 6961 cols
[2022-06-09 01:17:59] [INFO ] Computed 82 place invariants in 3005 ms
[2022-06-09 01:18:00] [INFO ] Dead Transitions using invariants and state equation in 4100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6961/6961 places, 32078/32078 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-080-UpperBounds-01 in 134679 ms.
Starting property specific reduction for CANInsertWithFailure-PT-080-UpperBounds-02
Normalized transition count is 32077 out of 32085 initially.
// Phase 1: matrix 32077 rows 6968 cols
[2022-06-09 01:18:03] [INFO ] Computed 82 place invariants in 2830 ms
Incomplete random walk after 10000 steps, including 20 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
[2022-06-09 01:18:03] [INFO ] Flow matrix only has 32077 transitions (discarded 8 similar events)
// Phase 1: matrix 32077 rows 6968 cols
[2022-06-09 01:18:06] [INFO ] Computed 82 place invariants in 2943 ms
[2022-06-09 01:18:08] [INFO ] [Real]Absence check using 80 positive place invariants in 191 ms returned sat
[2022-06-09 01:18:08] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 122 ms returned sat
[2022-06-09 01:18:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:18:11] [INFO ] [Real]Absence check using state equation in 3753 ms returned unknown
Current structural bounds on expressions (after SMT) : [80] Max seen :[1]
Support contains 1 out of 6968 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6968/6968 places, 32085/32085 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 6961 transition count 32078
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 6961 transition count 32077
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 6960 transition count 32077
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 6960 transition count 32077
Applied a total of 23 rules in 14701 ms. Remains 6960 /6968 variables (removed 8) and now considering 32077/32085 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 6960/6968 places, 32077/32085 transitions.
Normalized transition count is 32076 out of 32077 initially.
// Phase 1: matrix 32076 rows 6960 cols
[2022-06-09 01:18:29] [INFO ] Computed 82 place invariants in 2826 ms
Finished random walk after 825971 steps, including 1703 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=27 )
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 3056 ms. (steps per millisecond=327 ) properties (out of 1) seen :1
[2022-06-09 01:19:02] [INFO ] Flow matrix only has 32076 transitions (discarded 1 similar events)
// Phase 1: matrix 32076 rows 6960 cols
[2022-06-09 01:19:05] [INFO ] Computed 82 place invariants in 2833 ms
[2022-06-09 01:19:06] [INFO ] [Real]Absence check using 80 positive place invariants in 204 ms returned sat
[2022-06-09 01:19:06] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 121 ms returned sat
[2022-06-09 01:19:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:28] [INFO ] [Real]Absence check using state equation in 21745 ms returned sat
[2022-06-09 01:19:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:19:30] [INFO ] [Nat]Absence check using 80 positive place invariants in 205 ms returned sat
[2022-06-09 01:19:30] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 120 ms returned sat
[2022-06-09 01:19:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:51] [INFO ] [Nat]Absence check using state equation in 20078 ms returned sat
[2022-06-09 01:19:51] [INFO ] State equation strengthened by 31758 read => feed constraints.
[2022-06-09 01:19:56] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 01:19:59] [INFO ] [Nat]Added 31758 Read/Feed constraints in 8349 ms returned unknown
Current structural bounds on expressions (after SMT) : [80] Max seen :[1]
Support contains 1 out of 6960 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6960/6960 places, 32077/32077 transitions.
Applied a total of 0 rules in 3668 ms. Remains 6960 /6960 variables (removed 0) and now considering 32077/32077 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 6960/6960 places, 32077/32077 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 6960/6960 places, 32077/32077 transitions.
Applied a total of 0 rules in 3542 ms. Remains 6960 /6960 variables (removed 0) and now considering 32077/32077 (removed 0) transitions.
[2022-06-09 01:20:06] [INFO ] Flow matrix only has 32076 transitions (discarded 1 similar events)
// Phase 1: matrix 32076 rows 6960 cols
[2022-06-09 01:20:09] [INFO ] Computed 82 place invariants in 3037 ms
[2022-06-09 01:20:10] [INFO ] Implicit Places using invariants in 3989 ms returned []
Implicit Place search using SMT only with invariants took 3992 ms to find 0 implicit places.
[2022-06-09 01:20:10] [INFO ] Flow matrix only has 32076 transitions (discarded 1 similar events)
// Phase 1: matrix 32076 rows 6960 cols
[2022-06-09 01:20:13] [INFO ] Computed 82 place invariants in 2798 ms
[2022-06-09 01:20:14] [INFO ] Dead Transitions using invariants and state equation in 3703 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6960/6960 places, 32077/32077 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-080-UpperBounds-02 in 133901 ms.
Starting property specific reduction for CANInsertWithFailure-PT-080-UpperBounds-03
Normalized transition count is 32077 out of 32085 initially.
// Phase 1: matrix 32077 rows 6968 cols
[2022-06-09 01:20:17] [INFO ] Computed 82 place invariants in 2627 ms
Incomplete random walk after 10000 steps, including 21 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
[2022-06-09 01:20:17] [INFO ] Flow matrix only has 32077 transitions (discarded 8 similar events)
// Phase 1: matrix 32077 rows 6968 cols
[2022-06-09 01:20:20] [INFO ] Computed 82 place invariants in 2633 ms
[2022-06-09 01:20:21] [INFO ] [Real]Absence check using 80 positive place invariants in 190 ms returned sat
[2022-06-09 01:20:21] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 123 ms returned sat
[2022-06-09 01:20:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:20:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:901)
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: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) : [80] Max seen :[0]
Support contains 1 out of 6968 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6968/6968 places, 32085/32085 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 6961 transition count 32078
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 6961 transition count 32077
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 6960 transition count 32077
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 6960 transition count 32077
Applied a total of 23 rules in 14533 ms. Remains 6960 /6968 variables (removed 8) and now considering 32077/32085 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 6960/6968 places, 32077/32085 transitions.
Normalized transition count is 32076 out of 32077 initially.
// Phase 1: matrix 32076 rows 6960 cols
[2022-06-09 01:20:42] [INFO ] Computed 82 place invariants in 2816 ms
Finished random walk after 870500 steps, including 1797 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=29 )
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2731 ms. (steps per millisecond=366 ) properties (out of 1) seen :1
[2022-06-09 01:21:15] [INFO ] Flow matrix only has 32076 transitions (discarded 1 similar events)
// Phase 1: matrix 32076 rows 6960 cols
[2022-06-09 01:21:18] [INFO ] Computed 82 place invariants in 3228 ms
[2022-06-09 01:21:20] [INFO ] [Real]Absence check using 80 positive place invariants in 204 ms returned sat
[2022-06-09 01:21:20] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 125 ms returned sat
[2022-06-09 01:21:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:42] [INFO ] [Real]Absence check using state equation in 22286 ms returned sat
[2022-06-09 01:21:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:21:44] [INFO ] [Nat]Absence check using 80 positive place invariants in 205 ms returned sat
[2022-06-09 01:21:45] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 119 ms returned sat
[2022-06-09 01:21:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:22:07] [INFO ] [Nat]Absence check using state equation in 22836 ms returned sat
[2022-06-09 01:22:08] [INFO ] State equation strengthened by 31758 read => feed constraints.
[2022-06-09 01:22:13] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 01:22:16] [INFO ] [Nat]Added 31758 Read/Feed constraints in 8676 ms returned unknown
Current structural bounds on expressions (after SMT) : [80] Max seen :[1]
Support contains 1 out of 6960 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6960/6960 places, 32077/32077 transitions.
Applied a total of 0 rules in 3555 ms. Remains 6960 /6960 variables (removed 0) and now considering 32077/32077 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 6960/6960 places, 32077/32077 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 6960/6960 places, 32077/32077 transitions.
Applied a total of 0 rules in 3529 ms. Remains 6960 /6960 variables (removed 0) and now considering 32077/32077 (removed 0) transitions.
[2022-06-09 01:22:23] [INFO ] Flow matrix only has 32076 transitions (discarded 1 similar events)
// Phase 1: matrix 32076 rows 6960 cols
[2022-06-09 01:22:26] [INFO ] Computed 82 place invariants in 2602 ms
[2022-06-09 01:22:27] [INFO ] Implicit Places using invariants in 3709 ms returned []
Implicit Place search using SMT only with invariants took 3710 ms to find 0 implicit places.
[2022-06-09 01:22:27] [INFO ] Flow matrix only has 32076 transitions (discarded 1 similar events)
// Phase 1: matrix 32076 rows 6960 cols
[2022-06-09 01:22:30] [INFO ] Computed 82 place invariants in 3075 ms
[2022-06-09 01:22:31] [INFO ] Dead Transitions using invariants and state equation in 4094 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6960/6960 places, 32077/32077 transitions.
Normalized transition count is 32076 out of 32077 initially.
// Phase 1: matrix 32076 rows 6960 cols
[2022-06-09 01:22:34] [INFO ] Computed 82 place invariants in 2792 ms
Finished random walk after 858007 steps, including 1776 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=28 )
Incomplete Best-First random walk after 1000001 steps, including 18 resets, run finished after 2523 ms. (steps per millisecond=396 ) properties (out of 1) seen :1
[2022-06-09 01:23:07] [INFO ] Flow matrix only has 32076 transitions (discarded 1 similar events)
// Phase 1: matrix 32076 rows 6960 cols
[2022-06-09 01:23:09] [INFO ] Computed 82 place invariants in 2776 ms
[2022-06-09 01:23:11] [INFO ] [Real]Absence check using 80 positive place invariants in 212 ms returned sat
[2022-06-09 01:23:11] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 130 ms returned sat
[2022-06-09 01:23:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:23:33] [INFO ] [Real]Absence check using state equation in 22279 ms returned sat
[2022-06-09 01:23:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:23:36] [INFO ] [Nat]Absence check using 80 positive place invariants in 203 ms returned sat
[2022-06-09 01:23:36] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 117 ms returned sat
[2022-06-09 01:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:24:00] [INFO ] [Nat]Absence check using state equation in 24654 ms returned sat
[2022-06-09 01:24:01] [INFO ] State equation strengthened by 31758 read => feed constraints.
[2022-06-09 01:24:07] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 01:24:10] [INFO ] [Nat]Added 31758 Read/Feed constraints in 9271 ms returned unknown
Current structural bounds on expressions (after SMT) : [80] Max seen :[1]
Support contains 1 out of 6960 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6960/6960 places, 32077/32077 transitions.
Applied a total of 0 rules in 3930 ms. Remains 6960 /6960 variables (removed 0) and now considering 32077/32077 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 6960/6960 places, 32077/32077 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 6960/6960 places, 32077/32077 transitions.
Applied a total of 0 rules in 4137 ms. Remains 6960 /6960 variables (removed 0) and now considering 32077/32077 (removed 0) transitions.
[2022-06-09 01:24:18] [INFO ] Flow matrix only has 32076 transitions (discarded 1 similar events)
// Phase 1: matrix 32076 rows 6960 cols
[2022-06-09 01:24:21] [INFO ] Computed 82 place invariants in 2954 ms
[2022-06-09 01:24:22] [INFO ] Implicit Places using invariants in 3954 ms returned []
Implicit Place search using SMT only with invariants took 3955 ms to find 0 implicit places.
[2022-06-09 01:24:22] [INFO ] Flow matrix only has 32076 transitions (discarded 1 similar events)
// Phase 1: matrix 32076 rows 6960 cols
[2022-06-09 01:24:25] [INFO ] Computed 82 place invariants in 2810 ms
[2022-06-09 01:24:26] [INFO ] Dead Transitions using invariants and state equation in 3775 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6960/6960 places, 32077/32077 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-080-UpperBounds-03 in 251817 ms.
Starting property specific reduction for CANInsertWithFailure-PT-080-UpperBounds-04
Normalized transition count is 32077 out of 32085 initially.
// Phase 1: matrix 32077 rows 6968 cols
[2022-06-09 01:24:29] [INFO ] Computed 82 place invariants in 3017 ms
Incomplete random walk after 10000 steps, including 20 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
[2022-06-09 01:24:29] [INFO ] Flow matrix only has 32077 transitions (discarded 8 similar events)
// Phase 1: matrix 32077 rows 6968 cols
[2022-06-09 01:24:33] [INFO ] Computed 82 place invariants in 3167 ms
[2022-06-09 01:24:34] [INFO ] [Real]Absence check using 80 positive place invariants in 283 ms returned sat
[2022-06-09 01:24:34] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 150 ms returned sat
[2022-06-09 01:24:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:24:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:901)
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: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) : [80] Max seen :[0]
Support contains 1 out of 6968 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6968/6968 places, 32085/32085 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 9 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 6962 transition count 32079
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 6962 transition count 32078
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 6961 transition count 32078
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 22 place count 6961 transition count 32078
Applied a total of 22 rules in 18684 ms. Remains 6961 /6968 variables (removed 7) and now considering 32078/32085 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 6961/6968 places, 32078/32085 transitions.
// Phase 1: matrix 32078 rows 6961 cols
[2022-06-09 01:24:59] [INFO ] Computed 82 place invariants in 2982 ms
Finished random walk after 796467 steps, including 1641 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=26 )
Incomplete Best-First random walk after 1000001 steps, including 18 resets, run finished after 2778 ms. (steps per millisecond=359 ) properties (out of 1) seen :0
// Phase 1: matrix 32078 rows 6961 cols
[2022-06-09 01:25:35] [INFO ] Computed 82 place invariants in 3192 ms
[2022-06-09 01:25:37] [INFO ] [Real]Absence check using 80 positive place invariants in 251 ms returned sat
[2022-06-09 01:25:37] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 140 ms returned sat
[2022-06-09 01:25:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:25:44] [INFO ] [Real]Absence check using state equation in 6880 ms returned sat
[2022-06-09 01:25:45] [INFO ] State equation strengthened by 31758 read => feed constraints.
[2022-06-09 01:25:51] [INFO ] [Real]Added 31758 Read/Feed constraints in 5476 ms returned sat
[2022-06-09 01:25:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:25:53] [INFO ] [Nat]Absence check using 80 positive place invariants in 251 ms returned sat
[2022-06-09 01:25:53] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 137 ms returned sat
[2022-06-09 01:25:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:26:00] [INFO ] [Nat]Absence check using state equation in 7048 ms returned sat
[2022-06-09 01:26:06] [INFO ] [Nat]Added 31758 Read/Feed constraints in 5383 ms returned sat
[2022-06-09 01:26:36] [INFO ] Deduced a trap composed of 2 places in 29387 ms of which 12 ms to minimize.
[2022-06-09 01:27:17] [INFO ] Deduced a trap composed of 3 places in 39631 ms of which 10 ms to minimize.
[2022-06-09 01:27:17] [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) : [80] Max seen :[1]
Support contains 1 out of 6961 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6961/6961 places, 32078/32078 transitions.
Applied a total of 0 rules in 8862 ms. Remains 6961 /6961 variables (removed 0) and now considering 32078/32078 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 6961/6961 places, 32078/32078 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 6961/6961 places, 32078/32078 transitions.
Applied a total of 0 rules in 9559 ms. Remains 6961 /6961 variables (removed 0) and now considering 32078/32078 (removed 0) transitions.
// Phase 1: matrix 32078 rows 6961 cols
[2022-06-09 01:27:39] [INFO ] Computed 82 place invariants in 3861 ms
[2022-06-09 01:27:40] [INFO ] Implicit Places using invariants in 4893 ms returned []
Implicit Place search using SMT only with invariants took 4897 ms to find 0 implicit places.
// Phase 1: matrix 32078 rows 6961 cols
[2022-06-09 01:27:44] [INFO ] Computed 82 place invariants in 3593 ms
[2022-06-09 01:27:44] [INFO ] Dead Transitions using invariants and state equation in 4589 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6961/6961 places, 32078/32078 transitions.
// Phase 1: matrix 32078 rows 6961 cols
[2022-06-09 01:27:48] [INFO ] Computed 82 place invariants in 3632 ms
Finished random walk after 732899 steps, including 1511 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=24 )
Incomplete Best-First random walk after 1000001 steps, including 18 resets, run finished after 2850 ms. (steps per millisecond=350 ) properties (out of 1) seen :1
// Phase 1: matrix 32078 rows 6961 cols
[2022-06-09 01:28:25] [INFO ] Computed 82 place invariants in 3705 ms
[2022-06-09 01:28:26] [INFO ] [Real]Absence check using 80 positive place invariants in 309 ms returned sat
[2022-06-09 01:28:26] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 146 ms returned sat
[2022-06-09 01:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:29:03] [INFO ] [Real]Absence check using state equation in 36830 ms returned sat
[2022-06-09 01:29:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:29:06] [INFO ] [Nat]Absence check using 80 positive place invariants in 288 ms returned sat
[2022-06-09 01:29:06] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 141 ms returned sat
[2022-06-09 01:29:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:29:14] [INFO ] [Nat]Absence check using state equation in 7696 ms returned sat
[2022-06-09 01:29:14] [INFO ] State equation strengthened by 31758 read => feed constraints.
[2022-06-09 01:29:20] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 01:29:20] [INFO ] [Nat]Added 31758 Read/Feed constraints in 6297 ms returned sat
[2022-06-09 01:29:56] [INFO ] Deduced a trap composed of 2 places in 33996 ms of which 9 ms to minimize.
[2022-06-09 01:29:56] [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) : [80] Max seen :[1]
Support contains 1 out of 6961 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6961/6961 places, 32078/32078 transitions.
Applied a total of 0 rules in 4359 ms. Remains 6961 /6961 variables (removed 0) and now considering 32078/32078 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 6961/6961 places, 32078/32078 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 6961/6961 places, 32078/32078 transitions.
Applied a total of 0 rules in 4847 ms. Remains 6961 /6961 variables (removed 0) and now considering 32078/32078 (removed 0) transitions.
// Phase 1: matrix 32078 rows 6961 cols
[2022-06-09 01:30:08] [INFO ] Computed 82 place invariants in 3247 ms
[2022-06-09 01:30:09] [INFO ] Implicit Places using invariants in 4230 ms returned []
Implicit Place search using SMT only with invariants took 4233 ms to find 0 implicit places.
// Phase 1: matrix 32078 rows 6961 cols
[2022-06-09 01:30:12] [INFO ] Computed 82 place invariants in 3037 ms
[2022-06-09 01:30:13] [INFO ] Dead Transitions using invariants and state equation in 4022 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6961/6961 places, 32078/32078 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-080-UpperBounds-04 in 347253 ms.
Starting property specific reduction for CANInsertWithFailure-PT-080-UpperBounds-05
Normalized transition count is 32077 out of 32085 initially.
// Phase 1: matrix 32077 rows 6968 cols
[2022-06-09 01:30:16] [INFO ] Computed 82 place invariants in 3057 ms
Incomplete random walk after 10000 steps, including 21 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
[2022-06-09 01:30:17] [INFO ] Flow matrix only has 32077 transitions (discarded 8 similar events)
// Phase 1: matrix 32077 rows 6968 cols
[2022-06-09 01:30:20] [INFO ] Computed 82 place invariants in 3083 ms
[2022-06-09 01:30:21] [INFO ] [Real]Absence check using 80 positive place invariants in 224 ms returned sat
[2022-06-09 01:30:21] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 140 ms returned sat
[2022-06-09 01:30:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:30:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:901)
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: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) : [80] Max seen :[0]
Support contains 1 out of 6968 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6968/6968 places, 32085/32085 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 10 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 6961 transition count 32078
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 6961 transition count 32077
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 6960 transition count 32077
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 6960 transition count 32077
Applied a total of 23 rules in 17215 ms. Remains 6960 /6968 variables (removed 8) and now considering 32077/32085 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 6960/6968 places, 32077/32085 transitions.
Normalized transition count is 32076 out of 32077 initially.
// Phase 1: matrix 32076 rows 6960 cols
[2022-06-09 01:30:45] [INFO ] Computed 82 place invariants in 3004 ms
Finished random walk after 782232 steps, including 1612 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=26 )
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 2782 ms. (steps per millisecond=359 ) properties (out of 1) seen :1
[2022-06-09 01:31:18] [INFO ] Flow matrix only has 32076 transitions (discarded 1 similar events)
// Phase 1: matrix 32076 rows 6960 cols
[2022-06-09 01:31:21] [INFO ] Computed 82 place invariants in 3239 ms
[2022-06-09 01:31:22] [INFO ] [Real]Absence check using 80 positive place invariants in 241 ms returned sat
[2022-06-09 01:31:22] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 135 ms returned sat
[2022-06-09 01:31:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:31:49] [INFO ] [Real]Absence check using state equation in 26867 ms returned sat
[2022-06-09 01:31:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:31:52] [INFO ] [Nat]Absence check using 80 positive place invariants in 244 ms returned sat
[2022-06-09 01:31:52] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 134 ms returned sat
[2022-06-09 01:31:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:32:19] [INFO ] [Nat]Absence check using state equation in 27138 ms returned sat
[2022-06-09 01:32:20] [INFO ] State equation strengthened by 31758 read => feed constraints.
[2022-06-09 01:32:25] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 01:32:28] [INFO ] [Nat]Added 31758 Read/Feed constraints in 8562 ms returned unknown
Current structural bounds on expressions (after SMT) : [80] Max seen :[1]
Support contains 1 out of 6960 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6960/6960 places, 32077/32077 transitions.
Applied a total of 0 rules in 4799 ms. Remains 6960 /6960 variables (removed 0) and now considering 32077/32077 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 6960/6960 places, 32077/32077 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 6960/6960 places, 32077/32077 transitions.
Applied a total of 0 rules in 4849 ms. Remains 6960 /6960 variables (removed 0) and now considering 32077/32077 (removed 0) transitions.
[2022-06-09 01:32:38] [INFO ] Flow matrix only has 32076 transitions (discarded 1 similar events)
// Phase 1: matrix 32076 rows 6960 cols
[2022-06-09 01:32:41] [INFO ] Computed 82 place invariants in 3030 ms
[2022-06-09 01:32:42] [INFO ] Implicit Places using invariants in 4019 ms returned []
Implicit Place search using SMT only with invariants took 4020 ms to find 0 implicit places.
[2022-06-09 01:32:42] [INFO ] Flow matrix only has 32076 transitions (discarded 1 similar events)
// Phase 1: matrix 32076 rows 6960 cols
[2022-06-09 01:32:45] [INFO ] Computed 82 place invariants in 3093 ms
[2022-06-09 01:32:46] [INFO ] Dead Transitions using invariants and state equation in 4064 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6960/6960 places, 32077/32077 transitions.
Normalized transition count is 32076 out of 32077 initially.
// Phase 1: matrix 32076 rows 6960 cols
[2022-06-09 01:32:49] [INFO ] Computed 82 place invariants in 2936 ms
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="CANInsertWithFailure-PT-080"
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 CANInsertWithFailure-PT-080, 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 r294-smll-165463872400069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-080.tgz
mv CANInsertWithFailure-PT-080 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 ;