About the Execution of ITS-Tools for CANInsertWithFailure-PT-040
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16212.932 | 3600000.00 | 3228794.00 | 186711.80 | 1 ? ? ? ? ? ? ? ? ? ? ? ? 1 ? ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872300037.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-040, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872300037
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 11K May 30 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 30 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 30 15:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 30 15:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 25 12:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 25 12:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 25 12:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 12:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 16K May 30 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 30 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 30 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 30 15:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 25 12:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 25 12:58 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 9.8M 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-040-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-040-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-040-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-040-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-040-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-040-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-040-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-040-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-040-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-040-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-040-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-040-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-040-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-040-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-040-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-040-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1654680276221
Running Version 202205111006
[2022-06-08 09:24:37] [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-08 09:24:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 09:24:38] [INFO ] Load time of PNML (sax parser for PT used): 783 ms
[2022-06-08 09:24:38] [INFO ] Transformed 3684 places.
[2022-06-08 09:24:39] [INFO ] Transformed 9840 transitions.
[2022-06-08 09:24:39] [INFO ] Parsed PT model containing 3684 places and 9840 transitions in 996 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 9840 rows 3684 cols
[2022-06-08 09:24:39] [INFO ] Computed 43 place invariants in 668 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :1
FORMULA CANInsertWithFailure-PT-040-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :1
FORMULA CANInsertWithFailure-PT-040-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 9840 rows 3684 cols
[2022-06-08 09:24:40] [INFO ] Computed 43 place invariants in 528 ms
[2022-06-08 09:24:41] [INFO ] [Real]Absence check using 41 positive place invariants in 93 ms returned sat
[2022-06-08 09:24:41] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 52 ms returned sat
[2022-06-08 09:24:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:24:45] [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-08 09:24:46] [INFO ] [Real]Absence check using 41 positive place invariants in 85 ms returned sat
[2022-06-08 09:24:46] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 49 ms returned sat
[2022-06-08 09:24:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:24:50] [INFO ] [Real]Absence check using state equation in 4341 ms returned unknown
[2022-06-08 09:24:51] [INFO ] [Real]Absence check using 41 positive place invariants in 88 ms returned sat
[2022-06-08 09:24:51] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 50 ms returned sat
[2022-06-08 09:24:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:24:55] [INFO ] [Real]Absence check using state equation in 4365 ms returned unknown
[2022-06-08 09:24:56] [INFO ] [Real]Absence check using 41 positive place invariants in 80 ms returned sat
[2022-06-08 09:24:56] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 48 ms returned sat
[2022-06-08 09:24:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:25:00] [INFO ] [Real]Absence check using state equation in 4374 ms returned unknown
[2022-06-08 09:25:01] [INFO ] [Real]Absence check using 41 positive place invariants in 83 ms returned sat
[2022-06-08 09:25:01] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 50 ms returned sat
[2022-06-08 09:25:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:25:06] [INFO ] [Real]Absence check using state equation in 4351 ms returned unknown
[2022-06-08 09:25:06] [INFO ] [Real]Absence check using 41 positive place invariants in 80 ms returned sat
[2022-06-08 09:25:06] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 55 ms returned sat
[2022-06-08 09:25:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:25:11] [INFO ] [Real]Absence check using state equation in 4359 ms returned unknown
[2022-06-08 09:25:11] [INFO ] [Real]Absence check using 41 positive place invariants in 85 ms returned sat
[2022-06-08 09:25:11] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 49 ms returned sat
[2022-06-08 09:25:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:25:16] [INFO ] [Real]Absence check using state equation in 4336 ms returned unknown
[2022-06-08 09:25:16] [INFO ] [Real]Absence check using 41 positive place invariants in 81 ms returned sat
[2022-06-08 09:25:16] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 48 ms returned sat
[2022-06-08 09:25:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:25:21] [INFO ] [Real]Absence check using state equation in 4381 ms returned unknown
[2022-06-08 09:25:21] [INFO ] [Real]Absence check using 41 positive place invariants in 78 ms returned sat
[2022-06-08 09:25:21] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 48 ms returned sat
[2022-06-08 09:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:25:26] [INFO ] [Real]Absence check using state equation in 4358 ms returned sat
[2022-06-08 09:25:26] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2022-06-08 09:25:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2022-06-08 09:25:26] [INFO ] [Real]Absence check using 41 positive place invariants in 79 ms returned sat
[2022-06-08 09:25:26] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 52 ms returned sat
[2022-06-08 09:25:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:25:31] [INFO ] [Real]Absence check using state equation in 4337 ms returned unknown
[2022-06-08 09:25:31] [INFO ] [Real]Absence check using 41 positive place invariants in 80 ms returned sat
[2022-06-08 09:25:31] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 50 ms returned sat
[2022-06-08 09:25:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:25:36] [INFO ] [Real]Absence check using state equation in 4385 ms returned unknown
[2022-06-08 09:25:36] [INFO ] [Real]Absence check using 41 positive place invariants in 79 ms returned sat
[2022-06-08 09:25:36] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 49 ms returned sat
[2022-06-08 09:25:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:25:41] [INFO ] [Real]Absence check using state equation in 4387 ms returned unknown
[2022-06-08 09:25:41] [INFO ] [Real]Absence check using 41 positive place invariants in 78 ms returned sat
[2022-06-08 09:25:41] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 48 ms returned sat
[2022-06-08 09:25:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:25:46] [INFO ] [Real]Absence check using state equation in 4390 ms returned unknown
[2022-06-08 09:25:46] [INFO ] [Real]Absence check using 41 positive place invariants in 79 ms returned sat
[2022-06-08 09:25:46] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 50 ms returned sat
[2022-06-08 09:25:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:25:51] [INFO ] [Real]Absence check using state equation in 4379 ms returned unknown
Current structural bounds on expressions (after SMT) : [40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40] Max seen :[0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0]
Support contains 14 out of 3684 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Graph (complete) has 13401 edges and 3684 vertex of which 3683 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.29 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 281 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 561 place count 3403 transition count 9560
Performed 1552 Post agglomeration using F-continuation condition.Transition count delta: 1552
Deduced a syphon composed of 1552 places in 6 ms
Reduce places removed 1552 places and 0 transitions.
Iterating global reduction 2 with 3104 rules applied. Total rules applied 3665 place count 1851 transition count 8008
Drop transitions removed 1474 transitions
Redundant transition composition rules discarded 1474 transitions
Iterating global reduction 2 with 1474 rules applied. Total rules applied 5139 place count 1851 transition count 6534
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5140 place count 1851 transition count 6533
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5141 place count 1850 transition count 6533
Partial Free-agglomeration rule applied 1635 times.
Drop transitions removed 1635 transitions
Iterating global reduction 3 with 1635 rules applied. Total rules applied 6776 place count 1850 transition count 6533
Applied a total of 6776 rules in 3162 ms. Remains 1850 /3684 variables (removed 1834) and now considering 6533/9840 (removed 3307) transitions.
Finished structural reductions, in 1 iterations. Remains : 1850/3684 places, 6533/9840 transitions.
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:25:54] [INFO ] Computed 42 place invariants in 184 ms
Incomplete random walk after 1000000 steps, including 5406 resets, run finished after 13598 ms. (steps per millisecond=73 ) properties (out of 14) seen :14
Incomplete Best-First random walk after 1000001 steps, including 110 resets, run finished after 1624 ms. (steps per millisecond=615 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 1000001 steps, including 110 resets, run finished after 1604 ms. (steps per millisecond=623 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 1000001 steps, including 110 resets, run finished after 1587 ms. (steps per millisecond=630 ) properties (out of 14) seen :14
Incomplete Best-First random walk after 1000001 steps, including 109 resets, run finished after 1590 ms. (steps per millisecond=628 ) properties (out of 14) seen :14
Incomplete Best-First random walk after 1000001 steps, including 113 resets, run finished after 1589 ms. (steps per millisecond=629 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 1000001 steps, including 113 resets, run finished after 1578 ms. (steps per millisecond=633 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 1000001 steps, including 112 resets, run finished after 1581 ms. (steps per millisecond=632 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 1000001 steps, including 111 resets, run finished after 1598 ms. (steps per millisecond=625 ) properties (out of 14) seen :14
Incomplete Best-First random walk after 1000001 steps, including 111 resets, run finished after 1587 ms. (steps per millisecond=630 ) properties (out of 14) seen :14
Incomplete Best-First random walk after 1000001 steps, including 111 resets, run finished after 1605 ms. (steps per millisecond=623 ) properties (out of 14) seen :14
Incomplete Best-First random walk after 1000001 steps, including 110 resets, run finished after 1583 ms. (steps per millisecond=631 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 1000001 steps, including 112 resets, run finished after 1582 ms. (steps per millisecond=632 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 1000001 steps, including 111 resets, run finished after 1584 ms. (steps per millisecond=631 ) properties (out of 14) seen :14
Incomplete Best-First random walk after 1000001 steps, including 109 resets, run finished after 1591 ms. (steps per millisecond=628 ) properties (out of 14) seen :13
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:26:30] [INFO ] Computed 42 place invariants in 194 ms
[2022-06-08 09:26:31] [INFO ] [Real]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-08 09:26:31] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:26:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:26:33] [INFO ] [Real]Absence check using state equation in 2001 ms returned sat
[2022-06-08 09:26:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:26:33] [INFO ] [Nat]Absence check using 40 positive place invariants in 38 ms returned sat
[2022-06-08 09:26:33] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2022-06-08 09:26:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:26:35] [INFO ] [Nat]Absence check using state equation in 1948 ms returned sat
[2022-06-08 09:26:35] [INFO ] State equation strengthened by 6384 read => feed constraints.
[2022-06-08 09:26:36] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1029 ms returned sat
[2022-06-08 09:26:37] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 587 ms.
[2022-06-08 09:26:39] [INFO ] Added : 6 causal constraints over 2 iterations in 2239 ms. Result :sat
[2022-06-08 09:26:39] [INFO ] [Real]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-08 09:26:39] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:26:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:26:42] [INFO ] [Real]Absence check using state equation in 2078 ms returned sat
[2022-06-08 09:26:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:26:42] [INFO ] [Nat]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-08 09:26:42] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:26:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:26:44] [INFO ] [Nat]Absence check using state equation in 2038 ms returned sat
[2022-06-08 09:26:45] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1245 ms returned sat
[2022-06-08 09:26:46] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 454 ms.
[2022-06-08 09:26:48] [INFO ] Added : 8 causal constraints over 2 iterations in 2005 ms. Result :sat
[2022-06-08 09:26:48] [INFO ] [Real]Absence check using 40 positive place invariants in 40 ms returned sat
[2022-06-08 09:26:48] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:26:50] [INFO ] [Real]Absence check using state equation in 2020 ms returned sat
[2022-06-08 09:26:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:26:51] [INFO ] [Nat]Absence check using 40 positive place invariants in 43 ms returned sat
[2022-06-08 09:26:51] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:26:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:26:53] [INFO ] [Nat]Absence check using state equation in 2097 ms returned sat
[2022-06-08 09:26:54] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1590 ms returned sat
[2022-06-08 09:26:55] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 498 ms.
[2022-06-08 09:26:57] [INFO ] Added : 13 causal constraints over 3 iterations in 2327 ms. Result :sat
[2022-06-08 09:26:57] [INFO ] [Real]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-08 09:26:58] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:26:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:27:00] [INFO ] [Real]Absence check using state equation in 2072 ms returned sat
[2022-06-08 09:27:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:27:00] [INFO ] [Nat]Absence check using 40 positive place invariants in 43 ms returned sat
[2022-06-08 09:27:00] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:27:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:27:02] [INFO ] [Nat]Absence check using state equation in 2104 ms returned sat
[2022-06-08 09:27:04] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1561 ms returned sat
[2022-06-08 09:27:04] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 445 ms.
[2022-06-08 09:27:06] [INFO ] Added : 6 causal constraints over 2 iterations in 1985 ms. Result :sat
[2022-06-08 09:27:07] [INFO ] [Real]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-08 09:27:07] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:27:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:27:09] [INFO ] [Real]Absence check using state equation in 2211 ms returned sat
[2022-06-08 09:27:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:27:09] [INFO ] [Nat]Absence check using 40 positive place invariants in 44 ms returned sat
[2022-06-08 09:27:09] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:27:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:27:11] [INFO ] [Nat]Absence check using state equation in 2091 ms returned sat
[2022-06-08 09:27:12] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1008 ms returned sat
[2022-06-08 09:27:13] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 431 ms.
[2022-06-08 09:27:14] [INFO ] Added : 6 causal constraints over 2 iterations in 1906 ms. Result :sat
[2022-06-08 09:27:15] [INFO ] [Real]Absence check using 40 positive place invariants in 39 ms returned sat
[2022-06-08 09:27:15] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:27:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:27:17] [INFO ] [Real]Absence check using state equation in 1987 ms returned sat
[2022-06-08 09:27:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:27:17] [INFO ] [Nat]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-08 09:27:18] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:27:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:27:19] [INFO ] [Nat]Absence check using state equation in 1958 ms returned sat
[2022-06-08 09:27:21] [INFO ] [Nat]Added 6384 Read/Feed constraints in 2019 ms returned sat
[2022-06-08 09:27:22] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 451 ms.
[2022-06-08 09:27:24] [INFO ] Added : 8 causal constraints over 2 iterations in 1971 ms. Result :sat
[2022-06-08 09:27:24] [INFO ] [Real]Absence check using 40 positive place invariants in 40 ms returned sat
[2022-06-08 09:27:24] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:27:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:27:26] [INFO ] [Real]Absence check using state equation in 1946 ms returned sat
[2022-06-08 09:27:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:27:27] [INFO ] [Nat]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-08 09:27:27] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:27:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:27:29] [INFO ] [Nat]Absence check using state equation in 2021 ms returned sat
[2022-06-08 09:27:30] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1352 ms returned sat
[2022-06-08 09:27:31] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 435 ms.
[2022-06-08 09:27:32] [INFO ] Added : 10 causal constraints over 2 iterations in 1877 ms. Result :sat
[2022-06-08 09:27:33] [INFO ] [Real]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-08 09:27:33] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:27:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:27:35] [INFO ] [Real]Absence check using state equation in 2134 ms returned sat
[2022-06-08 09:27:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:27:35] [INFO ] [Nat]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-08 09:27:35] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:27:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:27:38] [INFO ] [Nat]Absence check using state equation in 2138 ms returned sat
[2022-06-08 09:27:39] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1074 ms returned sat
[2022-06-08 09:27:39] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 446 ms.
[2022-06-08 09:27:41] [INFO ] Added : 9 causal constraints over 2 iterations in 1940 ms. Result :sat
[2022-06-08 09:27:41] [INFO ] [Real]Absence check using 40 positive place invariants in 40 ms returned sat
[2022-06-08 09:27:41] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:27:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:27:43] [INFO ] [Real]Absence check using state equation in 2020 ms returned sat
[2022-06-08 09:27:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:27:44] [INFO ] [Nat]Absence check using 40 positive place invariants in 42 ms returned sat
[2022-06-08 09:27:44] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:27:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:27:46] [INFO ] [Nat]Absence check using state equation in 2033 ms returned sat
[2022-06-08 09:27:47] [INFO ] [Nat]Added 6384 Read/Feed constraints in 976 ms returned sat
[2022-06-08 09:27:48] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 438 ms.
[2022-06-08 09:27:49] [INFO ] Added : 9 causal constraints over 2 iterations in 1863 ms. Result :sat
[2022-06-08 09:27:50] [INFO ] [Real]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-08 09:27:50] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:27:51] [INFO ] [Real]Absence check using state equation in 1940 ms returned sat
[2022-06-08 09:27:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:27:52] [INFO ] [Nat]Absence check using 40 positive place invariants in 42 ms returned sat
[2022-06-08 09:27:52] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:27:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:27:54] [INFO ] [Nat]Absence check using state equation in 2025 ms returned sat
[2022-06-08 09:27:56] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1610 ms returned sat
[2022-06-08 09:27:56] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 453 ms.
[2022-06-08 09:27:58] [INFO ] Added : 7 causal constraints over 2 iterations in 1931 ms. Result :sat
[2022-06-08 09:27:58] [INFO ] [Real]Absence check using 40 positive place invariants in 40 ms returned sat
[2022-06-08 09:27:58] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:27:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:28:00] [INFO ] [Real]Absence check using state equation in 2020 ms returned sat
[2022-06-08 09:28:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:28:01] [INFO ] [Nat]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-08 09:28:01] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:28:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:28:03] [INFO ] [Nat]Absence check using state equation in 2046 ms returned sat
[2022-06-08 09:28:05] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1826 ms returned sat
[2022-06-08 09:28:05] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 425 ms.
[2022-06-08 09:28:07] [INFO ] Added : 14 causal constraints over 4 iterations in 2549 ms. Result :sat
[2022-06-08 09:28:08] [INFO ] [Real]Absence check using 40 positive place invariants in 40 ms returned sat
[2022-06-08 09:28:08] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:28:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:28:10] [INFO ] [Real]Absence check using state equation in 1912 ms returned sat
[2022-06-08 09:28:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:28:10] [INFO ] [Nat]Absence check using 40 positive place invariants in 46 ms returned sat
[2022-06-08 09:28:10] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:28:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:28:12] [INFO ] [Nat]Absence check using state equation in 2015 ms returned sat
[2022-06-08 09:28:14] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1308 ms returned sat
[2022-06-08 09:28:14] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 438 ms.
[2022-06-08 09:28:16] [INFO ] Added : 11 causal constraints over 3 iterations in 2175 ms. Result :sat
[2022-06-08 09:28:17] [INFO ] [Real]Absence check using 40 positive place invariants in 40 ms returned sat
[2022-06-08 09:28:17] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:28:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:28:19] [INFO ] [Real]Absence check using state equation in 2031 ms returned sat
[2022-06-08 09:28:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:28:19] [INFO ] [Nat]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-08 09:28:19] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:28:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:28:21] [INFO ] [Nat]Absence check using state equation in 2037 ms returned sat
[2022-06-08 09:28:23] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1258 ms returned sat
[2022-06-08 09:28:23] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 435 ms.
[2022-06-08 09:28:25] [INFO ] Added : 12 causal constraints over 3 iterations in 2232 ms. Result :sat
[2022-06-08 09:28:26] [INFO ] [Real]Absence check using 40 positive place invariants in 39 ms returned sat
[2022-06-08 09:28:26] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:28:28] [INFO ] [Real]Absence check using state equation in 2031 ms returned sat
[2022-06-08 09:28:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:28:28] [INFO ] [Nat]Absence check using 40 positive place invariants in 46 ms returned sat
[2022-06-08 09:28:28] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:28:30] [INFO ] [Nat]Absence check using state equation in 2062 ms returned sat
[2022-06-08 09:28:32] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1686 ms returned sat
[2022-06-08 09:28:32] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 467 ms.
[2022-06-08 09:28:34] [INFO ] Added : 7 causal constraints over 2 iterations in 1950 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40] Max seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 14 out of 1850 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1850/1850 places, 6533/6533 transitions.
Applied a total of 0 rules in 297 ms. Remains 1850 /1850 variables (removed 0) and now considering 6533/6533 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1850/1850 places, 6533/6533 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1850/1850 places, 6533/6533 transitions.
Applied a total of 0 rules in 287 ms. Remains 1850 /1850 variables (removed 0) and now considering 6533/6533 (removed 0) transitions.
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:28:36] [INFO ] Computed 42 place invariants in 179 ms
[2022-06-08 09:28:39] [INFO ] Implicit Places using invariants in 3586 ms returned []
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:28:39] [INFO ] Computed 42 place invariants in 194 ms
[2022-06-08 09:28:44] [INFO ] Implicit Places using invariants and state equation in 5297 ms returned []
Implicit Place search using SMT with State Equation took 8888 ms to find 0 implicit places.
[2022-06-08 09:28:45] [INFO ] Redundant transitions in 924 ms returned []
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:28:45] [INFO ] Computed 42 place invariants in 184 ms
[2022-06-08 09:28:52] [INFO ] Dead Transitions using invariants and state equation in 6453 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1850/1850 places, 6533/6533 transitions.
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:28:52] [INFO ] Computed 42 place invariants in 180 ms
Incomplete random walk after 1000000 steps, including 5393 resets, run finished after 14758 ms. (steps per millisecond=67 ) properties (out of 14) seen :14
Incomplete Best-First random walk after 1000001 steps, including 113 resets, run finished after 1657 ms. (steps per millisecond=603 ) properties (out of 14) seen :14
Incomplete Best-First random walk after 1000001 steps, including 113 resets, run finished after 1808 ms. (steps per millisecond=553 ) properties (out of 14) seen :14
Incomplete Best-First random walk after 1000001 steps, including 111 resets, run finished after 1945 ms. (steps per millisecond=514 ) properties (out of 14) seen :14
Incomplete Best-First random walk after 1000001 steps, including 112 resets, run finished after 1655 ms. (steps per millisecond=604 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 1000001 steps, including 112 resets, run finished after 1914 ms. (steps per millisecond=522 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 1000001 steps, including 113 resets, run finished after 1670 ms. (steps per millisecond=598 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 1000001 steps, including 113 resets, run finished after 1567 ms. (steps per millisecond=638 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 1000001 steps, including 111 resets, run finished after 1764 ms. (steps per millisecond=566 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 1000001 steps, including 110 resets, run finished after 1542 ms. (steps per millisecond=648 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 1000001 steps, including 113 resets, run finished after 1977 ms. (steps per millisecond=505 ) properties (out of 14) seen :14
Incomplete Best-First random walk after 1000001 steps, including 111 resets, run finished after 1761 ms. (steps per millisecond=567 ) properties (out of 14) seen :14
Incomplete Best-First random walk after 1000001 steps, including 108 resets, run finished after 1605 ms. (steps per millisecond=623 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 1000001 steps, including 111 resets, run finished after 1580 ms. (steps per millisecond=632 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 1000001 steps, including 111 resets, run finished after 1554 ms. (steps per millisecond=643 ) properties (out of 14) seen :13
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:29:31] [INFO ] Computed 42 place invariants in 204 ms
[2022-06-08 09:29:31] [INFO ] [Real]Absence check using 40 positive place invariants in 68 ms returned sat
[2022-06-08 09:29:31] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 36 ms returned sat
[2022-06-08 09:29:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:29:34] [INFO ] [Real]Absence check using state equation in 2517 ms returned sat
[2022-06-08 09:29:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:29:35] [INFO ] [Nat]Absence check using 40 positive place invariants in 44 ms returned sat
[2022-06-08 09:29:35] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:29:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:29:37] [INFO ] [Nat]Absence check using state equation in 2371 ms returned sat
[2022-06-08 09:29:37] [INFO ] State equation strengthened by 6384 read => feed constraints.
[2022-06-08 09:29:38] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1298 ms returned sat
[2022-06-08 09:29:39] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 522 ms.
[2022-06-08 09:29:41] [INFO ] Added : 6 causal constraints over 2 iterations in 2582 ms. Result :sat
[2022-06-08 09:29:42] [INFO ] [Real]Absence check using 40 positive place invariants in 37 ms returned sat
[2022-06-08 09:29:42] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:29:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:29:44] [INFO ] [Real]Absence check using state equation in 1999 ms returned sat
[2022-06-08 09:29:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:29:44] [INFO ] [Nat]Absence check using 40 positive place invariants in 65 ms returned sat
[2022-06-08 09:29:44] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 33 ms returned sat
[2022-06-08 09:29:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:29:47] [INFO ] [Nat]Absence check using state equation in 2333 ms returned sat
[2022-06-08 09:29:48] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1440 ms returned sat
[2022-06-08 09:29:49] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 463 ms.
[2022-06-08 09:29:51] [INFO ] Added : 8 causal constraints over 2 iterations in 2683 ms. Result :sat
[2022-06-08 09:29:52] [INFO ] [Real]Absence check using 40 positive place invariants in 64 ms returned sat
[2022-06-08 09:29:52] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 35 ms returned sat
[2022-06-08 09:29:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:29:54] [INFO ] [Real]Absence check using state equation in 2344 ms returned sat
[2022-06-08 09:29:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:29:55] [INFO ] [Nat]Absence check using 40 positive place invariants in 60 ms returned sat
[2022-06-08 09:29:55] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 33 ms returned sat
[2022-06-08 09:29:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:29:57] [INFO ] [Nat]Absence check using state equation in 2184 ms returned sat
[2022-06-08 09:29:59] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1602 ms returned sat
[2022-06-08 09:29:59] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 451 ms.
[2022-06-08 09:30:02] [INFO ] Added : 13 causal constraints over 3 iterations in 2542 ms. Result :sat
[2022-06-08 09:30:02] [INFO ] [Real]Absence check using 40 positive place invariants in 40 ms returned sat
[2022-06-08 09:30:02] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:30:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:30:04] [INFO ] [Real]Absence check using state equation in 2031 ms returned sat
[2022-06-08 09:30:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:30:05] [INFO ] [Nat]Absence check using 40 positive place invariants in 38 ms returned sat
[2022-06-08 09:30:05] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2022-06-08 09:30:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:30:07] [INFO ] [Nat]Absence check using state equation in 2099 ms returned sat
[2022-06-08 09:30:08] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1511 ms returned sat
[2022-06-08 09:30:09] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 423 ms.
[2022-06-08 09:30:10] [INFO ] Added : 6 causal constraints over 2 iterations in 1911 ms. Result :sat
[2022-06-08 09:30:11] [INFO ] [Real]Absence check using 40 positive place invariants in 36 ms returned sat
[2022-06-08 09:30:11] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:30:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:30:13] [INFO ] [Real]Absence check using state equation in 2366 ms returned sat
[2022-06-08 09:30:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:30:14] [INFO ] [Nat]Absence check using 40 positive place invariants in 38 ms returned sat
[2022-06-08 09:30:14] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2022-06-08 09:30:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:30:16] [INFO ] [Nat]Absence check using state equation in 1978 ms returned sat
[2022-06-08 09:30:17] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1103 ms returned sat
[2022-06-08 09:30:18] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 431 ms.
[2022-06-08 09:30:19] [INFO ] Added : 6 causal constraints over 2 iterations in 1915 ms. Result :sat
[2022-06-08 09:30:20] [INFO ] [Real]Absence check using 40 positive place invariants in 38 ms returned sat
[2022-06-08 09:30:20] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:30:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:30:22] [INFO ] [Real]Absence check using state equation in 2148 ms returned sat
[2022-06-08 09:30:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:30:22] [INFO ] [Nat]Absence check using 40 positive place invariants in 39 ms returned sat
[2022-06-08 09:30:22] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:30:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:30:24] [INFO ] [Nat]Absence check using state equation in 2182 ms returned sat
[2022-06-08 09:30:26] [INFO ] [Nat]Added 6384 Read/Feed constraints in 2011 ms returned sat
[2022-06-08 09:30:27] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 430 ms.
[2022-06-08 09:30:29] [INFO ] Added : 8 causal constraints over 2 iterations in 2061 ms. Result :sat
[2022-06-08 09:30:29] [INFO ] [Real]Absence check using 40 positive place invariants in 39 ms returned sat
[2022-06-08 09:30:29] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:30:31] [INFO ] [Real]Absence check using state equation in 1998 ms returned sat
[2022-06-08 09:30:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:30:32] [INFO ] [Nat]Absence check using 40 positive place invariants in 42 ms returned sat
[2022-06-08 09:30:32] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:30:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:30:34] [INFO ] [Nat]Absence check using state equation in 2043 ms returned sat
[2022-06-08 09:30:35] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1350 ms returned sat
[2022-06-08 09:30:36] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 424 ms.
[2022-06-08 09:30:37] [INFO ] Added : 10 causal constraints over 2 iterations in 1901 ms. Result :sat
[2022-06-08 09:30:38] [INFO ] [Real]Absence check using 40 positive place invariants in 40 ms returned sat
[2022-06-08 09:30:38] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:30:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:30:40] [INFO ] [Real]Absence check using state equation in 2172 ms returned sat
[2022-06-08 09:30:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:30:41] [INFO ] [Nat]Absence check using 40 positive place invariants in 63 ms returned sat
[2022-06-08 09:30:41] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 31 ms returned sat
[2022-06-08 09:30:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:30:43] [INFO ] [Nat]Absence check using state equation in 2341 ms returned sat
[2022-06-08 09:30:44] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1059 ms returned sat
[2022-06-08 09:30:45] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 559 ms.
[2022-06-08 09:30:46] [INFO ] Added : 9 causal constraints over 2 iterations in 2036 ms. Result :sat
[2022-06-08 09:30:47] [INFO ] [Real]Absence check using 40 positive place invariants in 39 ms returned sat
[2022-06-08 09:30:47] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:30:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:30:49] [INFO ] [Real]Absence check using state equation in 2024 ms returned sat
[2022-06-08 09:30:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:30:49] [INFO ] [Nat]Absence check using 40 positive place invariants in 40 ms returned sat
[2022-06-08 09:30:49] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:30:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:30:52] [INFO ] [Nat]Absence check using state equation in 2183 ms returned sat
[2022-06-08 09:30:53] [INFO ] [Nat]Added 6384 Read/Feed constraints in 934 ms returned sat
[2022-06-08 09:30:53] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 439 ms.
[2022-06-08 09:30:55] [INFO ] Added : 9 causal constraints over 2 iterations in 1850 ms. Result :sat
[2022-06-08 09:30:55] [INFO ] [Real]Absence check using 40 positive place invariants in 40 ms returned sat
[2022-06-08 09:30:55] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:30:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:30:57] [INFO ] [Real]Absence check using state equation in 2254 ms returned sat
[2022-06-08 09:30:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:30:58] [INFO ] [Nat]Absence check using 40 positive place invariants in 39 ms returned sat
[2022-06-08 09:30:58] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2022-06-08 09:30:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:31:00] [INFO ] [Nat]Absence check using state equation in 2072 ms returned sat
[2022-06-08 09:31:02] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1610 ms returned sat
[2022-06-08 09:31:02] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 442 ms.
[2022-06-08 09:31:04] [INFO ] Added : 7 causal constraints over 2 iterations in 1872 ms. Result :sat
[2022-06-08 09:31:04] [INFO ] [Real]Absence check using 40 positive place invariants in 60 ms returned sat
[2022-06-08 09:31:04] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 32 ms returned sat
[2022-06-08 09:31:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:31:06] [INFO ] [Real]Absence check using state equation in 2025 ms returned sat
[2022-06-08 09:31:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:31:07] [INFO ] [Nat]Absence check using 40 positive place invariants in 37 ms returned sat
[2022-06-08 09:31:07] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2022-06-08 09:31:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:31:09] [INFO ] [Nat]Absence check using state equation in 1956 ms returned sat
[2022-06-08 09:31:11] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1753 ms returned sat
[2022-06-08 09:31:11] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 431 ms.
[2022-06-08 09:31:13] [INFO ] Added : 14 causal constraints over 4 iterations in 2437 ms. Result :sat
[2022-06-08 09:31:14] [INFO ] [Real]Absence check using 40 positive place invariants in 43 ms returned sat
[2022-06-08 09:31:14] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:31:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:31:16] [INFO ] [Real]Absence check using state equation in 2089 ms returned sat
[2022-06-08 09:31:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:31:16] [INFO ] [Nat]Absence check using 40 positive place invariants in 65 ms returned sat
[2022-06-08 09:31:16] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 33 ms returned sat
[2022-06-08 09:31:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:31:19] [INFO ] [Nat]Absence check using state equation in 2085 ms returned sat
[2022-06-08 09:31:20] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1258 ms returned sat
[2022-06-08 09:31:21] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 628 ms.
[2022-06-08 09:31:22] [INFO ] Added : 11 causal constraints over 3 iterations in 2308 ms. Result :sat
[2022-06-08 09:31:23] [INFO ] [Real]Absence check using 40 positive place invariants in 64 ms returned sat
[2022-06-08 09:31:23] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:31:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:31:25] [INFO ] [Real]Absence check using state equation in 1971 ms returned sat
[2022-06-08 09:31:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:31:25] [INFO ] [Nat]Absence check using 40 positive place invariants in 42 ms returned sat
[2022-06-08 09:31:25] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:31:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:31:28] [INFO ] [Nat]Absence check using state equation in 2259 ms returned sat
[2022-06-08 09:31:29] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1253 ms returned sat
[2022-06-08 09:31:30] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 476 ms.
[2022-06-08 09:31:33] [INFO ] Added : 12 causal constraints over 3 iterations in 3777 ms. Result :sat
[2022-06-08 09:31:34] [INFO ] [Real]Absence check using 40 positive place invariants in 62 ms returned sat
[2022-06-08 09:31:34] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 33 ms returned sat
[2022-06-08 09:31:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:31:36] [INFO ] [Real]Absence check using state equation in 2339 ms returned sat
[2022-06-08 09:31:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:31:37] [INFO ] [Nat]Absence check using 40 positive place invariants in 65 ms returned sat
[2022-06-08 09:31:37] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 33 ms returned sat
[2022-06-08 09:31:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:31:39] [INFO ] [Nat]Absence check using state equation in 2262 ms returned sat
[2022-06-08 09:31:41] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1822 ms returned sat
[2022-06-08 09:31:42] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 421 ms.
[2022-06-08 09:31:43] [INFO ] Added : 7 causal constraints over 2 iterations in 1852 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40] Max seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 14 out of 1850 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1850/1850 places, 6533/6533 transitions.
Applied a total of 0 rules in 278 ms. Remains 1850 /1850 variables (removed 0) and now considering 6533/6533 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1850/1850 places, 6533/6533 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1850/1850 places, 6533/6533 transitions.
Applied a total of 0 rules in 291 ms. Remains 1850 /1850 variables (removed 0) and now considering 6533/6533 (removed 0) transitions.
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:31:45] [INFO ] Computed 42 place invariants in 171 ms
[2022-06-08 09:31:48] [INFO ] Implicit Places using invariants in 3627 ms returned []
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:31:48] [INFO ] Computed 42 place invariants in 169 ms
[2022-06-08 09:31:55] [INFO ] Implicit Places using invariants and state equation in 7143 ms returned []
Implicit Place search using SMT with State Equation took 10771 ms to find 0 implicit places.
[2022-06-08 09:31:57] [INFO ] Redundant transitions in 1249 ms returned []
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:31:57] [INFO ] Computed 42 place invariants in 171 ms
[2022-06-08 09:32:01] [INFO ] Dead Transitions using invariants and state equation in 4481 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1850/1850 places, 6533/6533 transitions.
Starting property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-01
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:32:01] [INFO ] Computed 42 place invariants in 176 ms
Incomplete random walk after 10000 steps, including 53 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :1
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:32:02] [INFO ] Computed 42 place invariants in 300 ms
[2022-06-08 09:32:02] [INFO ] [Real]Absence check using 40 positive place invariants in 60 ms returned sat
[2022-06-08 09:32:02] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 34 ms returned sat
[2022-06-08 09:32:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:32:05] [INFO ] [Real]Absence check using state equation in 2257 ms returned sat
[2022-06-08 09:32:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:32:05] [INFO ] [Nat]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-08 09:32:05] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:32:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:32:07] [INFO ] [Nat]Absence check using state equation in 2016 ms returned sat
[2022-06-08 09:32:07] [INFO ] State equation strengthened by 6384 read => feed constraints.
[2022-06-08 09:32:08] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1126 ms returned sat
[2022-06-08 09:32:09] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 640 ms.
[2022-06-08 09:32:13] [INFO ] Deduced a trap composed of 3 places in 3390 ms of which 7 ms to minimize.
[2022-06-08 09:32:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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) : [40] Max seen :[1]
Support contains 1 out of 1850 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1850/1850 places, 6533/6533 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1843 transition count 6526
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 1843 transition count 6526
Applied a total of 20 rules in 947 ms. Remains 1843 /1850 variables (removed 7) and now considering 6526/6533 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1850 places, 6526/6533 transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:32:14] [INFO ] Computed 42 place invariants in 193 ms
Incomplete random walk after 1000000 steps, including 5396 resets, run finished after 14426 ms. (steps per millisecond=69 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 111 resets, run finished after 1945 ms. (steps per millisecond=514 ) properties (out of 1) seen :1
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:32:31] [INFO ] Computed 42 place invariants in 208 ms
[2022-06-08 09:32:32] [INFO ] [Real]Absence check using 40 positive place invariants in 59 ms returned sat
[2022-06-08 09:32:32] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 35 ms returned sat
[2022-06-08 09:32:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:32:34] [INFO ] [Real]Absence check using state equation in 2327 ms returned sat
[2022-06-08 09:32:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:32:35] [INFO ] [Nat]Absence check using 40 positive place invariants in 70 ms returned sat
[2022-06-08 09:32:35] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 34 ms returned sat
[2022-06-08 09:32:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:32:37] [INFO ] [Nat]Absence check using state equation in 2264 ms returned sat
[2022-06-08 09:32:37] [INFO ] State equation strengthened by 6404 read => feed constraints.
[2022-06-08 09:32:38] [INFO ] [Nat]Added 6404 Read/Feed constraints in 927 ms returned sat
[2022-06-08 09:32:39] [INFO ] Computed and/alt/rep : 4692/12467/4692 causal constraints (skipped 1794 transitions) in 585 ms.
[2022-06-08 09:32:41] [INFO ] Added : 6 causal constraints over 2 iterations in 2832 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40] Max seen :[1]
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 454 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 341 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:32:42] [INFO ] Computed 42 place invariants in 177 ms
[2022-06-08 09:32:46] [INFO ] Implicit Places using invariants in 4127 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:32:47] [INFO ] Computed 42 place invariants in 188 ms
[2022-06-08 09:32:51] [INFO ] Implicit Places using invariants and state equation in 4436 ms returned []
Implicit Place search using SMT with State Equation took 8565 ms to find 0 implicit places.
[2022-06-08 09:32:52] [INFO ] Redundant transitions in 1059 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:32:52] [INFO ] Computed 42 place invariants in 176 ms
[2022-06-08 09:32:58] [INFO ] Dead Transitions using invariants and state equation in 6201 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-01 in 56863 ms.
Starting property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-02
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:32:58] [INFO ] Computed 42 place invariants in 173 ms
Incomplete random walk after 10000 steps, including 53 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:32:59] [INFO ] Computed 42 place invariants in 176 ms
[2022-06-08 09:32:59] [INFO ] [Real]Absence check using 40 positive place invariants in 38 ms returned sat
[2022-06-08 09:32:59] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:32:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:33:01] [INFO ] [Real]Absence check using state equation in 2280 ms returned sat
[2022-06-08 09:33:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:33:02] [INFO ] [Nat]Absence check using 40 positive place invariants in 64 ms returned sat
[2022-06-08 09:33:02] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 33 ms returned sat
[2022-06-08 09:33:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:33:04] [INFO ] [Nat]Absence check using state equation in 2592 ms returned sat
[2022-06-08 09:33:04] [INFO ] State equation strengthened by 6384 read => feed constraints.
[2022-06-08 09:33:06] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1398 ms returned sat
[2022-06-08 09:33:06] [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.refineWithCausalOrder(DeadlockTester.java:1001)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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) : [40] Max seen :[1]
Support contains 1 out of 1850 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1850/1850 places, 6533/6533 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1843 transition count 6526
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 1843 transition count 6526
Applied a total of 20 rules in 765 ms. Remains 1843 /1850 variables (removed 7) and now considering 6526/6533 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1850 places, 6526/6533 transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:33:07] [INFO ] Computed 42 place invariants in 178 ms
Incomplete random walk after 1000000 steps, including 5402 resets, run finished after 15347 ms. (steps per millisecond=65 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 112 resets, run finished after 1890 ms. (steps per millisecond=529 ) properties (out of 1) seen :1
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:33:25] [INFO ] Computed 42 place invariants in 178 ms
[2022-06-08 09:33:25] [INFO ] [Real]Absence check using 40 positive place invariants in 55 ms returned sat
[2022-06-08 09:33:25] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 34 ms returned sat
[2022-06-08 09:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:33:27] [INFO ] [Real]Absence check using state equation in 2361 ms returned sat
[2022-06-08 09:33:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:33:28] [INFO ] [Nat]Absence check using 40 positive place invariants in 36 ms returned sat
[2022-06-08 09:33:28] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:33:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:33:30] [INFO ] [Nat]Absence check using state equation in 2301 ms returned sat
[2022-06-08 09:33:30] [INFO ] State equation strengthened by 6404 read => feed constraints.
[2022-06-08 09:33:32] [INFO ] [Nat]Added 6404 Read/Feed constraints in 1494 ms returned sat
[2022-06-08 09:33:33] [INFO ] Computed and/alt/rep : 4692/12467/4692 causal constraints (skipped 1794 transitions) in 616 ms.
[2022-06-08 09:33:35] [INFO ] Added : 9 causal constraints over 2 iterations in 2782 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40] Max seen :[1]
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 438 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 420 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:33:36] [INFO ] Computed 42 place invariants in 292 ms
[2022-06-08 09:33:41] [INFO ] Implicit Places using invariants in 4526 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:33:41] [INFO ] Computed 42 place invariants in 248 ms
[2022-06-08 09:33:45] [INFO ] Implicit Places using invariants and state equation in 4192 ms returned []
Implicit Place search using SMT with State Equation took 8721 ms to find 0 implicit places.
[2022-06-08 09:33:46] [INFO ] Redundant transitions in 969 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:33:46] [INFO ] Computed 42 place invariants in 176 ms
[2022-06-08 09:33:53] [INFO ] Dead Transitions using invariants and state equation in 7460 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-02 in 55286 ms.
Starting property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-03
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:33:54] [INFO ] Computed 42 place invariants in 179 ms
Incomplete random walk after 10000 steps, including 52 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:33:54] [INFO ] Computed 42 place invariants in 289 ms
[2022-06-08 09:33:55] [INFO ] [Real]Absence check using 40 positive place invariants in 64 ms returned sat
[2022-06-08 09:33:55] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 35 ms returned sat
[2022-06-08 09:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:33:57] [INFO ] [Real]Absence check using state equation in 2578 ms returned sat
[2022-06-08 09:33:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:33:58] [INFO ] [Nat]Absence check using 40 positive place invariants in 65 ms returned sat
[2022-06-08 09:33:58] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 33 ms returned sat
[2022-06-08 09:33:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:34:00] [INFO ] [Nat]Absence check using state equation in 2277 ms returned sat
[2022-06-08 09:34:00] [INFO ] State equation strengthened by 6384 read => feed constraints.
[2022-06-08 09:34:01] [INFO ] [Nat]Added 6384 Read/Feed constraints in 907 ms returned sat
[2022-06-08 09:34:02] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 730 ms.
[2022-06-08 09:34:06] [INFO ] Deduced a trap composed of 3 places in 3290 ms of which 4 ms to minimize.
[2022-06-08 09:34:06] [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.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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) : [40] Max seen :[0]
Support contains 1 out of 1850 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1850/1850 places, 6533/6533 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1842 transition count 6525
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 1842 transition count 6525
Applied a total of 21 rules in 926 ms. Remains 1842 /1850 variables (removed 8) and now considering 6525/6533 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 1842/1850 places, 6525/6533 transitions.
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:34:07] [INFO ] Computed 42 place invariants in 185 ms
Incomplete random walk after 1000000 steps, including 5411 resets, run finished after 13145 ms. (steps per millisecond=76 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 114 resets, run finished after 1524 ms. (steps per millisecond=656 ) properties (out of 1) seen :1
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:34:22] [INFO ] Computed 42 place invariants in 184 ms
[2022-06-08 09:34:22] [INFO ] [Real]Absence check using 40 positive place invariants in 38 ms returned sat
[2022-06-08 09:34:22] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:34:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:34:24] [INFO ] [Real]Absence check using state equation in 2222 ms returned sat
[2022-06-08 09:34:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:34:25] [INFO ] [Nat]Absence check using 40 positive place invariants in 38 ms returned sat
[2022-06-08 09:34:25] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:34:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:34:27] [INFO ] [Nat]Absence check using state equation in 2222 ms returned sat
[2022-06-08 09:34:27] [INFO ] State equation strengthened by 6405 read => feed constraints.
[2022-06-08 09:34:29] [INFO ] [Nat]Added 6405 Read/Feed constraints in 1790 ms returned sat
[2022-06-08 09:34:29] [INFO ] Computed and/alt/rep : 4691/12469/4691 causal constraints (skipped 1794 transitions) in 477 ms.
[2022-06-08 09:34:32] [INFO ] Added : 10 causal constraints over 2 iterations in 2550 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40] Max seen :[1]
Support contains 1 out of 1842 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1842/1842 places, 6525/6525 transitions.
Applied a total of 0 rules in 324 ms. Remains 1842 /1842 variables (removed 0) and now considering 6525/6525 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1842/1842 places, 6525/6525 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1842/1842 places, 6525/6525 transitions.
Applied a total of 0 rules in 403 ms. Remains 1842 /1842 variables (removed 0) and now considering 6525/6525 (removed 0) transitions.
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:34:33] [INFO ] Computed 42 place invariants in 195 ms
[2022-06-08 09:34:37] [INFO ] Implicit Places using invariants in 4469 ms returned []
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:34:37] [INFO ] Computed 42 place invariants in 180 ms
[2022-06-08 09:34:43] [INFO ] Implicit Places using invariants and state equation in 5584 ms returned []
Implicit Place search using SMT with State Equation took 10055 ms to find 0 implicit places.
[2022-06-08 09:34:43] [INFO ] Redundant transitions in 767 ms returned []
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:34:44] [INFO ] Computed 42 place invariants in 185 ms
[2022-06-08 09:34:49] [INFO ] Dead Transitions using invariants and state equation in 5871 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1842/1842 places, 6525/6525 transitions.
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:34:49] [INFO ] Computed 42 place invariants in 182 ms
Incomplete random walk after 1000000 steps, including 5405 resets, run finished after 12970 ms. (steps per millisecond=77 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 111 resets, run finished after 1700 ms. (steps per millisecond=588 ) properties (out of 1) seen :1
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:35:04] [INFO ] Computed 42 place invariants in 180 ms
[2022-06-08 09:35:05] [INFO ] [Real]Absence check using 40 positive place invariants in 62 ms returned sat
[2022-06-08 09:35:05] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 34 ms returned sat
[2022-06-08 09:35:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:35:07] [INFO ] [Real]Absence check using state equation in 2742 ms returned sat
[2022-06-08 09:35:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:35:08] [INFO ] [Nat]Absence check using 40 positive place invariants in 38 ms returned sat
[2022-06-08 09:35:08] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:35:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:35:10] [INFO ] [Nat]Absence check using state equation in 2191 ms returned sat
[2022-06-08 09:35:10] [INFO ] State equation strengthened by 6405 read => feed constraints.
[2022-06-08 09:35:12] [INFO ] [Nat]Added 6405 Read/Feed constraints in 1888 ms returned sat
[2022-06-08 09:35:13] [INFO ] Computed and/alt/rep : 4691/12469/4691 causal constraints (skipped 1794 transitions) in 436 ms.
[2022-06-08 09:35:14] [INFO ] Added : 10 causal constraints over 2 iterations in 2044 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40] Max seen :[1]
Support contains 1 out of 1842 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1842/1842 places, 6525/6525 transitions.
Applied a total of 0 rules in 276 ms. Remains 1842 /1842 variables (removed 0) and now considering 6525/6525 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1842/1842 places, 6525/6525 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1842/1842 places, 6525/6525 transitions.
Applied a total of 0 rules in 269 ms. Remains 1842 /1842 variables (removed 0) and now considering 6525/6525 (removed 0) transitions.
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:35:15] [INFO ] Computed 42 place invariants in 195 ms
[2022-06-08 09:35:19] [INFO ] Implicit Places using invariants in 3529 ms returned []
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:35:19] [INFO ] Computed 42 place invariants in 190 ms
[2022-06-08 09:35:26] [INFO ] Implicit Places using invariants and state equation in 7118 ms returned []
Implicit Place search using SMT with State Equation took 10654 ms to find 0 implicit places.
[2022-06-08 09:35:27] [INFO ] Redundant transitions in 1000 ms returned []
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:35:27] [INFO ] Computed 42 place invariants in 207 ms
[2022-06-08 09:35:32] [INFO ] Dead Transitions using invariants and state equation in 4820 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1842/1842 places, 6525/6525 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-03 in 98356 ms.
Starting property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-04
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:35:32] [INFO ] Computed 42 place invariants in 289 ms
Incomplete random walk after 10000 steps, including 53 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:35:32] [INFO ] Computed 42 place invariants in 284 ms
[2022-06-08 09:35:33] [INFO ] [Real]Absence check using 40 positive place invariants in 60 ms returned sat
[2022-06-08 09:35:33] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 32 ms returned sat
[2022-06-08 09:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:35:35] [INFO ] [Real]Absence check using state equation in 2483 ms returned sat
[2022-06-08 09:35:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:35:36] [INFO ] [Nat]Absence check using 40 positive place invariants in 67 ms returned sat
[2022-06-08 09:35:36] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 34 ms returned sat
[2022-06-08 09:35:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:35:38] [INFO ] [Nat]Absence check using state equation in 2279 ms returned sat
[2022-06-08 09:35:39] [INFO ] State equation strengthened by 6384 read => feed constraints.
[2022-06-08 09:35:40] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1713 ms returned sat
[2022-06-08 09:35:41] [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.refineWithCausalOrder(DeadlockTester.java:1001)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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) : [40] Max seen :[1]
Support contains 1 out of 1850 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1850/1850 places, 6533/6533 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1842 transition count 6525
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 1842 transition count 6525
Applied a total of 21 rules in 973 ms. Remains 1842 /1850 variables (removed 8) and now considering 6525/6533 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 1842/1850 places, 6525/6533 transitions.
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:35:42] [INFO ] Computed 42 place invariants in 191 ms
Incomplete random walk after 1000000 steps, including 5405 resets, run finished after 13118 ms. (steps per millisecond=76 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 111 resets, run finished after 1585 ms. (steps per millisecond=630 ) properties (out of 1) seen :1
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:35:57] [INFO ] Computed 42 place invariants in 189 ms
[2022-06-08 09:35:57] [INFO ] [Real]Absence check using 40 positive place invariants in 44 ms returned sat
[2022-06-08 09:35:57] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:35:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:35:59] [INFO ] [Real]Absence check using state equation in 2168 ms returned sat
[2022-06-08 09:35:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:36:00] [INFO ] [Nat]Absence check using 40 positive place invariants in 42 ms returned sat
[2022-06-08 09:36:00] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:36:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:36:02] [INFO ] [Nat]Absence check using state equation in 2147 ms returned sat
[2022-06-08 09:36:02] [INFO ] State equation strengthened by 6405 read => feed constraints.
[2022-06-08 09:36:03] [INFO ] [Nat]Added 6405 Read/Feed constraints in 1141 ms returned sat
[2022-06-08 09:36:04] [INFO ] Computed and/alt/rep : 4691/12469/4691 causal constraints (skipped 1794 transitions) in 443 ms.
[2022-06-08 09:36:05] [INFO ] Added : 9 causal constraints over 2 iterations in 1947 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40] Max seen :[1]
Support contains 1 out of 1842 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1842/1842 places, 6525/6525 transitions.
Applied a total of 0 rules in 284 ms. Remains 1842 /1842 variables (removed 0) and now considering 6525/6525 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1842/1842 places, 6525/6525 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1842/1842 places, 6525/6525 transitions.
Applied a total of 0 rules in 327 ms. Remains 1842 /1842 variables (removed 0) and now considering 6525/6525 (removed 0) transitions.
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:36:06] [INFO ] Computed 42 place invariants in 305 ms
[2022-06-08 09:36:10] [INFO ] Implicit Places using invariants in 4073 ms returned []
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:36:11] [INFO ] Computed 42 place invariants in 319 ms
[2022-06-08 09:36:17] [INFO ] Implicit Places using invariants and state equation in 6401 ms returned []
Implicit Place search using SMT with State Equation took 10475 ms to find 0 implicit places.
[2022-06-08 09:36:17] [INFO ] Redundant transitions in 784 ms returned []
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:36:18] [INFO ] Computed 42 place invariants in 189 ms
[2022-06-08 09:36:25] [INFO ] Dead Transitions using invariants and state equation in 7456 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1842/1842 places, 6525/6525 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-04 in 53217 ms.
Starting property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-05
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:36:25] [INFO ] Computed 42 place invariants in 179 ms
Incomplete random walk after 10000 steps, including 53 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:36:25] [INFO ] Computed 42 place invariants in 179 ms
[2022-06-08 09:36:26] [INFO ] [Real]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-08 09:36:26] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 26 ms returned sat
[2022-06-08 09:36:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:36:28] [INFO ] [Real]Absence check using state equation in 2392 ms returned sat
[2022-06-08 09:36:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:36:29] [INFO ] [Nat]Absence check using 40 positive place invariants in 42 ms returned sat
[2022-06-08 09:36:29] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:36:31] [INFO ] [Nat]Absence check using state equation in 2092 ms returned sat
[2022-06-08 09:36:31] [INFO ] State equation strengthened by 6384 read => feed constraints.
[2022-06-08 09:36:32] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1064 ms returned sat
[2022-06-08 09:36:33] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 482 ms.
[2022-06-08 09:36:36] [INFO ] Deduced a trap composed of 3 places in 2845 ms of which 5 ms to minimize.
[2022-06-08 09:36:36] [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.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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) : [40] Max seen :[1]
Support contains 1 out of 1850 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1850/1850 places, 6533/6533 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1842 transition count 6525
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 1842 transition count 6525
Applied a total of 21 rules in 815 ms. Remains 1842 /1850 variables (removed 8) and now considering 6525/6533 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 1842/1850 places, 6525/6533 transitions.
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:36:37] [INFO ] Computed 42 place invariants in 180 ms
Incomplete random walk after 1000000 steps, including 5407 resets, run finished after 14149 ms. (steps per millisecond=70 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 111 resets, run finished after 1706 ms. (steps per millisecond=586 ) properties (out of 1) seen :1
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:36:53] [INFO ] Computed 42 place invariants in 188 ms
[2022-06-08 09:36:54] [INFO ] [Real]Absence check using 40 positive place invariants in 51 ms returned sat
[2022-06-08 09:36:54] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 34 ms returned sat
[2022-06-08 09:36:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:36:56] [INFO ] [Real]Absence check using state equation in 2700 ms returned sat
[2022-06-08 09:36:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:36:57] [INFO ] [Nat]Absence check using 40 positive place invariants in 40 ms returned sat
[2022-06-08 09:36:57] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2022-06-08 09:36:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:36:59] [INFO ] [Nat]Absence check using state equation in 2169 ms returned sat
[2022-06-08 09:36:59] [INFO ] State equation strengthened by 6405 read => feed constraints.
[2022-06-08 09:37:01] [INFO ] [Nat]Added 6405 Read/Feed constraints in 2449 ms returned sat
[2022-06-08 09:37:02] [INFO ] Computed and/alt/rep : 4691/12469/4691 causal constraints (skipped 1794 transitions) in 708 ms.
[2022-06-08 09:37:05] [INFO ] Added : 8 causal constraints over 2 iterations in 2971 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40] Max seen :[1]
Support contains 1 out of 1842 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1842/1842 places, 6525/6525 transitions.
Applied a total of 0 rules in 434 ms. Remains 1842 /1842 variables (removed 0) and now considering 6525/6525 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1842/1842 places, 6525/6525 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1842/1842 places, 6525/6525 transitions.
Applied a total of 0 rules in 279 ms. Remains 1842 /1842 variables (removed 0) and now considering 6525/6525 (removed 0) transitions.
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:37:06] [INFO ] Computed 42 place invariants in 189 ms
[2022-06-08 09:37:09] [INFO ] Implicit Places using invariants in 3366 ms returned []
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:37:09] [INFO ] Computed 42 place invariants in 281 ms
[2022-06-08 09:37:15] [INFO ] Implicit Places using invariants and state equation in 5854 ms returned []
Implicit Place search using SMT with State Equation took 9236 ms to find 0 implicit places.
[2022-06-08 09:37:16] [INFO ] Redundant transitions in 907 ms returned []
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:37:16] [INFO ] Computed 42 place invariants in 249 ms
[2022-06-08 09:37:23] [INFO ] Dead Transitions using invariants and state equation in 7155 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1842/1842 places, 6525/6525 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-05 in 58199 ms.
Starting property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-06
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:37:23] [INFO ] Computed 42 place invariants in 174 ms
Incomplete random walk after 10000 steps, including 53 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:37:24] [INFO ] Computed 42 place invariants in 221 ms
[2022-06-08 09:37:24] [INFO ] [Real]Absence check using 40 positive place invariants in 66 ms returned sat
[2022-06-08 09:37:24] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 34 ms returned sat
[2022-06-08 09:37:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:37:27] [INFO ] [Real]Absence check using state equation in 2638 ms returned sat
[2022-06-08 09:37:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:37:27] [INFO ] [Nat]Absence check using 40 positive place invariants in 67 ms returned sat
[2022-06-08 09:37:27] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 33 ms returned sat
[2022-06-08 09:37:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:37:30] [INFO ] [Nat]Absence check using state equation in 2216 ms returned sat
[2022-06-08 09:37:30] [INFO ] State equation strengthened by 6384 read => feed constraints.
[2022-06-08 09:37:32] [INFO ] [Nat]Added 6384 Read/Feed constraints in 2061 ms returned sat
[2022-06-08 09:37:32] [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.refineWithCausalOrder(DeadlockTester.java:1001)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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) : [40] Max seen :[1]
Support contains 1 out of 1850 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1850/1850 places, 6533/6533 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1842 transition count 6525
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 1842 transition count 6525
Applied a total of 21 rules in 914 ms. Remains 1842 /1850 variables (removed 8) and now considering 6525/6533 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 1842/1850 places, 6525/6533 transitions.
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:37:33] [INFO ] Computed 42 place invariants in 234 ms
Incomplete random walk after 1000000 steps, including 5414 resets, run finished after 14136 ms. (steps per millisecond=70 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 112 resets, run finished after 1510 ms. (steps per millisecond=662 ) properties (out of 1) seen :1
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:37:49] [INFO ] Computed 42 place invariants in 181 ms
[2022-06-08 09:37:49] [INFO ] [Real]Absence check using 40 positive place invariants in 64 ms returned sat
[2022-06-08 09:37:49] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 34 ms returned sat
[2022-06-08 09:37:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:37:52] [INFO ] [Real]Absence check using state equation in 2483 ms returned sat
[2022-06-08 09:37:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:37:53] [INFO ] [Nat]Absence check using 40 positive place invariants in 66 ms returned sat
[2022-06-08 09:37:53] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 33 ms returned sat
[2022-06-08 09:37:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:37:55] [INFO ] [Nat]Absence check using state equation in 2252 ms returned sat
[2022-06-08 09:37:55] [INFO ] State equation strengthened by 6405 read => feed constraints.
[2022-06-08 09:37:57] [INFO ] [Nat]Added 6405 Read/Feed constraints in 1836 ms returned sat
[2022-06-08 09:37:58] [INFO ] Computed and/alt/rep : 4691/12469/4691 causal constraints (skipped 1794 transitions) in 619 ms.
[2022-06-08 09:38:00] [INFO ] Added : 9 causal constraints over 2 iterations in 2714 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40] Max seen :[1]
Support contains 1 out of 1842 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1842/1842 places, 6525/6525 transitions.
Applied a total of 0 rules in 435 ms. Remains 1842 /1842 variables (removed 0) and now considering 6525/6525 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1842/1842 places, 6525/6525 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1842/1842 places, 6525/6525 transitions.
Applied a total of 0 rules in 435 ms. Remains 1842 /1842 variables (removed 0) and now considering 6525/6525 (removed 0) transitions.
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:38:01] [INFO ] Computed 42 place invariants in 320 ms
[2022-06-08 09:38:05] [INFO ] Implicit Places using invariants in 3959 ms returned []
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:38:05] [INFO ] Computed 42 place invariants in 263 ms
[2022-06-08 09:38:11] [INFO ] Implicit Places using invariants and state equation in 6119 ms returned []
Implicit Place search using SMT with State Equation took 10080 ms to find 0 implicit places.
[2022-06-08 09:38:12] [INFO ] Redundant transitions in 881 ms returned []
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:38:12] [INFO ] Computed 42 place invariants in 185 ms
[2022-06-08 09:38:20] [INFO ] Dead Transitions using invariants and state equation in 7609 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1842/1842 places, 6525/6525 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-06 in 56599 ms.
Starting property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-07
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:38:20] [INFO ] Computed 42 place invariants in 173 ms
Incomplete random walk after 10000 steps, including 54 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:38:20] [INFO ] Computed 42 place invariants in 286 ms
[2022-06-08 09:38:21] [INFO ] [Real]Absence check using 40 positive place invariants in 61 ms returned sat
[2022-06-08 09:38:21] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 33 ms returned sat
[2022-06-08 09:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:38:23] [INFO ] [Real]Absence check using state equation in 2194 ms returned sat
[2022-06-08 09:38:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:38:23] [INFO ] [Nat]Absence check using 40 positive place invariants in 39 ms returned sat
[2022-06-08 09:38:23] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:38:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:38:26] [INFO ] [Nat]Absence check using state equation in 2231 ms returned sat
[2022-06-08 09:38:26] [INFO ] State equation strengthened by 6384 read => feed constraints.
[2022-06-08 09:38:27] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1007 ms returned sat
[2022-06-08 09:38:28] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 620 ms.
[2022-06-08 09:38:32] [INFO ] Deduced a trap composed of 3 places in 4012 ms of which 4 ms to minimize.
[2022-06-08 09:38:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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) : [40] Max seen :[0]
Support contains 1 out of 1850 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1850/1850 places, 6533/6533 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1843 transition count 6526
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 1843 transition count 6526
Applied a total of 20 rules in 917 ms. Remains 1843 /1850 variables (removed 7) and now considering 6526/6533 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1850 places, 6526/6533 transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:38:33] [INFO ] Computed 42 place invariants in 183 ms
Incomplete random walk after 1000000 steps, including 5409 resets, run finished after 14381 ms. (steps per millisecond=69 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 112 resets, run finished after 1554 ms. (steps per millisecond=643 ) properties (out of 1) seen :1
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:38:50] [INFO ] Computed 42 place invariants in 217 ms
[2022-06-08 09:38:50] [INFO ] [Real]Absence check using 40 positive place invariants in 59 ms returned sat
[2022-06-08 09:38:50] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 36 ms returned sat
[2022-06-08 09:38:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:38:53] [INFO ] [Real]Absence check using state equation in 2356 ms returned sat
[2022-06-08 09:38:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:38:53] [INFO ] [Nat]Absence check using 40 positive place invariants in 52 ms returned sat
[2022-06-08 09:38:53] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 31 ms returned sat
[2022-06-08 09:38:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:38:55] [INFO ] [Nat]Absence check using state equation in 2343 ms returned sat
[2022-06-08 09:38:55] [INFO ] State equation strengthened by 6404 read => feed constraints.
[2022-06-08 09:38:57] [INFO ] [Nat]Added 6404 Read/Feed constraints in 1983 ms returned sat
[2022-06-08 09:38:58] [INFO ] Computed and/alt/rep : 4692/12467/4692 causal constraints (skipped 1794 transitions) in 518 ms.
[2022-06-08 09:39:01] [INFO ] Added : 8 causal constraints over 2 iterations in 2900 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40] Max seen :[1]
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 485 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 281 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:39:02] [INFO ] Computed 42 place invariants in 185 ms
[2022-06-08 09:39:06] [INFO ] Implicit Places using invariants in 3974 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:39:06] [INFO ] Computed 42 place invariants in 304 ms
[2022-06-08 09:39:10] [INFO ] Implicit Places using invariants and state equation in 4116 ms returned []
Implicit Place search using SMT with State Equation took 8092 ms to find 0 implicit places.
[2022-06-08 09:39:11] [INFO ] Redundant transitions in 988 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:39:11] [INFO ] Computed 42 place invariants in 196 ms
[2022-06-08 09:39:17] [INFO ] Dead Transitions using invariants and state equation in 6386 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:39:17] [INFO ] Computed 42 place invariants in 186 ms
Incomplete random walk after 1000000 steps, including 5414 resets, run finished after 13850 ms. (steps per millisecond=72 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 112 resets, run finished after 1573 ms. (steps per millisecond=635 ) properties (out of 1) seen :1
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:39:33] [INFO ] Computed 42 place invariants in 233 ms
[2022-06-08 09:39:34] [INFO ] [Real]Absence check using 40 positive place invariants in 58 ms returned sat
[2022-06-08 09:39:34] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 34 ms returned sat
[2022-06-08 09:39:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:39:36] [INFO ] [Real]Absence check using state equation in 2258 ms returned sat
[2022-06-08 09:39:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:39:37] [INFO ] [Nat]Absence check using 40 positive place invariants in 54 ms returned sat
[2022-06-08 09:39:37] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 09:39:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:39:39] [INFO ] [Nat]Absence check using state equation in 2249 ms returned sat
[2022-06-08 09:39:39] [INFO ] State equation strengthened by 6404 read => feed constraints.
[2022-06-08 09:39:40] [INFO ] [Nat]Added 6404 Read/Feed constraints in 1634 ms returned sat
[2022-06-08 09:39:41] [INFO ] Computed and/alt/rep : 4692/12467/4692 causal constraints (skipped 1794 transitions) in 438 ms.
[2022-06-08 09:39:43] [INFO ] Added : 8 causal constraints over 2 iterations in 2608 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40] Max seen :[1]
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 464 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 392 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:39:45] [INFO ] Computed 42 place invariants in 179 ms
[2022-06-08 09:39:49] [INFO ] Implicit Places using invariants in 4403 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:39:49] [INFO ] Computed 42 place invariants in 178 ms
[2022-06-08 09:39:55] [INFO ] Implicit Places using invariants and state equation in 5840 ms returned []
Implicit Place search using SMT with State Equation took 10251 ms to find 0 implicit places.
[2022-06-08 09:39:56] [INFO ] Redundant transitions in 964 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:39:56] [INFO ] Computed 42 place invariants in 188 ms
[2022-06-08 09:40:03] [INFO ] Dead Transitions using invariants and state equation in 6814 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-07 in 102974 ms.
Starting property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-08
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:40:03] [INFO ] Computed 42 place invariants in 183 ms
Incomplete random walk after 10000 steps, including 54 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:40:03] [INFO ] Computed 42 place invariants in 228 ms
[2022-06-08 09:40:04] [INFO ] [Real]Absence check using 40 positive place invariants in 45 ms returned sat
[2022-06-08 09:40:04] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 24 ms returned sat
[2022-06-08 09:40:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:40:06] [INFO ] [Real]Absence check using state equation in 2049 ms returned sat
[2022-06-08 09:40:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:40:06] [INFO ] [Nat]Absence check using 40 positive place invariants in 40 ms returned sat
[2022-06-08 09:40:06] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:40:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:40:08] [INFO ] [Nat]Absence check using state equation in 2063 ms returned sat
[2022-06-08 09:40:08] [INFO ] State equation strengthened by 6384 read => feed constraints.
[2022-06-08 09:40:09] [INFO ] [Nat]Added 6384 Read/Feed constraints in 777 ms returned sat
[2022-06-08 09:40:10] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 433 ms.
[2022-06-08 09:40:11] [INFO ] Added : 1 causal constraints over 1 iterations in 1534 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40] Max seen :[0]
Support contains 1 out of 1850 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1850/1850 places, 6533/6533 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1843 transition count 6526
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 1843 transition count 6526
Applied a total of 20 rules in 749 ms. Remains 1843 /1850 variables (removed 7) and now considering 6526/6533 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1850 places, 6526/6533 transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:40:12] [INFO ] Computed 42 place invariants in 185 ms
Incomplete random walk after 1000000 steps, including 5412 resets, run finished after 13661 ms. (steps per millisecond=73 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 111 resets, run finished after 1514 ms. (steps per millisecond=660 ) properties (out of 1) seen :1
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:40:27] [INFO ] Computed 42 place invariants in 180 ms
[2022-06-08 09:40:27] [INFO ] [Real]Absence check using 40 positive place invariants in 35 ms returned sat
[2022-06-08 09:40:28] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:40:29] [INFO ] [Real]Absence check using state equation in 1991 ms returned sat
[2022-06-08 09:40:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:40:30] [INFO ] [Nat]Absence check using 40 positive place invariants in 38 ms returned sat
[2022-06-08 09:40:30] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:40:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:40:32] [INFO ] [Nat]Absence check using state equation in 2163 ms returned sat
[2022-06-08 09:40:32] [INFO ] State equation strengthened by 6404 read => feed constraints.
[2022-06-08 09:40:33] [INFO ] [Nat]Added 6404 Read/Feed constraints in 894 ms returned sat
[2022-06-08 09:40:34] [INFO ] Computed and/alt/rep : 4692/12467/4692 causal constraints (skipped 1794 transitions) in 454 ms.
[2022-06-08 09:40:36] [INFO ] Added : 7 causal constraints over 2 iterations in 2384 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40] Max seen :[1]
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 412 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 265 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:40:37] [INFO ] Computed 42 place invariants in 178 ms
[2022-06-08 09:40:41] [INFO ] Implicit Places using invariants in 4500 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:40:42] [INFO ] Computed 42 place invariants in 311 ms
[2022-06-08 09:40:46] [INFO ] Implicit Places using invariants and state equation in 4221 ms returned []
Implicit Place search using SMT with State Equation took 8724 ms to find 0 implicit places.
[2022-06-08 09:40:46] [INFO ] Redundant transitions in 771 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:40:46] [INFO ] Computed 42 place invariants in 179 ms
[2022-06-08 09:40:53] [INFO ] Dead Transitions using invariants and state equation in 6574 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:40:53] [INFO ] Computed 42 place invariants in 214 ms
Incomplete random walk after 1000000 steps, including 5400 resets, run finished after 13730 ms. (steps per millisecond=72 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 110 resets, run finished after 1582 ms. (steps per millisecond=632 ) properties (out of 1) seen :0
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:41:09] [INFO ] Computed 42 place invariants in 187 ms
[2022-06-08 09:41:09] [INFO ] [Real]Absence check using 40 positive place invariants in 37 ms returned sat
[2022-06-08 09:41:09] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:41:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:41:11] [INFO ] [Real]Absence check using state equation in 2096 ms returned sat
[2022-06-08 09:41:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:41:12] [INFO ] [Nat]Absence check using 40 positive place invariants in 38 ms returned sat
[2022-06-08 09:41:12] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:41:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:41:14] [INFO ] [Nat]Absence check using state equation in 2083 ms returned sat
[2022-06-08 09:41:14] [INFO ] State equation strengthened by 6404 read => feed constraints.
[2022-06-08 09:41:15] [INFO ] [Nat]Added 6404 Read/Feed constraints in 972 ms returned sat
[2022-06-08 09:41:15] [INFO ] Computed and/alt/rep : 4692/12467/4692 causal constraints (skipped 1794 transitions) in 444 ms.
[2022-06-08 09:41:17] [INFO ] Added : 7 causal constraints over 2 iterations in 2077 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40] Max seen :[1]
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 272 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 268 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:41:18] [INFO ] Computed 42 place invariants in 178 ms
[2022-06-08 09:41:21] [INFO ] Implicit Places using invariants in 3114 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:41:21] [INFO ] Computed 42 place invariants in 180 ms
[2022-06-08 09:41:26] [INFO ] Implicit Places using invariants and state equation in 4873 ms returned []
Implicit Place search using SMT with State Equation took 7992 ms to find 0 implicit places.
[2022-06-08 09:41:27] [INFO ] Redundant transitions in 752 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:41:27] [INFO ] Computed 42 place invariants in 201 ms
[2022-06-08 09:41:32] [INFO ] Dead Transitions using invariants and state equation in 5849 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-08 in 89732 ms.
Starting property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-09
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:41:33] [INFO ] Computed 42 place invariants in 172 ms
Incomplete random walk after 10000 steps, including 53 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:41:33] [INFO ] Computed 42 place invariants in 170 ms
[2022-06-08 09:41:33] [INFO ] [Real]Absence check using 40 positive place invariants in 36 ms returned sat
[2022-06-08 09:41:33] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:41:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:41:35] [INFO ] [Real]Absence check using state equation in 1836 ms returned sat
[2022-06-08 09:41:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:41:35] [INFO ] [Nat]Absence check using 40 positive place invariants in 38 ms returned sat
[2022-06-08 09:41:36] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2022-06-08 09:41:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:41:38] [INFO ] [Nat]Absence check using state equation in 2003 ms returned sat
[2022-06-08 09:41:38] [INFO ] State equation strengthened by 6384 read => feed constraints.
[2022-06-08 09:41:38] [INFO ] [Nat]Added 6384 Read/Feed constraints in 768 ms returned sat
[2022-06-08 09:41:39] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 432 ms.
[2022-06-08 09:41:42] [INFO ] Deduced a trap composed of 3 places in 2269 ms of which 3 ms to minimize.
[2022-06-08 09:41:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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) : [40] Max seen :[0]
Support contains 1 out of 1850 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1850/1850 places, 6533/6533 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1843 transition count 6526
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 1843 transition count 6526
Applied a total of 20 rules in 736 ms. Remains 1843 /1850 variables (removed 7) and now considering 6526/6533 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1850 places, 6526/6533 transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:41:43] [INFO ] Computed 42 place invariants in 179 ms
Incomplete random walk after 1000000 steps, including 5410 resets, run finished after 12612 ms. (steps per millisecond=79 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 110 resets, run finished after 1513 ms. (steps per millisecond=660 ) properties (out of 1) seen :1
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:41:58] [INFO ] Computed 42 place invariants in 184 ms
[2022-06-08 09:41:58] [INFO ] [Real]Absence check using 40 positive place invariants in 42 ms returned sat
[2022-06-08 09:41:58] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:42:00] [INFO ] [Real]Absence check using state equation in 2142 ms returned sat
[2022-06-08 09:42:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:42:01] [INFO ] [Nat]Absence check using 40 positive place invariants in 39 ms returned sat
[2022-06-08 09:42:01] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:42:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:42:03] [INFO ] [Nat]Absence check using state equation in 2120 ms returned sat
[2022-06-08 09:42:03] [INFO ] State equation strengthened by 6404 read => feed constraints.
[2022-06-08 09:42:05] [INFO ] [Nat]Added 6404 Read/Feed constraints in 1980 ms returned sat
[2022-06-08 09:42:06] [INFO ] Computed and/alt/rep : 4692/12467/4692 causal constraints (skipped 1794 transitions) in 436 ms.
[2022-06-08 09:42:07] [INFO ] Added : 10 causal constraints over 2 iterations in 1863 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40] Max seen :[1]
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 274 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 282 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:42:08] [INFO ] Computed 42 place invariants in 186 ms
[2022-06-08 09:42:12] [INFO ] Implicit Places using invariants in 4019 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:42:12] [INFO ] Computed 42 place invariants in 201 ms
[2022-06-08 09:42:16] [INFO ] Implicit Places using invariants and state equation in 3757 ms returned []
Implicit Place search using SMT with State Equation took 7778 ms to find 0 implicit places.
[2022-06-08 09:42:16] [INFO ] Redundant transitions in 781 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:42:17] [INFO ] Computed 42 place invariants in 186 ms
[2022-06-08 09:42:22] [INFO ] Dead Transitions using invariants and state equation in 5775 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:42:22] [INFO ] Computed 42 place invariants in 185 ms
Incomplete random walk after 1000000 steps, including 5414 resets, run finished after 12923 ms. (steps per millisecond=77 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 112 resets, run finished after 1568 ms. (steps per millisecond=637 ) properties (out of 1) seen :1
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:42:37] [INFO ] Computed 42 place invariants in 186 ms
[2022-06-08 09:42:37] [INFO ] [Real]Absence check using 40 positive place invariants in 37 ms returned sat
[2022-06-08 09:42:37] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:42:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:42:39] [INFO ] [Real]Absence check using state equation in 2044 ms returned sat
[2022-06-08 09:42:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:42:40] [INFO ] [Nat]Absence check using 40 positive place invariants in 38 ms returned sat
[2022-06-08 09:42:40] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:42:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:42:42] [INFO ] [Nat]Absence check using state equation in 2059 ms returned sat
[2022-06-08 09:42:42] [INFO ] State equation strengthened by 6404 read => feed constraints.
[2022-06-08 09:42:44] [INFO ] [Nat]Added 6404 Read/Feed constraints in 1834 ms returned sat
[2022-06-08 09:42:44] [INFO ] Computed and/alt/rep : 4692/12467/4692 causal constraints (skipped 1794 transitions) in 458 ms.
[2022-06-08 09:42:46] [INFO ] Added : 10 causal constraints over 2 iterations in 1912 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40] Max seen :[1]
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 278 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 279 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:42:47] [INFO ] Computed 42 place invariants in 185 ms
[2022-06-08 09:42:51] [INFO ] Implicit Places using invariants in 4112 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:42:51] [INFO ] Computed 42 place invariants in 211 ms
[2022-06-08 09:42:56] [INFO ] Implicit Places using invariants and state equation in 5130 ms returned []
Implicit Place search using SMT with State Equation took 9246 ms to find 0 implicit places.
[2022-06-08 09:42:57] [INFO ] Redundant transitions in 790 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:42:57] [INFO ] Computed 42 place invariants in 185 ms
[2022-06-08 09:43:02] [INFO ] Dead Transitions using invariants and state equation in 5264 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-09 in 89732 ms.
Starting property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-10
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:43:02] [INFO ] Computed 42 place invariants in 178 ms
Incomplete random walk after 10000 steps, including 54 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:43:03] [INFO ] Computed 42 place invariants in 192 ms
[2022-06-08 09:43:03] [INFO ] [Real]Absence check using 40 positive place invariants in 39 ms returned sat
[2022-06-08 09:43:03] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:43:05] [INFO ] [Real]Absence check using state equation in 2059 ms returned sat
[2022-06-08 09:43:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:43:05] [INFO ] [Nat]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-08 09:43:06] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:43:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:43:08] [INFO ] [Nat]Absence check using state equation in 2051 ms returned sat
[2022-06-08 09:43:08] [INFO ] State equation strengthened by 6384 read => feed constraints.
[2022-06-08 09:43:09] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1657 ms returned sat
[2022-06-08 09:43:10] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 438 ms.
[2022-06-08 09:43:10] [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.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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) : [40] Max seen :[1]
Support contains 1 out of 1850 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1850/1850 places, 6533/6533 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1843 transition count 6526
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 1843 transition count 6526
Applied a total of 20 rules in 764 ms. Remains 1843 /1850 variables (removed 7) and now considering 6526/6533 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1850 places, 6526/6533 transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:43:11] [INFO ] Computed 42 place invariants in 185 ms
Incomplete random walk after 1000000 steps, including 5412 resets, run finished after 13037 ms. (steps per millisecond=76 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 110 resets, run finished after 1561 ms. (steps per millisecond=640 ) properties (out of 1) seen :1
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:43:26] [INFO ] Computed 42 place invariants in 186 ms
[2022-06-08 09:43:26] [INFO ] [Real]Absence check using 40 positive place invariants in 37 ms returned sat
[2022-06-08 09:43:26] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:43:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:43:28] [INFO ] [Real]Absence check using state equation in 2063 ms returned sat
[2022-06-08 09:43:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:43:29] [INFO ] [Nat]Absence check using 40 positive place invariants in 36 ms returned sat
[2022-06-08 09:43:29] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:43:31] [INFO ] [Nat]Absence check using state equation in 2073 ms returned sat
[2022-06-08 09:43:31] [INFO ] State equation strengthened by 6404 read => feed constraints.
[2022-06-08 09:43:32] [INFO ] [Nat]Added 6404 Read/Feed constraints in 960 ms returned sat
[2022-06-08 09:43:33] [INFO ] Computed and/alt/rep : 4692/12467/4692 causal constraints (skipped 1794 transitions) in 444 ms.
[2022-06-08 09:43:34] [INFO ] Added : 7 causal constraints over 2 iterations in 1900 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40] Max seen :[1]
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 279 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 274 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:43:35] [INFO ] Computed 42 place invariants in 186 ms
[2022-06-08 09:43:39] [INFO ] Implicit Places using invariants in 3700 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:43:39] [INFO ] Computed 42 place invariants in 186 ms
[2022-06-08 09:43:44] [INFO ] Implicit Places using invariants and state equation in 5197 ms returned []
Implicit Place search using SMT with State Equation took 8897 ms to find 0 implicit places.
[2022-06-08 09:43:45] [INFO ] Redundant transitions in 773 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:43:45] [INFO ] Computed 42 place invariants in 189 ms
[2022-06-08 09:43:51] [INFO ] Dead Transitions using invariants and state equation in 6165 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-10 in 48669 ms.
Starting property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-11
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:43:51] [INFO ] Computed 42 place invariants in 176 ms
Incomplete random walk after 10000 steps, including 53 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:43:51] [INFO ] Computed 42 place invariants in 179 ms
[2022-06-08 09:43:52] [INFO ] [Real]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-08 09:43:52] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:43:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:43:54] [INFO ] [Real]Absence check using state equation in 2078 ms returned sat
[2022-06-08 09:43:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:43:54] [INFO ] [Nat]Absence check using 40 positive place invariants in 43 ms returned sat
[2022-06-08 09:43:54] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:43:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:43:56] [INFO ] [Nat]Absence check using state equation in 2032 ms returned sat
[2022-06-08 09:43:56] [INFO ] State equation strengthened by 6384 read => feed constraints.
[2022-06-08 09:43:58] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1856 ms returned sat
[2022-06-08 09:43:59] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 471 ms.
[2022-06-08 09:44:02] [INFO ] Deduced a trap composed of 3 places in 2623 ms of which 2 ms to minimize.
[2022-06-08 09:44:02] [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.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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) : [40] Max seen :[1]
Support contains 1 out of 1850 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1850/1850 places, 6533/6533 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1843 transition count 6526
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 1843 transition count 6526
Applied a total of 20 rules in 739 ms. Remains 1843 /1850 variables (removed 7) and now considering 6526/6533 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1850 places, 6526/6533 transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:44:03] [INFO ] Computed 42 place invariants in 265 ms
Incomplete random walk after 1000000 steps, including 5401 resets, run finished after 12939 ms. (steps per millisecond=77 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 112 resets, run finished after 1558 ms. (steps per millisecond=641 ) properties (out of 1) seen :1
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:44:17] [INFO ] Computed 42 place invariants in 187 ms
[2022-06-08 09:44:18] [INFO ] [Real]Absence check using 40 positive place invariants in 38 ms returned sat
[2022-06-08 09:44:18] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:44:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:44:20] [INFO ] [Real]Absence check using state equation in 2077 ms returned sat
[2022-06-08 09:44:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:44:20] [INFO ] [Nat]Absence check using 40 positive place invariants in 39 ms returned sat
[2022-06-08 09:44:20] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:44:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:44:22] [INFO ] [Nat]Absence check using state equation in 2050 ms returned sat
[2022-06-08 09:44:22] [INFO ] State equation strengthened by 6404 read => feed constraints.
[2022-06-08 09:44:24] [INFO ] [Nat]Added 6404 Read/Feed constraints in 1671 ms returned sat
[2022-06-08 09:44:25] [INFO ] Computed and/alt/rep : 4692/12467/4692 causal constraints (skipped 1794 transitions) in 434 ms.
[2022-06-08 09:44:26] [INFO ] Added : 8 causal constraints over 2 iterations in 1896 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40] Max seen :[1]
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 277 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 278 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:44:27] [INFO ] Computed 42 place invariants in 188 ms
[2022-06-08 09:44:31] [INFO ] Implicit Places using invariants in 3922 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:44:31] [INFO ] Computed 42 place invariants in 275 ms
[2022-06-08 09:44:36] [INFO ] Implicit Places using invariants and state equation in 5361 ms returned []
Implicit Place search using SMT with State Equation took 9289 ms to find 0 implicit places.
[2022-06-08 09:44:37] [INFO ] Redundant transitions in 776 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:44:37] [INFO ] Computed 42 place invariants in 188 ms
[2022-06-08 09:44:45] [INFO ] Dead Transitions using invariants and state equation in 7760 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-11 in 53892 ms.
Starting property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-12
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:44:45] [INFO ] Computed 42 place invariants in 179 ms
Incomplete random walk after 10000 steps, including 53 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:44:45] [INFO ] Computed 42 place invariants in 178 ms
[2022-06-08 09:44:46] [INFO ] [Real]Absence check using 40 positive place invariants in 40 ms returned sat
[2022-06-08 09:44:46] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:44:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:44:48] [INFO ] [Real]Absence check using state equation in 2087 ms returned sat
[2022-06-08 09:44:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:44:48] [INFO ] [Nat]Absence check using 40 positive place invariants in 42 ms returned sat
[2022-06-08 09:44:48] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:44:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:44:50] [INFO ] [Nat]Absence check using state equation in 2102 ms returned sat
[2022-06-08 09:44:50] [INFO ] State equation strengthened by 6384 read => feed constraints.
[2022-06-08 09:44:51] [INFO ] [Nat]Added 6384 Read/Feed constraints in 843 ms returned sat
[2022-06-08 09:44:52] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 443 ms.
[2022-06-08 09:44:55] [INFO ] Deduced a trap composed of 3 places in 2556 ms of which 2 ms to minimize.
[2022-06-08 09:44:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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) : [40] Max seen :[0]
Support contains 1 out of 1850 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1850/1850 places, 6533/6533 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 1843 transition count 6526
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 1843 transition count 6526
Applied a total of 20 rules in 743 ms. Remains 1843 /1850 variables (removed 7) and now considering 6526/6533 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1850 places, 6526/6533 transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:44:56] [INFO ] Computed 42 place invariants in 192 ms
Incomplete random walk after 1000000 steps, including 5397 resets, run finished after 13017 ms. (steps per millisecond=76 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 110 resets, run finished after 1565 ms. (steps per millisecond=638 ) properties (out of 1) seen :1
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:45:11] [INFO ] Computed 42 place invariants in 197 ms
[2022-06-08 09:45:11] [INFO ] [Real]Absence check using 40 positive place invariants in 38 ms returned sat
[2022-06-08 09:45:12] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:45:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:45:14] [INFO ] [Real]Absence check using state equation in 2030 ms returned sat
[2022-06-08 09:45:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:45:14] [INFO ] [Nat]Absence check using 40 positive place invariants in 38 ms returned sat
[2022-06-08 09:45:14] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:45:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:45:16] [INFO ] [Nat]Absence check using state equation in 2086 ms returned sat
[2022-06-08 09:45:16] [INFO ] State equation strengthened by 6404 read => feed constraints.
[2022-06-08 09:45:18] [INFO ] [Nat]Added 6404 Read/Feed constraints in 1522 ms returned sat
[2022-06-08 09:45:18] [INFO ] Computed and/alt/rep : 4692/12467/4692 causal constraints (skipped 1794 transitions) in 434 ms.
[2022-06-08 09:45:20] [INFO ] Added : 14 causal constraints over 3 iterations in 2202 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40] Max seen :[1]
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 279 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 274 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:45:21] [INFO ] Computed 42 place invariants in 189 ms
[2022-06-08 09:45:25] [INFO ] Implicit Places using invariants in 3967 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:45:25] [INFO ] Computed 42 place invariants in 258 ms
[2022-06-08 09:45:31] [INFO ] Implicit Places using invariants and state equation in 6038 ms returned []
Implicit Place search using SMT with State Equation took 10007 ms to find 0 implicit places.
[2022-06-08 09:45:32] [INFO ] Redundant transitions in 946 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:45:32] [INFO ] Computed 42 place invariants in 195 ms
[2022-06-08 09:45:40] [INFO ] Dead Transitions using invariants and state equation in 7784 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:45:40] [INFO ] Computed 42 place invariants in 189 ms
Incomplete random walk after 1000000 steps, including 5409 resets, run finished after 12957 ms. (steps per millisecond=77 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 112 resets, run finished after 1575 ms. (steps per millisecond=634 ) properties (out of 1) seen :1
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:45:55] [INFO ] Computed 42 place invariants in 189 ms
[2022-06-08 09:45:55] [INFO ] [Real]Absence check using 40 positive place invariants in 38 ms returned sat
[2022-06-08 09:45:55] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:45:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:45:57] [INFO ] [Real]Absence check using state equation in 2099 ms returned sat
[2022-06-08 09:45:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:45:58] [INFO ] [Nat]Absence check using 40 positive place invariants in 38 ms returned sat
[2022-06-08 09:45:58] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:45:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:46:00] [INFO ] [Nat]Absence check using state equation in 2083 ms returned sat
[2022-06-08 09:46:00] [INFO ] State equation strengthened by 6404 read => feed constraints.
[2022-06-08 09:46:01] [INFO ] [Nat]Added 6404 Read/Feed constraints in 1536 ms returned sat
[2022-06-08 09:46:02] [INFO ] Computed and/alt/rep : 4692/12467/4692 causal constraints (skipped 1794 transitions) in 447 ms.
[2022-06-08 09:46:04] [INFO ] Added : 14 causal constraints over 3 iterations in 2229 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40] Max seen :[1]
Support contains 1 out of 1843 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 277 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1843/1843 places, 6526/6526 transitions.
Applied a total of 0 rules in 273 ms. Remains 1843 /1843 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:46:05] [INFO ] Computed 42 place invariants in 188 ms
[2022-06-08 09:46:09] [INFO ] Implicit Places using invariants in 3978 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:46:09] [INFO ] Computed 42 place invariants in 188 ms
[2022-06-08 09:46:14] [INFO ] Implicit Places using invariants and state equation in 5460 ms returned []
Implicit Place search using SMT with State Equation took 9440 ms to find 0 implicit places.
[2022-06-08 09:46:15] [INFO ] Redundant transitions in 786 ms returned []
// Phase 1: matrix 6526 rows 1843 cols
[2022-06-08 09:46:15] [INFO ] Computed 42 place invariants in 187 ms
[2022-06-08 09:46:22] [INFO ] Dead Transitions using invariants and state equation in 6817 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1843/1843 places, 6526/6526 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-12 in 96926 ms.
Starting property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-14
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:46:22] [INFO ] Computed 42 place invariants in 176 ms
Incomplete random walk after 10000 steps, including 55 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:46:22] [INFO ] Computed 42 place invariants in 175 ms
[2022-06-08 09:46:22] [INFO ] [Real]Absence check using 40 positive place invariants in 40 ms returned sat
[2022-06-08 09:46:22] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:46:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:46:25] [INFO ] [Real]Absence check using state equation in 2066 ms returned sat
[2022-06-08 09:46:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:46:25] [INFO ] [Nat]Absence check using 40 positive place invariants in 42 ms returned sat
[2022-06-08 09:46:25] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:46:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:46:27] [INFO ] [Nat]Absence check using state equation in 2032 ms returned sat
[2022-06-08 09:46:27] [INFO ] State equation strengthened by 6384 read => feed constraints.
[2022-06-08 09:46:28] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1340 ms returned sat
[2022-06-08 09:46:29] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 452 ms.
[2022-06-08 09:46:30] [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.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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) : [40] Max seen :[1]
Support contains 1 out of 1850 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1850/1850 places, 6533/6533 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1842 transition count 6525
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 1842 transition count 6525
Applied a total of 21 rules in 754 ms. Remains 1842 /1850 variables (removed 8) and now considering 6525/6533 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 1842/1850 places, 6525/6533 transitions.
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:46:31] [INFO ] Computed 42 place invariants in 186 ms
Incomplete random walk after 1000000 steps, including 5411 resets, run finished after 13159 ms. (steps per millisecond=75 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 111 resets, run finished after 1567 ms. (steps per millisecond=638 ) properties (out of 1) seen :1
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:46:46] [INFO ] Computed 42 place invariants in 187 ms
[2022-06-08 09:46:46] [INFO ] [Real]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-08 09:46:46] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:46:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:46:48] [INFO ] [Real]Absence check using state equation in 2034 ms returned sat
[2022-06-08 09:46:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:46:48] [INFO ] [Nat]Absence check using 40 positive place invariants in 40 ms returned sat
[2022-06-08 09:46:48] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:46:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:46:51] [INFO ] [Nat]Absence check using state equation in 2053 ms returned sat
[2022-06-08 09:46:51] [INFO ] State equation strengthened by 6405 read => feed constraints.
[2022-06-08 09:46:51] [INFO ] [Nat]Added 6405 Read/Feed constraints in 810 ms returned sat
[2022-06-08 09:46:52] [INFO ] Computed and/alt/rep : 4691/12469/4691 causal constraints (skipped 1794 transitions) in 462 ms.
[2022-06-08 09:46:54] [INFO ] Added : 7 causal constraints over 2 iterations in 1948 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40] Max seen :[1]
Support contains 1 out of 1842 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1842/1842 places, 6525/6525 transitions.
Applied a total of 0 rules in 271 ms. Remains 1842 /1842 variables (removed 0) and now considering 6525/6525 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1842/1842 places, 6525/6525 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1842/1842 places, 6525/6525 transitions.
Applied a total of 0 rules in 272 ms. Remains 1842 /1842 variables (removed 0) and now considering 6525/6525 (removed 0) transitions.
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:46:55] [INFO ] Computed 42 place invariants in 187 ms
[2022-06-08 09:46:58] [INFO ] Implicit Places using invariants in 3809 ms returned []
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:46:58] [INFO ] Computed 42 place invariants in 193 ms
[2022-06-08 09:47:03] [INFO ] Implicit Places using invariants and state equation in 5099 ms returned []
Implicit Place search using SMT with State Equation took 8911 ms to find 0 implicit places.
[2022-06-08 09:47:04] [INFO ] Redundant transitions in 773 ms returned []
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:47:04] [INFO ] Computed 42 place invariants in 188 ms
[2022-06-08 09:47:11] [INFO ] Dead Transitions using invariants and state equation in 7081 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1842/1842 places, 6525/6525 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-14 in 49537 ms.
Starting property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-15
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:47:11] [INFO ] Computed 42 place invariants in 176 ms
Incomplete random walk after 10000 steps, including 53 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
// Phase 1: matrix 6533 rows 1850 cols
[2022-06-08 09:47:12] [INFO ] Computed 42 place invariants in 186 ms
[2022-06-08 09:47:12] [INFO ] [Real]Absence check using 40 positive place invariants in 40 ms returned sat
[2022-06-08 09:47:12] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:47:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:47:14] [INFO ] [Real]Absence check using state equation in 2124 ms returned sat
[2022-06-08 09:47:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:47:15] [INFO ] [Nat]Absence check using 40 positive place invariants in 41 ms returned sat
[2022-06-08 09:47:15] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 09:47:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:47:17] [INFO ] [Nat]Absence check using state equation in 2204 ms returned sat
[2022-06-08 09:47:17] [INFO ] State equation strengthened by 6384 read => feed constraints.
[2022-06-08 09:47:19] [INFO ] [Nat]Added 6384 Read/Feed constraints in 1808 ms returned sat
[2022-06-08 09:47:19] [INFO ] Computed and/alt/rep : 4699/12440/4699 causal constraints (skipped 1794 transitions) in 476 ms.
[2022-06-08 09:47:19] [INFO ] Added : 0 causal constraints over 0 iterations in 478 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [40] Max seen :[1]
Support contains 1 out of 1850 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1850/1850 places, 6533/6533 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1842 transition count 6525
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 1842 transition count 6525
Applied a total of 21 rules in 775 ms. Remains 1842 /1850 variables (removed 8) and now considering 6525/6533 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 1842/1850 places, 6525/6533 transitions.
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:47:20] [INFO ] Computed 42 place invariants in 188 ms
Incomplete random walk after 1000000 steps, including 5410 resets, run finished after 13674 ms. (steps per millisecond=73 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 112 resets, run finished after 1624 ms. (steps per millisecond=615 ) properties (out of 1) seen :1
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:47:36] [INFO ] Computed 42 place invariants in 189 ms
[2022-06-08 09:47:36] [INFO ] [Real]Absence check using 40 positive place invariants in 40 ms returned sat
[2022-06-08 09:47:36] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2022-06-08 09:47:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 09:47:38] [INFO ] [Real]Absence check using state equation in 2128 ms returned sat
[2022-06-08 09:47:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 09:47:39] [INFO ] [Nat]Absence check using 40 positive place invariants in 40 ms returned sat
[2022-06-08 09:47:39] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2022-06-08 09:47:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 09:47:41] [INFO ] [Nat]Absence check using state equation in 2110 ms returned sat
[2022-06-08 09:47:41] [INFO ] State equation strengthened by 6405 read => feed constraints.
[2022-06-08 09:47:43] [INFO ] [Nat]Added 6405 Read/Feed constraints in 2280 ms returned sat
[2022-06-08 09:47:44] [INFO ] Computed and/alt/rep : 4691/12469/4691 causal constraints (skipped 1794 transitions) in 441 ms.
[2022-06-08 09:47:45] [INFO ] Added : 6 causal constraints over 2 iterations in 1917 ms. Result :sat
Current structural bounds on expressions (after SMT) : [40] Max seen :[1]
Support contains 1 out of 1842 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1842/1842 places, 6525/6525 transitions.
Applied a total of 0 rules in 277 ms. Remains 1842 /1842 variables (removed 0) and now considering 6525/6525 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1842/1842 places, 6525/6525 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1842/1842 places, 6525/6525 transitions.
Applied a total of 0 rules in 280 ms. Remains 1842 /1842 variables (removed 0) and now considering 6525/6525 (removed 0) transitions.
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:47:46] [INFO ] Computed 42 place invariants in 186 ms
[2022-06-08 09:47:50] [INFO ] Implicit Places using invariants in 3783 ms returned []
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:47:50] [INFO ] Computed 42 place invariants in 193 ms
[2022-06-08 09:47:56] [INFO ] Implicit Places using invariants and state equation in 5562 ms returned []
Implicit Place search using SMT with State Equation took 9352 ms to find 0 implicit places.
[2022-06-08 09:47:56] [INFO ] Redundant transitions in 779 ms returned []
// Phase 1: matrix 6525 rows 1842 cols
[2022-06-08 09:47:57] [INFO ] Computed 42 place invariants in 190 ms
[2022-06-08 09:48:04] [INFO ] Dead Transitions using invariants and state equation in 7880 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1842/1842 places, 6525/6525 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-040-UpperBounds-15 in 53186 ms.
[2022-06-08 09:48:05] [INFO ] Flatten gal took : 465 ms
[2022-06-08 09:48:05] [INFO ] Applying decomposition
[2022-06-08 09:48:06] [INFO ] Flatten gal took : 230 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1219181014457992095.txt' '-o' '/tmp/graph1219181014457992095.bin' '-w' '/tmp/graph1219181014457992095.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1219181014457992095.bin' '-l' '-1' '-v' '-w' '/tmp/graph1219181014457992095.weights' '-q' '0' '-e' '0.001'
[2022-06-08 09:48:06] [INFO ] Decomposing Gal with order
[2022-06-08 09:48:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 09:48:08] [INFO ] Removed a total of 4938 redundant transitions.
[2022-06-08 09:48:08] [INFO ] Flatten gal took : 1370 ms
[2022-06-08 09:48:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 4964 labels/synchronizations in 482 ms.
[2022-06-08 09:48:09] [INFO ] Time to serialize gal into /tmp/UpperBounds17076510410249491743.gal : 100 ms
[2022-06-08 09:48:09] [INFO ] Time to serialize properties into /tmp/UpperBounds17354235200551430062.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17076510410249491743.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17354235200551430062.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...276
Loading property file /tmp/UpperBounds17354235200551430062.prop.
Detected timeout of ITS tools.
[2022-06-08 10:16:10] [INFO ] Flatten gal took : 2105 ms
[2022-06-08 10:16:11] [INFO ] Time to serialize gal into /tmp/UpperBounds10632837560729700913.gal : 228 ms
[2022-06-08 10:16:11] [INFO ] Time to serialize properties into /tmp/UpperBounds9323253761368298771.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10632837560729700913.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9323253761368298771.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds9323253761368298771.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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-040"
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-040, 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-165463872300037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-040.tgz
mv CANInsertWithFailure-PT-040 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 ;