fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r323-tall-165472292600043
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for BugTracking-PT-q8m128

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16247.724 3600000.00 3352343.00 190386.00 0 0 0 0 0 1 0 0 0 ? ? 0 0 ? ? 0 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.r323-tall-165472292600043.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 gold2021
Input is BugTracking-PT-q8m128, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292600043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 6.1K Jun 7 16:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Jun 7 16:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Jun 7 16:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Jun 7 16:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 7 17:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 7 17:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Jun 7 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 7 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 16M Jun 6 12:11 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 BugTracking-PT-q8m128-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m128-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654741290064

Running Version 0
[2022-06-09 02:21:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 02:21:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 02:21:32] [INFO ] Load time of PNML (sax parser for PT used): 743 ms
[2022-06-09 02:21:32] [INFO ] Transformed 754 places.
[2022-06-09 02:21:32] [INFO ] Transformed 27370 transitions.
[2022-06-09 02:21:32] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 951 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 474 places in 123 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m128-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 02:21:33] [INFO ] Computed 10 place invariants in 64 ms
Incomplete random walk after 10000 steps, including 8 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :1
FORMULA BugTracking-PT-q8m128-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :8
[2022-06-09 02:21:33] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 02:21:33] [INFO ] Computed 10 place invariants in 17 ms
[2022-06-09 02:21:33] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2022-06-09 02:21:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:21:34] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2022-06-09 02:21:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:21:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 02:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:21:34] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2022-06-09 02:21:34] [INFO ] State equation strengthened by 316 read => feed constraints.
[2022-06-09 02:21:35] [INFO ] [Nat]Added 316 Read/Feed constraints in 195 ms returned sat
[2022-06-09 02:21:35] [INFO ] Deduced a trap composed of 98 places in 436 ms of which 4 ms to minimize.
[2022-06-09 02:21:36] [INFO ] Deduced a trap composed of 101 places in 404 ms of which 1 ms to minimize.
[2022-06-09 02:21:36] [INFO ] Deduced a trap composed of 66 places in 339 ms of which 1 ms to minimize.
[2022-06-09 02:21:36] [INFO ] Deduced a trap composed of 17 places in 274 ms of which 2 ms to minimize.
[2022-06-09 02:21:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1984 ms
[2022-06-09 02:21:37] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 308 ms.
[2022-06-09 02:21:39] [INFO ] Deduced a trap composed of 15 places in 485 ms of which 1 ms to minimize.
[2022-06-09 02:21:39] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 02:21:39] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 02:21:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:21:40] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2022-06-09 02:21:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:21:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 02:21:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:21:40] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2022-06-09 02:21:41] [INFO ] [Nat]Added 316 Read/Feed constraints in 201 ms returned sat
[2022-06-09 02:21:41] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 1 ms to minimize.
[2022-06-09 02:21:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2022-06-09 02:21:41] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 306 ms.
[2022-06-09 02:21: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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 02:21:45] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 02:21:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:21:45] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2022-06-09 02:21:46] [INFO ] [Real]Added 316 Read/Feed constraints in 187 ms returned sat
[2022-06-09 02:21:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:21:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 02:21:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:21:46] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2022-06-09 02:21:47] [INFO ] [Nat]Added 316 Read/Feed constraints in 188 ms returned sat
[2022-06-09 02:21:47] [INFO ] Deduced a trap composed of 33 places in 458 ms of which 1 ms to minimize.
[2022-06-09 02:21:48] [INFO ] Deduced a trap composed of 76 places in 491 ms of which 1 ms to minimize.
[2022-06-09 02:21:48] [INFO ] Deduced a trap composed of 30 places in 500 ms of which 1 ms to minimize.
[2022-06-09 02:21:49] [INFO ] Deduced a trap composed of 77 places in 500 ms of which 0 ms to minimize.
[2022-06-09 02:21:49] [INFO ] Deduced a trap composed of 31 places in 498 ms of which 0 ms to minimize.
[2022-06-09 02:21:50] [INFO ] Deduced a trap composed of 24 places in 534 ms of which 16 ms to minimize.
[2022-06-09 02:21:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3645 ms
[2022-06-09 02:21:50] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 245 ms.
[2022-06-09 02:21:51] [INFO ] Deduced a trap composed of 15 places in 550 ms of which 1 ms to minimize.
[2022-06-09 02:21:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 02:21:51] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 02:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:21:52] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2022-06-09 02:21:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:21:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 02:21:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:21:53] [INFO ] [Nat]Absence check using state equation in 518 ms returned sat
[2022-06-09 02:21:53] [INFO ] [Nat]Added 316 Read/Feed constraints in 198 ms returned sat
[2022-06-09 02:21:53] [INFO ] Deduced a trap composed of 133 places in 401 ms of which 0 ms to minimize.
[2022-06-09 02:21:54] [INFO ] Deduced a trap composed of 97 places in 429 ms of which 0 ms to minimize.
[2022-06-09 02:21:54] [INFO ] Deduced a trap composed of 129 places in 490 ms of which 1 ms to minimize.
[2022-06-09 02:21:55] [INFO ] Deduced a trap composed of 78 places in 444 ms of which 1 ms to minimize.
[2022-06-09 02:21:55] [INFO ] Deduced a trap composed of 131 places in 448 ms of which 1 ms to minimize.
[2022-06-09 02:21:56] [INFO ] Deduced a trap composed of 125 places in 474 ms of which 0 ms to minimize.
[2022-06-09 02:21:57] [INFO ] Deduced a trap composed of 135 places in 450 ms of which 0 ms to minimize.
[2022-06-09 02:21:57] [INFO ] Deduced a trap composed of 122 places in 444 ms of which 1 ms to minimize.
[2022-06-09 02:21:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, -1, -1, -1] Max seen :[0, 0, 10, 0]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 330 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/280 places, 3871/3904 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:21:57] [INFO ] Computed 8 place invariants in 21 ms
Incomplete random walk after 1000012 steps, including 2 resets, run finished after 741 ms. (steps per millisecond=1349 ) properties (out of 4) seen :508
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2045 ms. (steps per millisecond=488 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1999 ms. (steps per millisecond=500 ) properties (out of 4) seen :4258
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2038 ms. (steps per millisecond=490 ) properties (out of 4) seen :19668
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1933 ms. (steps per millisecond=517 ) properties (out of 4) seen :4027
[2022-06-09 02:22:06] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:22:06] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 02:22:06] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:22:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:22:07] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2022-06-09 02:22:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:22:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:22:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:22:07] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2022-06-09 02:22:07] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:22:08] [INFO ] [Nat]Added 296 Read/Feed constraints in 205 ms returned sat
[2022-06-09 02:22:08] [INFO ] Deduced a trap composed of 51 places in 481 ms of which 1 ms to minimize.
[2022-06-09 02:22:09] [INFO ] Deduced a trap composed of 21 places in 450 ms of which 1 ms to minimize.
[2022-06-09 02:22:09] [INFO ] Deduced a trap composed of 17 places in 452 ms of which 0 ms to minimize.
[2022-06-09 02:22:10] [INFO ] Deduced a trap composed of 9 places in 398 ms of which 0 ms to minimize.
[2022-06-09 02:22:10] [INFO ] Deduced a trap composed of 88 places in 304 ms of which 1 ms to minimize.
[2022-06-09 02:22:10] [INFO ] Deduced a trap composed of 81 places in 314 ms of which 1 ms to minimize.
[2022-06-09 02:22:11] [INFO ] Deduced a trap composed of 79 places in 320 ms of which 0 ms to minimize.
[2022-06-09 02:22:11] [INFO ] Deduced a trap composed of 68 places in 302 ms of which 0 ms to minimize.
[2022-06-09 02:22:12] [INFO ] Deduced a trap composed of 67 places in 310 ms of which 1 ms to minimize.
[2022-06-09 02:22:12] [INFO ] Deduced a trap composed of 19 places in 303 ms of which 0 ms to minimize.
[2022-06-09 02:22:12] [INFO ] Deduced a trap composed of 16 places in 305 ms of which 1 ms to minimize.
[2022-06-09 02:22:13] [INFO ] Deduced a trap composed of 86 places in 306 ms of which 0 ms to minimize.
[2022-06-09 02:22:13] [INFO ] Deduced a trap composed of 66 places in 310 ms of which 2 ms to minimize.
[2022-06-09 02:22:14] [INFO ] Deduced a trap composed of 84 places in 303 ms of which 1 ms to minimize.
[2022-06-09 02:22:14] [INFO ] Deduced a trap composed of 83 places in 302 ms of which 1 ms to minimize.
[2022-06-09 02:22:14] [INFO ] Deduced a trap composed of 83 places in 304 ms of which 1 ms to minimize.
[2022-06-09 02:22:15] [INFO ] Deduced a trap composed of 92 places in 309 ms of which 1 ms to minimize.
[2022-06-09 02:22:15] [INFO ] Deduced a trap composed of 92 places in 310 ms of which 1 ms to minimize.
[2022-06-09 02:22:16] [INFO ] Deduced a trap composed of 97 places in 295 ms of which 0 ms to minimize.
[2022-06-09 02:22:16] [INFO ] Deduced a trap composed of 67 places in 233 ms of which 1 ms to minimize.
[2022-06-09 02:22:16] [INFO ] Deduced a trap composed of 67 places in 247 ms of which 1 ms to minimize.
[2022-06-09 02:22:17] [INFO ] Deduced a trap composed of 64 places in 261 ms of which 1 ms to minimize.
[2022-06-09 02:22:17] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 0 ms to minimize.
[2022-06-09 02:22:17] [INFO ] Deduced a trap composed of 67 places in 305 ms of which 1 ms to minimize.
[2022-06-09 02:22:18] [INFO ] Deduced a trap composed of 68 places in 299 ms of which 0 ms to minimize.
[2022-06-09 02:22:18] [INFO ] Deduced a trap composed of 93 places in 310 ms of which 0 ms to minimize.
[2022-06-09 02:22:19] [INFO ] Deduced a trap composed of 66 places in 273 ms of which 0 ms to minimize.
[2022-06-09 02:22:19] [INFO ] Deduced a trap composed of 68 places in 293 ms of which 0 ms to minimize.
[2022-06-09 02:22:19] [INFO ] Deduced a trap composed of 89 places in 300 ms of which 1 ms to minimize.
[2022-06-09 02:22:20] [INFO ] Deduced a trap composed of 68 places in 307 ms of which 1 ms to minimize.
[2022-06-09 02:22:20] [INFO ] Deduced a trap composed of 68 places in 266 ms of which 0 ms to minimize.
[2022-06-09 02:22:20] [INFO ] Deduced a trap composed of 65 places in 272 ms of which 0 ms to minimize.
[2022-06-09 02:22:21] [INFO ] Deduced a trap composed of 90 places in 309 ms of which 1 ms to minimize.
[2022-06-09 02:22:21] [INFO ] Deduced a trap composed of 91 places in 303 ms of which 1 ms to minimize.
[2022-06-09 02:22:22] [INFO ] Deduced a trap composed of 88 places in 306 ms of which 1 ms to minimize.
[2022-06-09 02:22:22] [INFO ] Deduced a trap composed of 90 places in 323 ms of which 5 ms to minimize.
[2022-06-09 02:22:22] [INFO ] Deduced a trap composed of 83 places in 311 ms of which 0 ms to minimize.
[2022-06-09 02:22:23] [INFO ] Deduced a trap composed of 67 places in 298 ms of which 1 ms to minimize.
[2022-06-09 02:22:23] [INFO ] Deduced a trap composed of 66 places in 292 ms of which 0 ms to minimize.
[2022-06-09 02:22:24] [INFO ] Deduced a trap composed of 91 places in 312 ms of which 0 ms to minimize.
[2022-06-09 02:22:24] [INFO ] Deduced a trap composed of 69 places in 301 ms of which 1 ms to minimize.
[2022-06-09 02:22:24] [INFO ] Deduced a trap composed of 68 places in 291 ms of which 1 ms to minimize.
[2022-06-09 02:22:25] [INFO ] Deduced a trap composed of 62 places in 310 ms of which 1 ms to minimize.
[2022-06-09 02:22:25] [INFO ] Deduced a trap composed of 78 places in 299 ms of which 1 ms to minimize.
[2022-06-09 02:22:26] [INFO ] Deduced a trap composed of 10 places in 309 ms of which 12 ms to minimize.
[2022-06-09 02:22:26] [INFO ] Deduced a trap composed of 87 places in 301 ms of which 1 ms to minimize.
[2022-06-09 02:22:26] [INFO ] Deduced a trap composed of 68 places in 296 ms of which 0 ms to minimize.
[2022-06-09 02:22:27] [INFO ] Deduced a trap composed of 88 places in 299 ms of which 1 ms to minimize.
[2022-06-09 02:22:27] [INFO ] Deduced a trap composed of 77 places in 302 ms of which 1 ms to minimize.
[2022-06-09 02:22:28] [INFO ] Deduced a trap composed of 72 places in 306 ms of which 0 ms to minimize.
[2022-06-09 02:22:28] [INFO ] Deduced a trap composed of 59 places in 264 ms of which 0 ms to minimize.
[2022-06-09 02:22:28] [INFO ] Deduced a trap composed of 86 places in 301 ms of which 1 ms to minimize.
[2022-06-09 02:22:29] [INFO ] Deduced a trap composed of 39 places in 309 ms of which 1 ms to minimize.
[2022-06-09 02:22:29] [INFO ] Deduced a trap composed of 68 places in 294 ms of which 0 ms to minimize.
[2022-06-09 02:22:30] [INFO ] Deduced a trap composed of 86 places in 286 ms of which 0 ms to minimize.
[2022-06-09 02:22:30] [INFO ] Deduced a trap composed of 68 places in 306 ms of which 0 ms to minimize.
[2022-06-09 02:22:30] [INFO ] Deduced a trap composed of 66 places in 298 ms of which 0 ms to minimize.
[2022-06-09 02:22:31] [INFO ] Deduced a trap composed of 17 places in 304 ms of which 1 ms to minimize.
[2022-06-09 02:22:31] [INFO ] Deduced a trap composed of 69 places in 293 ms of which 1 ms to minimize.
[2022-06-09 02:22:32] [INFO ] Deduced a trap composed of 74 places in 275 ms of which 1 ms to minimize.
[2022-06-09 02:22:32] [INFO ] Deduced a trap composed of 71 places in 282 ms of which 0 ms to minimize.
[2022-06-09 02:22:32] [INFO ] Deduced a trap composed of 64 places in 301 ms of which 1 ms to minimize.
[2022-06-09 02:22:33] [INFO ] Deduced a trap composed of 64 places in 304 ms of which 0 ms to minimize.
[2022-06-09 02:22:33] [INFO ] Deduced a trap composed of 63 places in 286 ms of which 0 ms to minimize.
[2022-06-09 02:22:34] [INFO ] Deduced a trap composed of 67 places in 340 ms of which 0 ms to minimize.
[2022-06-09 02:22:34] [INFO ] Deduced a trap composed of 65 places in 337 ms of which 0 ms to minimize.
[2022-06-09 02:22:34] [INFO ] Deduced a trap composed of 64 places in 313 ms of which 1 ms to minimize.
[2022-06-09 02:22:35] [INFO ] Deduced a trap composed of 67 places in 309 ms of which 0 ms to minimize.
[2022-06-09 02:22:35] [INFO ] Deduced a trap composed of 65 places in 300 ms of which 1 ms to minimize.
[2022-06-09 02:22:36] [INFO ] Deduced a trap composed of 78 places in 298 ms of which 0 ms to minimize.
[2022-06-09 02:22:36] [INFO ] Deduced a trap composed of 65 places in 298 ms of which 0 ms to minimize.
[2022-06-09 02:22:36] [INFO ] Deduced a trap composed of 71 places in 265 ms of which 1 ms to minimize.
[2022-06-09 02:22:37] [INFO ] Deduced a trap composed of 69 places in 277 ms of which 0 ms to minimize.
[2022-06-09 02:22:37] [INFO ] Deduced a trap composed of 97 places in 268 ms of which 1 ms to minimize.
[2022-06-09 02:22:37] [INFO ] Deduced a trap composed of 97 places in 261 ms of which 1 ms to minimize.
[2022-06-09 02:22:38] [INFO ] Deduced a trap composed of 70 places in 265 ms of which 0 ms to minimize.
[2022-06-09 02:22:38] [INFO ] Deduced a trap composed of 68 places in 261 ms of which 0 ms to minimize.
[2022-06-09 02:22:39] [INFO ] Deduced a trap composed of 94 places in 262 ms of which 0 ms to minimize.
[2022-06-09 02:22:39] [INFO ] Deduced a trap composed of 97 places in 275 ms of which 0 ms to minimize.
[2022-06-09 02:22:39] [INFO ] Deduced a trap composed of 97 places in 267 ms of which 0 ms to minimize.
[2022-06-09 02:22:40] [INFO ] Deduced a trap composed of 98 places in 304 ms of which 1 ms to minimize.
[2022-06-09 02:22:40] [INFO ] Deduced a trap composed of 72 places in 298 ms of which 1 ms to minimize.
[2022-06-09 02:22:40] [INFO ] Deduced a trap composed of 100 places in 263 ms of which 1 ms to minimize.
[2022-06-09 02:22:41] [INFO ] Deduced a trap composed of 67 places in 259 ms of which 0 ms to minimize.
[2022-06-09 02:22:41] [INFO ] Deduced a trap composed of 99 places in 266 ms of which 0 ms to minimize.
[2022-06-09 02:22:42] [INFO ] Deduced a trap composed of 98 places in 264 ms of which 0 ms to minimize.
[2022-06-09 02:22:42] [INFO ] Deduced a trap composed of 97 places in 265 ms of which 0 ms to minimize.
[2022-06-09 02:22:42] [INFO ] Deduced a trap composed of 103 places in 265 ms of which 0 ms to minimize.
[2022-06-09 02:22:43] [INFO ] Deduced a trap composed of 64 places in 281 ms of which 1 ms to minimize.
[2022-06-09 02:22:43] [INFO ] Deduced a trap composed of 64 places in 267 ms of which 0 ms to minimize.
[2022-06-09 02:22:43] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 0 ms to minimize.
[2022-06-09 02:22:44] [INFO ] Deduced a trap composed of 101 places in 306 ms of which 0 ms to minimize.
[2022-06-09 02:22:44] [INFO ] Deduced a trap composed of 69 places in 265 ms of which 0 ms to minimize.
[2022-06-09 02:22:44] [INFO ] Deduced a trap composed of 69 places in 263 ms of which 1 ms to minimize.
[2022-06-09 02:22:45] [INFO ] Deduced a trap composed of 90 places in 263 ms of which 0 ms to minimize.
[2022-06-09 02:22:45] [INFO ] Deduced a trap composed of 98 places in 289 ms of which 0 ms to minimize.
[2022-06-09 02:22:46] [INFO ] Deduced a trap composed of 96 places in 264 ms of which 1 ms to minimize.
[2022-06-09 02:22:46] [INFO ] Deduced a trap composed of 97 places in 255 ms of which 0 ms to minimize.
[2022-06-09 02:22:46] [INFO ] Deduced a trap composed of 99 places in 296 ms of which 0 ms to minimize.
[2022-06-09 02:22:47] [INFO ] Deduced a trap composed of 68 places in 294 ms of which 1 ms to minimize.
[2022-06-09 02:22:47] [INFO ] Deduced a trap composed of 73 places in 290 ms of which 2 ms to minimize.
[2022-06-09 02:22:47] [INFO ] Deduced a trap composed of 69 places in 284 ms of which 1 ms to minimize.
[2022-06-09 02:22:48] [INFO ] Deduced a trap composed of 94 places in 343 ms of which 0 ms to minimize.
[2022-06-09 02:22:48] [INFO ] Deduced a trap composed of 99 places in 281 ms of which 0 ms to minimize.
[2022-06-09 02:22:49] [INFO ] Deduced a trap composed of 99 places in 276 ms of which 0 ms to minimize.
[2022-06-09 02:22:49] [INFO ] Deduced a trap composed of 65 places in 287 ms of which 0 ms to minimize.
[2022-06-09 02:22:49] [INFO ] Deduced a trap composed of 67 places in 289 ms of which 1 ms to minimize.
[2022-06-09 02:22:50] [INFO ] Deduced a trap composed of 67 places in 290 ms of which 1 ms to minimize.
[2022-06-09 02:22:50] [INFO ] Deduced a trap composed of 69 places in 279 ms of which 1 ms to minimize.
[2022-06-09 02:22:51] [INFO ] Deduced a trap composed of 69 places in 262 ms of which 0 ms to minimize.
[2022-06-09 02:22:51] [INFO ] Deduced a trap composed of 67 places in 297 ms of which 0 ms to minimize.
[2022-06-09 02:22:51] [INFO ] Deduced a trap composed of 66 places in 265 ms of which 1 ms to minimize.
[2022-06-09 02:22:52] [INFO ] Deduced a trap composed of 69 places in 262 ms of which 0 ms to minimize.
[2022-06-09 02:22:52] [INFO ] Deduced a trap composed of 66 places in 281 ms of which 0 ms to minimize.
[2022-06-09 02:22:52] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 02:22:52] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:22:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:22:53] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2022-06-09 02:22:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:22:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:22:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:22:53] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2022-06-09 02:22:53] [INFO ] [Nat]Added 296 Read/Feed constraints in 209 ms returned sat
[2022-06-09 02:22:54] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 0 ms to minimize.
[2022-06-09 02:22:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 387 ms
[2022-06-09 02:22:54] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 234 ms.
[2022-06-09 02:22:58] [INFO ] Deduced a trap composed of 59 places in 271 ms of which 2 ms to minimize.
[2022-06-09 02:22:58] [INFO ] Deduced a trap composed of 59 places in 257 ms of which 0 ms to minimize.
[2022-06-09 02:22:59] [INFO ] Deduced a trap composed of 46 places in 239 ms of which 0 ms to minimize.
[2022-06-09 02:22:59] [INFO ] Deduced a trap composed of 62 places in 254 ms of which 1 ms to minimize.
[2022-06-09 02:23:00] [INFO ] Deduced a trap composed of 59 places in 239 ms of which 0 ms to minimize.
[2022-06-09 02:23:00] [INFO ] Deduced a trap composed of 35 places in 238 ms of which 0 ms to minimize.
[2022-06-09 02:23:00] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 1 ms to minimize.
[2022-06-09 02:23:01] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 0 ms to minimize.
[2022-06-09 02:23:01] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 0 ms to minimize.
[2022-06-09 02:23:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3414 ms
[2022-06-09 02:23:01] [INFO ] Added : 124 causal constraints over 25 iterations in 7542 ms. Result :sat
[2022-06-09 02:23:02] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-06-09 02:23:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:23:02] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2022-06-09 02:23:02] [INFO ] [Real]Added 296 Read/Feed constraints in 199 ms returned sat
[2022-06-09 02:23:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:23:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:23:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:23:03] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2022-06-09 02:23:03] [INFO ] [Nat]Added 296 Read/Feed constraints in 200 ms returned sat
[2022-06-09 02:23:03] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 1 ms to minimize.
[2022-06-09 02:23:04] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 1 ms to minimize.
[2022-06-09 02:23:04] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 0 ms to minimize.
[2022-06-09 02:23:04] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 0 ms to minimize.
[2022-06-09 02:23:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1256 ms
[2022-06-09 02:23:05] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 219 ms.
[2022-06-09 02:23:09] [INFO ] Deduced a trap composed of 101 places in 411 ms of which 0 ms to minimize.
[2022-06-09 02:23:10] [INFO ] Deduced a trap composed of 103 places in 407 ms of which 1 ms to minimize.
[2022-06-09 02:23:10] [INFO ] Deduced a trap composed of 103 places in 418 ms of which 0 ms to minimize.
[2022-06-09 02:23:11] [INFO ] Deduced a trap composed of 97 places in 416 ms of which 1 ms to minimize.
[2022-06-09 02:23:11] [INFO ] Deduced a trap composed of 87 places in 417 ms of which 0 ms to minimize.
[2022-06-09 02:23:12] [INFO ] Deduced a trap composed of 107 places in 411 ms of which 0 ms to minimize.
[2022-06-09 02:23:12] [INFO ] Deduced a trap composed of 69 places in 415 ms of which 1 ms to minimize.
[2022-06-09 02:23:13] [INFO ] Deduced a trap composed of 69 places in 412 ms of which 1 ms to minimize.
[2022-06-09 02:23:13] [INFO ] Deduced a trap composed of 69 places in 403 ms of which 1 ms to minimize.
[2022-06-09 02:23:14] [INFO ] Deduced a trap composed of 35 places in 283 ms of which 1 ms to minimize.
[2022-06-09 02:23:14] [INFO ] Deduced a trap composed of 125 places in 433 ms of which 0 ms to minimize.
[2022-06-09 02:23:15] [INFO ] Deduced a trap composed of 123 places in 414 ms of which 0 ms to minimize.
[2022-06-09 02:23:15] [INFO ] Deduced a trap composed of 18 places in 419 ms of which 1 ms to minimize.
[2022-06-09 02:23:16] [INFO ] Deduced a trap composed of 20 places in 406 ms of which 0 ms to minimize.
[2022-06-09 02:23:17] [INFO ] Deduced a trap composed of 17 places in 412 ms of which 0 ms to minimize.
[2022-06-09 02:23:17] [INFO ] Deduced a trap composed of 85 places in 425 ms of which 1 ms to minimize.
[2022-06-09 02:23:18] [INFO ] Deduced a trap composed of 125 places in 443 ms of which 0 ms to minimize.
[2022-06-09 02:23:18] [INFO ] Deduced a trap composed of 115 places in 438 ms of which 1 ms to minimize.
[2022-06-09 02:23:19] [INFO ] Deduced a trap composed of 114 places in 433 ms of which 1 ms to minimize.
[2022-06-09 02:23:19] [INFO ] Deduced a trap composed of 130 places in 428 ms of which 0 ms to minimize.
[2022-06-09 02:23:20] [INFO ] Deduced a trap composed of 143 places in 478 ms of which 0 ms to minimize.
[2022-06-09 02:23:21] [INFO ] Deduced a trap composed of 40 places in 449 ms of which 1 ms to minimize.
[2022-06-09 02:23:21] [INFO ] Deduced a trap composed of 126 places in 434 ms of which 0 ms to minimize.
[2022-06-09 02:23:22] [INFO ] Deduced a trap composed of 124 places in 413 ms of which 0 ms to minimize.
[2022-06-09 02:23:22] [INFO ] Deduced a trap composed of 124 places in 428 ms of which 0 ms to minimize.
[2022-06-09 02:23:23] [INFO ] Deduced a trap composed of 125 places in 402 ms of which 0 ms to minimize.
[2022-06-09 02:23:23] [INFO ] Deduced a trap composed of 125 places in 440 ms of which 1 ms to minimize.
[2022-06-09 02:23:24] [INFO ] Deduced a trap composed of 116 places in 405 ms of which 1 ms to minimize.
[2022-06-09 02:23:25] [INFO ] Deduced a trap composed of 126 places in 398 ms of which 0 ms to minimize.
[2022-06-09 02:23:25] [INFO ] Deduced a trap composed of 125 places in 396 ms of which 0 ms to minimize.
[2022-06-09 02:23:26] [INFO ] Deduced a trap composed of 115 places in 396 ms of which 1 ms to minimize.
[2022-06-09 02:23:26] [INFO ] Deduced a trap composed of 139 places in 400 ms of which 1 ms to minimize.
[2022-06-09 02:23:27] [INFO ] Deduced a trap composed of 124 places in 391 ms of which 0 ms to minimize.
[2022-06-09 02:23:27] [INFO ] Deduced a trap composed of 23 places in 382 ms of which 0 ms to minimize.
[2022-06-09 02:23:28] [INFO ] Deduced a trap composed of 111 places in 383 ms of which 0 ms to minimize.
[2022-06-09 02:23:28] [INFO ] Deduced a trap composed of 136 places in 379 ms of which 1 ms to minimize.
[2022-06-09 02:23:29] [INFO ] Deduced a trap composed of 112 places in 417 ms of which 0 ms to minimize.
[2022-06-09 02:23:29] [INFO ] Deduced a trap composed of 17 places in 458 ms of which 1 ms to minimize.
[2022-06-09 02:23:30] [INFO ] Deduced a trap composed of 136 places in 429 ms of which 1 ms to minimize.
[2022-06-09 02:23:31] [INFO ] Deduced a trap composed of 130 places in 436 ms of which 0 ms to minimize.
[2022-06-09 02:23:31] [INFO ] Deduced a trap composed of 132 places in 428 ms of which 0 ms to minimize.
[2022-06-09 02:23:32] [INFO ] Deduced a trap composed of 129 places in 437 ms of which 1 ms to minimize.
[2022-06-09 02:23:32] [INFO ] Deduced a trap composed of 125 places in 429 ms of which 0 ms to minimize.
[2022-06-09 02:23:33] [INFO ] Deduced a trap composed of 134 places in 445 ms of which 0 ms to minimize.
[2022-06-09 02:23:33] [INFO ] Deduced a trap composed of 125 places in 438 ms of which 1 ms to minimize.
[2022-06-09 02:23:34] [INFO ] Deduced a trap composed of 133 places in 437 ms of which 0 ms to minimize.
[2022-06-09 02:23:35] [INFO ] Deduced a trap composed of 137 places in 432 ms of which 1 ms to minimize.
[2022-06-09 02:23:35] [INFO ] Deduced a trap composed of 125 places in 425 ms of which 0 ms to minimize.
[2022-06-09 02:23:36] [INFO ] Deduced a trap composed of 126 places in 402 ms of which 1 ms to minimize.
[2022-06-09 02:23:36] [INFO ] Deduced a trap composed of 128 places in 426 ms of which 0 ms to minimize.
[2022-06-09 02:23:37] [INFO ] Deduced a trap composed of 128 places in 394 ms of which 0 ms to minimize.
[2022-06-09 02:23:37] [INFO ] Deduced a trap composed of 122 places in 396 ms of which 1 ms to minimize.
[2022-06-09 02:23:38] [INFO ] Deduced a trap composed of 127 places in 411 ms of which 0 ms to minimize.
[2022-06-09 02:23:38] [INFO ] Deduced a trap composed of 118 places in 405 ms of which 0 ms to minimize.
[2022-06-09 02:23:39] [INFO ] Deduced a trap composed of 125 places in 411 ms of which 0 ms to minimize.
[2022-06-09 02:23:40] [INFO ] Deduced a trap composed of 125 places in 422 ms of which 0 ms to minimize.
[2022-06-09 02:23:40] [INFO ] Deduced a trap composed of 124 places in 430 ms of which 0 ms to minimize.
[2022-06-09 02:23:41] [INFO ] Deduced a trap composed of 124 places in 439 ms of which 0 ms to minimize.
[2022-06-09 02:23:41] [INFO ] Deduced a trap composed of 77 places in 449 ms of which 1 ms to minimize.
[2022-06-09 02:23:42] [INFO ] Deduced a trap composed of 7 places in 457 ms of which 1 ms to minimize.
[2022-06-09 02:23:43] [INFO ] Deduced a trap composed of 123 places in 444 ms of which 0 ms to minimize.
[2022-06-09 02:23:43] [INFO ] Deduced a trap composed of 120 places in 411 ms of which 1 ms to minimize.
[2022-06-09 02:23:44] [INFO ] Deduced a trap composed of 117 places in 431 ms of which 0 ms to minimize.
[2022-06-09 02:23:44] [INFO ] Deduced a trap composed of 122 places in 512 ms of which 1 ms to minimize.
[2022-06-09 02:23:45] [INFO ] Deduced a trap composed of 125 places in 438 ms of which 0 ms to minimize.
[2022-06-09 02:23:45] [INFO ] Deduced a trap composed of 111 places in 441 ms of which 0 ms to minimize.
[2022-06-09 02:23:46] [INFO ] Deduced a trap composed of 112 places in 447 ms of which 1 ms to minimize.
[2022-06-09 02:23:47] [INFO ] Deduced a trap composed of 35 places in 442 ms of which 1 ms to minimize.
[2022-06-09 02:23:47] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2022-06-09 02:23:47] [INFO ] Trap strengthening (SAT) tested/added 70/69 trap constraints in 38535 ms
[2022-06-09 02:23:47] [INFO ] Added : 127 causal constraints over 27 iterations in 42991 ms.(timeout) Result :sat
[2022-06-09 02:23:47] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:23:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:23:48] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2022-06-09 02:23:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:23:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:23:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:23:49] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2022-06-09 02:23:49] [INFO ] [Nat]Added 296 Read/Feed constraints in 197 ms returned sat
[2022-06-09 02:23:49] [INFO ] Deduced a trap composed of 7 places in 395 ms of which 1 ms to minimize.
[2022-06-09 02:23:50] [INFO ] Deduced a trap composed of 51 places in 308 ms of which 0 ms to minimize.
[2022-06-09 02:23:50] [INFO ] Deduced a trap composed of 64 places in 302 ms of which 0 ms to minimize.
[2022-06-09 02:23:50] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 1 ms to minimize.
[2022-06-09 02:23:51] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 1 ms to minimize.
[2022-06-09 02:23:51] [INFO ] Deduced a trap composed of 18 places in 309 ms of which 1 ms to minimize.
[2022-06-09 02:23:51] [INFO ] Deduced a trap composed of 65 places in 306 ms of which 1 ms to minimize.
[2022-06-09 02:23:52] [INFO ] Deduced a trap composed of 14 places in 316 ms of which 1 ms to minimize.
[2022-06-09 02:23:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3179 ms
[2022-06-09 02:23:52] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 239 ms.
[2022-06-09 02:23:55] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 0 ms to minimize.
[2022-06-09 02:23:55] [INFO ] Deduced a trap composed of 35 places in 200 ms of which 1 ms to minimize.
[2022-06-09 02:23:56] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 0 ms to minimize.
[2022-06-09 02:23:56] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 0 ms to minimize.
[2022-06-09 02:23:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1448 ms
[2022-06-09 02:23:57] [INFO ] Added : 81 causal constraints over 17 iterations in 4622 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, -1, -1, -1] Max seen :[0, 0, 19668, 0]
Incomplete Parikh walk after 959200 steps, including 1000 resets, run finished after 8054 ms. (steps per millisecond=119 ) properties (out of 4) seen :2132 could not realise parikh vector
Interrupted Parikh walk after 3240422 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=108 ) properties (out of 4) seen :11
Incomplete Parikh walk after 1194400 steps, including 1000 resets, run finished after 10355 ms. (steps per millisecond=115 ) properties (out of 4) seen :54070 could not realise parikh vector
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 70 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 157 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 02:24:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:24:45] [INFO ] Computed 8 place invariants in 19 ms
[2022-06-09 02:24:46] [INFO ] Implicit Places using invariants in 490 ms returned []
[2022-06-09 02:24:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:24:46] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 02:24:46] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:24:54] [INFO ] Implicit Places using invariants and state equation in 7689 ms returned []
Implicit Place search using SMT with State Equation took 8183 ms to find 0 implicit places.
[2022-06-09 02:24:54] [INFO ] Redundant transitions in 318 ms returned []
[2022-06-09 02:24:54] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:24:54] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 02:24:55] [INFO ] Dead Transitions using invariants and state equation in 1074 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:24:55] [INFO ] Computed 8 place invariants in 17 ms
Incomplete random walk after 1000057 steps, including 2 resets, run finished after 650 ms. (steps per millisecond=1538 ) properties (out of 4) seen :424
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2015 ms. (steps per millisecond=496 ) properties (out of 4) seen :3926
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2015 ms. (steps per millisecond=496 ) properties (out of 4) seen :4213
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2046 ms. (steps per millisecond=488 ) properties (out of 4) seen :19594
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2022 ms. (steps per millisecond=494 ) properties (out of 4) seen :3
[2022-06-09 02:25:04] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:25:04] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 02:25:04] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:25:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:25:04] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2022-06-09 02:25:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:25:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:25:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:25:05] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2022-06-09 02:25:05] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:25:05] [INFO ] [Nat]Added 296 Read/Feed constraints in 230 ms returned sat
[2022-06-09 02:25:06] [INFO ] Deduced a trap composed of 51 places in 471 ms of which 0 ms to minimize.
[2022-06-09 02:25:06] [INFO ] Deduced a trap composed of 21 places in 474 ms of which 3 ms to minimize.
[2022-06-09 02:25:07] [INFO ] Deduced a trap composed of 17 places in 453 ms of which 0 ms to minimize.
[2022-06-09 02:25:07] [INFO ] Deduced a trap composed of 9 places in 405 ms of which 0 ms to minimize.
[2022-06-09 02:25:08] [INFO ] Deduced a trap composed of 88 places in 306 ms of which 0 ms to minimize.
[2022-06-09 02:25:08] [INFO ] Deduced a trap composed of 81 places in 307 ms of which 0 ms to minimize.
[2022-06-09 02:25:09] [INFO ] Deduced a trap composed of 79 places in 279 ms of which 1 ms to minimize.
[2022-06-09 02:25:09] [INFO ] Deduced a trap composed of 68 places in 322 ms of which 0 ms to minimize.
[2022-06-09 02:25:09] [INFO ] Deduced a trap composed of 67 places in 313 ms of which 0 ms to minimize.
[2022-06-09 02:25:10] [INFO ] Deduced a trap composed of 19 places in 301 ms of which 1 ms to minimize.
[2022-06-09 02:25:10] [INFO ] Deduced a trap composed of 16 places in 325 ms of which 1 ms to minimize.
[2022-06-09 02:25:11] [INFO ] Deduced a trap composed of 86 places in 307 ms of which 1 ms to minimize.
[2022-06-09 02:25:11] [INFO ] Deduced a trap composed of 66 places in 290 ms of which 1 ms to minimize.
[2022-06-09 02:25:11] [INFO ] Deduced a trap composed of 84 places in 303 ms of which 0 ms to minimize.
[2022-06-09 02:25:12] [INFO ] Deduced a trap composed of 83 places in 349 ms of which 1 ms to minimize.
[2022-06-09 02:25:12] [INFO ] Deduced a trap composed of 83 places in 314 ms of which 3 ms to minimize.
[2022-06-09 02:25:13] [INFO ] Deduced a trap composed of 92 places in 296 ms of which 1 ms to minimize.
[2022-06-09 02:25:13] [INFO ] Deduced a trap composed of 92 places in 290 ms of which 0 ms to minimize.
[2022-06-09 02:25:13] [INFO ] Deduced a trap composed of 97 places in 288 ms of which 0 ms to minimize.
[2022-06-09 02:25:14] [INFO ] Deduced a trap composed of 67 places in 223 ms of which 1 ms to minimize.
[2022-06-09 02:25:14] [INFO ] Deduced a trap composed of 67 places in 220 ms of which 0 ms to minimize.
[2022-06-09 02:25:14] [INFO ] Deduced a trap composed of 64 places in 229 ms of which 1 ms to minimize.
[2022-06-09 02:25:15] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 0 ms to minimize.
[2022-06-09 02:25:15] [INFO ] Deduced a trap composed of 67 places in 296 ms of which 1 ms to minimize.
[2022-06-09 02:25:15] [INFO ] Deduced a trap composed of 68 places in 297 ms of which 3 ms to minimize.
[2022-06-09 02:25:16] [INFO ] Deduced a trap composed of 93 places in 283 ms of which 1 ms to minimize.
[2022-06-09 02:25:16] [INFO ] Deduced a trap composed of 66 places in 276 ms of which 0 ms to minimize.
[2022-06-09 02:25:17] [INFO ] Deduced a trap composed of 68 places in 298 ms of which 0 ms to minimize.
[2022-06-09 02:25:17] [INFO ] Deduced a trap composed of 89 places in 280 ms of which 1 ms to minimize.
[2022-06-09 02:25:17] [INFO ] Deduced a trap composed of 68 places in 282 ms of which 1 ms to minimize.
[2022-06-09 02:25:18] [INFO ] Deduced a trap composed of 68 places in 288 ms of which 1 ms to minimize.
[2022-06-09 02:25:18] [INFO ] Deduced a trap composed of 65 places in 298 ms of which 0 ms to minimize.
[2022-06-09 02:25:19] [INFO ] Deduced a trap composed of 90 places in 275 ms of which 0 ms to minimize.
[2022-06-09 02:25:19] [INFO ] Deduced a trap composed of 91 places in 281 ms of which 0 ms to minimize.
[2022-06-09 02:25:19] [INFO ] Deduced a trap composed of 88 places in 291 ms of which 0 ms to minimize.
[2022-06-09 02:25:20] [INFO ] Deduced a trap composed of 90 places in 270 ms of which 0 ms to minimize.
[2022-06-09 02:25:20] [INFO ] Deduced a trap composed of 83 places in 286 ms of which 1 ms to minimize.
[2022-06-09 02:25:20] [INFO ] Deduced a trap composed of 67 places in 293 ms of which 7 ms to minimize.
[2022-06-09 02:25:21] [INFO ] Deduced a trap composed of 66 places in 294 ms of which 0 ms to minimize.
[2022-06-09 02:25:21] [INFO ] Deduced a trap composed of 91 places in 297 ms of which 0 ms to minimize.
[2022-06-09 02:25:22] [INFO ] Deduced a trap composed of 69 places in 267 ms of which 0 ms to minimize.
[2022-06-09 02:25:22] [INFO ] Deduced a trap composed of 68 places in 292 ms of which 0 ms to minimize.
[2022-06-09 02:25:22] [INFO ] Deduced a trap composed of 62 places in 302 ms of which 0 ms to minimize.
[2022-06-09 02:25:23] [INFO ] Deduced a trap composed of 78 places in 309 ms of which 0 ms to minimize.
[2022-06-09 02:25:23] [INFO ] Deduced a trap composed of 10 places in 307 ms of which 0 ms to minimize.
[2022-06-09 02:25:24] [INFO ] Deduced a trap composed of 87 places in 296 ms of which 0 ms to minimize.
[2022-06-09 02:25:24] [INFO ] Deduced a trap composed of 68 places in 310 ms of which 0 ms to minimize.
[2022-06-09 02:25:24] [INFO ] Deduced a trap composed of 88 places in 299 ms of which 1 ms to minimize.
[2022-06-09 02:25:25] [INFO ] Deduced a trap composed of 77 places in 292 ms of which 0 ms to minimize.
[2022-06-09 02:25:25] [INFO ] Deduced a trap composed of 72 places in 290 ms of which 0 ms to minimize.
[2022-06-09 02:25:26] [INFO ] Deduced a trap composed of 59 places in 299 ms of which 1 ms to minimize.
[2022-06-09 02:25:26] [INFO ] Deduced a trap composed of 86 places in 287 ms of which 0 ms to minimize.
[2022-06-09 02:25:26] [INFO ] Deduced a trap composed of 39 places in 305 ms of which 0 ms to minimize.
[2022-06-09 02:25:27] [INFO ] Deduced a trap composed of 68 places in 279 ms of which 1 ms to minimize.
[2022-06-09 02:25:27] [INFO ] Deduced a trap composed of 86 places in 284 ms of which 0 ms to minimize.
[2022-06-09 02:25:27] [INFO ] Deduced a trap composed of 68 places in 287 ms of which 0 ms to minimize.
[2022-06-09 02:25:28] [INFO ] Deduced a trap composed of 66 places in 300 ms of which 0 ms to minimize.
[2022-06-09 02:25:28] [INFO ] Deduced a trap composed of 17 places in 276 ms of which 0 ms to minimize.
[2022-06-09 02:25:29] [INFO ] Deduced a trap composed of 69 places in 292 ms of which 0 ms to minimize.
[2022-06-09 02:25:29] [INFO ] Deduced a trap composed of 74 places in 298 ms of which 0 ms to minimize.
[2022-06-09 02:25:29] [INFO ] Deduced a trap composed of 71 places in 291 ms of which 0 ms to minimize.
[2022-06-09 02:25:30] [INFO ] Deduced a trap composed of 64 places in 283 ms of which 0 ms to minimize.
[2022-06-09 02:25:30] [INFO ] Deduced a trap composed of 64 places in 274 ms of which 0 ms to minimize.
[2022-06-09 02:25:31] [INFO ] Deduced a trap composed of 63 places in 263 ms of which 0 ms to minimize.
[2022-06-09 02:25:31] [INFO ] Deduced a trap composed of 67 places in 341 ms of which 0 ms to minimize.
[2022-06-09 02:25:31] [INFO ] Deduced a trap composed of 65 places in 320 ms of which 0 ms to minimize.
[2022-06-09 02:25:32] [INFO ] Deduced a trap composed of 64 places in 316 ms of which 1 ms to minimize.
[2022-06-09 02:25:32] [INFO ] Deduced a trap composed of 67 places in 332 ms of which 0 ms to minimize.
[2022-06-09 02:25:33] [INFO ] Deduced a trap composed of 65 places in 341 ms of which 0 ms to minimize.
[2022-06-09 02:25:33] [INFO ] Deduced a trap composed of 78 places in 317 ms of which 0 ms to minimize.
[2022-06-09 02:25:34] [INFO ] Deduced a trap composed of 65 places in 339 ms of which 0 ms to minimize.
[2022-06-09 02:25:34] [INFO ] Deduced a trap composed of 71 places in 285 ms of which 0 ms to minimize.
[2022-06-09 02:25:34] [INFO ] Deduced a trap composed of 69 places in 292 ms of which 0 ms to minimize.
[2022-06-09 02:25:35] [INFO ] Deduced a trap composed of 97 places in 275 ms of which 1 ms to minimize.
[2022-06-09 02:25:35] [INFO ] Deduced a trap composed of 97 places in 275 ms of which 0 ms to minimize.
[2022-06-09 02:25:35] [INFO ] Deduced a trap composed of 70 places in 265 ms of which 0 ms to minimize.
[2022-06-09 02:25:36] [INFO ] Deduced a trap composed of 68 places in 312 ms of which 1 ms to minimize.
[2022-06-09 02:25:36] [INFO ] Deduced a trap composed of 94 places in 306 ms of which 1 ms to minimize.
[2022-06-09 02:25:37] [INFO ] Deduced a trap composed of 97 places in 304 ms of which 0 ms to minimize.
[2022-06-09 02:25:37] [INFO ] Deduced a trap composed of 97 places in 307 ms of which 0 ms to minimize.
[2022-06-09 02:25:37] [INFO ] Deduced a trap composed of 98 places in 314 ms of which 1 ms to minimize.
[2022-06-09 02:25:38] [INFO ] Deduced a trap composed of 72 places in 304 ms of which 0 ms to minimize.
[2022-06-09 02:25:38] [INFO ] Deduced a trap composed of 100 places in 305 ms of which 0 ms to minimize.
[2022-06-09 02:25:39] [INFO ] Deduced a trap composed of 67 places in 305 ms of which 1 ms to minimize.
[2022-06-09 02:25:39] [INFO ] Deduced a trap composed of 99 places in 315 ms of which 0 ms to minimize.
[2022-06-09 02:25:40] [INFO ] Deduced a trap composed of 98 places in 316 ms of which 0 ms to minimize.
[2022-06-09 02:25:40] [INFO ] Deduced a trap composed of 97 places in 313 ms of which 0 ms to minimize.
[2022-06-09 02:25:40] [INFO ] Deduced a trap composed of 103 places in 304 ms of which 0 ms to minimize.
[2022-06-09 02:25:41] [INFO ] Deduced a trap composed of 64 places in 309 ms of which 0 ms to minimize.
[2022-06-09 02:25:41] [INFO ] Deduced a trap composed of 64 places in 299 ms of which 0 ms to minimize.
[2022-06-09 02:25:42] [INFO ] Deduced a trap composed of 64 places in 302 ms of which 0 ms to minimize.
[2022-06-09 02:25:42] [INFO ] Deduced a trap composed of 101 places in 297 ms of which 0 ms to minimize.
[2022-06-09 02:25:42] [INFO ] Deduced a trap composed of 69 places in 300 ms of which 1 ms to minimize.
[2022-06-09 02:25:43] [INFO ] Deduced a trap composed of 69 places in 291 ms of which 1 ms to minimize.
[2022-06-09 02:25:43] [INFO ] Deduced a trap composed of 90 places in 292 ms of which 0 ms to minimize.
[2022-06-09 02:25:44] [INFO ] Deduced a trap composed of 98 places in 301 ms of which 1 ms to minimize.
[2022-06-09 02:25:44] [INFO ] Deduced a trap composed of 96 places in 296 ms of which 1 ms to minimize.
[2022-06-09 02:25:44] [INFO ] Deduced a trap composed of 97 places in 292 ms of which 1 ms to minimize.
[2022-06-09 02:25:45] [INFO ] Deduced a trap composed of 99 places in 286 ms of which 0 ms to minimize.
[2022-06-09 02:25:45] [INFO ] Deduced a trap composed of 68 places in 289 ms of which 0 ms to minimize.
[2022-06-09 02:25:46] [INFO ] Deduced a trap composed of 73 places in 303 ms of which 1 ms to minimize.
[2022-06-09 02:25:46] [INFO ] Deduced a trap composed of 69 places in 305 ms of which 0 ms to minimize.
[2022-06-09 02:25:46] [INFO ] Deduced a trap composed of 94 places in 339 ms of which 1 ms to minimize.
[2022-06-09 02:25:47] [INFO ] Deduced a trap composed of 99 places in 294 ms of which 0 ms to minimize.
[2022-06-09 02:25:47] [INFO ] Deduced a trap composed of 99 places in 267 ms of which 0 ms to minimize.
[2022-06-09 02:25:48] [INFO ] Deduced a trap composed of 65 places in 292 ms of which 1 ms to minimize.
[2022-06-09 02:25:48] [INFO ] Deduced a trap composed of 67 places in 273 ms of which 0 ms to minimize.
[2022-06-09 02:25:48] [INFO ] Deduced a trap composed of 67 places in 268 ms of which 0 ms to minimize.
[2022-06-09 02:25:49] [INFO ] Deduced a trap composed of 69 places in 286 ms of which 0 ms to minimize.
[2022-06-09 02:25:49] [INFO ] Deduced a trap composed of 69 places in 289 ms of which 1 ms to minimize.
[2022-06-09 02:25:49] [INFO ] Deduced a trap composed of 67 places in 286 ms of which 1 ms to minimize.
[2022-06-09 02:25:49] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 02:25:49] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:25:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:25:50] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2022-06-09 02:25:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:25:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:25:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:25:51] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2022-06-09 02:25:51] [INFO ] [Nat]Added 296 Read/Feed constraints in 214 ms returned sat
[2022-06-09 02:25:51] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 0 ms to minimize.
[2022-06-09 02:25:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 371 ms
[2022-06-09 02:25:51] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 227 ms.
[2022-06-09 02:25:55] [INFO ] Deduced a trap composed of 59 places in 266 ms of which 0 ms to minimize.
[2022-06-09 02:25:56] [INFO ] Deduced a trap composed of 59 places in 258 ms of which 0 ms to minimize.
[2022-06-09 02:25:56] [INFO ] Deduced a trap composed of 46 places in 257 ms of which 0 ms to minimize.
[2022-06-09 02:25:57] [INFO ] Deduced a trap composed of 62 places in 257 ms of which 0 ms to minimize.
[2022-06-09 02:25:57] [INFO ] Deduced a trap composed of 59 places in 260 ms of which 0 ms to minimize.
[2022-06-09 02:25:57] [INFO ] Deduced a trap composed of 35 places in 260 ms of which 0 ms to minimize.
[2022-06-09 02:25:58] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 0 ms to minimize.
[2022-06-09 02:25:58] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 0 ms to minimize.
[2022-06-09 02:25:58] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 0 ms to minimize.
[2022-06-09 02:25:59] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3530 ms
[2022-06-09 02:25:59] [INFO ] Added : 124 causal constraints over 25 iterations in 7637 ms. Result :sat
[2022-06-09 02:25:59] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:25:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:25:59] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2022-06-09 02:26:00] [INFO ] [Real]Added 296 Read/Feed constraints in 207 ms returned sat
[2022-06-09 02:26:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:26:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:26:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:26:00] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2022-06-09 02:26:00] [INFO ] [Nat]Added 296 Read/Feed constraints in 207 ms returned sat
[2022-06-09 02:26:01] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 1 ms to minimize.
[2022-06-09 02:26:01] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 0 ms to minimize.
[2022-06-09 02:26:01] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 0 ms to minimize.
[2022-06-09 02:26:02] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 1 ms to minimize.
[2022-06-09 02:26:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1218 ms
[2022-06-09 02:26:02] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 207 ms.
[2022-06-09 02:26:06] [INFO ] Deduced a trap composed of 101 places in 422 ms of which 0 ms to minimize.
[2022-06-09 02:26:07] [INFO ] Deduced a trap composed of 103 places in 409 ms of which 0 ms to minimize.
[2022-06-09 02:26:08] [INFO ] Deduced a trap composed of 103 places in 428 ms of which 1 ms to minimize.
[2022-06-09 02:26:08] [INFO ] Deduced a trap composed of 97 places in 415 ms of which 1 ms to minimize.
[2022-06-09 02:26:09] [INFO ] Deduced a trap composed of 87 places in 421 ms of which 0 ms to minimize.
[2022-06-09 02:26:09] [INFO ] Deduced a trap composed of 107 places in 467 ms of which 1 ms to minimize.
[2022-06-09 02:26:10] [INFO ] Deduced a trap composed of 69 places in 451 ms of which 0 ms to minimize.
[2022-06-09 02:26:10] [INFO ] Deduced a trap composed of 69 places in 452 ms of which 0 ms to minimize.
[2022-06-09 02:26:11] [INFO ] Deduced a trap composed of 69 places in 448 ms of which 0 ms to minimize.
[2022-06-09 02:26:11] [INFO ] Deduced a trap composed of 35 places in 286 ms of which 1 ms to minimize.
[2022-06-09 02:26:12] [INFO ] Deduced a trap composed of 125 places in 455 ms of which 0 ms to minimize.
[2022-06-09 02:26:13] [INFO ] Deduced a trap composed of 123 places in 482 ms of which 1 ms to minimize.
[2022-06-09 02:26:13] [INFO ] Deduced a trap composed of 18 places in 457 ms of which 1 ms to minimize.
[2022-06-09 02:26:14] [INFO ] Deduced a trap composed of 20 places in 455 ms of which 0 ms to minimize.
[2022-06-09 02:26:14] [INFO ] Deduced a trap composed of 17 places in 471 ms of which 1 ms to minimize.
[2022-06-09 02:26:15] [INFO ] Deduced a trap composed of 85 places in 437 ms of which 0 ms to minimize.
[2022-06-09 02:26:16] [INFO ] Deduced a trap composed of 125 places in 417 ms of which 0 ms to minimize.
[2022-06-09 02:26:16] [INFO ] Deduced a trap composed of 115 places in 444 ms of which 0 ms to minimize.
[2022-06-09 02:26:17] [INFO ] Deduced a trap composed of 114 places in 458 ms of which 1 ms to minimize.
[2022-06-09 02:26:17] [INFO ] Deduced a trap composed of 130 places in 488 ms of which 0 ms to minimize.
[2022-06-09 02:26:18] [INFO ] Deduced a trap composed of 143 places in 457 ms of which 1 ms to minimize.
[2022-06-09 02:26:19] [INFO ] Deduced a trap composed of 40 places in 451 ms of which 1 ms to minimize.
[2022-06-09 02:26:19] [INFO ] Deduced a trap composed of 126 places in 416 ms of which 0 ms to minimize.
[2022-06-09 02:26:20] [INFO ] Deduced a trap composed of 124 places in 469 ms of which 1 ms to minimize.
[2022-06-09 02:26:20] [INFO ] Deduced a trap composed of 124 places in 410 ms of which 1 ms to minimize.
[2022-06-09 02:26:21] [INFO ] Deduced a trap composed of 125 places in 444 ms of which 0 ms to minimize.
[2022-06-09 02:26:21] [INFO ] Deduced a trap composed of 125 places in 414 ms of which 0 ms to minimize.
[2022-06-09 02:26:22] [INFO ] Deduced a trap composed of 116 places in 430 ms of which 1 ms to minimize.
[2022-06-09 02:26:23] [INFO ] Deduced a trap composed of 126 places in 437 ms of which 0 ms to minimize.
[2022-06-09 02:26:23] [INFO ] Deduced a trap composed of 125 places in 437 ms of which 1 ms to minimize.
[2022-06-09 02:26:24] [INFO ] Deduced a trap composed of 115 places in 429 ms of which 0 ms to minimize.
[2022-06-09 02:26:24] [INFO ] Deduced a trap composed of 139 places in 431 ms of which 0 ms to minimize.
[2022-06-09 02:26:25] [INFO ] Deduced a trap composed of 124 places in 450 ms of which 0 ms to minimize.
[2022-06-09 02:26:25] [INFO ] Deduced a trap composed of 23 places in 432 ms of which 0 ms to minimize.
[2022-06-09 02:26:26] [INFO ] Deduced a trap composed of 111 places in 420 ms of which 0 ms to minimize.
[2022-06-09 02:26:27] [INFO ] Deduced a trap composed of 136 places in 441 ms of which 1 ms to minimize.
[2022-06-09 02:26:27] [INFO ] Deduced a trap composed of 112 places in 428 ms of which 1 ms to minimize.
[2022-06-09 02:26:28] [INFO ] Deduced a trap composed of 17 places in 422 ms of which 1 ms to minimize.
[2022-06-09 02:26:28] [INFO ] Deduced a trap composed of 136 places in 421 ms of which 1 ms to minimize.
[2022-06-09 02:26:29] [INFO ] Deduced a trap composed of 130 places in 424 ms of which 0 ms to minimize.
[2022-06-09 02:26:29] [INFO ] Deduced a trap composed of 132 places in 419 ms of which 1 ms to minimize.
[2022-06-09 02:26:30] [INFO ] Deduced a trap composed of 129 places in 437 ms of which 1 ms to minimize.
[2022-06-09 02:26:31] [INFO ] Deduced a trap composed of 125 places in 429 ms of which 0 ms to minimize.
[2022-06-09 02:26:31] [INFO ] Deduced a trap composed of 134 places in 412 ms of which 1 ms to minimize.
[2022-06-09 02:26:32] [INFO ] Deduced a trap composed of 125 places in 432 ms of which 1 ms to minimize.
[2022-06-09 02:26:32] [INFO ] Deduced a trap composed of 133 places in 415 ms of which 0 ms to minimize.
[2022-06-09 02:26:33] [INFO ] Deduced a trap composed of 137 places in 420 ms of which 1 ms to minimize.
[2022-06-09 02:26:33] [INFO ] Deduced a trap composed of 125 places in 413 ms of which 0 ms to minimize.
[2022-06-09 02:26:34] [INFO ] Deduced a trap composed of 126 places in 414 ms of which 1 ms to minimize.
[2022-06-09 02:26:34] [INFO ] Deduced a trap composed of 128 places in 417 ms of which 1 ms to minimize.
[2022-06-09 02:26:35] [INFO ] Deduced a trap composed of 128 places in 413 ms of which 0 ms to minimize.
[2022-06-09 02:26:36] [INFO ] Deduced a trap composed of 122 places in 415 ms of which 1 ms to minimize.
[2022-06-09 02:26:36] [INFO ] Deduced a trap composed of 127 places in 424 ms of which 0 ms to minimize.
[2022-06-09 02:26:37] [INFO ] Deduced a trap composed of 118 places in 412 ms of which 1 ms to minimize.
[2022-06-09 02:26:37] [INFO ] Deduced a trap composed of 125 places in 414 ms of which 0 ms to minimize.
[2022-06-09 02:26:38] [INFO ] Deduced a trap composed of 125 places in 411 ms of which 0 ms to minimize.
[2022-06-09 02:26:38] [INFO ] Deduced a trap composed of 124 places in 411 ms of which 0 ms to minimize.
[2022-06-09 02:26:39] [INFO ] Deduced a trap composed of 124 places in 405 ms of which 1 ms to minimize.
[2022-06-09 02:26:39] [INFO ] Deduced a trap composed of 77 places in 434 ms of which 0 ms to minimize.
[2022-06-09 02:26:40] [INFO ] Deduced a trap composed of 7 places in 446 ms of which 0 ms to minimize.
[2022-06-09 02:26:40] [INFO ] Deduced a trap composed of 123 places in 405 ms of which 0 ms to minimize.
[2022-06-09 02:26:41] [INFO ] Deduced a trap composed of 120 places in 409 ms of which 0 ms to minimize.
[2022-06-09 02:26:42] [INFO ] Deduced a trap composed of 117 places in 413 ms of which 0 ms to minimize.
[2022-06-09 02:26:42] [INFO ] Deduced a trap composed of 122 places in 410 ms of which 1 ms to minimize.
[2022-06-09 02:26:43] [INFO ] Deduced a trap composed of 125 places in 411 ms of which 1 ms to minimize.
[2022-06-09 02:26:43] [INFO ] Deduced a trap composed of 111 places in 437 ms of which 0 ms to minimize.
[2022-06-09 02:26:44] [INFO ] Deduced a trap composed of 112 places in 438 ms of which 0 ms to minimize.
[2022-06-09 02:26:44] [INFO ] Deduced a trap composed of 35 places in 435 ms of which 1 ms to minimize.
[2022-06-09 02:26:45] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
[2022-06-09 02:26:45] [INFO ] Trap strengthening (SAT) tested/added 70/69 trap constraints in 38898 ms
[2022-06-09 02:26:45] [INFO ] Deduced a trap composed of 7 places in 531 ms of which 0 ms to minimize.
[2022-06-09 02:26: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: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 02:26:45] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:26:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:26:46] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2022-06-09 02:26:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:26:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:26:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:26:46] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2022-06-09 02:26:47] [INFO ] [Nat]Added 296 Read/Feed constraints in 192 ms returned sat
[2022-06-09 02:26:47] [INFO ] Deduced a trap composed of 7 places in 366 ms of which 0 ms to minimize.
[2022-06-09 02:26:47] [INFO ] Deduced a trap composed of 51 places in 315 ms of which 0 ms to minimize.
[2022-06-09 02:26:48] [INFO ] Deduced a trap composed of 64 places in 299 ms of which 1 ms to minimize.
[2022-06-09 02:26:48] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 0 ms to minimize.
[2022-06-09 02:26:48] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 0 ms to minimize.
[2022-06-09 02:26:49] [INFO ] Deduced a trap composed of 18 places in 321 ms of which 0 ms to minimize.
[2022-06-09 02:26:49] [INFO ] Deduced a trap composed of 65 places in 309 ms of which 0 ms to minimize.
[2022-06-09 02:26:50] [INFO ] Deduced a trap composed of 14 places in 279 ms of which 0 ms to minimize.
[2022-06-09 02:26:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3066 ms
[2022-06-09 02:26:50] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 241 ms.
[2022-06-09 02:26:53] [INFO ] Deduced a trap composed of 35 places in 215 ms of which 1 ms to minimize.
[2022-06-09 02:26:53] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 0 ms to minimize.
[2022-06-09 02:26:53] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 0 ms to minimize.
[2022-06-09 02:26:54] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 0 ms to minimize.
[2022-06-09 02:26:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1502 ms
[2022-06-09 02:26:54] [INFO ] Added : 81 causal constraints over 17 iterations in 4648 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, -1, -1, -1] Max seen :[0, 0, 54070, 0]
Incomplete Parikh walk after 959200 steps, including 1000 resets, run finished after 7613 ms. (steps per millisecond=125 ) properties (out of 4) seen :33 could not realise parikh vector
Incomplete Parikh walk after 1194400 steps, including 1000 resets, run finished after 9593 ms. (steps per millisecond=124 ) properties (out of 4) seen :54536 could not realise parikh vector
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 55 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 54 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 02:27:12] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:27:12] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 02:27:12] [INFO ] Implicit Places using invariants in 498 ms returned []
[2022-06-09 02:27:12] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:27:12] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 02:27:13] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:27:19] [INFO ] Implicit Places using invariants and state equation in 6962 ms returned []
Implicit Place search using SMT with State Equation took 7482 ms to find 0 implicit places.
[2022-06-09 02:27:19] [INFO ] Redundant transitions in 234 ms returned []
[2022-06-09 02:27:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:27:20] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 02:27:21] [INFO ] Dead Transitions using invariants and state equation in 1095 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:27:21] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 1000113 steps, including 2 resets, run finished after 588 ms. (steps per millisecond=1700 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1887 ms. (steps per millisecond=529 ) properties (out of 4) seen :3863
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1943 ms. (steps per millisecond=514 ) properties (out of 4) seen :4047
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1899 ms. (steps per millisecond=526 ) properties (out of 4) seen :19641
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1936 ms. (steps per millisecond=516 ) properties (out of 4) seen :4273
[2022-06-09 02:27:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:27:29] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 02:27:29] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:27:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:27:29] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2022-06-09 02:27:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:27:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:27:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:27:30] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2022-06-09 02:27:30] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:27:30] [INFO ] [Nat]Added 296 Read/Feed constraints in 226 ms returned sat
[2022-06-09 02:27:31] [INFO ] Deduced a trap composed of 51 places in 489 ms of which 1 ms to minimize.
[2022-06-09 02:27:31] [INFO ] Deduced a trap composed of 21 places in 462 ms of which 0 ms to minimize.
[2022-06-09 02:27:32] [INFO ] Deduced a trap composed of 17 places in 457 ms of which 0 ms to minimize.
[2022-06-09 02:27:32] [INFO ] Deduced a trap composed of 9 places in 395 ms of which 0 ms to minimize.
[2022-06-09 02:27:33] [INFO ] Deduced a trap composed of 88 places in 306 ms of which 0 ms to minimize.
[2022-06-09 02:27:33] [INFO ] Deduced a trap composed of 81 places in 320 ms of which 0 ms to minimize.
[2022-06-09 02:27:34] [INFO ] Deduced a trap composed of 79 places in 333 ms of which 0 ms to minimize.
[2022-06-09 02:27:34] [INFO ] Deduced a trap composed of 68 places in 287 ms of which 1 ms to minimize.
[2022-06-09 02:27:34] [INFO ] Deduced a trap composed of 67 places in 285 ms of which 0 ms to minimize.
[2022-06-09 02:27:35] [INFO ] Deduced a trap composed of 19 places in 321 ms of which 1 ms to minimize.
[2022-06-09 02:27:35] [INFO ] Deduced a trap composed of 16 places in 325 ms of which 0 ms to minimize.
[2022-06-09 02:27:36] [INFO ] Deduced a trap composed of 86 places in 300 ms of which 1 ms to minimize.
[2022-06-09 02:27:36] [INFO ] Deduced a trap composed of 66 places in 296 ms of which 0 ms to minimize.
[2022-06-09 02:27:36] [INFO ] Deduced a trap composed of 84 places in 303 ms of which 0 ms to minimize.
[2022-06-09 02:27:37] [INFO ] Deduced a trap composed of 83 places in 302 ms of which 0 ms to minimize.
[2022-06-09 02:27:37] [INFO ] Deduced a trap composed of 83 places in 299 ms of which 0 ms to minimize.
[2022-06-09 02:27:38] [INFO ] Deduced a trap composed of 92 places in 295 ms of which 0 ms to minimize.
[2022-06-09 02:27:38] [INFO ] Deduced a trap composed of 92 places in 304 ms of which 0 ms to minimize.
[2022-06-09 02:27:38] [INFO ] Deduced a trap composed of 97 places in 301 ms of which 0 ms to minimize.
[2022-06-09 02:27:39] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 0 ms to minimize.
[2022-06-09 02:27:39] [INFO ] Deduced a trap composed of 67 places in 249 ms of which 0 ms to minimize.
[2022-06-09 02:27:39] [INFO ] Deduced a trap composed of 64 places in 265 ms of which 0 ms to minimize.
[2022-06-09 02:27:40] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 1 ms to minimize.
[2022-06-09 02:27:40] [INFO ] Deduced a trap composed of 67 places in 333 ms of which 1 ms to minimize.
[2022-06-09 02:27:41] [INFO ] Deduced a trap composed of 68 places in 305 ms of which 0 ms to minimize.
[2022-06-09 02:27:41] [INFO ] Deduced a trap composed of 93 places in 320 ms of which 0 ms to minimize.
[2022-06-09 02:27:41] [INFO ] Deduced a trap composed of 66 places in 318 ms of which 0 ms to minimize.
[2022-06-09 02:27:42] [INFO ] Deduced a trap composed of 68 places in 296 ms of which 0 ms to minimize.
[2022-06-09 02:27:42] [INFO ] Deduced a trap composed of 89 places in 307 ms of which 0 ms to minimize.
[2022-06-09 02:27:43] [INFO ] Deduced a trap composed of 68 places in 301 ms of which 0 ms to minimize.
[2022-06-09 02:27:43] [INFO ] Deduced a trap composed of 68 places in 303 ms of which 1 ms to minimize.
[2022-06-09 02:27:43] [INFO ] Deduced a trap composed of 65 places in 287 ms of which 0 ms to minimize.
[2022-06-09 02:27:44] [INFO ] Deduced a trap composed of 90 places in 302 ms of which 0 ms to minimize.
[2022-06-09 02:27:44] [INFO ] Deduced a trap composed of 91 places in 315 ms of which 0 ms to minimize.
[2022-06-09 02:27:44] [INFO ] Deduced a trap composed of 88 places in 289 ms of which 0 ms to minimize.
[2022-06-09 02:27:45] [INFO ] Deduced a trap composed of 90 places in 315 ms of which 0 ms to minimize.
[2022-06-09 02:27:45] [INFO ] Deduced a trap composed of 83 places in 291 ms of which 0 ms to minimize.
[2022-06-09 02:27:46] [INFO ] Deduced a trap composed of 67 places in 284 ms of which 0 ms to minimize.
[2022-06-09 02:27:46] [INFO ] Deduced a trap composed of 66 places in 277 ms of which 1 ms to minimize.
[2022-06-09 02:27:46] [INFO ] Deduced a trap composed of 91 places in 303 ms of which 1 ms to minimize.
[2022-06-09 02:27:47] [INFO ] Deduced a trap composed of 69 places in 288 ms of which 0 ms to minimize.
[2022-06-09 02:27:47] [INFO ] Deduced a trap composed of 68 places in 282 ms of which 1 ms to minimize.
[2022-06-09 02:27:48] [INFO ] Deduced a trap composed of 62 places in 308 ms of which 1 ms to minimize.
[2022-06-09 02:27:48] [INFO ] Deduced a trap composed of 78 places in 308 ms of which 0 ms to minimize.
[2022-06-09 02:27:48] [INFO ] Deduced a trap composed of 10 places in 301 ms of which 0 ms to minimize.
[2022-06-09 02:27:49] [INFO ] Deduced a trap composed of 87 places in 311 ms of which 1 ms to minimize.
[2022-06-09 02:27:49] [INFO ] Deduced a trap composed of 68 places in 294 ms of which 0 ms to minimize.
[2022-06-09 02:27:50] [INFO ] Deduced a trap composed of 88 places in 290 ms of which 1 ms to minimize.
[2022-06-09 02:27:50] [INFO ] Deduced a trap composed of 77 places in 302 ms of which 0 ms to minimize.
[2022-06-09 02:27:50] [INFO ] Deduced a trap composed of 72 places in 282 ms of which 0 ms to minimize.
[2022-06-09 02:27:51] [INFO ] Deduced a trap composed of 59 places in 283 ms of which 0 ms to minimize.
[2022-06-09 02:27:51] [INFO ] Deduced a trap composed of 86 places in 298 ms of which 1 ms to minimize.
[2022-06-09 02:27:52] [INFO ] Deduced a trap composed of 39 places in 291 ms of which 0 ms to minimize.
[2022-06-09 02:27:52] [INFO ] Deduced a trap composed of 68 places in 297 ms of which 1 ms to minimize.
[2022-06-09 02:27:52] [INFO ] Deduced a trap composed of 86 places in 296 ms of which 0 ms to minimize.
[2022-06-09 02:27:53] [INFO ] Deduced a trap composed of 68 places in 286 ms of which 0 ms to minimize.
[2022-06-09 02:27:53] [INFO ] Deduced a trap composed of 66 places in 294 ms of which 1 ms to minimize.
[2022-06-09 02:27:53] [INFO ] Deduced a trap composed of 17 places in 294 ms of which 0 ms to minimize.
[2022-06-09 02:27:54] [INFO ] Deduced a trap composed of 69 places in 287 ms of which 1 ms to minimize.
[2022-06-09 02:27:54] [INFO ] Deduced a trap composed of 74 places in 294 ms of which 0 ms to minimize.
[2022-06-09 02:27:55] [INFO ] Deduced a trap composed of 71 places in 294 ms of which 0 ms to minimize.
[2022-06-09 02:27:55] [INFO ] Deduced a trap composed of 64 places in 284 ms of which 1 ms to minimize.
[2022-06-09 02:27:55] [INFO ] Deduced a trap composed of 64 places in 305 ms of which 0 ms to minimize.
[2022-06-09 02:27:56] [INFO ] Deduced a trap composed of 63 places in 290 ms of which 0 ms to minimize.
[2022-06-09 02:27:56] [INFO ] Deduced a trap composed of 67 places in 337 ms of which 0 ms to minimize.
[2022-06-09 02:27:57] [INFO ] Deduced a trap composed of 65 places in 331 ms of which 0 ms to minimize.
[2022-06-09 02:27:57] [INFO ] Deduced a trap composed of 64 places in 336 ms of which 0 ms to minimize.
[2022-06-09 02:27:58] [INFO ] Deduced a trap composed of 67 places in 334 ms of which 1 ms to minimize.
[2022-06-09 02:27:58] [INFO ] Deduced a trap composed of 65 places in 330 ms of which 0 ms to minimize.
[2022-06-09 02:27:58] [INFO ] Deduced a trap composed of 78 places in 339 ms of which 1 ms to minimize.
[2022-06-09 02:27:59] [INFO ] Deduced a trap composed of 65 places in 330 ms of which 0 ms to minimize.
[2022-06-09 02:27:59] [INFO ] Deduced a trap composed of 71 places in 285 ms of which 0 ms to minimize.
[2022-06-09 02:28:00] [INFO ] Deduced a trap composed of 69 places in 290 ms of which 0 ms to minimize.
[2022-06-09 02:28:00] [INFO ] Deduced a trap composed of 97 places in 285 ms of which 1 ms to minimize.
[2022-06-09 02:28:00] [INFO ] Deduced a trap composed of 97 places in 294 ms of which 4 ms to minimize.
[2022-06-09 02:28:01] [INFO ] Deduced a trap composed of 70 places in 296 ms of which 1 ms to minimize.
[2022-06-09 02:28:01] [INFO ] Deduced a trap composed of 68 places in 300 ms of which 0 ms to minimize.
[2022-06-09 02:28:02] [INFO ] Deduced a trap composed of 94 places in 286 ms of which 1 ms to minimize.
[2022-06-09 02:28:02] [INFO ] Deduced a trap composed of 97 places in 295 ms of which 1 ms to minimize.
[2022-06-09 02:28:02] [INFO ] Deduced a trap composed of 97 places in 284 ms of which 0 ms to minimize.
[2022-06-09 02:28:03] [INFO ] Deduced a trap composed of 98 places in 295 ms of which 1 ms to minimize.
[2022-06-09 02:28:03] [INFO ] Deduced a trap composed of 72 places in 318 ms of which 0 ms to minimize.
[2022-06-09 02:28:04] [INFO ] Deduced a trap composed of 100 places in 304 ms of which 0 ms to minimize.
[2022-06-09 02:28:04] [INFO ] Deduced a trap composed of 67 places in 296 ms of which 0 ms to minimize.
[2022-06-09 02:28:04] [INFO ] Deduced a trap composed of 99 places in 299 ms of which 0 ms to minimize.
[2022-06-09 02:28:05] [INFO ] Deduced a trap composed of 98 places in 298 ms of which 1 ms to minimize.
[2022-06-09 02:28:05] [INFO ] Deduced a trap composed of 97 places in 298 ms of which 0 ms to minimize.
[2022-06-09 02:28:06] [INFO ] Deduced a trap composed of 103 places in 297 ms of which 0 ms to minimize.
[2022-06-09 02:28:06] [INFO ] Deduced a trap composed of 64 places in 293 ms of which 1 ms to minimize.
[2022-06-09 02:28:06] [INFO ] Deduced a trap composed of 64 places in 291 ms of which 0 ms to minimize.
[2022-06-09 02:28:07] [INFO ] Deduced a trap composed of 64 places in 285 ms of which 0 ms to minimize.
[2022-06-09 02:28:07] [INFO ] Deduced a trap composed of 101 places in 292 ms of which 1 ms to minimize.
[2022-06-09 02:28:08] [INFO ] Deduced a trap composed of 69 places in 306 ms of which 1 ms to minimize.
[2022-06-09 02:28:08] [INFO ] Deduced a trap composed of 69 places in 323 ms of which 1 ms to minimize.
[2022-06-09 02:28:08] [INFO ] Deduced a trap composed of 90 places in 299 ms of which 0 ms to minimize.
[2022-06-09 02:28:09] [INFO ] Deduced a trap composed of 98 places in 300 ms of which 0 ms to minimize.
[2022-06-09 02:28:09] [INFO ] Deduced a trap composed of 96 places in 295 ms of which 0 ms to minimize.
[2022-06-09 02:28:09] [INFO ] Deduced a trap composed of 97 places in 295 ms of which 0 ms to minimize.
[2022-06-09 02:28:10] [INFO ] Deduced a trap composed of 99 places in 294 ms of which 1 ms to minimize.
[2022-06-09 02:28:10] [INFO ] Deduced a trap composed of 68 places in 289 ms of which 1 ms to minimize.
[2022-06-09 02:28:11] [INFO ] Deduced a trap composed of 73 places in 292 ms of which 0 ms to minimize.
[2022-06-09 02:28:11] [INFO ] Deduced a trap composed of 69 places in 291 ms of which 0 ms to minimize.
[2022-06-09 02:28:11] [INFO ] Deduced a trap composed of 94 places in 347 ms of which 0 ms to minimize.
[2022-06-09 02:28:12] [INFO ] Deduced a trap composed of 99 places in 284 ms of which 0 ms to minimize.
[2022-06-09 02:28:12] [INFO ] Deduced a trap composed of 99 places in 287 ms of which 0 ms to minimize.
[2022-06-09 02:28:13] [INFO ] Deduced a trap composed of 65 places in 317 ms of which 0 ms to minimize.
[2022-06-09 02:28:13] [INFO ] Deduced a trap composed of 67 places in 284 ms of which 0 ms to minimize.
[2022-06-09 02:28:13] [INFO ] Deduced a trap composed of 67 places in 283 ms of which 0 ms to minimize.
[2022-06-09 02:28:14] [INFO ] Deduced a trap composed of 69 places in 279 ms of which 1 ms to minimize.
[2022-06-09 02:28:14] [INFO ] Deduced a trap composed of 69 places in 288 ms of which 0 ms to minimize.
[2022-06-09 02:28:14] [INFO ] Deduced a trap composed of 67 places in 293 ms of which 0 ms to minimize.
[2022-06-09 02:28:15] [INFO ] Deduced a trap composed of 7 places in 550 ms of which 0 ms to minimize.
[2022-06-09 02:28:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 02:28:15] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:28:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:28:16] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2022-06-09 02:28:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:28:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:28:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:28:16] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2022-06-09 02:28:16] [INFO ] [Nat]Added 296 Read/Feed constraints in 215 ms returned sat
[2022-06-09 02:28:17] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 0 ms to minimize.
[2022-06-09 02:28:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 367 ms
[2022-06-09 02:28:17] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 211 ms.
[2022-06-09 02:28:21] [INFO ] Deduced a trap composed of 59 places in 267 ms of which 0 ms to minimize.
[2022-06-09 02:28:21] [INFO ] Deduced a trap composed of 59 places in 270 ms of which 0 ms to minimize.
[2022-06-09 02:28:22] [INFO ] Deduced a trap composed of 46 places in 283 ms of which 0 ms to minimize.
[2022-06-09 02:28:22] [INFO ] Deduced a trap composed of 62 places in 272 ms of which 0 ms to minimize.
[2022-06-09 02:28:23] [INFO ] Deduced a trap composed of 59 places in 263 ms of which 0 ms to minimize.
[2022-06-09 02:28:23] [INFO ] Deduced a trap composed of 35 places in 263 ms of which 0 ms to minimize.
[2022-06-09 02:28:23] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 0 ms to minimize.
[2022-06-09 02:28:24] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 0 ms to minimize.
[2022-06-09 02:28:24] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 0 ms to minimize.
[2022-06-09 02:28:24] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3591 ms
[2022-06-09 02:28:24] [INFO ] Added : 124 causal constraints over 25 iterations in 7658 ms. Result :sat
[2022-06-09 02:28:25] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:28:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:28:25] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2022-06-09 02:28:25] [INFO ] [Real]Added 296 Read/Feed constraints in 211 ms returned sat
[2022-06-09 02:28:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:28:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:28:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:28:26] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2022-06-09 02:28:26] [INFO ] [Nat]Added 296 Read/Feed constraints in 210 ms returned sat
[2022-06-09 02:28:26] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 0 ms to minimize.
[2022-06-09 02:28:27] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 0 ms to minimize.
[2022-06-09 02:28:27] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 0 ms to minimize.
[2022-06-09 02:28:27] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 0 ms to minimize.
[2022-06-09 02:28:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1212 ms
[2022-06-09 02:28:28] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 235 ms.
[2022-06-09 02:28:32] [INFO ] Deduced a trap composed of 101 places in 448 ms of which 0 ms to minimize.
[2022-06-09 02:28:33] [INFO ] Deduced a trap composed of 103 places in 449 ms of which 0 ms to minimize.
[2022-06-09 02:28:33] [INFO ] Deduced a trap composed of 103 places in 452 ms of which 0 ms to minimize.
[2022-06-09 02:28:34] [INFO ] Deduced a trap composed of 97 places in 463 ms of which 0 ms to minimize.
[2022-06-09 02:28:34] [INFO ] Deduced a trap composed of 87 places in 471 ms of which 1 ms to minimize.
[2022-06-09 02:28:35] [INFO ] Deduced a trap composed of 107 places in 447 ms of which 1 ms to minimize.
[2022-06-09 02:28:36] [INFO ] Deduced a trap composed of 69 places in 453 ms of which 0 ms to minimize.
[2022-06-09 02:28:36] [INFO ] Deduced a trap composed of 69 places in 444 ms of which 1 ms to minimize.
[2022-06-09 02:28:37] [INFO ] Deduced a trap composed of 69 places in 453 ms of which 1 ms to minimize.
[2022-06-09 02:28:37] [INFO ] Deduced a trap composed of 35 places in 274 ms of which 0 ms to minimize.
[2022-06-09 02:28:38] [INFO ] Deduced a trap composed of 125 places in 468 ms of which 0 ms to minimize.
[2022-06-09 02:28:38] [INFO ] Deduced a trap composed of 123 places in 448 ms of which 1 ms to minimize.
[2022-06-09 02:28:39] [INFO ] Deduced a trap composed of 18 places in 458 ms of which 0 ms to minimize.
[2022-06-09 02:28:40] [INFO ] Deduced a trap composed of 20 places in 452 ms of which 0 ms to minimize.
[2022-06-09 02:28:40] [INFO ] Deduced a trap composed of 17 places in 456 ms of which 1 ms to minimize.
[2022-06-09 02:28:41] [INFO ] Deduced a trap composed of 85 places in 486 ms of which 1 ms to minimize.
[2022-06-09 02:28:41] [INFO ] Deduced a trap composed of 125 places in 419 ms of which 0 ms to minimize.
[2022-06-09 02:28:42] [INFO ] Deduced a trap composed of 115 places in 423 ms of which 0 ms to minimize.
[2022-06-09 02:28:42] [INFO ] Deduced a trap composed of 114 places in 408 ms of which 1 ms to minimize.
[2022-06-09 02:28:43] [INFO ] Deduced a trap composed of 130 places in 409 ms of which 1 ms to minimize.
[2022-06-09 02:28:44] [INFO ] Deduced a trap composed of 143 places in 403 ms of which 0 ms to minimize.
[2022-06-09 02:28:44] [INFO ] Deduced a trap composed of 40 places in 404 ms of which 1 ms to minimize.
[2022-06-09 02:28:45] [INFO ] Deduced a trap composed of 126 places in 406 ms of which 1 ms to minimize.
[2022-06-09 02:28:45] [INFO ] Deduced a trap composed of 124 places in 436 ms of which 1 ms to minimize.
[2022-06-09 02:28:46] [INFO ] Deduced a trap composed of 124 places in 432 ms of which 0 ms to minimize.
[2022-06-09 02:28:46] [INFO ] Deduced a trap composed of 125 places in 429 ms of which 0 ms to minimize.
[2022-06-09 02:28:47] [INFO ] Deduced a trap composed of 125 places in 423 ms of which 0 ms to minimize.
[2022-06-09 02:28:48] [INFO ] Deduced a trap composed of 116 places in 412 ms of which 0 ms to minimize.
[2022-06-09 02:28:48] [INFO ] Deduced a trap composed of 126 places in 409 ms of which 1 ms to minimize.
[2022-06-09 02:28:49] [INFO ] Deduced a trap composed of 125 places in 414 ms of which 0 ms to minimize.
[2022-06-09 02:28:49] [INFO ] Deduced a trap composed of 115 places in 447 ms of which 0 ms to minimize.
[2022-06-09 02:28:50] [INFO ] Deduced a trap composed of 139 places in 432 ms of which 1 ms to minimize.
[2022-06-09 02:28:50] [INFO ] Deduced a trap composed of 124 places in 414 ms of which 0 ms to minimize.
[2022-06-09 02:28:51] [INFO ] Deduced a trap composed of 23 places in 420 ms of which 0 ms to minimize.
[2022-06-09 02:28:52] [INFO ] Deduced a trap composed of 111 places in 462 ms of which 6 ms to minimize.
[2022-06-09 02:28:52] [INFO ] Deduced a trap composed of 136 places in 453 ms of which 0 ms to minimize.
[2022-06-09 02:28:53] [INFO ] Deduced a trap composed of 112 places in 459 ms of which 0 ms to minimize.
[2022-06-09 02:28:54] [INFO ] Deduced a trap composed of 17 places in 449 ms of which 0 ms to minimize.
[2022-06-09 02:28:54] [INFO ] Deduced a trap composed of 136 places in 413 ms of which 0 ms to minimize.
[2022-06-09 02:28:55] [INFO ] Deduced a trap composed of 130 places in 456 ms of which 0 ms to minimize.
[2022-06-09 02:28:55] [INFO ] Deduced a trap composed of 132 places in 418 ms of which 0 ms to minimize.
[2022-06-09 02:28:56] [INFO ] Deduced a trap composed of 129 places in 437 ms of which 1 ms to minimize.
[2022-06-09 02:28:56] [INFO ] Deduced a trap composed of 125 places in 418 ms of which 1 ms to minimize.
[2022-06-09 02:28:57] [INFO ] Deduced a trap composed of 134 places in 411 ms of which 1 ms to minimize.
[2022-06-09 02:28:58] [INFO ] Deduced a trap composed of 125 places in 448 ms of which 1 ms to minimize.
[2022-06-09 02:28:58] [INFO ] Deduced a trap composed of 133 places in 416 ms of which 0 ms to minimize.
[2022-06-09 02:28:59] [INFO ] Deduced a trap composed of 137 places in 407 ms of which 1 ms to minimize.
[2022-06-09 02:28:59] [INFO ] Deduced a trap composed of 125 places in 415 ms of which 1 ms to minimize.
[2022-06-09 02:29:00] [INFO ] Deduced a trap composed of 126 places in 424 ms of which 1 ms to minimize.
[2022-06-09 02:29:00] [INFO ] Deduced a trap composed of 128 places in 415 ms of which 0 ms to minimize.
[2022-06-09 02:29:01] [INFO ] Deduced a trap composed of 128 places in 432 ms of which 0 ms to minimize.
[2022-06-09 02:29:01] [INFO ] Deduced a trap composed of 122 places in 413 ms of which 1 ms to minimize.
[2022-06-09 02:29:02] [INFO ] Deduced a trap composed of 127 places in 431 ms of which 0 ms to minimize.
[2022-06-09 02:29:03] [INFO ] Deduced a trap composed of 118 places in 419 ms of which 1 ms to minimize.
[2022-06-09 02:29:03] [INFO ] Deduced a trap composed of 125 places in 404 ms of which 0 ms to minimize.
[2022-06-09 02:29:04] [INFO ] Deduced a trap composed of 125 places in 417 ms of which 0 ms to minimize.
[2022-06-09 02:29:04] [INFO ] Deduced a trap composed of 124 places in 407 ms of which 1 ms to minimize.
[2022-06-09 02:29:05] [INFO ] Deduced a trap composed of 124 places in 429 ms of which 0 ms to minimize.
[2022-06-09 02:29:05] [INFO ] Deduced a trap composed of 77 places in 463 ms of which 1 ms to minimize.
[2022-06-09 02:29:06] [INFO ] Deduced a trap composed of 7 places in 434 ms of which 1 ms to minimize.
[2022-06-09 02:29:07] [INFO ] Deduced a trap composed of 123 places in 448 ms of which 0 ms to minimize.
[2022-06-09 02:29:07] [INFO ] Deduced a trap composed of 120 places in 437 ms of which 0 ms to minimize.
[2022-06-09 02:29:08] [INFO ] Deduced a trap composed of 117 places in 470 ms of which 1 ms to minimize.
[2022-06-09 02:29:08] [INFO ] Deduced a trap composed of 122 places in 443 ms of which 0 ms to minimize.
[2022-06-09 02:29:09] [INFO ] Deduced a trap composed of 125 places in 464 ms of which 1 ms to minimize.
[2022-06-09 02:29:10] [INFO ] Deduced a trap composed of 111 places in 445 ms of which 0 ms to minimize.
[2022-06-09 02:29:10] [INFO ] Deduced a trap composed of 112 places in 452 ms of which 1 ms to minimize.
[2022-06-09 02:29:11] [INFO ] Deduced a trap composed of 35 places in 461 ms of which 0 ms to minimize.
[2022-06-09 02:29:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 02:29:11] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:29:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:29:11] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2022-06-09 02:29:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:29:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:29:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:29:12] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2022-06-09 02:29:12] [INFO ] [Nat]Added 296 Read/Feed constraints in 213 ms returned sat
[2022-06-09 02:29:13] [INFO ] Deduced a trap composed of 7 places in 395 ms of which 1 ms to minimize.
[2022-06-09 02:29:13] [INFO ] Deduced a trap composed of 51 places in 307 ms of which 0 ms to minimize.
[2022-06-09 02:29:13] [INFO ] Deduced a trap composed of 64 places in 307 ms of which 1 ms to minimize.
[2022-06-09 02:29:14] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 0 ms to minimize.
[2022-06-09 02:29:14] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 0 ms to minimize.
[2022-06-09 02:29:14] [INFO ] Deduced a trap composed of 18 places in 308 ms of which 0 ms to minimize.
[2022-06-09 02:29:15] [INFO ] Deduced a trap composed of 65 places in 311 ms of which 0 ms to minimize.
[2022-06-09 02:29:15] [INFO ] Deduced a trap composed of 14 places in 275 ms of which 1 ms to minimize.
[2022-06-09 02:29:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3179 ms
[2022-06-09 02:29:16] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 242 ms.
[2022-06-09 02:29:19] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 0 ms to minimize.
[2022-06-09 02:29:19] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 0 ms to minimize.
[2022-06-09 02:29:19] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 0 ms to minimize.
[2022-06-09 02:29:20] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 0 ms to minimize.
[2022-06-09 02:29:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1425 ms
[2022-06-09 02:29:20] [INFO ] Added : 81 causal constraints over 17 iterations in 4831 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, -1, -1, -1] Max seen :[0, 0, 54536, 0]
Incomplete Parikh walk after 959200 steps, including 1000 resets, run finished after 7907 ms. (steps per millisecond=121 ) properties (out of 4) seen :30 could not realise parikh vector
Incomplete Parikh walk after 1194400 steps, including 1000 resets, run finished after 9973 ms. (steps per millisecond=119 ) properties (out of 4) seen :26 could not realise parikh vector
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 66 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 02:29:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:29:38] [INFO ] Computed 8 place invariants in 21 ms
[2022-06-09 02:29:39] [INFO ] Implicit Places using invariants in 450 ms returned []
[2022-06-09 02:29:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:29:39] [INFO ] Computed 8 place invariants in 22 ms
[2022-06-09 02:29:39] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:29:46] [INFO ] Implicit Places using invariants and state equation in 7208 ms returned []
Implicit Place search using SMT with State Equation took 7659 ms to find 0 implicit places.
[2022-06-09 02:29:46] [INFO ] Redundant transitions in 133 ms returned []
[2022-06-09 02:29:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:29:46] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 02:29:47] [INFO ] Dead Transitions using invariants and state equation in 1134 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m128-UpperBounds-09
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:29:47] [INFO ] Computed 8 place invariants in 15 ms
Incomplete random walk after 10097 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1262 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2022-06-09 02:29:47] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:29:47] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 02:29:47] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:29:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:29:48] [INFO ] [Real]Absence check using state equation in 555 ms returned sat
[2022-06-09 02:29:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:29:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:29:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:29:49] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2022-06-09 02:29:49] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:29:49] [INFO ] [Nat]Added 296 Read/Feed constraints in 245 ms returned sat
[2022-06-09 02:29:49] [INFO ] Deduced a trap composed of 51 places in 466 ms of which 0 ms to minimize.
[2022-06-09 02:29:50] [INFO ] Deduced a trap composed of 21 places in 419 ms of which 0 ms to minimize.
[2022-06-09 02:29:50] [INFO ] Deduced a trap composed of 17 places in 466 ms of which 0 ms to minimize.
[2022-06-09 02:29:51] [INFO ] Deduced a trap composed of 9 places in 368 ms of which 0 ms to minimize.
[2022-06-09 02:29:51] [INFO ] Deduced a trap composed of 88 places in 275 ms of which 0 ms to minimize.
[2022-06-09 02:29:52] [INFO ] Deduced a trap composed of 81 places in 312 ms of which 1 ms to minimize.
[2022-06-09 02:29:52] [INFO ] Deduced a trap composed of 79 places in 290 ms of which 0 ms to minimize.
[2022-06-09 02:29:53] [INFO ] Deduced a trap composed of 68 places in 313 ms of which 1 ms to minimize.
[2022-06-09 02:29:53] [INFO ] Deduced a trap composed of 67 places in 312 ms of which 1 ms to minimize.
[2022-06-09 02:29:54] [INFO ] Deduced a trap composed of 7 places in 524 ms of which 0 ms to minimize.
[2022-06-09 02:29:54] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 54 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:29:54] [INFO ] Computed 8 place invariants in 18 ms
Incomplete random walk after 1000092 steps, including 2 resets, run finished after 586 ms. (steps per millisecond=1706 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1922 ms. (steps per millisecond=520 ) properties (out of 1) seen :0
[2022-06-09 02:29:56] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:29:56] [INFO ] Computed 8 place invariants in 23 ms
[2022-06-09 02:29:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:29:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:29:57] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2022-06-09 02:29:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:29:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:29:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:29:57] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2022-06-09 02:29:57] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:29:58] [INFO ] [Nat]Added 296 Read/Feed constraints in 239 ms returned sat
[2022-06-09 02:29:58] [INFO ] Deduced a trap composed of 51 places in 440 ms of which 0 ms to minimize.
[2022-06-09 02:29:59] [INFO ] Deduced a trap composed of 21 places in 476 ms of which 1 ms to minimize.
[2022-06-09 02:29:59] [INFO ] Deduced a trap composed of 17 places in 469 ms of which 0 ms to minimize.
[2022-06-09 02:30:00] [INFO ] Deduced a trap composed of 9 places in 426 ms of which 0 ms to minimize.
[2022-06-09 02:30:00] [INFO ] Deduced a trap composed of 88 places in 318 ms of which 0 ms to minimize.
[2022-06-09 02:30:01] [INFO ] Deduced a trap composed of 81 places in 318 ms of which 0 ms to minimize.
[2022-06-09 02:30:01] [INFO ] Deduced a trap composed of 79 places in 315 ms of which 1 ms to minimize.
[2022-06-09 02:30:02] [INFO ] Deduced a trap composed of 68 places in 322 ms of which 1 ms to minimize.
[2022-06-09 02:30:02] [INFO ] Deduced a trap composed of 67 places in 330 ms of which 0 ms to minimize.
[2022-06-09 02:30:02] [INFO ] Deduced a trap composed of 19 places in 318 ms of which 1 ms to minimize.
[2022-06-09 02:30:03] [INFO ] Deduced a trap composed of 16 places in 328 ms of which 2 ms to minimize.
[2022-06-09 02:30:03] [INFO ] Deduced a trap composed of 86 places in 314 ms of which 0 ms to minimize.
[2022-06-09 02:30:04] [INFO ] Deduced a trap composed of 66 places in 315 ms of which 0 ms to minimize.
[2022-06-09 02:30:04] [INFO ] Deduced a trap composed of 84 places in 319 ms of which 0 ms to minimize.
[2022-06-09 02:30:04] [INFO ] Deduced a trap composed of 83 places in 309 ms of which 1 ms to minimize.
[2022-06-09 02:30:05] [INFO ] Deduced a trap composed of 83 places in 275 ms of which 0 ms to minimize.
[2022-06-09 02:30:05] [INFO ] Deduced a trap composed of 92 places in 306 ms of which 1 ms to minimize.
[2022-06-09 02:30:06] [INFO ] Deduced a trap composed of 92 places in 273 ms of which 0 ms to minimize.
[2022-06-09 02:30:06] [INFO ] Deduced a trap composed of 97 places in 297 ms of which 1 ms to minimize.
[2022-06-09 02:30:06] [INFO ] Deduced a trap composed of 67 places in 254 ms of which 0 ms to minimize.
[2022-06-09 02:30:07] [INFO ] Deduced a trap composed of 67 places in 231 ms of which 1 ms to minimize.
[2022-06-09 02:30:07] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 0 ms to minimize.
[2022-06-09 02:30:07] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 0 ms to minimize.
[2022-06-09 02:30:08] [INFO ] Deduced a trap composed of 67 places in 281 ms of which 0 ms to minimize.
[2022-06-09 02:30:08] [INFO ] Deduced a trap composed of 68 places in 290 ms of which 0 ms to minimize.
[2022-06-09 02:30:09] [INFO ] Deduced a trap composed of 93 places in 274 ms of which 0 ms to minimize.
[2022-06-09 02:30:09] [INFO ] Deduced a trap composed of 66 places in 294 ms of which 0 ms to minimize.
[2022-06-09 02:30:09] [INFO ] Deduced a trap composed of 68 places in 292 ms of which 0 ms to minimize.
[2022-06-09 02:30:10] [INFO ] Deduced a trap composed of 89 places in 289 ms of which 1 ms to minimize.
[2022-06-09 02:30:10] [INFO ] Deduced a trap composed of 68 places in 283 ms of which 1 ms to minimize.
[2022-06-09 02:30:10] [INFO ] Deduced a trap composed of 68 places in 293 ms of which 0 ms to minimize.
[2022-06-09 02:30:11] [INFO ] Deduced a trap composed of 65 places in 296 ms of which 0 ms to minimize.
[2022-06-09 02:30:11] [INFO ] Deduced a trap composed of 90 places in 295 ms of which 0 ms to minimize.
[2022-06-09 02:30:12] [INFO ] Deduced a trap composed of 91 places in 271 ms of which 0 ms to minimize.
[2022-06-09 02:30:12] [INFO ] Deduced a trap composed of 88 places in 288 ms of which 0 ms to minimize.
[2022-06-09 02:30:12] [INFO ] Deduced a trap composed of 90 places in 312 ms of which 0 ms to minimize.
[2022-06-09 02:30:13] [INFO ] Deduced a trap composed of 83 places in 280 ms of which 0 ms to minimize.
[2022-06-09 02:30:13] [INFO ] Deduced a trap composed of 67 places in 277 ms of which 0 ms to minimize.
[2022-06-09 02:30:14] [INFO ] Deduced a trap composed of 66 places in 271 ms of which 0 ms to minimize.
[2022-06-09 02:30:14] [INFO ] Deduced a trap composed of 91 places in 299 ms of which 0 ms to minimize.
[2022-06-09 02:30:14] [INFO ] Deduced a trap composed of 69 places in 288 ms of which 0 ms to minimize.
[2022-06-09 02:30:15] [INFO ] Deduced a trap composed of 68 places in 286 ms of which 1 ms to minimize.
[2022-06-09 02:30:15] [INFO ] Deduced a trap composed of 62 places in 301 ms of which 0 ms to minimize.
[2022-06-09 02:30:15] [INFO ] Deduced a trap composed of 78 places in 300 ms of which 0 ms to minimize.
[2022-06-09 02:30:16] [INFO ] Deduced a trap composed of 10 places in 303 ms of which 0 ms to minimize.
[2022-06-09 02:30:16] [INFO ] Deduced a trap composed of 87 places in 304 ms of which 1 ms to minimize.
[2022-06-09 02:30:17] [INFO ] Deduced a trap composed of 68 places in 304 ms of which 0 ms to minimize.
[2022-06-09 02:30:17] [INFO ] Deduced a trap composed of 88 places in 295 ms of which 1 ms to minimize.
[2022-06-09 02:30:17] [INFO ] Deduced a trap composed of 77 places in 303 ms of which 0 ms to minimize.
[2022-06-09 02:30:18] [INFO ] Deduced a trap composed of 72 places in 293 ms of which 1 ms to minimize.
[2022-06-09 02:30:18] [INFO ] Deduced a trap composed of 59 places in 296 ms of which 0 ms to minimize.
[2022-06-09 02:30:19] [INFO ] Deduced a trap composed of 86 places in 300 ms of which 1 ms to minimize.
[2022-06-09 02:30:19] [INFO ] Deduced a trap composed of 39 places in 292 ms of which 0 ms to minimize.
[2022-06-09 02:30:19] [INFO ] Deduced a trap composed of 68 places in 323 ms of which 0 ms to minimize.
[2022-06-09 02:30:20] [INFO ] Deduced a trap composed of 86 places in 298 ms of which 0 ms to minimize.
[2022-06-09 02:30:20] [INFO ] Deduced a trap composed of 68 places in 299 ms of which 0 ms to minimize.
[2022-06-09 02:30:21] [INFO ] Deduced a trap composed of 66 places in 296 ms of which 0 ms to minimize.
[2022-06-09 02:30:21] [INFO ] Deduced a trap composed of 17 places in 294 ms of which 0 ms to minimize.
[2022-06-09 02:30:21] [INFO ] Deduced a trap composed of 69 places in 306 ms of which 0 ms to minimize.
[2022-06-09 02:30:22] [INFO ] Deduced a trap composed of 74 places in 298 ms of which 0 ms to minimize.
[2022-06-09 02:30:22] [INFO ] Deduced a trap composed of 71 places in 272 ms of which 0 ms to minimize.
[2022-06-09 02:30:23] [INFO ] Deduced a trap composed of 64 places in 302 ms of which 1 ms to minimize.
[2022-06-09 02:30:23] [INFO ] Deduced a trap composed of 64 places in 285 ms of which 1 ms to minimize.
[2022-06-09 02:30:23] [INFO ] Deduced a trap composed of 63 places in 274 ms of which 0 ms to minimize.
[2022-06-09 02:30:24] [INFO ] Deduced a trap composed of 67 places in 324 ms of which 0 ms to minimize.
[2022-06-09 02:30:24] [INFO ] Deduced a trap composed of 65 places in 345 ms of which 0 ms to minimize.
[2022-06-09 02:30:25] [INFO ] Deduced a trap composed of 64 places in 342 ms of which 0 ms to minimize.
[2022-06-09 02:30:25] [INFO ] Deduced a trap composed of 67 places in 344 ms of which 0 ms to minimize.
[2022-06-09 02:30:26] [INFO ] Deduced a trap composed of 65 places in 328 ms of which 1 ms to minimize.
[2022-06-09 02:30:26] [INFO ] Deduced a trap composed of 78 places in 309 ms of which 0 ms to minimize.
[2022-06-09 02:30:26] [INFO ] Deduced a trap composed of 65 places in 341 ms of which 0 ms to minimize.
[2022-06-09 02:30:27] [INFO ] Deduced a trap composed of 71 places in 272 ms of which 1 ms to minimize.
[2022-06-09 02:30:27] [INFO ] Deduced a trap composed of 69 places in 276 ms of which 0 ms to minimize.
[2022-06-09 02:30:28] [INFO ] Deduced a trap composed of 97 places in 278 ms of which 0 ms to minimize.
[2022-06-09 02:30:28] [INFO ] Deduced a trap composed of 97 places in 274 ms of which 0 ms to minimize.
[2022-06-09 02:30:28] [INFO ] Deduced a trap composed of 70 places in 279 ms of which 0 ms to minimize.
[2022-06-09 02:30:29] [INFO ] Deduced a trap composed of 68 places in 293 ms of which 1 ms to minimize.
[2022-06-09 02:30:29] [INFO ] Deduced a trap composed of 94 places in 281 ms of which 0 ms to minimize.
[2022-06-09 02:30:29] [INFO ] Deduced a trap composed of 97 places in 280 ms of which 0 ms to minimize.
[2022-06-09 02:30:30] [INFO ] Deduced a trap composed of 97 places in 277 ms of which 0 ms to minimize.
[2022-06-09 02:30:30] [INFO ] Deduced a trap composed of 98 places in 270 ms of which 1 ms to minimize.
[2022-06-09 02:30:31] [INFO ] Deduced a trap composed of 72 places in 313 ms of which 0 ms to minimize.
[2022-06-09 02:30:31] [INFO ] Deduced a trap composed of 100 places in 292 ms of which 0 ms to minimize.
[2022-06-09 02:30:31] [INFO ] Deduced a trap composed of 67 places in 297 ms of which 0 ms to minimize.
[2022-06-09 02:30:32] [INFO ] Deduced a trap composed of 99 places in 276 ms of which 0 ms to minimize.
[2022-06-09 02:30:32] [INFO ] Deduced a trap composed of 98 places in 271 ms of which 1 ms to minimize.
[2022-06-09 02:30:33] [INFO ] Deduced a trap composed of 97 places in 280 ms of which 0 ms to minimize.
[2022-06-09 02:30:33] [INFO ] Deduced a trap composed of 103 places in 268 ms of which 0 ms to minimize.
[2022-06-09 02:30:33] [INFO ] Deduced a trap composed of 64 places in 307 ms of which 0 ms to minimize.
[2022-06-09 02:30:34] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 0 ms to minimize.
[2022-06-09 02:30:34] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 1 ms to minimize.
[2022-06-09 02:30:34] [INFO ] Deduced a trap composed of 101 places in 294 ms of which 1 ms to minimize.
[2022-06-09 02:30:35] [INFO ] Deduced a trap composed of 69 places in 293 ms of which 1 ms to minimize.
[2022-06-09 02:30:35] [INFO ] Deduced a trap composed of 69 places in 295 ms of which 1 ms to minimize.
[2022-06-09 02:30:36] [INFO ] Deduced a trap composed of 90 places in 305 ms of which 0 ms to minimize.
[2022-06-09 02:30:36] [INFO ] Deduced a trap composed of 98 places in 302 ms of which 0 ms to minimize.
[2022-06-09 02:30:36] [INFO ] Deduced a trap composed of 96 places in 304 ms of which 0 ms to minimize.
[2022-06-09 02:30:37] [INFO ] Deduced a trap composed of 97 places in 300 ms of which 0 ms to minimize.
[2022-06-09 02:30:37] [INFO ] Deduced a trap composed of 99 places in 303 ms of which 1 ms to minimize.
[2022-06-09 02:30:38] [INFO ] Deduced a trap composed of 68 places in 267 ms of which 0 ms to minimize.
[2022-06-09 02:30:38] [INFO ] Deduced a trap composed of 73 places in 264 ms of which 0 ms to minimize.
[2022-06-09 02:30:38] [INFO ] Deduced a trap composed of 69 places in 269 ms of which 0 ms to minimize.
[2022-06-09 02:30:39] [INFO ] Deduced a trap composed of 94 places in 302 ms of which 1 ms to minimize.
[2022-06-09 02:30:39] [INFO ] Deduced a trap composed of 99 places in 270 ms of which 0 ms to minimize.
[2022-06-09 02:30:40] [INFO ] Deduced a trap composed of 99 places in 285 ms of which 1 ms to minimize.
[2022-06-09 02:30:40] [INFO ] Deduced a trap composed of 65 places in 286 ms of which 0 ms to minimize.
[2022-06-09 02:30:40] [INFO ] Deduced a trap composed of 67 places in 326 ms of which 1 ms to minimize.
[2022-06-09 02:30:41] [INFO ] Deduced a trap composed of 67 places in 293 ms of which 0 ms to minimize.
[2022-06-09 02:30:41] [INFO ] Deduced a trap composed of 69 places in 283 ms of which 0 ms to minimize.
[2022-06-09 02:30:42] [INFO ] Deduced a trap composed of 69 places in 301 ms of which 1 ms to minimize.
[2022-06-09 02:30:42] [INFO ] Deduced a trap composed of 67 places in 302 ms of which 1 ms to minimize.
[2022-06-09 02:30: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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 79 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 59 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 02:30:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:30:42] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 02:30:43] [INFO ] Implicit Places using invariants in 413 ms returned []
[2022-06-09 02:30:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:30:43] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 02:30:43] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:30:50] [INFO ] Implicit Places using invariants and state equation in 7658 ms returned []
Implicit Place search using SMT with State Equation took 8072 ms to find 0 implicit places.
[2022-06-09 02:30:50] [INFO ] Redundant transitions in 130 ms returned []
[2022-06-09 02:30:50] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:30:50] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 02:30:51] [INFO ] Dead Transitions using invariants and state equation in 1088 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m128-UpperBounds-09 in 64227 ms.
Starting property specific reduction for BugTracking-PT-q8m128-UpperBounds-10
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:30:51] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 10061 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1006 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
[2022-06-09 02:30:52] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:30:52] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 02:30:52] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:30:52] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2022-06-09 02:30:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:30:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:30:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:30:53] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2022-06-09 02:30:53] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:30:53] [INFO ] [Nat]Added 296 Read/Feed constraints in 234 ms returned sat
[2022-06-09 02:30:53] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 0 ms to minimize.
[2022-06-09 02:30:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 379 ms
[2022-06-09 02:30:54] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 258 ms.
[2022-06-09 02:30:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 58 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:30:57] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 1000068 steps, including 2 resets, run finished after 731 ms. (steps per millisecond=1368 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2072 ms. (steps per millisecond=482 ) properties (out of 1) seen :0
[2022-06-09 02:31:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:31:00] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 02:31:00] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:31:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:31:01] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2022-06-09 02:31:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:31:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:31:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:31:01] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2022-06-09 02:31:01] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:31:02] [INFO ] [Nat]Added 296 Read/Feed constraints in 226 ms returned sat
[2022-06-09 02:31:02] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 0 ms to minimize.
[2022-06-09 02:31:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 388 ms
[2022-06-09 02:31:02] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 234 ms.
[2022-06-09 02:31:06] [INFO ] Deduced a trap composed of 59 places in 274 ms of which 1 ms to minimize.
[2022-06-09 02:31:07] [INFO ] Deduced a trap composed of 59 places in 272 ms of which 1 ms to minimize.
[2022-06-09 02:31:07] [INFO ] Deduced a trap composed of 46 places in 266 ms of which 0 ms to minimize.
[2022-06-09 02:31:08] [INFO ] Deduced a trap composed of 62 places in 272 ms of which 1 ms to minimize.
[2022-06-09 02:31:08] [INFO ] Deduced a trap composed of 59 places in 276 ms of which 1 ms to minimize.
[2022-06-09 02:31:08] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 0 ms to minimize.
[2022-06-09 02:31:09] [INFO ] Deduced a trap composed of 10 places in 239 ms of which 1 ms to minimize.
[2022-06-09 02:31:09] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 0 ms to minimize.
[2022-06-09 02:31:09] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 1 ms to minimize.
[2022-06-09 02:31:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3636 ms
[2022-06-09 02:31:10] [INFO ] Added : 124 causal constraints over 25 iterations in 7908 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 1194400 steps, including 1000 resets, run finished after 10719 ms. (steps per millisecond=111 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 68 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 02:31:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:31:21] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 02:31:21] [INFO ] Implicit Places using invariants in 438 ms returned []
[2022-06-09 02:31:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:31:21] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 02:31:22] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:31:29] [INFO ] Implicit Places using invariants and state equation in 7849 ms returned []
Implicit Place search using SMT with State Equation took 8289 ms to find 0 implicit places.
[2022-06-09 02:31:29] [INFO ] Redundant transitions in 138 ms returned []
[2022-06-09 02:31:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:31:29] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 02:31:30] [INFO ] Dead Transitions using invariants and state equation in 1029 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m128-UpperBounds-10 in 38799 ms.
Starting property specific reduction for BugTracking-PT-q8m128-UpperBounds-13
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:31:30] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 10110 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=919 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :6
[2022-06-09 02:31:30] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:31:30] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 02:31:30] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:31:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:31:31] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2022-06-09 02:31:31] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:31:31] [INFO ] [Real]Added 296 Read/Feed constraints in 227 ms returned sat
[2022-06-09 02:31:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:31:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:31:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:31:32] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2022-06-09 02:31:32] [INFO ] [Nat]Added 296 Read/Feed constraints in 216 ms returned sat
[2022-06-09 02:31:32] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 1 ms to minimize.
[2022-06-09 02:31:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 380 ms
[2022-06-09 02:31:33] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 219 ms.
[2022-06-09 02:31:36] [INFO ] Added : 125 causal constraints over 25 iterations in 3897 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[6]
Incomplete Parikh walk after 1329600 steps, including 1000 resets, run finished after 11375 ms. (steps per millisecond=116 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:31:48] [INFO ] Computed 8 place invariants in 18 ms
Incomplete random walk after 1000118 steps, including 2 resets, run finished after 699 ms. (steps per millisecond=1430 ) properties (out of 1) seen :517
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1957 ms. (steps per millisecond=510 ) properties (out of 1) seen :0
[2022-06-09 02:31:50] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:31:50] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 02:31:50] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:31:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:31:51] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2022-06-09 02:31:51] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:31:51] [INFO ] [Real]Added 296 Read/Feed constraints in 225 ms returned sat
[2022-06-09 02:31:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:31:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:31:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:31:52] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2022-06-09 02:31:52] [INFO ] [Nat]Added 296 Read/Feed constraints in 222 ms returned sat
[2022-06-09 02:31:52] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 1 ms to minimize.
[2022-06-09 02:31:53] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 0 ms to minimize.
[2022-06-09 02:31:53] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 0 ms to minimize.
[2022-06-09 02:31:53] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 0 ms to minimize.
[2022-06-09 02:31:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1239 ms
[2022-06-09 02:31:54] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 281 ms.
[2022-06-09 02:31:59] [INFO ] Deduced a trap composed of 35 places in 358 ms of which 0 ms to minimize.
[2022-06-09 02:31:59] [INFO ] Deduced a trap composed of 10 places in 343 ms of which 0 ms to minimize.
[2022-06-09 02:31:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1080 ms
[2022-06-09 02:32:00] [INFO ] Added : 145 causal constraints over 29 iterations in 6224 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[517]
Incomplete Parikh walk after 1890400 steps, including 1000 resets, run finished after 16078 ms. (steps per millisecond=117 ) properties (out of 1) seen :20 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 59 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 54 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 02:32:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:32:16] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 02:32:16] [INFO ] Implicit Places using invariants in 413 ms returned []
[2022-06-09 02:32:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:32:16] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 02:32:17] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:32:24] [INFO ] Implicit Places using invariants and state equation in 7760 ms returned []
Implicit Place search using SMT with State Equation took 8189 ms to find 0 implicit places.
[2022-06-09 02:32:24] [INFO ] Redundant transitions in 129 ms returned []
[2022-06-09 02:32:24] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:32:24] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 02:32:25] [INFO ] Dead Transitions using invariants and state equation in 1025 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:32:25] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 1000047 steps, including 2 resets, run finished after 648 ms. (steps per millisecond=1543 ) properties (out of 1) seen :479
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1934 ms. (steps per millisecond=517 ) properties (out of 1) seen :7
[2022-06-09 02:32:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:32:28] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 02:32:28] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:32:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:32:28] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2022-06-09 02:32:29] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:32:29] [INFO ] [Real]Added 296 Read/Feed constraints in 218 ms returned sat
[2022-06-09 02:32:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:32:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:32:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:32:29] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2022-06-09 02:32:30] [INFO ] [Nat]Added 296 Read/Feed constraints in 236 ms returned sat
[2022-06-09 02:32:30] [INFO ] Deduced a trap composed of 26 places in 215 ms of which 0 ms to minimize.
[2022-06-09 02:32:30] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 0 ms to minimize.
[2022-06-09 02:32:31] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 0 ms to minimize.
[2022-06-09 02:32:31] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 1 ms to minimize.
[2022-06-09 02:32:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1314 ms
[2022-06-09 02:32:31] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 231 ms.
[2022-06-09 02:32:36] [INFO ] Deduced a trap composed of 35 places in 340 ms of which 0 ms to minimize.
[2022-06-09 02:32:37] [INFO ] Deduced a trap composed of 10 places in 279 ms of which 0 ms to minimize.
[2022-06-09 02:32:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 997 ms
[2022-06-09 02:32:37] [INFO ] Added : 145 causal constraints over 29 iterations in 6177 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[517]
Incomplete Parikh walk after 1890400 steps, including 1000 resets, run finished after 15505 ms. (steps per millisecond=121 ) properties (out of 1) seen :11 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 56 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 68 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 02:32:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:32:53] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 02:32:53] [INFO ] Implicit Places using invariants in 444 ms returned []
[2022-06-09 02:32:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:32:53] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 02:32:54] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:33:01] [INFO ] Implicit Places using invariants and state equation in 7488 ms returned []
Implicit Place search using SMT with State Equation took 7936 ms to find 0 implicit places.
[2022-06-09 02:33:01] [INFO ] Redundant transitions in 136 ms returned []
[2022-06-09 02:33:01] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:33:01] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 02:33:02] [INFO ] Dead Transitions using invariants and state equation in 1185 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m128-UpperBounds-13 in 91934 ms.
Starting property specific reduction for BugTracking-PT-q8m128-UpperBounds-14
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:33:02] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10034 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1433 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2022-06-09 02:33:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:33:02] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 02:33:02] [INFO ] [Real]Absence check using 8 positive place invariants in 21 ms returned sat
[2022-06-09 02:33:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:33:03] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2022-06-09 02:33:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:33:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:33:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:33:03] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2022-06-09 02:33:03] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:33:04] [INFO ] [Nat]Added 296 Read/Feed constraints in 196 ms returned sat
[2022-06-09 02:33:04] [INFO ] Deduced a trap composed of 7 places in 389 ms of which 0 ms to minimize.
[2022-06-09 02:33:04] [INFO ] Deduced a trap composed of 51 places in 278 ms of which 0 ms to minimize.
[2022-06-09 02:33:05] [INFO ] Deduced a trap composed of 64 places in 290 ms of which 0 ms to minimize.
[2022-06-09 02:33:05] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 0 ms to minimize.
[2022-06-09 02:33:05] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 0 ms to minimize.
[2022-06-09 02:33:06] [INFO ] Deduced a trap composed of 18 places in 327 ms of which 0 ms to minimize.
[2022-06-09 02:33:06] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 1 ms to minimize.
[2022-06-09 02:33:07] [INFO ] Deduced a trap composed of 14 places in 286 ms of which 1 ms to minimize.
[2022-06-09 02:33:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3060 ms
[2022-06-09 02:33:07] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 254 ms.
[2022-06-09 02:33:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 62 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:33:08] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 1000018 steps, including 2 resets, run finished after 605 ms. (steps per millisecond=1652 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1900 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2022-06-09 02:33:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:33:11] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 02:33:11] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:33:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:33:11] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2022-06-09 02:33:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:33:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:33:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:33:12] [INFO ] [Nat]Absence check using state equation in 535 ms returned sat
[2022-06-09 02:33:12] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:33:12] [INFO ] [Nat]Added 296 Read/Feed constraints in 228 ms returned sat
[2022-06-09 02:33:12] [INFO ] Deduced a trap composed of 7 places in 360 ms of which 0 ms to minimize.
[2022-06-09 02:33:13] [INFO ] Deduced a trap composed of 51 places in 286 ms of which 0 ms to minimize.
[2022-06-09 02:33:13] [INFO ] Deduced a trap composed of 64 places in 290 ms of which 0 ms to minimize.
[2022-06-09 02:33:13] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 0 ms to minimize.
[2022-06-09 02:33:14] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 0 ms to minimize.
[2022-06-09 02:33:14] [INFO ] Deduced a trap composed of 18 places in 284 ms of which 1 ms to minimize.
[2022-06-09 02:33:15] [INFO ] Deduced a trap composed of 65 places in 275 ms of which 0 ms to minimize.
[2022-06-09 02:33:15] [INFO ] Deduced a trap composed of 14 places in 317 ms of which 1 ms to minimize.
[2022-06-09 02:33:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3063 ms
[2022-06-09 02:33:15] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 251 ms.
[2022-06-09 02:33:18] [INFO ] Deduced a trap composed of 35 places in 203 ms of which 1 ms to minimize.
[2022-06-09 02:33:18] [INFO ] Deduced a trap composed of 35 places in 200 ms of which 0 ms to minimize.
[2022-06-09 02:33:19] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 1 ms to minimize.
[2022-06-09 02:33:19] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 0 ms to minimize.
[2022-06-09 02:33:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1384 ms
[2022-06-09 02:33:20] [INFO ] Added : 81 causal constraints over 17 iterations in 4578 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 959200 steps, including 1000 resets, run finished after 7656 ms. (steps per millisecond=125 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 69 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 56 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 02:33:27] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:33:28] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 02:33:28] [INFO ] Implicit Places using invariants in 435 ms returned []
[2022-06-09 02:33:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:33:28] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 02:33:29] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:33:35] [INFO ] Implicit Places using invariants and state equation in 7097 ms returned []
Implicit Place search using SMT with State Equation took 7533 ms to find 0 implicit places.
[2022-06-09 02:33:35] [INFO ] Redundant transitions in 133 ms returned []
[2022-06-09 02:33:35] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:33:35] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 02:33:36] [INFO ] Dead Transitions using invariants and state equation in 1124 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m128-UpperBounds-14 in 34126 ms.
[2022-06-09 02:33:37] [INFO ] Flatten gal took : 377 ms
[2022-06-09 02:33:37] [INFO ] Applying decomposition
[2022-06-09 02:33:37] [INFO ] Flatten gal took : 199 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph363597725069747072.txt, -o, /tmp/graph363597725069747072.bin, -w, /tmp/graph363597725069747072.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph363597725069747072.bin, -l, -1, -v, -w, /tmp/graph363597725069747072.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 02:33:38] [INFO ] Decomposing Gal with order
[2022-06-09 02:33:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 02:33:38] [INFO ] Removed a total of 424 redundant transitions.
[2022-06-09 02:33:39] [INFO ] Flatten gal took : 681 ms
[2022-06-09 02:33:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 33 ms.
[2022-06-09 02:33:39] [INFO ] Time to serialize gal into /tmp/UpperBounds4529483747075215410.gal : 78 ms
[2022-06-09 02:33:39] [INFO ] Time to serialize properties into /tmp/UpperBounds7689221398427074982.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds4529483747075215410.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7689221398427074982.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds4529483747075215410.gal -t CGAL -reachable-file /tmp/UpperBounds7689221398427074982.prop --nowitness
Loading property file /tmp/UpperBounds7689221398427074982.prop.
Detected timeout of ITS tools.
[2022-06-09 02:57:50] [INFO ] Flatten gal took : 997 ms
[2022-06-09 02:57:50] [INFO ] Time to serialize gal into /tmp/UpperBounds14378225362852299934.gal : 147 ms
[2022-06-09 02:57:50] [INFO ] Time to serialize properties into /tmp/UpperBounds7526379717530067927.prop : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds14378225362852299934.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7526379717530067927.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds14378225362852299934.gal -t CGAL -reachable-file /tmp/UpperBounds7526379717530067927.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds7526379717530067927.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="BugTracking-PT-q8m128"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is BugTracking-PT-q8m128, 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 r323-tall-165472292600043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m128.tgz
mv BugTracking-PT-q8m128 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;