MCC'2022- Execution of r179-tall-165277026700016

About the Execution of 2021-gold for Peterson-COL-7

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16242.615	3600000.00	2845766.00	582267.90	8 ? 7 ? 8 7 7 ? ? 7 7 8 ? 7 7 7	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.r179-tall-165277026700016.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 Peterson-COL-7, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277026700016
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 7.8K Apr 30 10:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 10:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 30 09:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 09:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 47K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-COL-7-UpperBounds-00
FORMULA_NAME Peterson-COL-7-UpperBounds-01
FORMULA_NAME Peterson-COL-7-UpperBounds-02
FORMULA_NAME Peterson-COL-7-UpperBounds-03
FORMULA_NAME Peterson-COL-7-UpperBounds-04
FORMULA_NAME Peterson-COL-7-UpperBounds-05
FORMULA_NAME Peterson-COL-7-UpperBounds-06
FORMULA_NAME Peterson-COL-7-UpperBounds-07
FORMULA_NAME Peterson-COL-7-UpperBounds-08
FORMULA_NAME Peterson-COL-7-UpperBounds-09
FORMULA_NAME Peterson-COL-7-UpperBounds-10
FORMULA_NAME Peterson-COL-7-UpperBounds-11
FORMULA_NAME Peterson-COL-7-UpperBounds-12
FORMULA_NAME Peterson-COL-7-UpperBounds-13
FORMULA_NAME Peterson-COL-7-UpperBounds-14
FORMULA_NAME Peterson-COL-7-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652823868945

Running Version 0
[2022-05-17 21:44:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 21:44:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 21:44:30] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-05-17 21:44:31] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 21:44:31] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 524 ms
[2022-05-17 21:44:31] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 2048 PT places and 3384.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2022-05-17 21:44:31] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions in 3 ms.
[2022-05-17 21:44:31] [INFO ] Skeletonized HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1000_1315146619353506119.dot
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2022-05-17 21:44:31] [INFO ] Computed 1 place invariants in 11 ms
FORMULA Peterson-COL-7-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-13 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-17 21:44:31] [INFO ] Unfolded HLPN to a Petri net with 2048 places and 3208 transitions in 46 ms.
[2022-05-17 21:44:31] [INFO ] Unfolded HLPN properties in 1 ms.
// Phase 1: matrix 14 rows 9 cols
[2022-05-17 21:44:31] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-17 21:44:31] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-17 21:44:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:31] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-17 21:44:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:31] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-17 21:44:31] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-17 21:44:31] [INFO ] Added : 11 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 21:44:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:31] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 21:44:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:31] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 21:44:31] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 21:44:31] [INFO ] Added : 11 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 21:44:31] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-05-17 21:44:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:31] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 21:44:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:31] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-17 21:44:31] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 21:44:31] [INFO ] Added : 11 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 7 ms.
[2022-05-17 21:44:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:31] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 21:44:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:31] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-17 21:44:31] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 21:44:31] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 21:44:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:31] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-17 21:44:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:31] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-17 21:44:31] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 21:44:31] [INFO ] Added : 12 causal constraints over 4 iterations in 15 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 21:44:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:31] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 21:44:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:31] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 21:44:31] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 21:44:31] [INFO ] Added : 12 causal constraints over 4 iterations in 16 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 21:44:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:31] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 21:44:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:31] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 21:44:31] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 21:44:31] [INFO ] Added : 11 causal constraints over 4 iterations in 13 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 21:44:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:31] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 21:44:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:31] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 21:44:31] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 21:44:32] [INFO ] Added : 11 causal constraints over 4 iterations in 17 ms. Result :sat
Minimization took 6 ms.
[2022-05-17 21:44:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:32] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 21:44:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:32] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 21:44:32] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 21:44:32] [INFO ] Added : 11 causal constraints over 4 iterations in 15 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 21:44:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 21:44:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:32] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 21:44:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:32] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 21:44:32] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 21:44:32] [INFO ] Added : 11 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 21:44:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:32] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 21:44:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 21:44:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:32] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 21:44:32] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 21:44:32] [INFO ] Added : 11 causal constraints over 4 iterations in 8 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8]
[2022-05-17 21:44:32] [INFO ] Unfolded HLPN to a Petri net with 2048 places and 3208 transitions in 22 ms.
[2022-05-17 21:44:32] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_13148241884231394808.dot
Deduced a syphon composed of 56 places in 26 ms
Reduce places removed 56 places and 112 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 11) seen :40
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 11) seen :28
FORMULA Peterson-COL-7-UpperBounds-00 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 10) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 10) seen :15
FORMULA Peterson-COL-7-UpperBounds-11 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :31
[2022-05-17 21:44:33] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 21:44:33] [INFO ] Computed 31 place invariants in 30 ms
[2022-05-17 21:44:33] [INFO ] [Real]Absence check using 23 positive place invariants in 36 ms returned sat
[2022-05-17 21:44:33] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 14 ms returned sat
[2022-05-17 21:44:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:34] [INFO ] [Real]Absence check using state equation in 775 ms returned sat
[2022-05-17 21:44:34] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 21:44:34] [INFO ] [Real]Added 546 Read/Feed constraints in 186 ms returned sat
[2022-05-17 21:44:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:35] [INFO ] [Nat]Absence check using 23 positive place invariants in 37 ms returned sat
[2022-05-17 21:44:35] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2022-05-17 21:44:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:35] [INFO ] [Nat]Absence check using state equation in 786 ms returned sat
[2022-05-17 21:44:36] [INFO ] [Nat]Added 546 Read/Feed constraints in 211 ms returned sat
[2022-05-17 21:44:37] [INFO ] Deduced a trap composed of 40 places in 949 ms of which 5 ms to minimize.
[2022-05-17 21:44:38] [INFO ] Deduced a trap composed of 33 places in 972 ms of which 2 ms to minimize.
[2022-05-17 21:44:39] [INFO ] Deduced a trap composed of 25 places in 1012 ms of which 3 ms to minimize.
[2022-05-17 21:44:40] [INFO ] Deduced a trap composed of 13 places in 982 ms of which 4 ms to minimize.
[2022-05-17 21:44:40] [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-05-17 21:44:40] [INFO ] [Real]Absence check using 23 positive place invariants in 37 ms returned sat
[2022-05-17 21:44:40] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2022-05-17 21:44:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:41] [INFO ] [Real]Absence check using state equation in 773 ms returned sat
[2022-05-17 21:44:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:41] [INFO ] [Nat]Absence check using 23 positive place invariants in 34 ms returned sat
[2022-05-17 21:44:41] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2022-05-17 21:44:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:42] [INFO ] [Nat]Absence check using state equation in 759 ms returned sat
[2022-05-17 21:44:42] [INFO ] [Nat]Added 546 Read/Feed constraints in 185 ms returned sat
[2022-05-17 21:44:43] [INFO ] Deduced a trap composed of 67 places in 880 ms of which 2 ms to minimize.
[2022-05-17 21:44:44] [INFO ] Deduced a trap composed of 17 places in 930 ms of which 2 ms to minimize.
[2022-05-17 21:44:45] [INFO ] Deduced a trap composed of 13 places in 872 ms of which 1 ms to minimize.
[2022-05-17 21:44:46] [INFO ] Deduced a trap composed of 176 places in 853 ms of which 2 ms to minimize.
[2022-05-17 21:44:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-05-17 21:44:46] [INFO ] [Real]Absence check using 23 positive place invariants in 31 ms returned sat
[2022-05-17 21:44:46] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2022-05-17 21:44:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:47] [INFO ] [Real]Absence check using state equation in 743 ms returned sat
[2022-05-17 21:44:47] [INFO ] [Real]Added 546 Read/Feed constraints in 177 ms returned sat
[2022-05-17 21:44:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:48] [INFO ] [Nat]Absence check using 23 positive place invariants in 36 ms returned sat
[2022-05-17 21:44:48] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2022-05-17 21:44:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:48] [INFO ] [Nat]Absence check using state equation in 754 ms returned sat
[2022-05-17 21:44:49] [INFO ] [Nat]Added 546 Read/Feed constraints in 194 ms returned sat
[2022-05-17 21:44:50] [INFO ] Deduced a trap composed of 40 places in 983 ms of which 2 ms to minimize.
[2022-05-17 21:44:51] [INFO ] Deduced a trap composed of 33 places in 971 ms of which 1 ms to minimize.
[2022-05-17 21:44:52] [INFO ] Deduced a trap composed of 25 places in 965 ms of which 2 ms to minimize.
[2022-05-17 21:44:53] [INFO ] Deduced a trap composed of 13 places in 986 ms of which 2 ms to minimize.
[2022-05-17 21:44:53] [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.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-05-17 21:44:53] [INFO ] [Real]Absence check using 23 positive place invariants in 32 ms returned sat
[2022-05-17 21:44:53] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2022-05-17 21:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:54] [INFO ] [Real]Absence check using state equation in 801 ms returned sat
[2022-05-17 21:44:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:44:54] [INFO ] [Nat]Absence check using 23 positive place invariants in 32 ms returned sat
[2022-05-17 21:44:54] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2022-05-17 21:44:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:44:55] [INFO ] [Nat]Absence check using state equation in 750 ms returned sat
[2022-05-17 21:44:55] [INFO ] [Nat]Added 546 Read/Feed constraints in 177 ms returned sat
[2022-05-17 21:44:56] [INFO ] Deduced a trap composed of 24 places in 725 ms of which 2 ms to minimize.
[2022-05-17 21:44:57] [INFO ] Deduced a trap composed of 89 places in 743 ms of which 1 ms to minimize.
[2022-05-17 21:44:58] [INFO ] Deduced a trap composed of 128 places in 764 ms of which 1 ms to minimize.
[2022-05-17 21:44:59] [INFO ] Deduced a trap composed of 120 places in 717 ms of which 1 ms to minimize.
[2022-05-17 21:44:59] [INFO ] Deduced a trap composed of 120 places in 781 ms of which 1 ms to minimize.
[2022-05-17 21:44:59] [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)
[2022-05-17 21:45:00] [INFO ] [Real]Absence check using 23 positive place invariants in 33 ms returned sat
[2022-05-17 21:45:00] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2022-05-17 21:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:00] [INFO ] [Real]Absence check using state equation in 795 ms returned sat
[2022-05-17 21:45:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:01] [INFO ] [Nat]Absence check using 23 positive place invariants in 36 ms returned sat
[2022-05-17 21:45:01] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 11 ms returned sat
[2022-05-17 21:45:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:01] [INFO ] [Nat]Absence check using state equation in 723 ms returned sat
[2022-05-17 21:45:02] [INFO ] [Nat]Added 546 Read/Feed constraints in 174 ms returned sat
[2022-05-17 21:45:02] [INFO ] Deduced a trap composed of 24 places in 719 ms of which 2 ms to minimize.
[2022-05-17 21:45:03] [INFO ] Deduced a trap composed of 89 places in 730 ms of which 1 ms to minimize.
[2022-05-17 21:45:04] [INFO ] Deduced a trap composed of 128 places in 750 ms of which 1 ms to minimize.
[2022-05-17 21:45:05] [INFO ] Deduced a trap composed of 120 places in 711 ms of which 2 ms to minimize.
[2022-05-17 21:45:06] [INFO ] Deduced a trap composed of 120 places in 728 ms of which 1 ms to minimize.
[2022-05-17 21:45:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
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-05-17 21:45:06] [INFO ] [Real]Absence check using 23 positive place invariants in 34 ms returned sat
[2022-05-17 21:45:06] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2022-05-17 21:45:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:07] [INFO ] [Real]Absence check using state equation in 777 ms returned sat
[2022-05-17 21:45:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:07] [INFO ] [Nat]Absence check using 23 positive place invariants in 33 ms returned sat
[2022-05-17 21:45:07] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2022-05-17 21:45:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:08] [INFO ] [Nat]Absence check using state equation in 774 ms returned sat
[2022-05-17 21:45:08] [INFO ] [Nat]Added 546 Read/Feed constraints in 185 ms returned sat
[2022-05-17 21:45:09] [INFO ] Deduced a trap composed of 67 places in 890 ms of which 1 ms to minimize.
[2022-05-17 21:45:10] [INFO ] Deduced a trap composed of 17 places in 892 ms of which 1 ms to minimize.
[2022-05-17 21:45:11] [INFO ] Deduced a trap composed of 13 places in 895 ms of which 1 ms to minimize.
[2022-05-17 21:45:12] [INFO ] Deduced a trap composed of 176 places in 894 ms of which 2 ms to minimize.
[2022-05-17 21:45:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-05-17 21:45:12] [INFO ] [Real]Absence check using 23 positive place invariants in 33 ms returned sat
[2022-05-17 21:45:12] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2022-05-17 21:45:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:13] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2022-05-17 21:45:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:13] [INFO ] [Nat]Absence check using 23 positive place invariants in 34 ms returned sat
[2022-05-17 21:45:13] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2022-05-17 21:45:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:14] [INFO ] [Nat]Absence check using state equation in 791 ms returned sat
[2022-05-17 21:45:14] [INFO ] [Nat]Added 546 Read/Feed constraints in 183 ms returned sat
[2022-05-17 21:45:15] [INFO ] Deduced a trap composed of 67 places in 923 ms of which 2 ms to minimize.
[2022-05-17 21:45:16] [INFO ] Deduced a trap composed of 17 places in 900 ms of which 2 ms to minimize.
[2022-05-17 21:45:17] [INFO ] Deduced a trap composed of 13 places in 885 ms of which 2 ms to minimize.
[2022-05-17 21:45:18] [INFO ] Deduced a trap composed of 176 places in 862 ms of which 1 ms to minimize.
[2022-05-17 21:45:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-05-17 21:45:18] [INFO ] [Real]Absence check using 23 positive place invariants in 31 ms returned sat
[2022-05-17 21:45:18] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2022-05-17 21:45:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:19] [INFO ] [Real]Absence check using state equation in 738 ms returned sat
[2022-05-17 21:45:19] [INFO ] [Real]Added 546 Read/Feed constraints in 186 ms returned sat
[2022-05-17 21:45:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:20] [INFO ] [Nat]Absence check using 23 positive place invariants in 32 ms returned sat
[2022-05-17 21:45:20] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 18 ms returned sat
[2022-05-17 21:45:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:21] [INFO ] [Nat]Absence check using state equation in 764 ms returned sat
[2022-05-17 21:45:21] [INFO ] [Nat]Added 546 Read/Feed constraints in 197 ms returned sat
[2022-05-17 21:45:22] [INFO ] Deduced a trap composed of 40 places in 991 ms of which 1 ms to minimize.
[2022-05-17 21:45:23] [INFO ] Deduced a trap composed of 33 places in 971 ms of which 2 ms to minimize.
[2022-05-17 21:45:24] [INFO ] Deduced a trap composed of 25 places in 982 ms of which 2 ms to minimize.
[2022-05-17 21:45:25] [INFO ] Deduced a trap composed of 13 places in 946 ms of which 2 ms to minimize.
[2022-05-17 21:45:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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-05-17 21:45:25] [INFO ] [Real]Absence check using 23 positive place invariants in 35 ms returned sat
[2022-05-17 21:45:25] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 24 ms returned sat
[2022-05-17 21:45:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:26] [INFO ] [Real]Absence check using state equation in 802 ms returned sat
[2022-05-17 21:45:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:26] [INFO ] [Nat]Absence check using 23 positive place invariants in 36 ms returned sat
[2022-05-17 21:45:26] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 14 ms returned sat
[2022-05-17 21:45:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:27] [INFO ] [Nat]Absence check using state equation in 796 ms returned sat
[2022-05-17 21:45:27] [INFO ] [Nat]Added 546 Read/Feed constraints in 193 ms returned sat
[2022-05-17 21:45:28] [INFO ] Deduced a trap composed of 67 places in 929 ms of which 8 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 17 places in 880 ms of which 1 ms to minimize.
[2022-05-17 21:45:30] [INFO ] Deduced a trap composed of 13 places in 891 ms of which 2 ms to minimize.
[2022-05-17 21:45:31] [INFO ] Deduced a trap composed of 176 places in 882 ms of which 2 ms to minimize.
[2022-05-17 21:45:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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) : [8, 8, 8, 8, 8, 8, 8, 8, 8] Max seen :[3, 7, 3, 1, 1, 7, 7, 3, 7]
Support contains 512 out of 1992 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 1992 transition count 2704
Reduce places removed 392 places and 0 transitions.
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 392
Iterating post reduction 1 with 784 rules applied. Total rules applied 1176 place count 1600 transition count 2312
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 2 with 392 rules applied. Total rules applied 1568 place count 1208 transition count 2312
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 1568 place count 1208 transition count 2256
Deduced a syphon composed of 56 places in 4 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 1680 place count 1152 transition count 2256
Applied a total of 1680 rules in 305 ms. Remains 1152 /1992 variables (removed 840) and now considering 2256/3096 (removed 840) transitions.
Finished structural reductions, in 1 iterations. Remains : 1152/1992 places, 2256/3096 transitions.
Normalized transition count is 1920 out of 2256 initially.
// Phase 1: matrix 1920 rows 1152 cols
[2022-05-17 21:45:32] [INFO ] Computed 31 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 27620 ms. (steps per millisecond=36 ) properties (out of 9) seen :39
Interrupted Best-First random walk after 520282 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=104 ) properties seen :{0=1, 1=6, 2=1, 5=6, 6=6, 7=1, 8=6}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4141 ms. (steps per millisecond=241 ) properties (out of 9) seen :28
Interrupted Best-First random walk after 520426 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=104 ) properties seen :{0=1, 1=3, 2=1, 5=3, 6=3, 7=1, 8=3}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3462 ms. (steps per millisecond=288 ) properties (out of 9) seen :21
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3463 ms. (steps per millisecond=288 ) properties (out of 9) seen :28
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4123 ms. (steps per millisecond=242 ) properties (out of 9) seen :31
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4126 ms. (steps per millisecond=242 ) properties (out of 9) seen :31
Interrupted Best-First random walk after 521056 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=104 ) properties seen :{0=2, 1=4, 2=2, 5=4, 6=4, 7=2, 8=4}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4114 ms. (steps per millisecond=243 ) properties (out of 9) seen :34
[2022-05-17 21:46:38] [INFO ] Flow matrix only has 1920 transitions (discarded 336 similar events)
// Phase 1: matrix 1920 rows 1152 cols
[2022-05-17 21:46:38] [INFO ] Computed 31 place invariants in 20 ms
[2022-05-17 21:46:38] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 21:46:38] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 21:46:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:38] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2022-05-17 21:46:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:46:39] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 21:46:39] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 11 ms returned sat
[2022-05-17 21:46:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:39] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2022-05-17 21:46:39] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 21:46:39] [INFO ] [Nat]Added 546 Read/Feed constraints in 113 ms returned sat
[2022-05-17 21:46:40] [INFO ] Deduced a trap composed of 55 places in 448 ms of which 0 ms to minimize.
[2022-05-17 21:46:40] [INFO ] Deduced a trap composed of 56 places in 437 ms of which 1 ms to minimize.
[2022-05-17 21:46:41] [INFO ] Deduced a trap composed of 36 places in 434 ms of which 1 ms to minimize.
[2022-05-17 21:46:41] [INFO ] Deduced a trap composed of 42 places in 488 ms of which 1 ms to minimize.
[2022-05-17 21:46:42] [INFO ] Deduced a trap composed of 83 places in 444 ms of which 1 ms to minimize.
[2022-05-17 21:46:42] [INFO ] Deduced a trap composed of 58 places in 460 ms of which 1 ms to minimize.
[2022-05-17 21:46:43] [INFO ] Deduced a trap composed of 20 places in 468 ms of which 1 ms to minimize.
[2022-05-17 21:46:43] [INFO ] Deduced a trap composed of 59 places in 444 ms of which 1 ms to minimize.
[2022-05-17 21:46:44] [INFO ] Deduced a trap composed of 91 places in 444 ms of which 0 ms to minimize.
[2022-05-17 21:46:44] [INFO ] Deduced a trap composed of 51 places in 427 ms of which 1 ms to minimize.
[2022-05-17 21:46:45] [INFO ] Deduced a trap composed of 17 places in 430 ms of which 1 ms to minimize.
[2022-05-17 21:46:45] [INFO ] Deduced a trap composed of 55 places in 470 ms of which 1 ms to minimize.
[2022-05-17 21:46:46] [INFO ] Deduced a trap composed of 17 places in 452 ms of which 1 ms to minimize.
[2022-05-17 21:46:46] [INFO ] Deduced a trap composed of 47 places in 438 ms of which 1 ms to minimize.
[2022-05-17 21:46:47] [INFO ] Deduced a trap composed of 81 places in 497 ms of which 1 ms to minimize.
[2022-05-17 21:46:47] [INFO ] Deduced a trap composed of 87 places in 448 ms of which 1 ms to minimize.
[2022-05-17 21:46:48] [INFO ] Deduced a trap composed of 71 places in 449 ms of which 1 ms to minimize.
[2022-05-17 21:46:49] [INFO ] Deduced a trap composed of 58 places in 471 ms of which 1 ms to minimize.
[2022-05-17 21:46:49] [INFO ] Deduced a trap composed of 28 places in 459 ms of which 8 ms to minimize.
[2022-05-17 21:46:50] [INFO ] Deduced a trap composed of 52 places in 429 ms of which 1 ms to minimize.
[2022-05-17 21:46:50] [INFO ] Deduced a trap composed of 70 places in 454 ms of which 1 ms to minimize.
[2022-05-17 21:46:51] [INFO ] Deduced a trap composed of 70 places in 431 ms of which 1 ms to minimize.
[2022-05-17 21:46:51] [INFO ] Deduced a trap composed of 20 places in 439 ms of which 1 ms to minimize.
[2022-05-17 21:46:52] [INFO ] Deduced a trap composed of 79 places in 444 ms of which 1 ms to minimize.
[2022-05-17 21:46:52] [INFO ] Deduced a trap composed of 70 places in 440 ms of which 1 ms to minimize.
[2022-05-17 21:46:53] [INFO ] Deduced a trap composed of 38 places in 446 ms of which 0 ms to minimize.
[2022-05-17 21:46:53] [INFO ] Deduced a trap composed of 13 places in 439 ms of which 1 ms to minimize.
[2022-05-17 21:46:54] [INFO ] Deduced a trap composed of 70 places in 454 ms of which 3 ms to minimize.
[2022-05-17 21:46:54] [INFO ] Deduced a trap composed of 11 places in 437 ms of which 2 ms to minimize.
[2022-05-17 21:46:55] [INFO ] Deduced a trap composed of 34 places in 455 ms of which 9 ms to minimize.
[2022-05-17 21:46:55] [INFO ] Deduced a trap composed of 20 places in 452 ms of which 1 ms to minimize.
[2022-05-17 21:46:56] [INFO ] Deduced a trap composed of 63 places in 440 ms of which 1 ms to minimize.
[2022-05-17 21:46:56] [INFO ] Deduced a trap composed of 43 places in 421 ms of which 1 ms to minimize.
[2022-05-17 21:46:57] [INFO ] Deduced a trap composed of 52 places in 449 ms of which 1 ms to minimize.
[2022-05-17 21:46:57] [INFO ] Deduced a trap composed of 33 places in 415 ms of which 1 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 20 places in 452 ms of which 1 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 31 places in 450 ms of which 1 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 11 places in 474 ms of which 0 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 36 places in 424 ms of which 1 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 11 places in 431 ms of which 1 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 135 places in 253 ms of which 1 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 118 places in 243 ms of which 1 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 99 places in 250 ms of which 1 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 128 places in 326 ms of which 1 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 70 places in 324 ms of which 0 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 101 places in 328 ms of which 1 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 91 places in 352 ms of which 1 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Deduced a trap composed of 82 places in 350 ms of which 1 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Deduced a trap composed of 67 places in 350 ms of which 1 ms to minimize.
[2022-05-17 21:47:04] [INFO ] Deduced a trap composed of 100 places in 332 ms of which 1 ms to minimize.
[2022-05-17 21:47:04] [INFO ] Deduced a trap composed of 74 places in 336 ms of which 1 ms to minimize.
[2022-05-17 21:47:05] [INFO ] Deduced a trap composed of 74 places in 344 ms of which 1 ms to minimize.
[2022-05-17 21:47:05] [INFO ] Deduced a trap composed of 36 places in 354 ms of which 1 ms to minimize.
[2022-05-17 21:47:05] [INFO ] Deduced a trap composed of 97 places in 361 ms of which 1 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 158 places in 345 ms of which 1 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 127 places in 340 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 119 places in 345 ms of which 1 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 77 places in 350 ms of which 1 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 82 places in 349 ms of which 1 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 92 places in 369 ms of which 1 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 93 places in 337 ms of which 0 ms to minimize.
[2022-05-17 21:47:09] [INFO ] Deduced a trap composed of 81 places in 341 ms of which 1 ms to minimize.
[2022-05-17 21:47:09] [INFO ] Deduced a trap composed of 42 places in 318 ms of which 1 ms to minimize.
[2022-05-17 21:47:09] [INFO ] Deduced a trap composed of 133 places in 330 ms of which 1 ms to minimize.
[2022-05-17 21:47:10] [INFO ] Deduced a trap composed of 154 places in 339 ms of which 1 ms to minimize.
[2022-05-17 21:47:10] [INFO ] Deduced a trap composed of 63 places in 353 ms of which 1 ms to minimize.
[2022-05-17 21:47:11] [INFO ] Deduced a trap composed of 154 places in 338 ms of which 1 ms to minimize.
[2022-05-17 21:47:11] [INFO ] Deduced a trap composed of 89 places in 350 ms of which 1 ms to minimize.
[2022-05-17 21:47:12] [INFO ] Deduced a trap composed of 154 places in 326 ms of which 1 ms to minimize.
[2022-05-17 21:47:12] [INFO ] Deduced a trap composed of 56 places in 306 ms of which 1 ms to minimize.
[2022-05-17 21:47:12] [INFO ] Deduced a trap composed of 86 places in 361 ms of which 1 ms to minimize.
[2022-05-17 21:47:13] [INFO ] Deduced a trap composed of 202 places in 343 ms of which 1 ms to minimize.
[2022-05-17 21:47:13] [INFO ] Deduced a trap composed of 184 places in 327 ms of which 1 ms to minimize.
[2022-05-17 21:47:14] [INFO ] Deduced a trap composed of 116 places in 304 ms of which 1 ms to minimize.
[2022-05-17 21:47:14] [INFO ] Deduced a trap composed of 167 places in 310 ms of which 1 ms to minimize.
[2022-05-17 21:47:14] [INFO ] Deduced a trap composed of 135 places in 305 ms of which 0 ms to minimize.
[2022-05-17 21:47:15] [INFO ] Deduced a trap composed of 114 places in 314 ms of which 1 ms to minimize.
[2022-05-17 21:47:15] [INFO ] Deduced a trap composed of 163 places in 331 ms of which 1 ms to minimize.
[2022-05-17 21:47:15] [INFO ] Deduced a trap composed of 133 places in 310 ms of which 0 ms to minimize.
[2022-05-17 21:47:16] [INFO ] Deduced a trap composed of 135 places in 307 ms of which 1 ms to minimize.
[2022-05-17 21:47:16] [INFO ] Deduced a trap composed of 195 places in 315 ms of which 1 ms to minimize.
[2022-05-17 21:47:17] [INFO ] Deduced a trap composed of 135 places in 308 ms of which 0 ms to minimize.
[2022-05-17 21:47:17] [INFO ] Deduced a trap composed of 130 places in 240 ms of which 1 ms to minimize.
[2022-05-17 21:47:17] [INFO ] Deduced a trap composed of 130 places in 250 ms of which 0 ms to minimize.
[2022-05-17 21:47:17] [INFO ] Deduced a trap composed of 130 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:47:18] [INFO ] Deduced a trap composed of 130 places in 234 ms of which 1 ms to minimize.
[2022-05-17 21:47:18] [INFO ] Deduced a trap composed of 116 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:47:18] [INFO ] Deduced a trap composed of 76 places in 285 ms of which 1 ms to minimize.
[2022-05-17 21:47:19] [INFO ] Deduced a trap composed of 95 places in 301 ms of which 1 ms to minimize.
[2022-05-17 21:47:19] [INFO ] Deduced a trap composed of 78 places in 296 ms of which 1 ms to minimize.
[2022-05-17 21:47:20] [INFO ] Deduced a trap composed of 116 places in 297 ms of which 1 ms to minimize.
[2022-05-17 21:47:20] [INFO ] Deduced a trap composed of 135 places in 285 ms of which 1 ms to minimize.
[2022-05-17 21:47:20] [INFO ] Deduced a trap composed of 78 places in 281 ms of which 1 ms to minimize.
[2022-05-17 21:47:21] [INFO ] Deduced a trap composed of 116 places in 242 ms of which 1 ms to minimize.
[2022-05-17 21:47:21] [INFO ] Deduced a trap composed of 142 places in 248 ms of which 0 ms to minimize.
[2022-05-17 21:47:21] [INFO ] Deduced a trap composed of 118 places in 258 ms of which 1 ms to minimize.
[2022-05-17 21:47:22] [INFO ] Deduced a trap composed of 135 places in 256 ms of which 0 ms to minimize.
[2022-05-17 21:47:22] [INFO ] Trap strengthening (SAT) tested/added 98/97 trap constraints in 42441 ms
[2022-05-17 21:47:22] [INFO ] Computed and/alt/rep : 1800/5000/1800 causal constraints (skipped 112 transitions) in 108 ms.
[2022-05-17 21:47:24] [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: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-05-17 21:47:24] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 21:47:24] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 21:47:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:24] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2022-05-17 21:47:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:47:24] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 21:47:24] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 21:47:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:25] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2022-05-17 21:47:25] [INFO ] [Nat]Added 546 Read/Feed constraints in 96 ms returned sat
[2022-05-17 21:47:25] [INFO ] Deduced a trap composed of 17 places in 390 ms of which 1 ms to minimize.
[2022-05-17 21:47:26] [INFO ] Deduced a trap composed of 13 places in 376 ms of which 1 ms to minimize.
[2022-05-17 21:47:26] [INFO ] Deduced a trap composed of 32 places in 372 ms of which 1 ms to minimize.
[2022-05-17 21:47:27] [INFO ] Deduced a trap composed of 42 places in 386 ms of which 1 ms to minimize.
[2022-05-17 21:47:27] [INFO ] Deduced a trap composed of 42 places in 364 ms of which 1 ms to minimize.
[2022-05-17 21:47:27] [INFO ] Deduced a trap composed of 17 places in 386 ms of which 1 ms to minimize.
[2022-05-17 21:47:28] [INFO ] Deduced a trap composed of 44 places in 376 ms of which 1 ms to minimize.
[2022-05-17 21:47:28] [INFO ] Deduced a trap composed of 17 places in 371 ms of which 0 ms to minimize.
[2022-05-17 21:47:29] [INFO ] Deduced a trap composed of 25 places in 376 ms of which 1 ms to minimize.
[2022-05-17 21:47:29] [INFO ] Deduced a trap composed of 44 places in 376 ms of which 1 ms to minimize.
[2022-05-17 21:47:30] [INFO ] Deduced a trap composed of 25 places in 369 ms of which 1 ms to minimize.
[2022-05-17 21:47:30] [INFO ] Deduced a trap composed of 30 places in 388 ms of which 0 ms to minimize.
[2022-05-17 21:47:31] [INFO ] Deduced a trap composed of 17 places in 366 ms of which 6 ms to minimize.
[2022-05-17 21:47:31] [INFO ] Deduced a trap composed of 29 places in 368 ms of which 1 ms to minimize.
[2022-05-17 21:47:31] [INFO ] Deduced a trap composed of 93 places in 367 ms of which 0 ms to minimize.
[2022-05-17 21:47:32] [INFO ] Deduced a trap composed of 14 places in 365 ms of which 1 ms to minimize.
[2022-05-17 21:47:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 7086 ms
[2022-05-17 21:47:32] [INFO ] [Real]Absence check using 23 positive place invariants in 25 ms returned sat
[2022-05-17 21:47:32] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 21:47:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:32] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2022-05-17 21:47:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:47:33] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 21:47:33] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 21:47:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:33] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2022-05-17 21:47:33] [INFO ] [Nat]Added 546 Read/Feed constraints in 103 ms returned sat
[2022-05-17 21:47:34] [INFO ] Deduced a trap composed of 55 places in 463 ms of which 1 ms to minimize.
[2022-05-17 21:47:34] [INFO ] Deduced a trap composed of 56 places in 463 ms of which 1 ms to minimize.
[2022-05-17 21:47:35] [INFO ] Deduced a trap composed of 36 places in 437 ms of which 1 ms to minimize.
[2022-05-17 21:47:35] [INFO ] Deduced a trap composed of 42 places in 477 ms of which 1 ms to minimize.
[2022-05-17 21:47:36] [INFO ] Deduced a trap composed of 83 places in 444 ms of which 1 ms to minimize.
[2022-05-17 21:47:36] [INFO ] Deduced a trap composed of 58 places in 436 ms of which 0 ms to minimize.
[2022-05-17 21:47:37] [INFO ] Deduced a trap composed of 20 places in 443 ms of which 1 ms to minimize.
[2022-05-17 21:47:37] [INFO ] Deduced a trap composed of 59 places in 429 ms of which 1 ms to minimize.
[2022-05-17 21:47:38] [INFO ] Deduced a trap composed of 91 places in 426 ms of which 1 ms to minimize.
[2022-05-17 21:47:38] [INFO ] Deduced a trap composed of 51 places in 414 ms of which 1 ms to minimize.
[2022-05-17 21:47:39] [INFO ] Deduced a trap composed of 17 places in 427 ms of which 1 ms to minimize.
[2022-05-17 21:47:39] [INFO ] Deduced a trap composed of 55 places in 442 ms of which 1 ms to minimize.
[2022-05-17 21:47:40] [INFO ] Deduced a trap composed of 17 places in 431 ms of which 1 ms to minimize.
[2022-05-17 21:47:40] [INFO ] Deduced a trap composed of 47 places in 435 ms of which 1 ms to minimize.
[2022-05-17 21:47:41] [INFO ] Deduced a trap composed of 81 places in 436 ms of which 1 ms to minimize.
[2022-05-17 21:47:41] [INFO ] Deduced a trap composed of 87 places in 459 ms of which 1 ms to minimize.
[2022-05-17 21:47:42] [INFO ] Deduced a trap composed of 71 places in 451 ms of which 1 ms to minimize.
[2022-05-17 21:47:42] [INFO ] Deduced a trap composed of 58 places in 427 ms of which 1 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 28 places in 443 ms of which 1 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 52 places in 424 ms of which 1 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 70 places in 429 ms of which 1 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 70 places in 427 ms of which 1 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 20 places in 450 ms of which 1 ms to minimize.
[2022-05-17 21:47:45] [INFO ] Deduced a trap composed of 79 places in 446 ms of which 0 ms to minimize.
[2022-05-17 21:47:46] [INFO ] Deduced a trap composed of 70 places in 433 ms of which 1 ms to minimize.
[2022-05-17 21:47:46] [INFO ] Deduced a trap composed of 38 places in 430 ms of which 1 ms to minimize.
[2022-05-17 21:47:47] [INFO ] Deduced a trap composed of 13 places in 428 ms of which 1 ms to minimize.
[2022-05-17 21:47:47] [INFO ] Deduced a trap composed of 70 places in 429 ms of which 1 ms to minimize.
[2022-05-17 21:47:48] [INFO ] Deduced a trap composed of 11 places in 430 ms of which 1 ms to minimize.
[2022-05-17 21:47:48] [INFO ] Deduced a trap composed of 34 places in 419 ms of which 0 ms to minimize.
[2022-05-17 21:47:49] [INFO ] Deduced a trap composed of 20 places in 416 ms of which 1 ms to minimize.
[2022-05-17 21:47:49] [INFO ] Deduced a trap composed of 63 places in 434 ms of which 1 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 43 places in 433 ms of which 1 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 52 places in 452 ms of which 1 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 33 places in 446 ms of which 1 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Deduced a trap composed of 20 places in 438 ms of which 1 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 31 places in 443 ms of which 1 ms to minimize.
[2022-05-17 21:47:52] [INFO ] Deduced a trap composed of 11 places in 429 ms of which 0 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 36 places in 426 ms of which 1 ms to minimize.
[2022-05-17 21:47:53] [INFO ] Deduced a trap composed of 11 places in 412 ms of which 1 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 135 places in 259 ms of which 1 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 118 places in 242 ms of which 0 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 99 places in 240 ms of which 1 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 128 places in 343 ms of which 1 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 70 places in 370 ms of which 1 ms to minimize.
[2022-05-17 21:47:56] [INFO ] Deduced a trap composed of 101 places in 336 ms of which 0 ms to minimize.
[2022-05-17 21:47:56] [INFO ] Deduced a trap composed of 91 places in 346 ms of which 1 ms to minimize.
[2022-05-17 21:47:56] [INFO ] Deduced a trap composed of 82 places in 357 ms of which 1 ms to minimize.
[2022-05-17 21:47:57] [INFO ] Deduced a trap composed of 67 places in 360 ms of which 0 ms to minimize.
[2022-05-17 21:47:57] [INFO ] Deduced a trap composed of 100 places in 342 ms of which 1 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 74 places in 343 ms of which 1 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 74 places in 338 ms of which 1 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 36 places in 341 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 97 places in 347 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 158 places in 339 ms of which 1 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 127 places in 342 ms of which 1 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 119 places in 345 ms of which 1 ms to minimize.
[2022-05-17 21:48:01] [INFO ] Deduced a trap composed of 77 places in 339 ms of which 0 ms to minimize.
[2022-05-17 21:48:01] [INFO ] Deduced a trap composed of 82 places in 345 ms of which 1 ms to minimize.
[2022-05-17 21:48:01] [INFO ] Deduced a trap composed of 92 places in 370 ms of which 0 ms to minimize.
[2022-05-17 21:48:02] [INFO ] Deduced a trap composed of 93 places in 333 ms of which 1 ms to minimize.
[2022-05-17 21:48:02] [INFO ] Deduced a trap composed of 81 places in 327 ms of which 1 ms to minimize.
[2022-05-17 21:48:03] [INFO ] Deduced a trap composed of 42 places in 311 ms of which 1 ms to minimize.
[2022-05-17 21:48:03] [INFO ] Deduced a trap composed of 133 places in 335 ms of which 0 ms to minimize.
[2022-05-17 21:48:03] [INFO ] Deduced a trap composed of 154 places in 350 ms of which 1 ms to minimize.
[2022-05-17 21:48:04] [INFO ] Deduced a trap composed of 63 places in 343 ms of which 1 ms to minimize.
[2022-05-17 21:48:04] [INFO ] Deduced a trap composed of 154 places in 331 ms of which 0 ms to minimize.
[2022-05-17 21:48:05] [INFO ] Deduced a trap composed of 89 places in 343 ms of which 0 ms to minimize.
[2022-05-17 21:48:05] [INFO ] Deduced a trap composed of 154 places in 311 ms of which 1 ms to minimize.
[2022-05-17 21:48:05] [INFO ] Deduced a trap composed of 56 places in 313 ms of which 0 ms to minimize.
[2022-05-17 21:48:06] [INFO ] Deduced a trap composed of 86 places in 348 ms of which 1 ms to minimize.
[2022-05-17 21:48:06] [INFO ] Deduced a trap composed of 202 places in 346 ms of which 1 ms to minimize.
[2022-05-17 21:48:07] [INFO ] Deduced a trap composed of 184 places in 333 ms of which 1 ms to minimize.
[2022-05-17 21:48:07] [INFO ] Deduced a trap composed of 116 places in 311 ms of which 1 ms to minimize.
[2022-05-17 21:48:07] [INFO ] Deduced a trap composed of 167 places in 301 ms of which 1 ms to minimize.
[2022-05-17 21:48:08] [INFO ] Deduced a trap composed of 135 places in 301 ms of which 1 ms to minimize.
[2022-05-17 21:48:08] [INFO ] Deduced a trap composed of 114 places in 301 ms of which 0 ms to minimize.
[2022-05-17 21:48:08] [INFO ] Deduced a trap composed of 163 places in 300 ms of which 0 ms to minimize.
[2022-05-17 21:48:09] [INFO ] Deduced a trap composed of 133 places in 304 ms of which 1 ms to minimize.
[2022-05-17 21:48:09] [INFO ] Deduced a trap composed of 135 places in 306 ms of which 1 ms to minimize.
[2022-05-17 21:48:10] [INFO ] Deduced a trap composed of 195 places in 296 ms of which 1 ms to minimize.
[2022-05-17 21:48:10] [INFO ] Deduced a trap composed of 135 places in 297 ms of which 0 ms to minimize.
[2022-05-17 21:48:10] [INFO ] Deduced a trap composed of 130 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:48:10] [INFO ] Deduced a trap composed of 130 places in 234 ms of which 0 ms to minimize.
[2022-05-17 21:48:11] [INFO ] Deduced a trap composed of 130 places in 248 ms of which 1 ms to minimize.
[2022-05-17 21:48:11] [INFO ] Deduced a trap composed of 130 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:48:11] [INFO ] Deduced a trap composed of 116 places in 222 ms of which 0 ms to minimize.
[2022-05-17 21:48:12] [INFO ] Deduced a trap composed of 76 places in 292 ms of which 1 ms to minimize.
[2022-05-17 21:48:12] [INFO ] Deduced a trap composed of 95 places in 298 ms of which 1 ms to minimize.
[2022-05-17 21:48:12] [INFO ] Deduced a trap composed of 78 places in 293 ms of which 1 ms to minimize.
[2022-05-17 21:48:13] [INFO ] Deduced a trap composed of 116 places in 295 ms of which 1 ms to minimize.
[2022-05-17 21:48:13] [INFO ] Deduced a trap composed of 135 places in 288 ms of which 1 ms to minimize.
[2022-05-17 21:48:14] [INFO ] Deduced a trap composed of 78 places in 303 ms of which 7 ms to minimize.
[2022-05-17 21:48:14] [INFO ] Deduced a trap composed of 116 places in 251 ms of which 0 ms to minimize.
[2022-05-17 21:48:14] [INFO ] Deduced a trap composed of 142 places in 247 ms of which 1 ms to minimize.
[2022-05-17 21:48:15] [INFO ] Deduced a trap composed of 118 places in 239 ms of which 1 ms to minimize.
[2022-05-17 21:48:15] [INFO ] Deduced a trap composed of 135 places in 254 ms of which 0 ms to minimize.
[2022-05-17 21:48:15] [INFO ] Trap strengthening (SAT) tested/added 98/97 trap constraints in 41815 ms
[2022-05-17 21:48:15] [INFO ] Computed and/alt/rep : 1800/5000/1800 causal constraints (skipped 112 transitions) in 113 ms.
[2022-05-17 21:48:17] [INFO ] Added : 110 causal constraints over 22 iterations in 2555 ms. Result :unknown
[2022-05-17 21:48:18] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 21:48:18] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 21:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:48:18] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2022-05-17 21:48:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:48:18] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 21:48:18] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 21:48:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:48:19] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2022-05-17 21:48:19] [INFO ] [Nat]Added 546 Read/Feed constraints in 97 ms returned sat
[2022-05-17 21:48:19] [INFO ] Deduced a trap composed of 13 places in 287 ms of which 0 ms to minimize.
[2022-05-17 21:48:19] [INFO ] Deduced a trap composed of 63 places in 296 ms of which 1 ms to minimize.
[2022-05-17 21:48:20] [INFO ] Deduced a trap composed of 11 places in 295 ms of which 1 ms to minimize.
[2022-05-17 21:48:20] [INFO ] Deduced a trap composed of 51 places in 308 ms of which 1 ms to minimize.
[2022-05-17 21:48:21] [INFO ] Deduced a trap composed of 108 places in 294 ms of which 1 ms to minimize.
[2022-05-17 21:48:21] [INFO ] Deduced a trap composed of 107 places in 308 ms of which 1 ms to minimize.
[2022-05-17 21:48:21] [INFO ] Deduced a trap composed of 19 places in 293 ms of which 1 ms to minimize.
[2022-05-17 21:48:22] [INFO ] Deduced a trap composed of 55 places in 293 ms of which 1 ms to minimize.
[2022-05-17 21:48:22] [INFO ] Deduced a trap composed of 70 places in 292 ms of which 0 ms to minimize.
[2022-05-17 21:48:22] [INFO ] Deduced a trap composed of 20 places in 291 ms of which 1 ms to minimize.
[2022-05-17 21:48:23] [INFO ] Deduced a trap composed of 53 places in 287 ms of which 1 ms to minimize.
[2022-05-17 21:48:23] [INFO ] Deduced a trap composed of 55 places in 293 ms of which 0 ms to minimize.
[2022-05-17 21:48:23] [INFO ] Deduced a trap composed of 59 places in 295 ms of which 1 ms to minimize.
[2022-05-17 21:48:24] [INFO ] Deduced a trap composed of 61 places in 300 ms of which 0 ms to minimize.
[2022-05-17 21:48:24] [INFO ] Deduced a trap composed of 139 places in 311 ms of which 1 ms to minimize.
[2022-05-17 21:48:25] [INFO ] Deduced a trap composed of 189 places in 294 ms of which 1 ms to minimize.
[2022-05-17 21:48:25] [INFO ] Deduced a trap composed of 93 places in 287 ms of which 1 ms to minimize.
[2022-05-17 21:48:25] [INFO ] Deduced a trap composed of 161 places in 300 ms of which 1 ms to minimize.
[2022-05-17 21:48:26] [INFO ] Deduced a trap composed of 115 places in 297 ms of which 1 ms to minimize.
[2022-05-17 21:48:26] [INFO ] Deduced a trap composed of 133 places in 303 ms of which 1 ms to minimize.
[2022-05-17 21:48:26] [INFO ] Deduced a trap composed of 93 places in 303 ms of which 1 ms to minimize.
[2022-05-17 21:48:27] [INFO ] Deduced a trap composed of 106 places in 305 ms of which 1 ms to minimize.
[2022-05-17 21:48:27] [INFO ] Deduced a trap composed of 159 places in 293 ms of which 1 ms to minimize.
[2022-05-17 21:48:27] [INFO ] Deduced a trap composed of 34 places in 295 ms of which 0 ms to minimize.
[2022-05-17 21:48:28] [INFO ] Deduced a trap composed of 60 places in 311 ms of which 0 ms to minimize.
[2022-05-17 21:48:28] [INFO ] Deduced a trap composed of 87 places in 302 ms of which 1 ms to minimize.
[2022-05-17 21:48:29] [INFO ] Deduced a trap composed of 87 places in 308 ms of which 1 ms to minimize.
[2022-05-17 21:48:29] [INFO ] Deduced a trap composed of 81 places in 306 ms of which 0 ms to minimize.
[2022-05-17 21:48:29] [INFO ] Deduced a trap composed of 36 places in 293 ms of which 1 ms to minimize.
[2022-05-17 21:48:30] [INFO ] Deduced a trap composed of 134 places in 285 ms of which 0 ms to minimize.
[2022-05-17 21:48:30] [INFO ] Deduced a trap composed of 93 places in 312 ms of which 1 ms to minimize.
[2022-05-17 21:48:30] [INFO ] Deduced a trap composed of 89 places in 298 ms of which 1 ms to minimize.
[2022-05-17 21:48:31] [INFO ] Deduced a trap composed of 21 places in 384 ms of which 1 ms to minimize.
[2022-05-17 21:48:31] [INFO ] Deduced a trap composed of 103 places in 373 ms of which 0 ms to minimize.
[2022-05-17 21:48:32] [INFO ] Deduced a trap composed of 44 places in 365 ms of which 0 ms to minimize.
[2022-05-17 21:48:32] [INFO ] Deduced a trap composed of 15 places in 356 ms of which 1 ms to minimize.
[2022-05-17 21:48:33] [INFO ] Deduced a trap composed of 43 places in 366 ms of which 1 ms to minimize.
[2022-05-17 21:48:33] [INFO ] Deduced a trap composed of 63 places in 361 ms of which 1 ms to minimize.
[2022-05-17 21:48:33] [INFO ] Deduced a trap composed of 40 places in 367 ms of which 0 ms to minimize.
[2022-05-17 21:48:34] [INFO ] Deduced a trap composed of 34 places in 402 ms of which 1 ms to minimize.
[2022-05-17 21:48:34] [INFO ] Deduced a trap composed of 84 places in 373 ms of which 1 ms to minimize.
[2022-05-17 21:48:35] [INFO ] Deduced a trap composed of 21 places in 391 ms of which 0 ms to minimize.
[2022-05-17 21:48:35] [INFO ] Deduced a trap composed of 171 places in 392 ms of which 1 ms to minimize.
[2022-05-17 21:48:36] [INFO ] Deduced a trap composed of 225 places in 396 ms of which 0 ms to minimize.
[2022-05-17 21:48:36] [INFO ] Deduced a trap composed of 41 places in 389 ms of which 1 ms to minimize.
[2022-05-17 21:48:37] [INFO ] Deduced a trap composed of 150 places in 398 ms of which 1 ms to minimize.
[2022-05-17 21:48:37] [INFO ] Deduced a trap composed of 42 places in 372 ms of which 1 ms to minimize.
[2022-05-17 21:48:38] [INFO ] Deduced a trap composed of 89 places in 364 ms of which 1 ms to minimize.
[2022-05-17 21:48:38] [INFO ] Deduced a trap composed of 199 places in 396 ms of which 1 ms to minimize.
[2022-05-17 21:48:38] [INFO ] Deduced a trap composed of 207 places in 391 ms of which 1 ms to minimize.
[2022-05-17 21:48:39] [INFO ] Deduced a trap composed of 249 places in 398 ms of which 1 ms to minimize.
[2022-05-17 21:48:39] [INFO ] Deduced a trap composed of 228 places in 372 ms of which 1 ms to minimize.
[2022-05-17 21:48:40] [INFO ] Deduced a trap composed of 36 places in 318 ms of which 0 ms to minimize.
[2022-05-17 21:48:40] [INFO ] Deduced a trap composed of 25 places in 305 ms of which 1 ms to minimize.
[2022-05-17 21:48:41] [INFO ] Deduced a trap composed of 157 places in 301 ms of which 0 ms to minimize.
[2022-05-17 21:48:41] [INFO ] Deduced a trap composed of 106 places in 279 ms of which 1 ms to minimize.
[2022-05-17 21:48:41] [INFO ] Deduced a trap composed of 30 places in 308 ms of which 1 ms to minimize.
[2022-05-17 21:48:42] [INFO ] Deduced a trap composed of 212 places in 308 ms of which 0 ms to minimize.
[2022-05-17 21:48:42] [INFO ] Deduced a trap composed of 13 places in 319 ms of which 0 ms to minimize.
[2022-05-17 21:48:42] [INFO ] Deduced a trap composed of 47 places in 281 ms of which 0 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 82 places in 403 ms of which 0 ms to minimize.
[2022-05-17 21:48:43] [INFO ] Deduced a trap composed of 44 places in 401 ms of which 1 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 24 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:48:44] [INFO ] Deduced a trap composed of 32 places in 388 ms of which 0 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 25 places in 384 ms of which 1 ms to minimize.
[2022-05-17 21:48:45] [INFO ] Deduced a trap composed of 49 places in 384 ms of which 1 ms to minimize.
[2022-05-17 21:48:46] [INFO ] Deduced a trap composed of 137 places in 385 ms of which 1 ms to minimize.
[2022-05-17 21:48:46] [INFO ] Deduced a trap composed of 19 places in 383 ms of which 1 ms to minimize.
[2022-05-17 21:48:46] [INFO ] Deduced a trap composed of 43 places in 335 ms of which 0 ms to minimize.
[2022-05-17 21:48:47] [INFO ] Deduced a trap composed of 105 places in 337 ms of which 0 ms to minimize.
[2022-05-17 21:48:47] [INFO ] Deduced a trap composed of 63 places in 329 ms of which 1 ms to minimize.
[2022-05-17 21:48:48] [INFO ] Deduced a trap composed of 196 places in 335 ms of which 1 ms to minimize.
[2022-05-17 21:48:48] [INFO ] Deduced a trap composed of 139 places in 336 ms of which 0 ms to minimize.
[2022-05-17 21:48:49] [INFO ] Deduced a trap composed of 249 places in 333 ms of which 1 ms to minimize.
[2022-05-17 21:48:49] [INFO ] Deduced a trap composed of 203 places in 340 ms of which 0 ms to minimize.
[2022-05-17 21:48:49] [INFO ] Deduced a trap composed of 59 places in 299 ms of which 0 ms to minimize.
[2022-05-17 21:48:50] [INFO ] Deduced a trap composed of 49 places in 298 ms of which 1 ms to minimize.
[2022-05-17 21:48:50] [INFO ] Deduced a trap composed of 101 places in 267 ms of which 1 ms to minimize.
[2022-05-17 21:48:50] [INFO ] Deduced a trap composed of 137 places in 348 ms of which 1 ms to minimize.
[2022-05-17 21:48:51] [INFO ] Deduced a trap composed of 164 places in 342 ms of which 1 ms to minimize.
[2022-05-17 21:48:51] [INFO ] Deduced a trap composed of 142 places in 318 ms of which 0 ms to minimize.
[2022-05-17 21:48:52] [INFO ] Deduced a trap composed of 92 places in 328 ms of which 1 ms to minimize.
[2022-05-17 21:48:52] [INFO ] Deduced a trap composed of 76 places in 269 ms of which 1 ms to minimize.
[2022-05-17 21:48:52] [INFO ] Deduced a trap composed of 133 places in 336 ms of which 0 ms to minimize.
[2022-05-17 21:48:53] [INFO ] Deduced a trap composed of 152 places in 332 ms of which 1 ms to minimize.
[2022-05-17 21:48:53] [INFO ] Deduced a trap composed of 176 places in 336 ms of which 1 ms to minimize.
[2022-05-17 21:48:54] [INFO ] Deduced a trap composed of 191 places in 329 ms of which 1 ms to minimize.
[2022-05-17 21:48:54] [INFO ] Deduced a trap composed of 137 places in 336 ms of which 1 ms to minimize.
[2022-05-17 21:48:54] [INFO ] Deduced a trap composed of 107 places in 273 ms of which 1 ms to minimize.
[2022-05-17 21:48:55] [INFO ] Deduced a trap composed of 244 places in 338 ms of which 1 ms to minimize.
[2022-05-17 21:48:55] [INFO ] Deduced a trap composed of 87 places in 294 ms of which 0 ms to minimize.
[2022-05-17 21:48:55] [INFO ] Deduced a trap composed of 49 places in 288 ms of which 1 ms to minimize.
[2022-05-17 21:48:56] [INFO ] Deduced a trap composed of 145 places in 314 ms of which 1 ms to minimize.
[2022-05-17 21:48:56] [INFO ] Deduced a trap composed of 57 places in 369 ms of which 1 ms to minimize.
[2022-05-17 21:48:57] [INFO ] Deduced a trap composed of 82 places in 364 ms of which 1 ms to minimize.
[2022-05-17 21:48:57] [INFO ] Deduced a trap composed of 221 places in 371 ms of which 1 ms to minimize.
[2022-05-17 21:48:58] [INFO ] Deduced a trap composed of 45 places in 304 ms of which 1 ms to minimize.
[2022-05-17 21:48:58] [INFO ] Deduced a trap composed of 61 places in 351 ms of which 1 ms to minimize.
[2022-05-17 21:48:58] [INFO ] Deduced a trap composed of 94 places in 350 ms of which 1 ms to minimize.
[2022-05-17 21:48:59] [INFO ] Deduced a trap composed of 33 places in 340 ms of which 1 ms to minimize.
[2022-05-17 21:48:59] [INFO ] Deduced a trap composed of 68 places in 371 ms of which 0 ms to minimize.
[2022-05-17 21:49:00] [INFO ] Deduced a trap composed of 156 places in 344 ms of which 1 ms to minimize.
[2022-05-17 21:49:00] [INFO ] Deduced a trap composed of 158 places in 344 ms of which 1 ms to minimize.
[2022-05-17 21:49:00] [INFO ] Deduced a trap composed of 135 places in 341 ms of which 1 ms to minimize.
[2022-05-17 21:49:01] [INFO ] Deduced a trap composed of 47 places in 325 ms of which 1 ms to minimize.
[2022-05-17 21:49:01] [INFO ] Deduced a trap composed of 143 places in 217 ms of which 1 ms to minimize.
[2022-05-17 21:49:01] [INFO ] Deduced a trap composed of 118 places in 211 ms of which 1 ms to minimize.
[2022-05-17 21:49:02] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 1 ms to minimize.
[2022-05-17 21:49:02] [INFO ] Deduced a trap composed of 128 places in 213 ms of which 0 ms to minimize.
[2022-05-17 21:49:02] [INFO ] Deduced a trap composed of 128 places in 215 ms of which 1 ms to minimize.
[2022-05-17 21:49:03] [INFO ] Deduced a trap composed of 112 places in 214 ms of which 0 ms to minimize.
[2022-05-17 21:49:03] [INFO ] Deduced a trap composed of 161 places in 205 ms of which 1 ms to minimize.
[2022-05-17 21:49:03] [INFO ] Deduced a trap composed of 80 places in 297 ms of which 0 ms to minimize.
[2022-05-17 21:49:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-05-17 21:49:03] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 21:49:03] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 21:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:49:04] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2022-05-17 21:49:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:49:04] [INFO ] [Nat]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 21:49:04] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 17 ms returned sat
[2022-05-17 21:49:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:49:04] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2022-05-17 21:49:04] [INFO ] [Nat]Added 546 Read/Feed constraints in 97 ms returned sat
[2022-05-17 21:49:05] [INFO ] Deduced a trap composed of 13 places in 292 ms of which 0 ms to minimize.
[2022-05-17 21:49:05] [INFO ] Deduced a trap composed of 63 places in 290 ms of which 1 ms to minimize.
[2022-05-17 21:49:05] [INFO ] Deduced a trap composed of 11 places in 295 ms of which 1 ms to minimize.
[2022-05-17 21:49:06] [INFO ] Deduced a trap composed of 51 places in 288 ms of which 1 ms to minimize.
[2022-05-17 21:49:06] [INFO ] Deduced a trap composed of 108 places in 295 ms of which 1 ms to minimize.
[2022-05-17 21:49:07] [INFO ] Deduced a trap composed of 107 places in 291 ms of which 1 ms to minimize.
[2022-05-17 21:49:07] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 1 ms to minimize.
[2022-05-17 21:49:07] [INFO ] Deduced a trap composed of 55 places in 290 ms of which 1 ms to minimize.
[2022-05-17 21:49:08] [INFO ] Deduced a trap composed of 70 places in 299 ms of which 0 ms to minimize.
[2022-05-17 21:49:08] [INFO ] Deduced a trap composed of 20 places in 291 ms of which 1 ms to minimize.
[2022-05-17 21:49:08] [INFO ] Deduced a trap composed of 53 places in 287 ms of which 0 ms to minimize.
[2022-05-17 21:49:09] [INFO ] Deduced a trap composed of 55 places in 289 ms of which 1 ms to minimize.
[2022-05-17 21:49:09] [INFO ] Deduced a trap composed of 59 places in 295 ms of which 1 ms to minimize.
[2022-05-17 21:49:09] [INFO ] Deduced a trap composed of 61 places in 296 ms of which 1 ms to minimize.
[2022-05-17 21:49:10] [INFO ] Deduced a trap composed of 139 places in 295 ms of which 1 ms to minimize.
[2022-05-17 21:49:10] [INFO ] Deduced a trap composed of 189 places in 291 ms of which 1 ms to minimize.
[2022-05-17 21:49:11] [INFO ] Deduced a trap composed of 93 places in 290 ms of which 0 ms to minimize.
[2022-05-17 21:49:11] [INFO ] Deduced a trap composed of 161 places in 307 ms of which 1 ms to minimize.
[2022-05-17 21:49:11] [INFO ] Deduced a trap composed of 115 places in 293 ms of which 1 ms to minimize.
[2022-05-17 21:49:12] [INFO ] Deduced a trap composed of 133 places in 298 ms of which 1 ms to minimize.
[2022-05-17 21:49:12] [INFO ] Deduced a trap composed of 93 places in 297 ms of which 1 ms to minimize.
[2022-05-17 21:49:12] [INFO ] Deduced a trap composed of 106 places in 296 ms of which 1 ms to minimize.
[2022-05-17 21:49:13] [INFO ] Deduced a trap composed of 159 places in 305 ms of which 1 ms to minimize.
[2022-05-17 21:49:13] [INFO ] Deduced a trap composed of 34 places in 288 ms of which 1 ms to minimize.
[2022-05-17 21:49:13] [INFO ] Deduced a trap composed of 60 places in 289 ms of which 1 ms to minimize.
[2022-05-17 21:49:14] [INFO ] Deduced a trap composed of 87 places in 296 ms of which 0 ms to minimize.
[2022-05-17 21:49:14] [INFO ] Deduced a trap composed of 87 places in 300 ms of which 1 ms to minimize.
[2022-05-17 21:49:15] [INFO ] Deduced a trap composed of 81 places in 294 ms of which 1 ms to minimize.
[2022-05-17 21:49:15] [INFO ] Deduced a trap composed of 36 places in 285 ms of which 0 ms to minimize.
[2022-05-17 21:49:15] [INFO ] Deduced a trap composed of 134 places in 292 ms of which 0 ms to minimize.
[2022-05-17 21:49:16] [INFO ] Deduced a trap composed of 93 places in 312 ms of which 1 ms to minimize.
[2022-05-17 21:49:16] [INFO ] Deduced a trap composed of 89 places in 309 ms of which 1 ms to minimize.
[2022-05-17 21:49:17] [INFO ] Deduced a trap composed of 21 places in 372 ms of which 1 ms to minimize.
[2022-05-17 21:49:17] [INFO ] Deduced a trap composed of 103 places in 366 ms of which 1 ms to minimize.
[2022-05-17 21:49:17] [INFO ] Deduced a trap composed of 44 places in 371 ms of which 0 ms to minimize.
[2022-05-17 21:49:18] [INFO ] Deduced a trap composed of 15 places in 362 ms of which 1 ms to minimize.
[2022-05-17 21:49:18] [INFO ] Deduced a trap composed of 43 places in 371 ms of which 1 ms to minimize.
[2022-05-17 21:49:19] [INFO ] Deduced a trap composed of 63 places in 362 ms of which 1 ms to minimize.
[2022-05-17 21:49:19] [INFO ] Deduced a trap composed of 40 places in 378 ms of which 0 ms to minimize.
[2022-05-17 21:49:20] [INFO ] Deduced a trap composed of 34 places in 387 ms of which 1 ms to minimize.
[2022-05-17 21:49:20] [INFO ] Deduced a trap composed of 84 places in 376 ms of which 0 ms to minimize.
[2022-05-17 21:49:20] [INFO ] Deduced a trap composed of 21 places in 362 ms of which 0 ms to minimize.
[2022-05-17 21:49:21] [INFO ] Deduced a trap composed of 171 places in 382 ms of which 0 ms to minimize.
[2022-05-17 21:49:21] [INFO ] Deduced a trap composed of 225 places in 403 ms of which 1 ms to minimize.
[2022-05-17 21:49:22] [INFO ] Deduced a trap composed of 41 places in 370 ms of which 0 ms to minimize.
[2022-05-17 21:49:22] [INFO ] Deduced a trap composed of 150 places in 372 ms of which 1 ms to minimize.
[2022-05-17 21:49:23] [INFO ] Deduced a trap composed of 42 places in 358 ms of which 1 ms to minimize.
[2022-05-17 21:49:23] [INFO ] Deduced a trap composed of 89 places in 352 ms of which 0 ms to minimize.
[2022-05-17 21:49:24] [INFO ] Deduced a trap composed of 199 places in 375 ms of which 1 ms to minimize.
[2022-05-17 21:49:24] [INFO ] Deduced a trap composed of 207 places in 371 ms of which 1 ms to minimize.
[2022-05-17 21:49:24] [INFO ] Deduced a trap composed of 249 places in 374 ms of which 0 ms to minimize.
[2022-05-17 21:49:25] [INFO ] Deduced a trap composed of 228 places in 380 ms of which 1 ms to minimize.
[2022-05-17 21:49:25] [INFO ] Deduced a trap composed of 36 places in 312 ms of which 0 ms to minimize.
[2022-05-17 21:49:26] [INFO ] Deduced a trap composed of 25 places in 309 ms of which 0 ms to minimize.
[2022-05-17 21:49:26] [INFO ] Deduced a trap composed of 157 places in 299 ms of which 1 ms to minimize.
[2022-05-17 21:49:26] [INFO ] Deduced a trap composed of 106 places in 274 ms of which 0 ms to minimize.
[2022-05-17 21:49:27] [INFO ] Deduced a trap composed of 30 places in 319 ms of which 1 ms to minimize.
[2022-05-17 21:49:27] [INFO ] Deduced a trap composed of 212 places in 312 ms of which 1 ms to minimize.
[2022-05-17 21:49:28] [INFO ] Deduced a trap composed of 13 places in 315 ms of which 1 ms to minimize.
[2022-05-17 21:49:28] [INFO ] Deduced a trap composed of 47 places in 280 ms of which 0 ms to minimize.
[2022-05-17 21:49:28] [INFO ] Deduced a trap composed of 82 places in 402 ms of which 1 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 44 places in 401 ms of which 1 ms to minimize.
[2022-05-17 21:49:29] [INFO ] Deduced a trap composed of 24 places in 399 ms of which 1 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 32 places in 385 ms of which 1 ms to minimize.
[2022-05-17 21:49:30] [INFO ] Deduced a trap composed of 25 places in 399 ms of which 1 ms to minimize.
[2022-05-17 21:49:31] [INFO ] Deduced a trap composed of 49 places in 388 ms of which 1 ms to minimize.
[2022-05-17 21:49:31] [INFO ] Deduced a trap composed of 137 places in 402 ms of which 0 ms to minimize.
[2022-05-17 21:49:32] [INFO ] Deduced a trap composed of 19 places in 382 ms of which 1 ms to minimize.
[2022-05-17 21:49:32] [INFO ] Deduced a trap composed of 43 places in 341 ms of which 1 ms to minimize.
[2022-05-17 21:49:32] [INFO ] Deduced a trap composed of 105 places in 326 ms of which 0 ms to minimize.
[2022-05-17 21:49:33] [INFO ] Deduced a trap composed of 63 places in 326 ms of which 1 ms to minimize.
[2022-05-17 21:49:33] [INFO ] Deduced a trap composed of 196 places in 327 ms of which 0 ms to minimize.
[2022-05-17 21:49:34] [INFO ] Deduced a trap composed of 139 places in 357 ms of which 0 ms to minimize.
[2022-05-17 21:49:34] [INFO ] Deduced a trap composed of 249 places in 341 ms of which 1 ms to minimize.
[2022-05-17 21:49:34] [INFO ] Deduced a trap composed of 203 places in 359 ms of which 1 ms to minimize.
[2022-05-17 21:49:35] [INFO ] Deduced a trap composed of 59 places in 303 ms of which 1 ms to minimize.
[2022-05-17 21:49:35] [INFO ] Deduced a trap composed of 49 places in 307 ms of which 0 ms to minimize.
[2022-05-17 21:49:36] [INFO ] Deduced a trap composed of 101 places in 284 ms of which 0 ms to minimize.
[2022-05-17 21:49:36] [INFO ] Deduced a trap composed of 137 places in 345 ms of which 1 ms to minimize.
[2022-05-17 21:49:36] [INFO ] Deduced a trap composed of 164 places in 352 ms of which 1 ms to minimize.
[2022-05-17 21:49:37] [INFO ] Deduced a trap composed of 142 places in 337 ms of which 1 ms to minimize.
[2022-05-17 21:49:37] [INFO ] Deduced a trap composed of 92 places in 349 ms of which 0 ms to minimize.
[2022-05-17 21:49:38] [INFO ] Deduced a trap composed of 76 places in 279 ms of which 1 ms to minimize.
[2022-05-17 21:49:38] [INFO ] Deduced a trap composed of 133 places in 352 ms of which 1 ms to minimize.
[2022-05-17 21:49:38] [INFO ] Deduced a trap composed of 152 places in 349 ms of which 1 ms to minimize.
[2022-05-17 21:49:39] [INFO ] Deduced a trap composed of 176 places in 356 ms of which 0 ms to minimize.
[2022-05-17 21:49:39] [INFO ] Deduced a trap composed of 191 places in 329 ms of which 1 ms to minimize.
[2022-05-17 21:49:40] [INFO ] Deduced a trap composed of 137 places in 339 ms of which 1 ms to minimize.
[2022-05-17 21:49:40] [INFO ] Deduced a trap composed of 107 places in 274 ms of which 1 ms to minimize.
[2022-05-17 21:49:40] [INFO ] Deduced a trap composed of 244 places in 337 ms of which 1 ms to minimize.
[2022-05-17 21:49:41] [INFO ] Deduced a trap composed of 87 places in 288 ms of which 1 ms to minimize.
[2022-05-17 21:49:41] [INFO ] Deduced a trap composed of 49 places in 272 ms of which 0 ms to minimize.
[2022-05-17 21:49:41] [INFO ] Deduced a trap composed of 145 places in 298 ms of which 1 ms to minimize.
[2022-05-17 21:49:42] [INFO ] Deduced a trap composed of 57 places in 363 ms of which 1 ms to minimize.
[2022-05-17 21:49:42] [INFO ] Deduced a trap composed of 82 places in 356 ms of which 1 ms to minimize.
[2022-05-17 21:49:43] [INFO ] Deduced a trap composed of 221 places in 359 ms of which 0 ms to minimize.
[2022-05-17 21:49:43] [INFO ] Deduced a trap composed of 45 places in 289 ms of which 1 ms to minimize.
[2022-05-17 21:49:44] [INFO ] Deduced a trap composed of 61 places in 344 ms of which 1 ms to minimize.
[2022-05-17 21:49:44] [INFO ] Deduced a trap composed of 94 places in 349 ms of which 0 ms to minimize.
[2022-05-17 21:49:44] [INFO ] Deduced a trap composed of 33 places in 342 ms of which 1 ms to minimize.
[2022-05-17 21:49:45] [INFO ] Deduced a trap composed of 68 places in 351 ms of which 0 ms to minimize.
[2022-05-17 21:49:45] [INFO ] Deduced a trap composed of 156 places in 335 ms of which 1 ms to minimize.
[2022-05-17 21:49:46] [INFO ] Deduced a trap composed of 158 places in 335 ms of which 1 ms to minimize.
[2022-05-17 21:49:46] [INFO ] Deduced a trap composed of 135 places in 327 ms of which 1 ms to minimize.
[2022-05-17 21:49:46] [INFO ] Deduced a trap composed of 47 places in 297 ms of which 0 ms to minimize.
[2022-05-17 21:49:47] [INFO ] Deduced a trap composed of 143 places in 210 ms of which 0 ms to minimize.
[2022-05-17 21:49:47] [INFO ] Deduced a trap composed of 118 places in 207 ms of which 1 ms to minimize.
[2022-05-17 21:49:47] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 1 ms to minimize.
[2022-05-17 21:49:47] [INFO ] Deduced a trap composed of 128 places in 207 ms of which 0 ms to minimize.
[2022-05-17 21:49:48] [INFO ] Deduced a trap composed of 128 places in 208 ms of which 1 ms to minimize.
[2022-05-17 21:49:48] [INFO ] Deduced a trap composed of 112 places in 204 ms of which 1 ms to minimize.
[2022-05-17 21:49:48] [INFO ] Deduced a trap composed of 161 places in 194 ms of which 1 ms to minimize.
[2022-05-17 21:49:49] [INFO ] Deduced a trap composed of 80 places in 294 ms of which 0 ms to minimize.
[2022-05-17 21:49:49] [INFO ] Deduced a trap composed of 76 places in 299 ms of which 1 ms to minimize.
[2022-05-17 21:49: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 4
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-05-17 21:49:49] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 21:49:49] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 21:49:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:49:50] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2022-05-17 21:49:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:49:50] [INFO ] [Nat]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 21:49:50] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 21:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:49:50] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2022-05-17 21:49:50] [INFO ] [Nat]Added 546 Read/Feed constraints in 94 ms returned sat
[2022-05-17 21:49:51] [INFO ] Deduced a trap composed of 17 places in 395 ms of which 1 ms to minimize.
[2022-05-17 21:49:51] [INFO ] Deduced a trap composed of 13 places in 359 ms of which 1 ms to minimize.
[2022-05-17 21:49:52] [INFO ] Deduced a trap composed of 32 places in 357 ms of which 0 ms to minimize.
[2022-05-17 21:49:52] [INFO ] Deduced a trap composed of 42 places in 368 ms of which 0 ms to minimize.
[2022-05-17 21:49:52] [INFO ] Deduced a trap composed of 42 places in 384 ms of which 1 ms to minimize.
[2022-05-17 21:49:53] [INFO ] Deduced a trap composed of 17 places in 365 ms of which 1 ms to minimize.
[2022-05-17 21:49:53] [INFO ] Deduced a trap composed of 44 places in 359 ms of which 1 ms to minimize.
[2022-05-17 21:49:54] [INFO ] Deduced a trap composed of 17 places in 358 ms of which 1 ms to minimize.
[2022-05-17 21:49:54] [INFO ] Deduced a trap composed of 25 places in 348 ms of which 1 ms to minimize.
[2022-05-17 21:49:55] [INFO ] Deduced a trap composed of 44 places in 371 ms of which 1 ms to minimize.
[2022-05-17 21:49:55] [INFO ] Deduced a trap composed of 25 places in 372 ms of which 1 ms to minimize.
[2022-05-17 21:49:55] [INFO ] Deduced a trap composed of 30 places in 362 ms of which 0 ms to minimize.
[2022-05-17 21:49:56] [INFO ] Deduced a trap composed of 17 places in 382 ms of which 0 ms to minimize.
[2022-05-17 21:49:56] [INFO ] Deduced a trap composed of 29 places in 373 ms of which 1 ms to minimize.
[2022-05-17 21:49:57] [INFO ] Deduced a trap composed of 93 places in 356 ms of which 1 ms to minimize.
[2022-05-17 21:49:57] [INFO ] Deduced a trap composed of 14 places in 348 ms of which 0 ms to minimize.
[2022-05-17 21:49:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 6969 ms
[2022-05-17 21:49:57] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 21:49:57] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 21:49:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:49:58] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2022-05-17 21:49:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:49:58] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 21:49:58] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 21:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:49:58] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2022-05-17 21:49:58] [INFO ] [Nat]Added 546 Read/Feed constraints in 97 ms returned sat
[2022-05-17 21:49:59] [INFO ] Deduced a trap composed of 17 places in 362 ms of which 0 ms to minimize.
[2022-05-17 21:49:59] [INFO ] Deduced a trap composed of 13 places in 359 ms of which 1 ms to minimize.
[2022-05-17 21:50:00] [INFO ] Deduced a trap composed of 32 places in 353 ms of which 1 ms to minimize.
[2022-05-17 21:50:00] [INFO ] Deduced a trap composed of 42 places in 366 ms of which 0 ms to minimize.
[2022-05-17 21:50:01] [INFO ] Deduced a trap composed of 42 places in 359 ms of which 1 ms to minimize.
[2022-05-17 21:50:01] [INFO ] Deduced a trap composed of 17 places in 382 ms of which 1 ms to minimize.
[2022-05-17 21:50:01] [INFO ] Deduced a trap composed of 44 places in 372 ms of which 0 ms to minimize.
[2022-05-17 21:50:02] [INFO ] Deduced a trap composed of 17 places in 360 ms of which 1 ms to minimize.
[2022-05-17 21:50:02] [INFO ] Deduced a trap composed of 25 places in 348 ms of which 1 ms to minimize.
[2022-05-17 21:50:03] [INFO ] Deduced a trap composed of 44 places in 355 ms of which 0 ms to minimize.
[2022-05-17 21:50:03] [INFO ] Deduced a trap composed of 25 places in 369 ms of which 1 ms to minimize.
[2022-05-17 21:50:04] [INFO ] Deduced a trap composed of 30 places in 368 ms of which 1 ms to minimize.
[2022-05-17 21:50:04] [INFO ] Deduced a trap composed of 17 places in 393 ms of which 1 ms to minimize.
[2022-05-17 21:50:05] [INFO ] Deduced a trap composed of 29 places in 391 ms of which 1 ms to minimize.
[2022-05-17 21:50:05] [INFO ] Deduced a trap composed of 93 places in 384 ms of which 1 ms to minimize.
[2022-05-17 21:50:05] [INFO ] Deduced a trap composed of 14 places in 353 ms of which 1 ms to minimize.
[2022-05-17 21:50:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 6963 ms
[2022-05-17 21:50:05] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 21:50:06] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 21:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:06] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2022-05-17 21:50:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:50:06] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 21:50:06] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 21:50:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:07] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2022-05-17 21:50:07] [INFO ] [Nat]Added 546 Read/Feed constraints in 103 ms returned sat
[2022-05-17 21:50:07] [INFO ] Deduced a trap composed of 55 places in 442 ms of which 1 ms to minimize.
[2022-05-17 21:50:08] [INFO ] Deduced a trap composed of 56 places in 437 ms of which 1 ms to minimize.
[2022-05-17 21:50:08] [INFO ] Deduced a trap composed of 36 places in 435 ms of which 1 ms to minimize.
[2022-05-17 21:50:09] [INFO ] Deduced a trap composed of 42 places in 465 ms of which 1 ms to minimize.
[2022-05-17 21:50:09] [INFO ] Deduced a trap composed of 83 places in 470 ms of which 3 ms to minimize.
[2022-05-17 21:50:10] [INFO ] Deduced a trap composed of 58 places in 439 ms of which 1 ms to minimize.
[2022-05-17 21:50:10] [INFO ] Deduced a trap composed of 20 places in 467 ms of which 4 ms to minimize.
[2022-05-17 21:50:11] [INFO ] Deduced a trap composed of 59 places in 429 ms of which 1 ms to minimize.
[2022-05-17 21:50:11] [INFO ] Deduced a trap composed of 91 places in 443 ms of which 0 ms to minimize.
[2022-05-17 21:50:12] [INFO ] Deduced a trap composed of 51 places in 436 ms of which 1 ms to minimize.
[2022-05-17 21:50:12] [INFO ] Deduced a trap composed of 17 places in 451 ms of which 1 ms to minimize.
[2022-05-17 21:50:13] [INFO ] Deduced a trap composed of 55 places in 455 ms of which 1 ms to minimize.
[2022-05-17 21:50:13] [INFO ] Deduced a trap composed of 17 places in 440 ms of which 0 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 47 places in 436 ms of which 1 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 81 places in 446 ms of which 1 ms to minimize.
[2022-05-17 21:50:15] [INFO ] Deduced a trap composed of 87 places in 451 ms of which 1 ms to minimize.
[2022-05-17 21:50:15] [INFO ] Deduced a trap composed of 71 places in 450 ms of which 1 ms to minimize.
[2022-05-17 21:50:16] [INFO ] Deduced a trap composed of 58 places in 444 ms of which 1 ms to minimize.
[2022-05-17 21:50:16] [INFO ] Deduced a trap composed of 28 places in 453 ms of which 1 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 52 places in 452 ms of which 1 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 70 places in 445 ms of which 1 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 70 places in 447 ms of which 1 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 20 places in 456 ms of which 1 ms to minimize.
[2022-05-17 21:50:19] [INFO ] Deduced a trap composed of 79 places in 469 ms of which 1 ms to minimize.
[2022-05-17 21:50:20] [INFO ] Deduced a trap composed of 70 places in 454 ms of which 1 ms to minimize.
[2022-05-17 21:50:20] [INFO ] Deduced a trap composed of 38 places in 427 ms of which 1 ms to minimize.
[2022-05-17 21:50:21] [INFO ] Deduced a trap composed of 13 places in 419 ms of which 1 ms to minimize.
[2022-05-17 21:50:21] [INFO ] Deduced a trap composed of 70 places in 449 ms of which 1 ms to minimize.
[2022-05-17 21:50:22] [INFO ] Deduced a trap composed of 11 places in 417 ms of which 0 ms to minimize.
[2022-05-17 21:50:22] [INFO ] Deduced a trap composed of 34 places in 437 ms of which 0 ms to minimize.
[2022-05-17 21:50:23] [INFO ] Deduced a trap composed of 20 places in 457 ms of which 1 ms to minimize.
[2022-05-17 21:50:23] [INFO ] Deduced a trap composed of 63 places in 454 ms of which 1 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 43 places in 438 ms of which 1 ms to minimize.
[2022-05-17 21:50:24] [INFO ] Deduced a trap composed of 52 places in 459 ms of which 1 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 33 places in 440 ms of which 1 ms to minimize.
[2022-05-17 21:50:25] [INFO ] Deduced a trap composed of 20 places in 454 ms of which 0 ms to minimize.
[2022-05-17 21:50:26] [INFO ] Deduced a trap composed of 31 places in 444 ms of which 1 ms to minimize.
[2022-05-17 21:50:26] [INFO ] Deduced a trap composed of 11 places in 436 ms of which 1 ms to minimize.
[2022-05-17 21:50:27] [INFO ] Deduced a trap composed of 36 places in 435 ms of which 0 ms to minimize.
[2022-05-17 21:50:27] [INFO ] Deduced a trap composed of 11 places in 427 ms of which 1 ms to minimize.
[2022-05-17 21:50:28] [INFO ] Deduced a trap composed of 135 places in 242 ms of which 1 ms to minimize.
[2022-05-17 21:50:28] [INFO ] Deduced a trap composed of 118 places in 248 ms of which 1 ms to minimize.
[2022-05-17 21:50:28] [INFO ] Deduced a trap composed of 99 places in 241 ms of which 1 ms to minimize.
[2022-05-17 21:50:29] [INFO ] Deduced a trap composed of 128 places in 327 ms of which 1 ms to minimize.
[2022-05-17 21:50:29] [INFO ] Deduced a trap composed of 70 places in 338 ms of which 0 ms to minimize.
[2022-05-17 21:50:29] [INFO ] Deduced a trap composed of 101 places in 328 ms of which 1 ms to minimize.
[2022-05-17 21:50:30] [INFO ] Deduced a trap composed of 91 places in 345 ms of which 1 ms to minimize.
[2022-05-17 21:50:30] [INFO ] Deduced a trap composed of 82 places in 350 ms of which 1 ms to minimize.
[2022-05-17 21:50:31] [INFO ] Deduced a trap composed of 67 places in 355 ms of which 1 ms to minimize.
[2022-05-17 21:50:31] [INFO ] Deduced a trap composed of 100 places in 355 ms of which 1 ms to minimize.
[2022-05-17 21:50:31] [INFO ] Deduced a trap composed of 74 places in 344 ms of which 1 ms to minimize.
[2022-05-17 21:50:32] [INFO ] Deduced a trap composed of 74 places in 346 ms of which 1 ms to minimize.
[2022-05-17 21:50:32] [INFO ] Deduced a trap composed of 36 places in 359 ms of which 1 ms to minimize.
[2022-05-17 21:50:33] [INFO ] Deduced a trap composed of 97 places in 346 ms of which 1 ms to minimize.
[2022-05-17 21:50:33] [INFO ] Deduced a trap composed of 158 places in 341 ms of which 1 ms to minimize.
[2022-05-17 21:50:33] [INFO ] Deduced a trap composed of 127 places in 334 ms of which 1 ms to minimize.
[2022-05-17 21:50:34] [INFO ] Deduced a trap composed of 119 places in 346 ms of which 1 ms to minimize.
[2022-05-17 21:50:34] [INFO ] Deduced a trap composed of 77 places in 334 ms of which 0 ms to minimize.
[2022-05-17 21:50:35] [INFO ] Deduced a trap composed of 82 places in 365 ms of which 1 ms to minimize.
[2022-05-17 21:50:35] [INFO ] Deduced a trap composed of 92 places in 381 ms of which 1 ms to minimize.
[2022-05-17 21:50:36] [INFO ] Deduced a trap composed of 93 places in 348 ms of which 0 ms to minimize.
[2022-05-17 21:50:36] [INFO ] Deduced a trap composed of 81 places in 341 ms of which 1 ms to minimize.
[2022-05-17 21:50:36] [INFO ] Deduced a trap composed of 42 places in 312 ms of which 1 ms to minimize.
[2022-05-17 21:50:37] [INFO ] Deduced a trap composed of 133 places in 327 ms of which 1 ms to minimize.
[2022-05-17 21:50:37] [INFO ] Deduced a trap composed of 154 places in 345 ms of which 1 ms to minimize.
[2022-05-17 21:50:38] [INFO ] Deduced a trap composed of 63 places in 341 ms of which 1 ms to minimize.
[2022-05-17 21:50:38] [INFO ] Deduced a trap composed of 154 places in 341 ms of which 0 ms to minimize.
[2022-05-17 21:50:38] [INFO ] Deduced a trap composed of 89 places in 329 ms of which 1 ms to minimize.
[2022-05-17 21:50:39] [INFO ] Deduced a trap composed of 154 places in 328 ms of which 1 ms to minimize.
[2022-05-17 21:50:39] [INFO ] Deduced a trap composed of 56 places in 312 ms of which 1 ms to minimize.
[2022-05-17 21:50:40] [INFO ] Deduced a trap composed of 86 places in 372 ms of which 0 ms to minimize.
[2022-05-17 21:50:40] [INFO ] Deduced a trap composed of 202 places in 347 ms of which 1 ms to minimize.
[2022-05-17 21:50:40] [INFO ] Deduced a trap composed of 184 places in 331 ms of which 0 ms to minimize.
[2022-05-17 21:50:41] [INFO ] Deduced a trap composed of 116 places in 319 ms of which 1 ms to minimize.
[2022-05-17 21:50:41] [INFO ] Deduced a trap composed of 167 places in 309 ms of which 0 ms to minimize.
[2022-05-17 21:50:42] [INFO ] Deduced a trap composed of 135 places in 302 ms of which 1 ms to minimize.
[2022-05-17 21:50:42] [INFO ] Deduced a trap composed of 114 places in 299 ms of which 1 ms to minimize.
[2022-05-17 21:50:42] [INFO ] Deduced a trap composed of 163 places in 304 ms of which 0 ms to minimize.
[2022-05-17 21:50:43] [INFO ] Deduced a trap composed of 133 places in 301 ms of which 0 ms to minimize.
[2022-05-17 21:50:43] [INFO ] Deduced a trap composed of 135 places in 303 ms of which 0 ms to minimize.
[2022-05-17 21:50:43] [INFO ] Deduced a trap composed of 195 places in 303 ms of which 1 ms to minimize.
[2022-05-17 21:50:44] [INFO ] Deduced a trap composed of 135 places in 301 ms of which 0 ms to minimize.
[2022-05-17 21:50:44] [INFO ] Deduced a trap composed of 130 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:50:44] [INFO ] Deduced a trap composed of 130 places in 231 ms of which 0 ms to minimize.
[2022-05-17 21:50:45] [INFO ] Deduced a trap composed of 130 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:50:45] [INFO ] Deduced a trap composed of 130 places in 232 ms of which 0 ms to minimize.
[2022-05-17 21:50:45] [INFO ] Deduced a trap composed of 116 places in 248 ms of which 0 ms to minimize.
[2022-05-17 21:50:46] [INFO ] Deduced a trap composed of 76 places in 285 ms of which 0 ms to minimize.
[2022-05-17 21:50:46] [INFO ] Deduced a trap composed of 95 places in 301 ms of which 1 ms to minimize.
[2022-05-17 21:50:46] [INFO ] Deduced a trap composed of 78 places in 283 ms of which 1 ms to minimize.
[2022-05-17 21:50:47] [INFO ] Deduced a trap composed of 116 places in 290 ms of which 0 ms to minimize.
[2022-05-17 21:50:47] [INFO ] Deduced a trap composed of 135 places in 284 ms of which 1 ms to minimize.
[2022-05-17 21:50:48] [INFO ] Deduced a trap composed of 78 places in 292 ms of which 0 ms to minimize.
[2022-05-17 21:50:48] [INFO ] Deduced a trap composed of 116 places in 247 ms of which 1 ms to minimize.
[2022-05-17 21:50:48] [INFO ] Deduced a trap composed of 142 places in 247 ms of which 1 ms to minimize.
[2022-05-17 21:50:48] [INFO ] Deduced a trap composed of 118 places in 247 ms of which 0 ms to minimize.
[2022-05-17 21:50:49] [INFO ] Deduced a trap composed of 135 places in 249 ms of which 0 ms to minimize.
[2022-05-17 21:50:49] [INFO ] Trap strengthening (SAT) tested/added 98/97 trap constraints in 42261 ms
[2022-05-17 21:50:49] [INFO ] Computed and/alt/rep : 1800/5000/1800 causal constraints (skipped 112 transitions) in 106 ms.
[2022-05-17 21:50: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 7
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: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-05-17 21:50:51] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 21:50:51] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 21:50:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:52] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2022-05-17 21:50:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:50:52] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 21:50:52] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 21:50:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:52] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2022-05-17 21:50:52] [INFO ] [Nat]Added 546 Read/Feed constraints in 102 ms returned sat
[2022-05-17 21:50:53] [INFO ] Deduced a trap composed of 17 places in 376 ms of which 0 ms to minimize.
[2022-05-17 21:50:53] [INFO ] Deduced a trap composed of 13 places in 368 ms of which 1 ms to minimize.
[2022-05-17 21:50:54] [INFO ] Deduced a trap composed of 32 places in 366 ms of which 0 ms to minimize.
[2022-05-17 21:50:54] [INFO ] Deduced a trap composed of 42 places in 378 ms of which 1 ms to minimize.
[2022-05-17 21:50:54] [INFO ] Deduced a trap composed of 42 places in 364 ms of which 0 ms to minimize.
[2022-05-17 21:50:55] [INFO ] Deduced a trap composed of 17 places in 369 ms of which 0 ms to minimize.
[2022-05-17 21:50:55] [INFO ] Deduced a trap composed of 44 places in 368 ms of which 1 ms to minimize.
[2022-05-17 21:50:56] [INFO ] Deduced a trap composed of 17 places in 391 ms of which 1 ms to minimize.
[2022-05-17 21:50:56] [INFO ] Deduced a trap composed of 25 places in 360 ms of which 1 ms to minimize.
[2022-05-17 21:50:57] [INFO ] Deduced a trap composed of 44 places in 364 ms of which 1 ms to minimize.
[2022-05-17 21:50:57] [INFO ] Deduced a trap composed of 25 places in 361 ms of which 1 ms to minimize.
[2022-05-17 21:50:57] [INFO ] Deduced a trap composed of 30 places in 401 ms of which 1 ms to minimize.
[2022-05-17 21:50:58] [INFO ] Deduced a trap composed of 17 places in 373 ms of which 1 ms to minimize.
[2022-05-17 21:50:58] [INFO ] Deduced a trap composed of 29 places in 379 ms of which 1 ms to minimize.
[2022-05-17 21:50:59] [INFO ] Deduced a trap composed of 93 places in 365 ms of which 1 ms to minimize.
[2022-05-17 21:50:59] [INFO ] Deduced a trap composed of 14 places in 371 ms of which 0 ms to minimize.
[2022-05-17 21:50:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 7044 ms
Current structural bounds on expressions (after SMT) : [8, 7, 8, 8, 8, 7, 7, 8, 7] Max seen :[7, 7, 7, 1, 1, 7, 7, 7, 7]
FORMULA Peterson-COL-7-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-7-UpperBounds-10 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-7-UpperBounds-09 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-7-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 908800 steps, including 1000 resets, run finished after 21496 ms. (steps per millisecond=42 ) properties (out of 5) seen :23 could not realise parikh vector
Support contains 456 out of 1152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1152/1152 places, 2256/2256 transitions.
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 48 Pre rules applied. Total rules applied 0 place count 1152 transition count 2208
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 1104 transition count 2208
Applied a total of 96 rules in 88 ms. Remains 1104 /1152 variables (removed 48) and now considering 2208/2256 (removed 48) transitions.
Finished structural reductions, in 1 iterations. Remains : 1104/1152 places, 2208/2256 transitions.
Normalized transition count is 1872 out of 2208 initially.
// Phase 1: matrix 1872 rows 1104 cols
[2022-05-17 21:51:21] [INFO ] Computed 31 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 23666 ms. (steps per millisecond=42 ) properties (out of 5) seen :20
Interrupted Best-First random walk after 545266 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=109 ) properties seen :{0=1, 1=1, 4=1}
Interrupted Best-First random walk after 546391 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=109 ) properties seen :{0=3, 1=3, 4=3}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3048 ms. (steps per millisecond=328 ) properties (out of 5) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3047 ms. (steps per millisecond=328 ) properties (out of 5) seen :5
Interrupted Best-First random walk after 545437 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=109 ) properties seen :{0=1, 1=1, 4=1}
[2022-05-17 21:52:06] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1104 cols
[2022-05-17 21:52:06] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-17 21:52:06] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 21:52:06] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 21:52:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:52:06] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2022-05-17 21:52:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:52:06] [INFO ] [Nat]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 21:52:06] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 21:52:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:52:07] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2022-05-17 21:52:07] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 21:52:07] [INFO ] [Nat]Added 546 Read/Feed constraints in 90 ms returned sat
[2022-05-17 21:52:07] [INFO ] Deduced a trap composed of 43 places in 409 ms of which 0 ms to minimize.
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 33 places in 410 ms of which 1 ms to minimize.
[2022-05-17 21:52:08] [INFO ] Deduced a trap composed of 37 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 67 places in 426 ms of which 1 ms to minimize.
[2022-05-17 21:52:09] [INFO ] Deduced a trap composed of 132 places in 405 ms of which 1 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 106 places in 446 ms of which 1 ms to minimize.
[2022-05-17 21:52:10] [INFO ] Deduced a trap composed of 107 places in 430 ms of which 1 ms to minimize.
[2022-05-17 21:52:11] [INFO ] Deduced a trap composed of 25 places in 421 ms of which 1 ms to minimize.
[2022-05-17 21:52:11] [INFO ] Deduced a trap composed of 153 places in 425 ms of which 1 ms to minimize.
[2022-05-17 21:52:12] [INFO ] Deduced a trap composed of 118 places in 454 ms of which 1 ms to minimize.
[2022-05-17 21:52:12] [INFO ] Deduced a trap composed of 134 places in 416 ms of which 0 ms to minimize.
[2022-05-17 21:52:13] [INFO ] Deduced a trap composed of 163 places in 423 ms of which 0 ms to minimize.
[2022-05-17 21:52:13] [INFO ] Deduced a trap composed of 54 places in 415 ms of which 1 ms to minimize.
[2022-05-17 21:52:14] [INFO ] Deduced a trap composed of 103 places in 424 ms of which 1 ms to minimize.
[2022-05-17 21:52:14] [INFO ] Deduced a trap composed of 268 places in 410 ms of which 1 ms to minimize.
[2022-05-17 21:52:15] [INFO ] Deduced a trap composed of 61 places in 416 ms of which 1 ms to minimize.
[2022-05-17 21:52:15] [INFO ] Deduced a trap composed of 76 places in 418 ms of which 0 ms to minimize.
[2022-05-17 21:52:16] [INFO ] Deduced a trap composed of 57 places in 421 ms of which 1 ms to minimize.
[2022-05-17 21:52:16] [INFO ] Deduced a trap composed of 31 places in 407 ms of which 0 ms to minimize.
[2022-05-17 21:52:17] [INFO ] Deduced a trap composed of 13 places in 392 ms of which 1 ms to minimize.
[2022-05-17 21:52:17] [INFO ] Deduced a trap composed of 15 places in 388 ms of which 1 ms to minimize.
[2022-05-17 21:52:17] [INFO ] Deduced a trap composed of 187 places in 401 ms of which 0 ms to minimize.
[2022-05-17 21:52:18] [INFO ] Deduced a trap composed of 19 places in 387 ms of which 1 ms to minimize.
[2022-05-17 21:52:18] [INFO ] Deduced a trap composed of 13 places in 400 ms of which 0 ms to minimize.
[2022-05-17 21:52:19] [INFO ] Deduced a trap composed of 50 places in 382 ms of which 1 ms to minimize.
[2022-05-17 21:52:19] [INFO ] Deduced a trap composed of 97 places in 381 ms of which 1 ms to minimize.
[2022-05-17 21:52:20] [INFO ] Deduced a trap composed of 86 places in 391 ms of which 1 ms to minimize.
[2022-05-17 21:52:20] [INFO ] Deduced a trap composed of 13 places in 387 ms of which 1 ms to minimize.
[2022-05-17 21:52:21] [INFO ] Deduced a trap composed of 116 places in 377 ms of which 1 ms to minimize.
[2022-05-17 21:52:21] [INFO ] Deduced a trap composed of 15 places in 376 ms of which 0 ms to minimize.
[2022-05-17 21:52:22] [INFO ] Deduced a trap composed of 113 places in 390 ms of which 0 ms to minimize.
[2022-05-17 21:52:22] [INFO ] Deduced a trap composed of 20 places in 396 ms of which 1 ms to minimize.
[2022-05-17 21:52:22] [INFO ] Deduced a trap composed of 24 places in 392 ms of which 1 ms to minimize.
[2022-05-17 21:52:23] [INFO ] Deduced a trap composed of 13 places in 411 ms of which 1 ms to minimize.
[2022-05-17 21:52:23] [INFO ] Deduced a trap composed of 67 places in 395 ms of which 1 ms to minimize.
[2022-05-17 21:52:24] [INFO ] Deduced a trap composed of 78 places in 401 ms of which 1 ms to minimize.
[2022-05-17 21:52:24] [INFO ] Deduced a trap composed of 20 places in 410 ms of which 1 ms to minimize.
[2022-05-17 21:52:25] [INFO ] Deduced a trap composed of 20 places in 409 ms of which 1 ms to minimize.
[2022-05-17 21:52:25] [INFO ] Deduced a trap composed of 13 places in 401 ms of which 0 ms to minimize.
[2022-05-17 21:52:26] [INFO ] Deduced a trap composed of 41 places in 417 ms of which 1 ms to minimize.
[2022-05-17 21:52:26] [INFO ] Deduced a trap composed of 20 places in 416 ms of which 1 ms to minimize.
[2022-05-17 21:52:27] [INFO ] Deduced a trap composed of 11 places in 412 ms of which 1 ms to minimize.
[2022-05-17 21:52:27] [INFO ] Deduced a trap composed of 11 places in 403 ms of which 1 ms to minimize.
[2022-05-17 21:52:28] [INFO ] Deduced a trap composed of 11 places in 415 ms of which 1 ms to minimize.
[2022-05-17 21:52:28] [INFO ] Deduced a trap composed of 85 places in 424 ms of which 0 ms to minimize.
[2022-05-17 21:52:29] [INFO ] Deduced a trap composed of 77 places in 412 ms of which 1 ms to minimize.
[2022-05-17 21:52:29] [INFO ] Deduced a trap composed of 38 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:52:30] [INFO ] Deduced a trap composed of 23 places in 415 ms of which 1 ms to minimize.
[2022-05-17 21:52:30] [INFO ] Deduced a trap composed of 97 places in 411 ms of which 1 ms to minimize.
[2022-05-17 21:52:31] [INFO ] Deduced a trap composed of 126 places in 397 ms of which 1 ms to minimize.
[2022-05-17 21:52:31] [INFO ] Deduced a trap composed of 46 places in 387 ms of which 1 ms to minimize.
[2022-05-17 21:52:31] [INFO ] Deduced a trap composed of 54 places in 381 ms of which 0 ms to minimize.
[2022-05-17 21:52:32] [INFO ] Deduced a trap composed of 108 places in 388 ms of which 1 ms to minimize.
[2022-05-17 21:52:32] [INFO ] Deduced a trap composed of 52 places in 386 ms of which 1 ms to minimize.
[2022-05-17 21:52:33] [INFO ] Deduced a trap composed of 97 places in 393 ms of which 1 ms to minimize.
[2022-05-17 21:52:33] [INFO ] Deduced a trap composed of 11 places in 384 ms of which 1 ms to minimize.
[2022-05-17 21:52:34] [INFO ] Deduced a trap composed of 31 places in 386 ms of which 1 ms to minimize.
[2022-05-17 21:52:34] [INFO ] Deduced a trap composed of 26 places in 384 ms of which 1 ms to minimize.
[2022-05-17 21:52:35] [INFO ] Deduced a trap composed of 49 places in 417 ms of which 0 ms to minimize.
[2022-05-17 21:52:35] [INFO ] Deduced a trap composed of 67 places in 418 ms of which 1 ms to minimize.
[2022-05-17 21:52:36] [INFO ] Deduced a trap composed of 57 places in 441 ms of which 1 ms to minimize.
[2022-05-17 21:52:36] [INFO ] Deduced a trap composed of 79 places in 419 ms of which 1 ms to minimize.
[2022-05-17 21:52:37] [INFO ] Deduced a trap composed of 102 places in 436 ms of which 1 ms to minimize.
[2022-05-17 21:52:37] [INFO ] Deduced a trap composed of 139 places in 423 ms of which 0 ms to minimize.
[2022-05-17 21:52:38] [INFO ] Deduced a trap composed of 80 places in 425 ms of which 1 ms to minimize.
[2022-05-17 21:52:38] [INFO ] Deduced a trap composed of 36 places in 434 ms of which 1 ms to minimize.
[2022-05-17 21:52:39] [INFO ] Deduced a trap composed of 85 places in 416 ms of which 1 ms to minimize.
[2022-05-17 21:52:39] [INFO ] Deduced a trap composed of 102 places in 432 ms of which 1 ms to minimize.
[2022-05-17 21:52:40] [INFO ] Deduced a trap composed of 117 places in 451 ms of which 0 ms to minimize.
[2022-05-17 21:52:40] [INFO ] Deduced a trap composed of 31 places in 417 ms of which 1 ms to minimize.
[2022-05-17 21:52:41] [INFO ] Deduced a trap composed of 55 places in 431 ms of which 0 ms to minimize.
[2022-05-17 21:52:41] [INFO ] Deduced a trap composed of 29 places in 425 ms of which 1 ms to minimize.
[2022-05-17 21:52:42] [INFO ] Deduced a trap composed of 41 places in 437 ms of which 3 ms to minimize.
[2022-05-17 21:52:42] [INFO ] Deduced a trap composed of 61 places in 404 ms of which 1 ms to minimize.
[2022-05-17 21:52:42] [INFO ] Deduced a trap composed of 49 places in 408 ms of which 1 ms to minimize.
[2022-05-17 21:52:43] [INFO ] Deduced a trap composed of 50 places in 387 ms of which 1 ms to minimize.
[2022-05-17 21:52:43] [INFO ] Deduced a trap composed of 141 places in 405 ms of which 1 ms to minimize.
[2022-05-17 21:52:44] [INFO ] Deduced a trap composed of 144 places in 401 ms of which 1 ms to minimize.
[2022-05-17 21:52:44] [INFO ] Deduced a trap composed of 136 places in 406 ms of which 0 ms to minimize.
[2022-05-17 21:52:45] [INFO ] Deduced a trap composed of 135 places in 400 ms of which 1 ms to minimize.
[2022-05-17 21:52:45] [INFO ] Deduced a trap composed of 165 places in 420 ms of which 1 ms to minimize.
[2022-05-17 21:52:46] [INFO ] Deduced a trap composed of 169 places in 412 ms of which 1 ms to minimize.
[2022-05-17 21:52:46] [INFO ] Deduced a trap composed of 138 places in 410 ms of which 1 ms to minimize.
[2022-05-17 21:52:47] [INFO ] Deduced a trap composed of 215 places in 402 ms of which 1 ms to minimize.
[2022-05-17 21:52:47] [INFO ] Deduced a trap composed of 179 places in 409 ms of which 0 ms to minimize.
[2022-05-17 21:52:48] [INFO ] Deduced a trap composed of 20 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:52:48] [INFO ] Deduced a trap composed of 85 places in 426 ms of which 1 ms to minimize.
[2022-05-17 21:52:49] [INFO ] Deduced a trap composed of 74 places in 439 ms of which 1 ms to minimize.
[2022-05-17 21:52:49] [INFO ] Deduced a trap composed of 24 places in 421 ms of which 0 ms to minimize.
[2022-05-17 21:52:50] [INFO ] Deduced a trap composed of 51 places in 419 ms of which 1 ms to minimize.
[2022-05-17 21:52:50] [INFO ] Deduced a trap composed of 11 places in 369 ms of which 1 ms to minimize.
[2022-05-17 21:52:51] [INFO ] Deduced a trap composed of 77 places in 381 ms of which 1 ms to minimize.
[2022-05-17 21:52:51] [INFO ] Deduced a trap composed of 84 places in 398 ms of which 1 ms to minimize.
[2022-05-17 21:52:51] [INFO ] Deduced a trap composed of 39 places in 401 ms of which 1 ms to minimize.
[2022-05-17 21:52: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 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-05-17 21:52:52] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 21:52:52] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 21:52:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:52:52] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2022-05-17 21:52:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:52:52] [INFO ] [Nat]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 21:52:52] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 21:52:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:52:53] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2022-05-17 21:52:53] [INFO ] [Nat]Added 546 Read/Feed constraints in 93 ms returned sat
[2022-05-17 21:52:53] [INFO ] Deduced a trap composed of 43 places in 415 ms of which 1 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 33 places in 423 ms of which 1 ms to minimize.
[2022-05-17 21:52:54] [INFO ] Deduced a trap composed of 37 places in 436 ms of which 1 ms to minimize.
[2022-05-17 21:52:55] [INFO ] Deduced a trap composed of 67 places in 426 ms of which 1 ms to minimize.
[2022-05-17 21:52:55] [INFO ] Deduced a trap composed of 132 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:52:56] [INFO ] Deduced a trap composed of 106 places in 440 ms of which 1 ms to minimize.
[2022-05-17 21:52:56] [INFO ] Deduced a trap composed of 107 places in 433 ms of which 1 ms to minimize.
[2022-05-17 21:52:57] [INFO ] Deduced a trap composed of 25 places in 417 ms of which 0 ms to minimize.
[2022-05-17 21:52:57] [INFO ] Deduced a trap composed of 153 places in 420 ms of which 1 ms to minimize.
[2022-05-17 21:52:58] [INFO ] Deduced a trap composed of 118 places in 434 ms of which 1 ms to minimize.
[2022-05-17 21:52:58] [INFO ] Deduced a trap composed of 134 places in 428 ms of which 1 ms to minimize.
[2022-05-17 21:52:59] [INFO ] Deduced a trap composed of 163 places in 420 ms of which 0 ms to minimize.
[2022-05-17 21:52:59] [INFO ] Deduced a trap composed of 54 places in 429 ms of which 1 ms to minimize.
[2022-05-17 21:53:00] [INFO ] Deduced a trap composed of 103 places in 441 ms of which 1 ms to minimize.
[2022-05-17 21:53:00] [INFO ] Deduced a trap composed of 268 places in 436 ms of which 1 ms to minimize.
[2022-05-17 21:53:01] [INFO ] Deduced a trap composed of 61 places in 429 ms of which 1 ms to minimize.
[2022-05-17 21:53:01] [INFO ] Deduced a trap composed of 76 places in 428 ms of which 1 ms to minimize.
[2022-05-17 21:53:02] [INFO ] Deduced a trap composed of 57 places in 444 ms of which 1 ms to minimize.
[2022-05-17 21:53:02] [INFO ] Deduced a trap composed of 31 places in 426 ms of which 1 ms to minimize.
[2022-05-17 21:53:03] [INFO ] Deduced a trap composed of 13 places in 398 ms of which 1 ms to minimize.
[2022-05-17 21:53:03] [INFO ] Deduced a trap composed of 15 places in 398 ms of which 1 ms to minimize.
[2022-05-17 21:53:03] [INFO ] Deduced a trap composed of 187 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:53:04] [INFO ] Deduced a trap composed of 19 places in 389 ms of which 0 ms to minimize.
[2022-05-17 21:53:04] [INFO ] Deduced a trap composed of 13 places in 411 ms of which 1 ms to minimize.
[2022-05-17 21:53:05] [INFO ] Deduced a trap composed of 50 places in 398 ms of which 1 ms to minimize.
[2022-05-17 21:53:05] [INFO ] Deduced a trap composed of 97 places in 394 ms of which 1 ms to minimize.
[2022-05-17 21:53:06] [INFO ] Deduced a trap composed of 86 places in 401 ms of which 1 ms to minimize.
[2022-05-17 21:53:06] [INFO ] Deduced a trap composed of 13 places in 406 ms of which 1 ms to minimize.
[2022-05-17 21:53:07] [INFO ] Deduced a trap composed of 116 places in 394 ms of which 1 ms to minimize.
[2022-05-17 21:53:07] [INFO ] Deduced a trap composed of 15 places in 392 ms of which 1 ms to minimize.
[2022-05-17 21:53:08] [INFO ] Deduced a trap composed of 113 places in 400 ms of which 1 ms to minimize.
[2022-05-17 21:53:08] [INFO ] Deduced a trap composed of 20 places in 390 ms of which 1 ms to minimize.
[2022-05-17 21:53:09] [INFO ] Deduced a trap composed of 24 places in 410 ms of which 0 ms to minimize.
[2022-05-17 21:53:09] [INFO ] Deduced a trap composed of 13 places in 399 ms of which 1 ms to minimize.
[2022-05-17 21:53:09] [INFO ] Deduced a trap composed of 67 places in 381 ms of which 1 ms to minimize.
[2022-05-17 21:53:10] [INFO ] Deduced a trap composed of 78 places in 383 ms of which 1 ms to minimize.
[2022-05-17 21:53:10] [INFO ] Deduced a trap composed of 20 places in 391 ms of which 1 ms to minimize.
[2022-05-17 21:53:11] [INFO ] Deduced a trap composed of 20 places in 388 ms of which 1 ms to minimize.
[2022-05-17 21:53:11] [INFO ] Deduced a trap composed of 13 places in 391 ms of which 1 ms to minimize.
[2022-05-17 21:53:12] [INFO ] Deduced a trap composed of 41 places in 398 ms of which 0 ms to minimize.
[2022-05-17 21:53:12] [INFO ] Deduced a trap composed of 20 places in 396 ms of which 1 ms to minimize.
[2022-05-17 21:53:13] [INFO ] Deduced a trap composed of 11 places in 391 ms of which 1 ms to minimize.
[2022-05-17 21:53:13] [INFO ] Deduced a trap composed of 11 places in 382 ms of which 1 ms to minimize.
[2022-05-17 21:53:14] [INFO ] Deduced a trap composed of 11 places in 388 ms of which 0 ms to minimize.
[2022-05-17 21:53:14] [INFO ] Deduced a trap composed of 85 places in 410 ms of which 1 ms to minimize.
[2022-05-17 21:53:15] [INFO ] Deduced a trap composed of 77 places in 384 ms of which 1 ms to minimize.
[2022-05-17 21:53:15] [INFO ] Deduced a trap composed of 38 places in 391 ms of which 1 ms to minimize.
[2022-05-17 21:53:15] [INFO ] Deduced a trap composed of 23 places in 395 ms of which 1 ms to minimize.
[2022-05-17 21:53:16] [INFO ] Deduced a trap composed of 97 places in 410 ms of which 1 ms to minimize.
[2022-05-17 21:53:16] [INFO ] Deduced a trap composed of 126 places in 392 ms of which 1 ms to minimize.
[2022-05-17 21:53:17] [INFO ] Deduced a trap composed of 46 places in 390 ms of which 0 ms to minimize.
[2022-05-17 21:53:17] [INFO ] Deduced a trap composed of 54 places in 386 ms of which 1 ms to minimize.
[2022-05-17 21:53:18] [INFO ] Deduced a trap composed of 108 places in 387 ms of which 1 ms to minimize.
[2022-05-17 21:53:18] [INFO ] Deduced a trap composed of 52 places in 380 ms of which 0 ms to minimize.
[2022-05-17 21:53:19] [INFO ] Deduced a trap composed of 97 places in 380 ms of which 0 ms to minimize.
[2022-05-17 21:53:19] [INFO ] Deduced a trap composed of 11 places in 380 ms of which 1 ms to minimize.
[2022-05-17 21:53:20] [INFO ] Deduced a trap composed of 31 places in 367 ms of which 1 ms to minimize.
[2022-05-17 21:53:20] [INFO ] Deduced a trap composed of 26 places in 381 ms of which 1 ms to minimize.
[2022-05-17 21:53:20] [INFO ] Deduced a trap composed of 49 places in 404 ms of which 1 ms to minimize.
[2022-05-17 21:53:21] [INFO ] Deduced a trap composed of 67 places in 416 ms of which 1 ms to minimize.
[2022-05-17 21:53:21] [INFO ] Deduced a trap composed of 57 places in 419 ms of which 0 ms to minimize.
[2022-05-17 21:53:22] [INFO ] Deduced a trap composed of 79 places in 414 ms of which 1 ms to minimize.
[2022-05-17 21:53:22] [INFO ] Deduced a trap composed of 102 places in 411 ms of which 1 ms to minimize.
[2022-05-17 21:53:23] [INFO ] Deduced a trap composed of 139 places in 414 ms of which 1 ms to minimize.
[2022-05-17 21:53:23] [INFO ] Deduced a trap composed of 80 places in 419 ms of which 0 ms to minimize.
[2022-05-17 21:53:24] [INFO ] Deduced a trap composed of 36 places in 437 ms of which 1 ms to minimize.
[2022-05-17 21:53:24] [INFO ] Deduced a trap composed of 85 places in 429 ms of which 1 ms to minimize.
[2022-05-17 21:53:25] [INFO ] Deduced a trap composed of 102 places in 442 ms of which 1 ms to minimize.
[2022-05-17 21:53:25] [INFO ] Deduced a trap composed of 117 places in 444 ms of which 1 ms to minimize.
[2022-05-17 21:53:26] [INFO ] Deduced a trap composed of 31 places in 426 ms of which 0 ms to minimize.
[2022-05-17 21:53:26] [INFO ] Deduced a trap composed of 55 places in 474 ms of which 1 ms to minimize.
[2022-05-17 21:53:27] [INFO ] Deduced a trap composed of 29 places in 434 ms of which 0 ms to minimize.
[2022-05-17 21:53:27] [INFO ] Deduced a trap composed of 41 places in 448 ms of which 1 ms to minimize.
[2022-05-17 21:53:28] [INFO ] Deduced a trap composed of 61 places in 418 ms of which 1 ms to minimize.
[2022-05-17 21:53:28] [INFO ] Deduced a trap composed of 49 places in 431 ms of which 0 ms to minimize.
[2022-05-17 21:53:29] [INFO ] Deduced a trap composed of 50 places in 400 ms of which 1 ms to minimize.
[2022-05-17 21:53:29] [INFO ] Deduced a trap composed of 141 places in 402 ms of which 0 ms to minimize.
[2022-05-17 21:53:30] [INFO ] Deduced a trap composed of 144 places in 390 ms of which 1 ms to minimize.
[2022-05-17 21:53:30] [INFO ] Deduced a trap composed of 136 places in 426 ms of which 1 ms to minimize.
[2022-05-17 21:53:31] [INFO ] Deduced a trap composed of 135 places in 418 ms of which 1 ms to minimize.
[2022-05-17 21:53:31] [INFO ] Deduced a trap composed of 165 places in 413 ms of which 0 ms to minimize.
[2022-05-17 21:53:32] [INFO ] Deduced a trap composed of 169 places in 418 ms of which 1 ms to minimize.
[2022-05-17 21:53:32] [INFO ] Deduced a trap composed of 138 places in 409 ms of which 1 ms to minimize.
[2022-05-17 21:53:33] [INFO ] Deduced a trap composed of 215 places in 403 ms of which 1 ms to minimize.
[2022-05-17 21:53:33] [INFO ] Deduced a trap composed of 179 places in 408 ms of which 1 ms to minimize.
[2022-05-17 21:53:34] [INFO ] Deduced a trap composed of 20 places in 409 ms of which 1 ms to minimize.
[2022-05-17 21:53:34] [INFO ] Deduced a trap composed of 85 places in 442 ms of which 1 ms to minimize.
[2022-05-17 21:53:35] [INFO ] Deduced a trap composed of 74 places in 440 ms of which 1 ms to minimize.
[2022-05-17 21:53:35] [INFO ] Deduced a trap composed of 24 places in 423 ms of which 1 ms to minimize.
[2022-05-17 21:53:36] [INFO ] Deduced a trap composed of 51 places in 431 ms of which 1 ms to minimize.
[2022-05-17 21:53:36] [INFO ] Deduced a trap composed of 11 places in 384 ms of which 1 ms to minimize.
[2022-05-17 21:53:37] [INFO ] Deduced a trap composed of 77 places in 410 ms of which 1 ms to minimize.
[2022-05-17 21:53:37] [INFO ] Deduced a trap composed of 84 places in 389 ms of which 1 ms to minimize.
[2022-05-17 21:53:37] [INFO ] Deduced a trap composed of 2 places in 441 ms of which 1 ms to minimize.
[2022-05-17 21:53:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-05-17 21:53:38] [INFO ] [Real]Absence check using 23 positive place invariants in 17 ms returned sat
[2022-05-17 21:53:38] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 21:53:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:53:38] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2022-05-17 21:53:38] [INFO ] [Real]Added 546 Read/Feed constraints in 78 ms returned sat
[2022-05-17 21:53:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:53:38] [INFO ] [Nat]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 21:53:38] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 21:53:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:53:39] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2022-05-17 21:53:39] [INFO ] [Nat]Added 546 Read/Feed constraints in 85 ms returned sat
[2022-05-17 21:53:39] [INFO ] Deduced a trap composed of 93 places in 368 ms of which 1 ms to minimize.
[2022-05-17 21:53:40] [INFO ] Deduced a trap composed of 124 places in 369 ms of which 1 ms to minimize.
[2022-05-17 21:53:40] [INFO ] Deduced a trap composed of 83 places in 390 ms of which 1 ms to minimize.
[2022-05-17 21:53:41] [INFO ] Deduced a trap composed of 56 places in 381 ms of which 1 ms to minimize.
[2022-05-17 21:53:41] [INFO ] Deduced a trap composed of 66 places in 383 ms of which 1 ms to minimize.
[2022-05-17 21:53:41] [INFO ] Deduced a trap composed of 61 places in 363 ms of which 1 ms to minimize.
[2022-05-17 21:53:42] [INFO ] Deduced a trap composed of 134 places in 412 ms of which 1 ms to minimize.
[2022-05-17 21:53:42] [INFO ] Deduced a trap composed of 48 places in 382 ms of which 1 ms to minimize.
[2022-05-17 21:53:43] [INFO ] Deduced a trap composed of 39 places in 368 ms of which 0 ms to minimize.
[2022-05-17 21:53:43] [INFO ] Deduced a trap composed of 17 places in 361 ms of which 0 ms to minimize.
[2022-05-17 21:53:44] [INFO ] Deduced a trap composed of 13 places in 378 ms of which 1 ms to minimize.
[2022-05-17 21:53:44] [INFO ] Deduced a trap composed of 109 places in 368 ms of which 1 ms to minimize.
[2022-05-17 21:53:45] [INFO ] Deduced a trap composed of 41 places in 380 ms of which 0 ms to minimize.
[2022-05-17 21:53:45] [INFO ] Deduced a trap composed of 41 places in 370 ms of which 1 ms to minimize.
[2022-05-17 21:53:45] [INFO ] Deduced a trap composed of 42 places in 368 ms of which 1 ms to minimize.
[2022-05-17 21:53:46] [INFO ] Deduced a trap composed of 35 places in 356 ms of which 1 ms to minimize.
[2022-05-17 21:53:46] [INFO ] Deduced a trap composed of 67 places in 367 ms of which 1 ms to minimize.
[2022-05-17 21:53:47] [INFO ] Deduced a trap composed of 97 places in 357 ms of which 1 ms to minimize.
[2022-05-17 21:53:47] [INFO ] Deduced a trap composed of 174 places in 354 ms of which 1 ms to minimize.
[2022-05-17 21:53:48] [INFO ] Deduced a trap composed of 69 places in 372 ms of which 1 ms to minimize.
[2022-05-17 21:53:48] [INFO ] Deduced a trap composed of 48 places in 367 ms of which 1 ms to minimize.
[2022-05-17 21:53:48] [INFO ] Deduced a trap composed of 76 places in 368 ms of which 1 ms to minimize.
[2022-05-17 21:53:49] [INFO ] Deduced a trap composed of 63 places in 355 ms of which 1 ms to minimize.
[2022-05-17 21:53:49] [INFO ] Deduced a trap composed of 57 places in 379 ms of which 1 ms to minimize.
[2022-05-17 21:53:50] [INFO ] Deduced a trap composed of 161 places in 386 ms of which 1 ms to minimize.
[2022-05-17 21:53:50] [INFO ] Deduced a trap composed of 97 places in 392 ms of which 1 ms to minimize.
[2022-05-17 21:53:51] [INFO ] Deduced a trap composed of 69 places in 360 ms of which 1 ms to minimize.
[2022-05-17 21:53:51] [INFO ] Deduced a trap composed of 76 places in 377 ms of which 1 ms to minimize.
[2022-05-17 21:53:51] [INFO ] Deduced a trap composed of 75 places in 357 ms of which 0 ms to minimize.
[2022-05-17 21:53:52] [INFO ] Deduced a trap composed of 59 places in 386 ms of which 1 ms to minimize.
[2022-05-17 21:53:52] [INFO ] Deduced a trap composed of 89 places in 325 ms of which 1 ms to minimize.
[2022-05-17 21:53:53] [INFO ] Deduced a trap composed of 93 places in 318 ms of which 0 ms to minimize.
[2022-05-17 21:53:53] [INFO ] Deduced a trap composed of 33 places in 382 ms of which 1 ms to minimize.
[2022-05-17 21:53:54] [INFO ] Deduced a trap composed of 105 places in 394 ms of which 1 ms to minimize.
[2022-05-17 21:53:54] [INFO ] Deduced a trap composed of 19 places in 322 ms of which 1 ms to minimize.
[2022-05-17 21:53:54] [INFO ] Deduced a trap composed of 98 places in 335 ms of which 0 ms to minimize.
[2022-05-17 21:53:55] [INFO ] Deduced a trap composed of 82 places in 325 ms of which 1 ms to minimize.
[2022-05-17 21:53:55] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 0 ms to minimize.
[2022-05-17 21:53:56] [INFO ] Deduced a trap composed of 114 places in 333 ms of which 0 ms to minimize.
[2022-05-17 21:53:56] [INFO ] Deduced a trap composed of 167 places in 332 ms of which 0 ms to minimize.
[2022-05-17 21:53:56] [INFO ] Deduced a trap composed of 43 places in 302 ms of which 0 ms to minimize.
[2022-05-17 21:53:57] [INFO ] Deduced a trap composed of 143 places in 361 ms of which 1 ms to minimize.
[2022-05-17 21:53:57] [INFO ] Deduced a trap composed of 209 places in 348 ms of which 1 ms to minimize.
[2022-05-17 21:53:58] [INFO ] Deduced a trap composed of 213 places in 350 ms of which 1 ms to minimize.
[2022-05-17 21:53:58] [INFO ] Deduced a trap composed of 21 places in 355 ms of which 0 ms to minimize.
[2022-05-17 21:53:58] [INFO ] Deduced a trap composed of 204 places in 352 ms of which 1 ms to minimize.
[2022-05-17 21:53:59] [INFO ] Deduced a trap composed of 39 places in 343 ms of which 1 ms to minimize.
[2022-05-17 21:53:59] [INFO ] Deduced a trap composed of 54 places in 287 ms of which 1 ms to minimize.
[2022-05-17 21:54:00] [INFO ] Deduced a trap composed of 75 places in 280 ms of which 1 ms to minimize.
[2022-05-17 21:54:00] [INFO ] Deduced a trap composed of 62 places in 299 ms of which 0 ms to minimize.
[2022-05-17 21:54:00] [INFO ] Deduced a trap composed of 62 places in 298 ms of which 1 ms to minimize.
[2022-05-17 21:54:01] [INFO ] Deduced a trap composed of 93 places in 297 ms of which 1 ms to minimize.
[2022-05-17 21:54:01] [INFO ] Deduced a trap composed of 30 places in 293 ms of which 1 ms to minimize.
[2022-05-17 21:54:01] [INFO ] Deduced a trap composed of 97 places in 269 ms of which 1 ms to minimize.
[2022-05-17 21:54:02] [INFO ] Deduced a trap composed of 207 places in 304 ms of which 1 ms to minimize.
[2022-05-17 21:54:02] [INFO ] Deduced a trap composed of 113 places in 263 ms of which 1 ms to minimize.
[2022-05-17 21:54:02] [INFO ] Deduced a trap composed of 101 places in 306 ms of which 1 ms to minimize.
[2022-05-17 21:54:03] [INFO ] Deduced a trap composed of 118 places in 311 ms of which 1 ms to minimize.
[2022-05-17 21:54:03] [INFO ] Deduced a trap composed of 135 places in 327 ms of which 1 ms to minimize.
[2022-05-17 21:54:04] [INFO ] Deduced a trap composed of 115 places in 344 ms of which 0 ms to minimize.
[2022-05-17 21:54:04] [INFO ] Deduced a trap composed of 80 places in 345 ms of which 1 ms to minimize.
[2022-05-17 21:54:04] [INFO ] Deduced a trap composed of 261 places in 343 ms of which 1 ms to minimize.
[2022-05-17 21:54:05] [INFO ] Deduced a trap composed of 22 places in 351 ms of which 1 ms to minimize.
[2022-05-17 21:54:05] [INFO ] Deduced a trap composed of 19 places in 338 ms of which 1 ms to minimize.
[2022-05-17 21:54:06] [INFO ] Deduced a trap composed of 65 places in 345 ms of which 1 ms to minimize.
[2022-05-17 21:54:06] [INFO ] Deduced a trap composed of 89 places in 333 ms of which 0 ms to minimize.
[2022-05-17 21:54:06] [INFO ] Deduced a trap composed of 130 places in 335 ms of which 1 ms to minimize.
[2022-05-17 21:54:07] [INFO ] Deduced a trap composed of 191 places in 345 ms of which 1 ms to minimize.
[2022-05-17 21:54:07] [INFO ] Deduced a trap composed of 130 places in 328 ms of which 0 ms to minimize.
[2022-05-17 21:54:08] [INFO ] Deduced a trap composed of 130 places in 342 ms of which 1 ms to minimize.
[2022-05-17 21:54:08] [INFO ] Deduced a trap composed of 130 places in 338 ms of which 1 ms to minimize.
[2022-05-17 21:54:08] [INFO ] Deduced a trap composed of 130 places in 330 ms of which 1 ms to minimize.
[2022-05-17 21:54:09] [INFO ] Deduced a trap composed of 130 places in 329 ms of which 1 ms to minimize.
[2022-05-17 21:54:09] [INFO ] Deduced a trap composed of 47 places in 344 ms of which 1 ms to minimize.
[2022-05-17 21:54:10] [INFO ] Deduced a trap composed of 189 places in 336 ms of which 0 ms to minimize.
[2022-05-17 21:54:10] [INFO ] Deduced a trap composed of 267 places in 325 ms of which 1 ms to minimize.
[2022-05-17 21:54:10] [INFO ] Deduced a trap composed of 256 places in 327 ms of which 1 ms to minimize.
[2022-05-17 21:54:11] [INFO ] Deduced a trap composed of 131 places in 328 ms of which 0 ms to minimize.
[2022-05-17 21:54:11] [INFO ] Deduced a trap composed of 138 places in 364 ms of which 1 ms to minimize.
[2022-05-17 21:54:12] [INFO ] Deduced a trap composed of 61 places in 374 ms of which 0 ms to minimize.
[2022-05-17 21:54:12] [INFO ] Deduced a trap composed of 110 places in 398 ms of which 13 ms to minimize.
[2022-05-17 21:54:13] [INFO ] Deduced a trap composed of 32 places in 400 ms of which 0 ms to minimize.
[2022-05-17 21:54:13] [INFO ] Deduced a trap composed of 53 places in 384 ms of which 1 ms to minimize.
[2022-05-17 21:54:14] [INFO ] Deduced a trap composed of 17 places in 358 ms of which 1 ms to minimize.
[2022-05-17 21:54:14] [INFO ] Deduced a trap composed of 43 places in 376 ms of which 0 ms to minimize.
[2022-05-17 21:54:15] [INFO ] Deduced a trap composed of 128 places in 362 ms of which 1 ms to minimize.
[2022-05-17 21:54:15] [INFO ] Deduced a trap composed of 27 places in 329 ms of which 1 ms to minimize.
[2022-05-17 21:54:15] [INFO ] Deduced a trap composed of 100 places in 359 ms of which 0 ms to minimize.
[2022-05-17 21:54:16] [INFO ] Deduced a trap composed of 109 places in 367 ms of which 1 ms to minimize.
[2022-05-17 21:54:16] [INFO ] Deduced a trap composed of 84 places in 342 ms of which 0 ms to minimize.
[2022-05-17 21:54:17] [INFO ] Deduced a trap composed of 61 places in 297 ms of which 1 ms to minimize.
[2022-05-17 21:54:17] [INFO ] Deduced a trap composed of 50 places in 308 ms of which 1 ms to minimize.
[2022-05-17 21:54:18] [INFO ] Deduced a trap composed of 106 places in 301 ms of which 0 ms to minimize.
[2022-05-17 21:54:18] [INFO ] Deduced a trap composed of 151 places in 304 ms of which 1 ms to minimize.
[2022-05-17 21:54:18] [INFO ] Deduced a trap composed of 116 places in 314 ms of which 0 ms to minimize.
[2022-05-17 21:54:19] [INFO ] Deduced a trap composed of 232 places in 301 ms of which 1 ms to minimize.
[2022-05-17 21:54:19] [INFO ] Deduced a trap composed of 194 places in 293 ms of which 0 ms to minimize.
[2022-05-17 21:54:19] [INFO ] Deduced a trap composed of 111 places in 295 ms of which 1 ms to minimize.
[2022-05-17 21:54:20] [INFO ] Deduced a trap composed of 65 places in 320 ms of which 1 ms to minimize.
[2022-05-17 21:54:20] [INFO ] Deduced a trap composed of 27 places in 337 ms of which 1 ms to minimize.
[2022-05-17 21:54:21] [INFO ] Deduced a trap composed of 19 places in 389 ms of which 1 ms to minimize.
[2022-05-17 21:54:21] [INFO ] Deduced a trap composed of 15 places in 388 ms of which 0 ms to minimize.
[2022-05-17 21:54:22] [INFO ] Deduced a trap composed of 46 places in 364 ms of which 1 ms to minimize.
[2022-05-17 21:54:22] [INFO ] Deduced a trap composed of 124 places in 312 ms of which 1 ms to minimize.
[2022-05-17 21:54:22] [INFO ] Deduced a trap composed of 82 places in 357 ms of which 1 ms to minimize.
[2022-05-17 21:54:23] [INFO ] Deduced a trap composed of 61 places in 358 ms of which 0 ms to minimize.
[2022-05-17 21:54:23] [INFO ] Deduced a trap composed of 77 places in 369 ms of which 1 ms to minimize.
[2022-05-17 21:54:23] [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.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-05-17 21:54:23] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 21:54:23] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 21:54:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:54:24] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2022-05-17 21:54:24] [INFO ] [Real]Added 546 Read/Feed constraints in 83 ms returned sat
[2022-05-17 21:54:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:54:24] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 21:54:24] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 21:54:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:54:25] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2022-05-17 21:54:25] [INFO ] [Nat]Added 546 Read/Feed constraints in 94 ms returned sat
[2022-05-17 21:54:25] [INFO ] Deduced a trap composed of 93 places in 388 ms of which 1 ms to minimize.
[2022-05-17 21:54:26] [INFO ] Deduced a trap composed of 124 places in 391 ms of which 1 ms to minimize.
[2022-05-17 21:54:26] [INFO ] Deduced a trap composed of 83 places in 387 ms of which 1 ms to minimize.
[2022-05-17 21:54:26] [INFO ] Deduced a trap composed of 56 places in 383 ms of which 1 ms to minimize.
[2022-05-17 21:54:27] [INFO ] Deduced a trap composed of 66 places in 389 ms of which 1 ms to minimize.
[2022-05-17 21:54:27] [INFO ] Deduced a trap composed of 61 places in 384 ms of which 1 ms to minimize.
[2022-05-17 21:54:28] [INFO ] Deduced a trap composed of 134 places in 384 ms of which 0 ms to minimize.
[2022-05-17 21:54:28] [INFO ] Deduced a trap composed of 48 places in 378 ms of which 0 ms to minimize.
[2022-05-17 21:54:29] [INFO ] Deduced a trap composed of 39 places in 368 ms of which 1 ms to minimize.
[2022-05-17 21:54:29] [INFO ] Deduced a trap composed of 17 places in 372 ms of which 1 ms to minimize.
[2022-05-17 21:54:30] [INFO ] Deduced a trap composed of 13 places in 361 ms of which 1 ms to minimize.
[2022-05-17 21:54:30] [INFO ] Deduced a trap composed of 109 places in 376 ms of which 1 ms to minimize.
[2022-05-17 21:54:30] [INFO ] Deduced a trap composed of 41 places in 388 ms of which 1 ms to minimize.
[2022-05-17 21:54:31] [INFO ] Deduced a trap composed of 41 places in 383 ms of which 1 ms to minimize.
[2022-05-17 21:54:31] [INFO ] Deduced a trap composed of 42 places in 371 ms of which 1 ms to minimize.
[2022-05-17 21:54:32] [INFO ] Deduced a trap composed of 35 places in 367 ms of which 1 ms to minimize.
[2022-05-17 21:54:32] [INFO ] Deduced a trap composed of 67 places in 379 ms of which 1 ms to minimize.
[2022-05-17 21:54:33] [INFO ] Deduced a trap composed of 97 places in 370 ms of which 1 ms to minimize.
[2022-05-17 21:54:33] [INFO ] Deduced a trap composed of 174 places in 388 ms of which 0 ms to minimize.
[2022-05-17 21:54:34] [INFO ] Deduced a trap composed of 69 places in 378 ms of which 1 ms to minimize.
[2022-05-17 21:54:34] [INFO ] Deduced a trap composed of 48 places in 386 ms of which 1 ms to minimize.
[2022-05-17 21:54:34] [INFO ] Deduced a trap composed of 76 places in 378 ms of which 1 ms to minimize.
[2022-05-17 21:54:35] [INFO ] Deduced a trap composed of 63 places in 397 ms of which 1 ms to minimize.
[2022-05-17 21:54:35] [INFO ] Deduced a trap composed of 57 places in 373 ms of which 1 ms to minimize.
[2022-05-17 21:54:36] [INFO ] Deduced a trap composed of 161 places in 377 ms of which 1 ms to minimize.
[2022-05-17 21:54:36] [INFO ] Deduced a trap composed of 97 places in 377 ms of which 1 ms to minimize.
[2022-05-17 21:54:37] [INFO ] Deduced a trap composed of 69 places in 371 ms of which 1 ms to minimize.
[2022-05-17 21:54:37] [INFO ] Deduced a trap composed of 76 places in 350 ms of which 0 ms to minimize.
[2022-05-17 21:54:38] [INFO ] Deduced a trap composed of 75 places in 361 ms of which 0 ms to minimize.
[2022-05-17 21:54:38] [INFO ] Deduced a trap composed of 59 places in 374 ms of which 0 ms to minimize.
[2022-05-17 21:54:38] [INFO ] Deduced a trap composed of 89 places in 313 ms of which 1 ms to minimize.
[2022-05-17 21:54:39] [INFO ] Deduced a trap composed of 93 places in 306 ms of which 1 ms to minimize.
[2022-05-17 21:54:39] [INFO ] Deduced a trap composed of 33 places in 385 ms of which 0 ms to minimize.
[2022-05-17 21:54:40] [INFO ] Deduced a trap composed of 105 places in 384 ms of which 0 ms to minimize.
[2022-05-17 21:54:40] [INFO ] Deduced a trap composed of 19 places in 307 ms of which 1 ms to minimize.
[2022-05-17 21:54:40] [INFO ] Deduced a trap composed of 98 places in 331 ms of which 0 ms to minimize.
[2022-05-17 21:54:41] [INFO ] Deduced a trap composed of 82 places in 325 ms of which 0 ms to minimize.
[2022-05-17 21:54:41] [INFO ] Deduced a trap composed of 196 places in 315 ms of which 1 ms to minimize.
[2022-05-17 21:54:42] [INFO ] Deduced a trap composed of 114 places in 327 ms of which 1 ms to minimize.
[2022-05-17 21:54:42] [INFO ] Deduced a trap composed of 167 places in 327 ms of which 1 ms to minimize.
[2022-05-17 21:54:42] [INFO ] Deduced a trap composed of 43 places in 287 ms of which 1 ms to minimize.
[2022-05-17 21:54:43] [INFO ] Deduced a trap composed of 143 places in 356 ms of which 1 ms to minimize.
[2022-05-17 21:54:43] [INFO ] Deduced a trap composed of 209 places in 376 ms of which 1 ms to minimize.
[2022-05-17 21:54:44] [INFO ] Deduced a trap composed of 213 places in 370 ms of which 1 ms to minimize.
[2022-05-17 21:54:44] [INFO ] Deduced a trap composed of 21 places in 359 ms of which 0 ms to minimize.
[2022-05-17 21:54:45] [INFO ] Deduced a trap composed of 204 places in 345 ms of which 1 ms to minimize.
[2022-05-17 21:54:45] [INFO ] Deduced a trap composed of 39 places in 341 ms of which 1 ms to minimize.
[2022-05-17 21:54:45] [INFO ] Deduced a trap composed of 54 places in 305 ms of which 1 ms to minimize.
[2022-05-17 21:54:46] [INFO ] Deduced a trap composed of 75 places in 308 ms of which 1 ms to minimize.
[2022-05-17 21:54:46] [INFO ] Deduced a trap composed of 62 places in 295 ms of which 0 ms to minimize.
[2022-05-17 21:54:46] [INFO ] Deduced a trap composed of 62 places in 295 ms of which 1 ms to minimize.
[2022-05-17 21:54:47] [INFO ] Deduced a trap composed of 93 places in 297 ms of which 0 ms to minimize.
[2022-05-17 21:54:47] [INFO ] Deduced a trap composed of 30 places in 301 ms of which 0 ms to minimize.
[2022-05-17 21:54:47] [INFO ] Deduced a trap composed of 97 places in 274 ms of which 0 ms to minimize.
[2022-05-17 21:54:48] [INFO ] Deduced a trap composed of 207 places in 324 ms of which 0 ms to minimize.
[2022-05-17 21:54:48] [INFO ] Deduced a trap composed of 113 places in 276 ms of which 1 ms to minimize.
[2022-05-17 21:54:49] [INFO ] Deduced a trap composed of 101 places in 327 ms of which 1 ms to minimize.
[2022-05-17 21:54:49] [INFO ] Deduced a trap composed of 118 places in 328 ms of which 1 ms to minimize.
[2022-05-17 21:54:49] [INFO ] Deduced a trap composed of 135 places in 346 ms of which 0 ms to minimize.
[2022-05-17 21:54:50] [INFO ] Deduced a trap composed of 115 places in 327 ms of which 1 ms to minimize.
[2022-05-17 21:54:50] [INFO ] Deduced a trap composed of 80 places in 326 ms of which 1 ms to minimize.
[2022-05-17 21:54:51] [INFO ] Deduced a trap composed of 261 places in 349 ms of which 1 ms to minimize.
[2022-05-17 21:54:51] [INFO ] Deduced a trap composed of 22 places in 328 ms of which 1 ms to minimize.
[2022-05-17 21:54:51] [INFO ] Deduced a trap composed of 19 places in 343 ms of which 1 ms to minimize.
[2022-05-17 21:54:52] [INFO ] Deduced a trap composed of 65 places in 328 ms of which 1 ms to minimize.
[2022-05-17 21:54:52] [INFO ] Deduced a trap composed of 89 places in 312 ms of which 1 ms to minimize.
[2022-05-17 21:54:53] [INFO ] Deduced a trap composed of 130 places in 317 ms of which 1 ms to minimize.
[2022-05-17 21:54:53] [INFO ] Deduced a trap composed of 191 places in 328 ms of which 1 ms to minimize.
[2022-05-17 21:54:53] [INFO ] Deduced a trap composed of 130 places in 336 ms of which 1 ms to minimize.
[2022-05-17 21:54:54] [INFO ] Deduced a trap composed of 130 places in 336 ms of which 1 ms to minimize.
[2022-05-17 21:54:54] [INFO ] Deduced a trap composed of 130 places in 326 ms of which 1 ms to minimize.
[2022-05-17 21:54:55] [INFO ] Deduced a trap composed of 130 places in 329 ms of which 1 ms to minimize.
[2022-05-17 21:54:55] [INFO ] Deduced a trap composed of 130 places in 319 ms of which 1 ms to minimize.
[2022-05-17 21:54:55] [INFO ] Deduced a trap composed of 47 places in 326 ms of which 1 ms to minimize.
[2022-05-17 21:54:56] [INFO ] Deduced a trap composed of 189 places in 320 ms of which 1 ms to minimize.
[2022-05-17 21:54:56] [INFO ] Deduced a trap composed of 267 places in 324 ms of which 1 ms to minimize.
[2022-05-17 21:54:57] [INFO ] Deduced a trap composed of 256 places in 340 ms of which 1 ms to minimize.
[2022-05-17 21:54:57] [INFO ] Deduced a trap composed of 131 places in 340 ms of which 0 ms to minimize.
[2022-05-17 21:54:57] [INFO ] Deduced a trap composed of 138 places in 371 ms of which 1 ms to minimize.
[2022-05-17 21:54:58] [INFO ] Deduced a trap composed of 61 places in 387 ms of which 1 ms to minimize.
[2022-05-17 21:54:58] [INFO ] Deduced a trap composed of 110 places in 375 ms of which 0 ms to minimize.
[2022-05-17 21:54:59] [INFO ] Deduced a trap composed of 32 places in 395 ms of which 1 ms to minimize.
[2022-05-17 21:54:59] [INFO ] Deduced a trap composed of 53 places in 391 ms of which 0 ms to minimize.
[2022-05-17 21:55:00] [INFO ] Deduced a trap composed of 17 places in 368 ms of which 1 ms to minimize.
[2022-05-17 21:55:00] [INFO ] Deduced a trap composed of 43 places in 385 ms of which 1 ms to minimize.
[2022-05-17 21:55:01] [INFO ] Deduced a trap composed of 128 places in 373 ms of which 1 ms to minimize.
[2022-05-17 21:55:01] [INFO ] Deduced a trap composed of 27 places in 349 ms of which 1 ms to minimize.
[2022-05-17 21:55:02] [INFO ] Deduced a trap composed of 100 places in 369 ms of which 0 ms to minimize.
[2022-05-17 21:55:02] [INFO ] Deduced a trap composed of 109 places in 371 ms of which 1 ms to minimize.
[2022-05-17 21:55:03] [INFO ] Deduced a trap composed of 84 places in 349 ms of which 1 ms to minimize.
[2022-05-17 21:55:03] [INFO ] Deduced a trap composed of 61 places in 300 ms of which 1 ms to minimize.
[2022-05-17 21:55:03] [INFO ] Deduced a trap composed of 50 places in 304 ms of which 1 ms to minimize.
[2022-05-17 21:55:04] [INFO ] Deduced a trap composed of 106 places in 302 ms of which 0 ms to minimize.
[2022-05-17 21:55:04] [INFO ] Deduced a trap composed of 151 places in 304 ms of which 1 ms to minimize.
[2022-05-17 21:55:04] [INFO ] Deduced a trap composed of 116 places in 316 ms of which 0 ms to minimize.
[2022-05-17 21:55:05] [INFO ] Deduced a trap composed of 232 places in 286 ms of which 1 ms to minimize.
[2022-05-17 21:55:05] [INFO ] Deduced a trap composed of 194 places in 288 ms of which 2 ms to minimize.
[2022-05-17 21:55:06] [INFO ] Deduced a trap composed of 111 places in 288 ms of which 1 ms to minimize.
[2022-05-17 21:55:06] [INFO ] Deduced a trap composed of 65 places in 326 ms of which 1 ms to minimize.
[2022-05-17 21:55:06] [INFO ] Deduced a trap composed of 27 places in 334 ms of which 1 ms to minimize.
[2022-05-17 21:55:07] [INFO ] Deduced a trap composed of 19 places in 385 ms of which 1 ms to minimize.
[2022-05-17 21:55:07] [INFO ] Deduced a trap composed of 15 places in 391 ms of which 1 ms to minimize.
[2022-05-17 21:55:08] [INFO ] Deduced a trap composed of 46 places in 338 ms of which 1 ms to minimize.
[2022-05-17 21:55:08] [INFO ] Deduced a trap composed of 124 places in 302 ms of which 1 ms to minimize.
[2022-05-17 21:55:09] [INFO ] Deduced a trap composed of 82 places in 357 ms of which 1 ms to minimize.
[2022-05-17 21:55:09] [INFO ] Deduced a trap composed of 61 places in 353 ms of which 0 ms to minimize.
[2022-05-17 21:55:09] [INFO ] Deduced a trap composed of 77 places in 338 ms of which 1 ms to minimize.
[2022-05-17 21:55:09] [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)
[2022-05-17 21:55:09] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 21:55:09] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 21:55:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:55:10] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2022-05-17 21:55:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:55:10] [INFO ] [Nat]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 21:55:10] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 21:55:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:55:10] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2022-05-17 21:55:11] [INFO ] [Nat]Added 546 Read/Feed constraints in 99 ms returned sat
[2022-05-17 21:55:11] [INFO ] Deduced a trap composed of 43 places in 415 ms of which 1 ms to minimize.
[2022-05-17 21:55:11] [INFO ] Deduced a trap composed of 33 places in 414 ms of which 0 ms to minimize.
[2022-05-17 21:55:12] [INFO ] Deduced a trap composed of 37 places in 430 ms of which 1 ms to minimize.
[2022-05-17 21:55:12] [INFO ] Deduced a trap composed of 67 places in 426 ms of which 1 ms to minimize.
[2022-05-17 21:55:13] [INFO ] Deduced a trap composed of 132 places in 419 ms of which 1 ms to minimize.
[2022-05-17 21:55:13] [INFO ] Deduced a trap composed of 106 places in 416 ms of which 1 ms to minimize.
[2022-05-17 21:55:14] [INFO ] Deduced a trap composed of 107 places in 410 ms of which 1 ms to minimize.
[2022-05-17 21:55:14] [INFO ] Deduced a trap composed of 25 places in 411 ms of which 1 ms to minimize.
[2022-05-17 21:55:15] [INFO ] Deduced a trap composed of 153 places in 404 ms of which 1 ms to minimize.
[2022-05-17 21:55:15] [INFO ] Deduced a trap composed of 118 places in 448 ms of which 1 ms to minimize.
[2022-05-17 21:55:16] [INFO ] Deduced a trap composed of 134 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:55:16] [INFO ] Deduced a trap composed of 163 places in 436 ms of which 0 ms to minimize.
[2022-05-17 21:55:17] [INFO ] Deduced a trap composed of 54 places in 416 ms of which 1 ms to minimize.
[2022-05-17 21:55:17] [INFO ] Deduced a trap composed of 103 places in 422 ms of which 0 ms to minimize.
[2022-05-17 21:55:18] [INFO ] Deduced a trap composed of 268 places in 405 ms of which 1 ms to minimize.
[2022-05-17 21:55:18] [INFO ] Deduced a trap composed of 61 places in 410 ms of which 1 ms to minimize.
[2022-05-17 21:55:19] [INFO ] Deduced a trap composed of 76 places in 421 ms of which 0 ms to minimize.
[2022-05-17 21:55:19] [INFO ] Deduced a trap composed of 57 places in 429 ms of which 1 ms to minimize.
[2022-05-17 21:55:20] [INFO ] Deduced a trap composed of 31 places in 423 ms of which 1 ms to minimize.
[2022-05-17 21:55:20] [INFO ] Deduced a trap composed of 13 places in 391 ms of which 1 ms to minimize.
[2022-05-17 21:55:21] [INFO ] Deduced a trap composed of 15 places in 391 ms of which 1 ms to minimize.
[2022-05-17 21:55:21] [INFO ] Deduced a trap composed of 187 places in 411 ms of which 1 ms to minimize.
[2022-05-17 21:55:22] [INFO ] Deduced a trap composed of 19 places in 387 ms of which 1 ms to minimize.
[2022-05-17 21:55:22] [INFO ] Deduced a trap composed of 13 places in 397 ms of which 0 ms to minimize.
[2022-05-17 21:55:23] [INFO ] Deduced a trap composed of 50 places in 389 ms of which 0 ms to minimize.
[2022-05-17 21:55:23] [INFO ] Deduced a trap composed of 97 places in 393 ms of which 0 ms to minimize.
[2022-05-17 21:55:23] [INFO ] Deduced a trap composed of 86 places in 396 ms of which 1 ms to minimize.
[2022-05-17 21:55:24] [INFO ] Deduced a trap composed of 13 places in 375 ms of which 1 ms to minimize.
[2022-05-17 21:55:24] [INFO ] Deduced a trap composed of 116 places in 405 ms of which 1 ms to minimize.
[2022-05-17 21:55:25] [INFO ] Deduced a trap composed of 15 places in 381 ms of which 1 ms to minimize.
[2022-05-17 21:55:25] [INFO ] Deduced a trap composed of 113 places in 415 ms of which 1 ms to minimize.
[2022-05-17 21:55:26] [INFO ] Deduced a trap composed of 20 places in 411 ms of which 0 ms to minimize.
[2022-05-17 21:55:26] [INFO ] Deduced a trap composed of 24 places in 403 ms of which 1 ms to minimize.
[2022-05-17 21:55:27] [INFO ] Deduced a trap composed of 13 places in 405 ms of which 1 ms to minimize.
[2022-05-17 21:55:27] [INFO ] Deduced a trap composed of 67 places in 402 ms of which 1 ms to minimize.
[2022-05-17 21:55:28] [INFO ] Deduced a trap composed of 78 places in 401 ms of which 1 ms to minimize.
[2022-05-17 21:55:28] [INFO ] Deduced a trap composed of 20 places in 423 ms of which 1 ms to minimize.
[2022-05-17 21:55:29] [INFO ] Deduced a trap composed of 20 places in 402 ms of which 1 ms to minimize.
[2022-05-17 21:55:29] [INFO ] Deduced a trap composed of 13 places in 388 ms of which 1 ms to minimize.
[2022-05-17 21:55:30] [INFO ] Deduced a trap composed of 41 places in 396 ms of which 1 ms to minimize.
[2022-05-17 21:55:30] [INFO ] Deduced a trap composed of 20 places in 374 ms of which 1 ms to minimize.
[2022-05-17 21:55:30] [INFO ] Deduced a trap composed of 11 places in 398 ms of which 0 ms to minimize.
[2022-05-17 21:55:31] [INFO ] Deduced a trap composed of 11 places in 396 ms of which 0 ms to minimize.
[2022-05-17 21:55:31] [INFO ] Deduced a trap composed of 11 places in 395 ms of which 1 ms to minimize.
[2022-05-17 21:55:32] [INFO ] Deduced a trap composed of 85 places in 422 ms of which 0 ms to minimize.
[2022-05-17 21:55:32] [INFO ] Deduced a trap composed of 77 places in 398 ms of which 0 ms to minimize.
[2022-05-17 21:55:33] [INFO ] Deduced a trap composed of 38 places in 409 ms of which 1 ms to minimize.
[2022-05-17 21:55:33] [INFO ] Deduced a trap composed of 23 places in 381 ms of which 1 ms to minimize.
[2022-05-17 21:55:34] [INFO ] Deduced a trap composed of 97 places in 402 ms of which 1 ms to minimize.
[2022-05-17 21:55:34] [INFO ] Deduced a trap composed of 126 places in 395 ms of which 1 ms to minimize.
[2022-05-17 21:55:35] [INFO ] Deduced a trap composed of 46 places in 390 ms of which 1 ms to minimize.
[2022-05-17 21:55:35] [INFO ] Deduced a trap composed of 54 places in 381 ms of which 1 ms to minimize.
[2022-05-17 21:55:36] [INFO ] Deduced a trap composed of 108 places in 397 ms of which 1 ms to minimize.
[2022-05-17 21:55:36] [INFO ] Deduced a trap composed of 52 places in 381 ms of which 1 ms to minimize.
[2022-05-17 21:55:36] [INFO ] Deduced a trap composed of 97 places in 398 ms of which 1 ms to minimize.
[2022-05-17 21:55:37] [INFO ] Deduced a trap composed of 11 places in 400 ms of which 1 ms to minimize.
[2022-05-17 21:55:37] [INFO ] Deduced a trap composed of 31 places in 422 ms of which 1 ms to minimize.
[2022-05-17 21:55:38] [INFO ] Deduced a trap composed of 26 places in 393 ms of which 0 ms to minimize.
[2022-05-17 21:55:38] [INFO ] Deduced a trap composed of 49 places in 422 ms of which 1 ms to minimize.
[2022-05-17 21:55:39] [INFO ] Deduced a trap composed of 67 places in 435 ms of which 1 ms to minimize.
[2022-05-17 21:55:39] [INFO ] Deduced a trap composed of 57 places in 411 ms of which 1 ms to minimize.
[2022-05-17 21:55:40] [INFO ] Deduced a trap composed of 79 places in 423 ms of which 1 ms to minimize.
[2022-05-17 21:55:40] [INFO ] Deduced a trap composed of 102 places in 430 ms of which 1 ms to minimize.
[2022-05-17 21:55:41] [INFO ] Deduced a trap composed of 139 places in 407 ms of which 1 ms to minimize.
[2022-05-17 21:55:41] [INFO ] Deduced a trap composed of 80 places in 409 ms of which 1 ms to minimize.
[2022-05-17 21:55:42] [INFO ] Deduced a trap composed of 36 places in 414 ms of which 0 ms to minimize.
[2022-05-17 21:55:42] [INFO ] Deduced a trap composed of 85 places in 399 ms of which 1 ms to minimize.
[2022-05-17 21:55:43] [INFO ] Deduced a trap composed of 102 places in 408 ms of which 1 ms to minimize.
[2022-05-17 21:55:43] [INFO ] Deduced a trap composed of 117 places in 418 ms of which 1 ms to minimize.
[2022-05-17 21:55:44] [INFO ] Deduced a trap composed of 31 places in 404 ms of which 1 ms to minimize.
[2022-05-17 21:55:44] [INFO ] Deduced a trap composed of 55 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:55:45] [INFO ] Deduced a trap composed of 29 places in 419 ms of which 1 ms to minimize.
[2022-05-17 21:55:45] [INFO ] Deduced a trap composed of 41 places in 450 ms of which 1 ms to minimize.
[2022-05-17 21:55:46] [INFO ] Deduced a trap composed of 61 places in 419 ms of which 1 ms to minimize.
[2022-05-17 21:55:46] [INFO ] Deduced a trap composed of 49 places in 410 ms of which 0 ms to minimize.
[2022-05-17 21:55:47] [INFO ] Deduced a trap composed of 50 places in 405 ms of which 0 ms to minimize.
[2022-05-17 21:55:47] [INFO ] Deduced a trap composed of 141 places in 390 ms of which 1 ms to minimize.
[2022-05-17 21:55:47] [INFO ] Deduced a trap composed of 144 places in 412 ms of which 1 ms to minimize.
[2022-05-17 21:55:48] [INFO ] Deduced a trap composed of 136 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:55:48] [INFO ] Deduced a trap composed of 135 places in 403 ms of which 1 ms to minimize.
[2022-05-17 21:55:49] [INFO ] Deduced a trap composed of 165 places in 420 ms of which 1 ms to minimize.
[2022-05-17 21:55:49] [INFO ] Deduced a trap composed of 169 places in 415 ms of which 1 ms to minimize.
[2022-05-17 21:55:50] [INFO ] Deduced a trap composed of 138 places in 409 ms of which 1 ms to minimize.
[2022-05-17 21:55:50] [INFO ] Deduced a trap composed of 215 places in 402 ms of which 0 ms to minimize.
[2022-05-17 21:55:51] [INFO ] Deduced a trap composed of 179 places in 409 ms of which 1 ms to minimize.
[2022-05-17 21:55:51] [INFO ] Deduced a trap composed of 20 places in 402 ms of which 1 ms to minimize.
[2022-05-17 21:55:52] [INFO ] Deduced a trap composed of 85 places in 433 ms of which 1 ms to minimize.
[2022-05-17 21:55:52] [INFO ] Deduced a trap composed of 74 places in 440 ms of which 1 ms to minimize.
[2022-05-17 21:55:53] [INFO ] Deduced a trap composed of 24 places in 419 ms of which 1 ms to minimize.
[2022-05-17 21:55:53] [INFO ] Deduced a trap composed of 51 places in 431 ms of which 1 ms to minimize.
[2022-05-17 21:55:54] [INFO ] Deduced a trap composed of 11 places in 387 ms of which 1 ms to minimize.
[2022-05-17 21:55:54] [INFO ] Deduced a trap composed of 77 places in 410 ms of which 0 ms to minimize.
[2022-05-17 21:55:55] [INFO ] Deduced a trap composed of 84 places in 404 ms of which 1 ms to minimize.
[2022-05-17 21:55:55] [INFO ] Deduced a trap composed of 39 places in 393 ms of which 1 ms to minimize.
[2022-05-17 21:55:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
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) : [8, 8, 8, 8, 8] Max seen :[7, 7, 1, 1, 7]
Support contains 456 out of 1104 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1104/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 36 ms. Remains 1104 /1104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1104/1104 places, 2208/2208 transitions.
Starting structural reductions, iteration 0 : 1104/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 32 ms. Remains 1104 /1104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2022-05-17 21:55:55] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1104 cols
[2022-05-17 21:55:55] [INFO ] Computed 31 place invariants in 6 ms
[2022-05-17 21:55:56] [INFO ] Implicit Places using invariants in 428 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 431 ms to find 8 implicit places.
[2022-05-17 21:55:56] [INFO ] Redundant transitions in 156 ms returned []
[2022-05-17 21:55:56] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 21:55:56] [INFO ] Computed 23 place invariants in 15 ms
[2022-05-17 21:55:57] [INFO ] Dead Transitions using invariants and state equation in 770 ms returned []
Starting structural reductions, iteration 1 : 1096/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 28 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2022-05-17 21:55:57] [INFO ] Redundant transitions in 162 ms returned []
[2022-05-17 21:55:57] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 21:55:57] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-17 21:55:58] [INFO ] Dead Transitions using invariants and state equation in 767 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1096/1104 places, 2208/2208 transitions.
Normalized transition count is 1872 out of 2208 initially.
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 21:55:58] [INFO ] Computed 23 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 23489 ms. (steps per millisecond=42 ) properties (out of 5) seen :20
Interrupted Best-First random walk after 548812 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=109 ) properties seen :{0=3, 1=3, 4=3}
Interrupted Best-First random walk after 566713 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=113 ) properties seen :{0=4, 1=4, 4=4}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2981 ms. (steps per millisecond=335 ) properties (out of 5) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3001 ms. (steps per millisecond=333 ) properties (out of 5) seen :5
Interrupted Best-First random walk after 552736 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=110 ) properties seen :{0=1, 1=1, 4=1}
[2022-05-17 21:56:42] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 21:56:42] [INFO ] Computed 23 place invariants in 14 ms
[2022-05-17 21:56:42] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2022-05-17 21:56:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:56:43] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2022-05-17 21:56:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:56:43] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2022-05-17 21:56:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:56:43] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2022-05-17 21:56:43] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 21:56:43] [INFO ] [Nat]Added 546 Read/Feed constraints in 99 ms returned sat
[2022-05-17 21:56:44] [INFO ] Deduced a trap composed of 29 places in 411 ms of which 1 ms to minimize.
[2022-05-17 21:56:44] [INFO ] Deduced a trap composed of 99 places in 424 ms of which 0 ms to minimize.
[2022-05-17 21:56:45] [INFO ] Deduced a trap composed of 54 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:56:45] [INFO ] Deduced a trap composed of 37 places in 415 ms of which 0 ms to minimize.
[2022-05-17 21:56:46] [INFO ] Deduced a trap composed of 37 places in 425 ms of which 0 ms to minimize.
[2022-05-17 21:56:46] [INFO ] Deduced a trap composed of 71 places in 419 ms of which 1 ms to minimize.
[2022-05-17 21:56:47] [INFO ] Deduced a trap composed of 126 places in 418 ms of which 0 ms to minimize.
[2022-05-17 21:56:47] [INFO ] Deduced a trap composed of 67 places in 430 ms of which 1 ms to minimize.
[2022-05-17 21:56:48] [INFO ] Deduced a trap composed of 43 places in 414 ms of which 1 ms to minimize.
[2022-05-17 21:56:48] [INFO ] Deduced a trap composed of 35 places in 423 ms of which 1 ms to minimize.
[2022-05-17 21:56:49] [INFO ] Deduced a trap composed of 92 places in 423 ms of which 0 ms to minimize.
[2022-05-17 21:56:49] [INFO ] Deduced a trap composed of 31 places in 415 ms of which 1 ms to minimize.
[2022-05-17 21:56:49] [INFO ] Deduced a trap composed of 79 places in 421 ms of which 1 ms to minimize.
[2022-05-17 21:56:50] [INFO ] Deduced a trap composed of 104 places in 409 ms of which 1 ms to minimize.
[2022-05-17 21:56:50] [INFO ] Deduced a trap composed of 41 places in 411 ms of which 1 ms to minimize.
[2022-05-17 21:56:51] [INFO ] Deduced a trap composed of 44 places in 403 ms of which 1 ms to minimize.
[2022-05-17 21:56:51] [INFO ] Deduced a trap composed of 73 places in 419 ms of which 1 ms to minimize.
[2022-05-17 21:56:52] [INFO ] Deduced a trap composed of 67 places in 445 ms of which 1 ms to minimize.
[2022-05-17 21:56:52] [INFO ] Deduced a trap composed of 67 places in 449 ms of which 1 ms to minimize.
[2022-05-17 21:56:53] [INFO ] Deduced a trap composed of 79 places in 453 ms of which 1 ms to minimize.
[2022-05-17 21:56:53] [INFO ] Deduced a trap composed of 105 places in 411 ms of which 1 ms to minimize.
[2022-05-17 21:56:54] [INFO ] Deduced a trap composed of 138 places in 412 ms of which 1 ms to minimize.
[2022-05-17 21:56:54] [INFO ] Deduced a trap composed of 34 places in 421 ms of which 1 ms to minimize.
[2022-05-17 21:56:55] [INFO ] Deduced a trap composed of 73 places in 412 ms of which 1 ms to minimize.
[2022-05-17 21:56:55] [INFO ] Deduced a trap composed of 34 places in 429 ms of which 0 ms to minimize.
[2022-05-17 21:56:56] [INFO ] Deduced a trap composed of 113 places in 414 ms of which 1 ms to minimize.
[2022-05-17 21:56:56] [INFO ] Deduced a trap composed of 61 places in 450 ms of which 1 ms to minimize.
[2022-05-17 21:56:57] [INFO ] Deduced a trap composed of 32 places in 448 ms of which 1 ms to minimize.
[2022-05-17 21:56:57] [INFO ] Deduced a trap composed of 64 places in 427 ms of which 1 ms to minimize.
[2022-05-17 21:56:58] [INFO ] Deduced a trap composed of 100 places in 447 ms of which 1 ms to minimize.
[2022-05-17 21:56:58] [INFO ] Deduced a trap composed of 28 places in 414 ms of which 1 ms to minimize.
[2022-05-17 21:56:59] [INFO ] Deduced a trap composed of 21 places in 419 ms of which 0 ms to minimize.
[2022-05-17 21:56:59] [INFO ] Deduced a trap composed of 109 places in 429 ms of which 1 ms to minimize.
[2022-05-17 21:57:00] [INFO ] Deduced a trap composed of 29 places in 418 ms of which 1 ms to minimize.
[2022-05-17 21:57:00] [INFO ] Deduced a trap composed of 184 places in 419 ms of which 1 ms to minimize.
[2022-05-17 21:57:01] [INFO ] Deduced a trap composed of 85 places in 401 ms of which 1 ms to minimize.
[2022-05-17 21:57:01] [INFO ] Deduced a trap composed of 71 places in 394 ms of which 1 ms to minimize.
[2022-05-17 21:57:02] [INFO ] Deduced a trap composed of 75 places in 405 ms of which 1 ms to minimize.
[2022-05-17 21:57:02] [INFO ] Deduced a trap composed of 85 places in 402 ms of which 1 ms to minimize.
[2022-05-17 21:57:03] [INFO ] Deduced a trap composed of 37 places in 408 ms of which 0 ms to minimize.
[2022-05-17 21:57:03] [INFO ] Deduced a trap composed of 52 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:57:04] [INFO ] Deduced a trap composed of 23 places in 411 ms of which 1 ms to minimize.
[2022-05-17 21:57:04] [INFO ] Deduced a trap composed of 64 places in 408 ms of which 1 ms to minimize.
[2022-05-17 21:57:05] [INFO ] Deduced a trap composed of 86 places in 421 ms of which 1 ms to minimize.
[2022-05-17 21:57:05] [INFO ] Deduced a trap composed of 17 places in 430 ms of which 1 ms to minimize.
[2022-05-17 21:57:06] [INFO ] Deduced a trap composed of 87 places in 441 ms of which 1 ms to minimize.
[2022-05-17 21:57:06] [INFO ] Deduced a trap composed of 54 places in 404 ms of which 1 ms to minimize.
[2022-05-17 21:57:06] [INFO ] Deduced a trap composed of 43 places in 426 ms of which 1 ms to minimize.
[2022-05-17 21:57:07] [INFO ] Deduced a trap composed of 51 places in 403 ms of which 0 ms to minimize.
[2022-05-17 21:57:07] [INFO ] Deduced a trap composed of 13 places in 403 ms of which 1 ms to minimize.
[2022-05-17 21:57:08] [INFO ] Deduced a trap composed of 76 places in 425 ms of which 1 ms to minimize.
[2022-05-17 21:57:08] [INFO ] Deduced a trap composed of 61 places in 410 ms of which 1 ms to minimize.
[2022-05-17 21:57:09] [INFO ] Deduced a trap composed of 89 places in 238 ms of which 1 ms to minimize.
[2022-05-17 21:57:09] [INFO ] Deduced a trap composed of 52 places in 418 ms of which 1 ms to minimize.
[2022-05-17 21:57:10] [INFO ] Deduced a trap composed of 43 places in 401 ms of which 1 ms to minimize.
[2022-05-17 21:57:10] [INFO ] Deduced a trap composed of 137 places in 429 ms of which 1 ms to minimize.
[2022-05-17 21:57:11] [INFO ] Deduced a trap composed of 169 places in 405 ms of which 1 ms to minimize.
[2022-05-17 21:57:11] [INFO ] Deduced a trap composed of 89 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:57:12] [INFO ] Deduced a trap composed of 76 places in 405 ms of which 1 ms to minimize.
[2022-05-17 21:57:12] [INFO ] Deduced a trap composed of 34 places in 421 ms of which 1 ms to minimize.
[2022-05-17 21:57:12] [INFO ] Deduced a trap composed of 113 places in 422 ms of which 1 ms to minimize.
[2022-05-17 21:57:13] [INFO ] Deduced a trap composed of 165 places in 405 ms of which 1 ms to minimize.
[2022-05-17 21:57:13] [INFO ] Deduced a trap composed of 44 places in 407 ms of which 1 ms to minimize.
[2022-05-17 21:57:14] [INFO ] Deduced a trap composed of 23 places in 407 ms of which 1 ms to minimize.
[2022-05-17 21:57:14] [INFO ] Deduced a trap composed of 28 places in 414 ms of which 1 ms to minimize.
[2022-05-17 21:57:15] [INFO ] Deduced a trap composed of 71 places in 415 ms of which 0 ms to minimize.
[2022-05-17 21:57:15] [INFO ] Deduced a trap composed of 53 places in 409 ms of which 1 ms to minimize.
[2022-05-17 21:57:16] [INFO ] Deduced a trap composed of 89 places in 432 ms of which 0 ms to minimize.
[2022-05-17 21:57:16] [INFO ] Deduced a trap composed of 76 places in 424 ms of which 1 ms to minimize.
[2022-05-17 21:57:17] [INFO ] Deduced a trap composed of 80 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:57:17] [INFO ] Deduced a trap composed of 99 places in 418 ms of which 1 ms to minimize.
[2022-05-17 21:57:18] [INFO ] Deduced a trap composed of 78 places in 365 ms of which 1 ms to minimize.
[2022-05-17 21:57:18] [INFO ] Deduced a trap composed of 143 places in 421 ms of which 1 ms to minimize.
[2022-05-17 21:57:19] [INFO ] Deduced a trap composed of 53 places in 410 ms of which 0 ms to minimize.
[2022-05-17 21:57:19] [INFO ] Deduced a trap composed of 32 places in 422 ms of which 0 ms to minimize.
[2022-05-17 21:57:20] [INFO ] Deduced a trap composed of 40 places in 417 ms of which 1 ms to minimize.
[2022-05-17 21:57:20] [INFO ] Deduced a trap composed of 36 places in 403 ms of which 1 ms to minimize.
[2022-05-17 21:57:21] [INFO ] Deduced a trap composed of 21 places in 410 ms of which 1 ms to minimize.
[2022-05-17 21:57:21] [INFO ] Deduced a trap composed of 81 places in 416 ms of which 1 ms to minimize.
[2022-05-17 21:57:22] [INFO ] Deduced a trap composed of 25 places in 418 ms of which 1 ms to minimize.
[2022-05-17 21:57:22] [INFO ] Deduced a trap composed of 77 places in 412 ms of which 1 ms to minimize.
[2022-05-17 21:57:23] [INFO ] Deduced a trap composed of 93 places in 395 ms of which 1 ms to minimize.
[2022-05-17 21:57:23] [INFO ] Deduced a trap composed of 60 places in 414 ms of which 1 ms to minimize.
[2022-05-17 21:57:24] [INFO ] Deduced a trap composed of 43 places in 421 ms of which 1 ms to minimize.
[2022-05-17 21:57:24] [INFO ] Deduced a trap composed of 77 places in 247 ms of which 0 ms to minimize.
[2022-05-17 21:57:24] [INFO ] Deduced a trap composed of 123 places in 207 ms of which 0 ms to minimize.
[2022-05-17 21:57:24] [INFO ] Deduced a trap composed of 95 places in 205 ms of which 1 ms to minimize.
[2022-05-17 21:57:25] [INFO ] Deduced a trap composed of 93 places in 208 ms of which 0 ms to minimize.
[2022-05-17 21:57:25] [INFO ] Deduced a trap composed of 88 places in 209 ms of which 0 ms to minimize.
[2022-05-17 21:57:25] [INFO ] Deduced a trap composed of 24 places in 406 ms of which 1 ms to minimize.
[2022-05-17 21:57:26] [INFO ] Deduced a trap composed of 20 places in 416 ms of which 1 ms to minimize.
[2022-05-17 21:57:26] [INFO ] Deduced a trap composed of 13 places in 394 ms of which 0 ms to minimize.
[2022-05-17 21:57:27] [INFO ] Deduced a trap composed of 126 places in 208 ms of which 0 ms to minimize.
[2022-05-17 21:57:27] [INFO ] Deduced a trap composed of 121 places in 295 ms of which 1 ms to minimize.
[2022-05-17 21:57:27] [INFO ] Deduced a trap composed of 122 places in 293 ms of which 0 ms to minimize.
[2022-05-17 21:57:28] [INFO ] Deduced a trap composed of 89 places in 306 ms of which 0 ms to minimize.
[2022-05-17 21:57:28] [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-05-17 21:57:28] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 21:57:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:57:28] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2022-05-17 21:57:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:57:28] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2022-05-17 21:57:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:57:29] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2022-05-17 21:57:29] [INFO ] [Nat]Added 546 Read/Feed constraints in 93 ms returned sat
[2022-05-17 21:57:29] [INFO ] Deduced a trap composed of 29 places in 428 ms of which 1 ms to minimize.
[2022-05-17 21:57:30] [INFO ] Deduced a trap composed of 99 places in 434 ms of which 1 ms to minimize.
[2022-05-17 21:57:30] [INFO ] Deduced a trap composed of 54 places in 427 ms of which 1 ms to minimize.
[2022-05-17 21:57:31] [INFO ] Deduced a trap composed of 37 places in 419 ms of which 0 ms to minimize.
[2022-05-17 21:57:31] [INFO ] Deduced a trap composed of 37 places in 441 ms of which 1 ms to minimize.
[2022-05-17 21:57:32] [INFO ] Deduced a trap composed of 71 places in 434 ms of which 1 ms to minimize.
[2022-05-17 21:57:32] [INFO ] Deduced a trap composed of 126 places in 405 ms of which 1 ms to minimize.
[2022-05-17 21:57:33] [INFO ] Deduced a trap composed of 67 places in 443 ms of which 1 ms to minimize.
[2022-05-17 21:57:33] [INFO ] Deduced a trap composed of 43 places in 410 ms of which 1 ms to minimize.
[2022-05-17 21:57:34] [INFO ] Deduced a trap composed of 35 places in 419 ms of which 1 ms to minimize.
[2022-05-17 21:57:34] [INFO ] Deduced a trap composed of 92 places in 408 ms of which 1 ms to minimize.
[2022-05-17 21:57:35] [INFO ] Deduced a trap composed of 31 places in 411 ms of which 1 ms to minimize.
[2022-05-17 21:57:35] [INFO ] Deduced a trap composed of 79 places in 430 ms of which 1 ms to minimize.
[2022-05-17 21:57:36] [INFO ] Deduced a trap composed of 104 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:57:36] [INFO ] Deduced a trap composed of 41 places in 410 ms of which 1 ms to minimize.
[2022-05-17 21:57:37] [INFO ] Deduced a trap composed of 44 places in 401 ms of which 0 ms to minimize.
[2022-05-17 21:57:37] [INFO ] Deduced a trap composed of 73 places in 408 ms of which 1 ms to minimize.
[2022-05-17 21:57:38] [INFO ] Deduced a trap composed of 67 places in 428 ms of which 1 ms to minimize.
[2022-05-17 21:57:38] [INFO ] Deduced a trap composed of 67 places in 429 ms of which 0 ms to minimize.
[2022-05-17 21:57:39] [INFO ] Deduced a trap composed of 79 places in 432 ms of which 1 ms to minimize.
[2022-05-17 21:57:39] [INFO ] Deduced a trap composed of 105 places in 423 ms of which 1 ms to minimize.
[2022-05-17 21:57:40] [INFO ] Deduced a trap composed of 138 places in 404 ms of which 1 ms to minimize.
[2022-05-17 21:57:40] [INFO ] Deduced a trap composed of 34 places in 410 ms of which 1 ms to minimize.
[2022-05-17 21:57:40] [INFO ] Deduced a trap composed of 73 places in 397 ms of which 1 ms to minimize.
[2022-05-17 21:57:41] [INFO ] Deduced a trap composed of 34 places in 420 ms of which 1 ms to minimize.
[2022-05-17 21:57:41] [INFO ] Deduced a trap composed of 113 places in 400 ms of which 1 ms to minimize.
[2022-05-17 21:57:42] [INFO ] Deduced a trap composed of 61 places in 432 ms of which 1 ms to minimize.
[2022-05-17 21:57:42] [INFO ] Deduced a trap composed of 32 places in 424 ms of which 1 ms to minimize.
[2022-05-17 21:57:43] [INFO ] Deduced a trap composed of 64 places in 409 ms of which 1 ms to minimize.
[2022-05-17 21:57:43] [INFO ] Deduced a trap composed of 100 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:57:44] [INFO ] Deduced a trap composed of 28 places in 403 ms of which 0 ms to minimize.
[2022-05-17 21:57:44] [INFO ] Deduced a trap composed of 21 places in 405 ms of which 1 ms to minimize.
[2022-05-17 21:57:45] [INFO ] Deduced a trap composed of 109 places in 438 ms of which 1 ms to minimize.
[2022-05-17 21:57:45] [INFO ] Deduced a trap composed of 29 places in 415 ms of which 1 ms to minimize.
[2022-05-17 21:57:46] [INFO ] Deduced a trap composed of 184 places in 434 ms of which 1 ms to minimize.
[2022-05-17 21:57:46] [INFO ] Deduced a trap composed of 85 places in 404 ms of which 1 ms to minimize.
[2022-05-17 21:57:47] [INFO ] Deduced a trap composed of 71 places in 402 ms of which 1 ms to minimize.
[2022-05-17 21:57:47] [INFO ] Deduced a trap composed of 75 places in 439 ms of which 1 ms to minimize.
[2022-05-17 21:57:48] [INFO ] Deduced a trap composed of 85 places in 410 ms of which 1 ms to minimize.
[2022-05-17 21:57:48] [INFO ] Deduced a trap composed of 37 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:57:49] [INFO ] Deduced a trap composed of 52 places in 391 ms of which 1 ms to minimize.
[2022-05-17 21:57:49] [INFO ] Deduced a trap composed of 23 places in 410 ms of which 1 ms to minimize.
[2022-05-17 21:57:50] [INFO ] Deduced a trap composed of 64 places in 405 ms of which 1 ms to minimize.
[2022-05-17 21:57:50] [INFO ] Deduced a trap composed of 86 places in 419 ms of which 0 ms to minimize.
[2022-05-17 21:57:51] [INFO ] Deduced a trap composed of 17 places in 406 ms of which 1 ms to minimize.
[2022-05-17 21:57:51] [INFO ] Deduced a trap composed of 87 places in 421 ms of which 1 ms to minimize.
[2022-05-17 21:57:51] [INFO ] Deduced a trap composed of 54 places in 401 ms of which 1 ms to minimize.
[2022-05-17 21:57:52] [INFO ] Deduced a trap composed of 43 places in 417 ms of which 1 ms to minimize.
[2022-05-17 21:57:52] [INFO ] Deduced a trap composed of 51 places in 404 ms of which 1 ms to minimize.
[2022-05-17 21:57:53] [INFO ] Deduced a trap composed of 13 places in 401 ms of which 1 ms to minimize.
[2022-05-17 21:57:53] [INFO ] Deduced a trap composed of 76 places in 451 ms of which 1 ms to minimize.
[2022-05-17 21:57:54] [INFO ] Deduced a trap composed of 61 places in 415 ms of which 1 ms to minimize.
[2022-05-17 21:57:54] [INFO ] Deduced a trap composed of 89 places in 247 ms of which 0 ms to minimize.
[2022-05-17 21:57:55] [INFO ] Deduced a trap composed of 52 places in 436 ms of which 0 ms to minimize.
[2022-05-17 21:57:55] [INFO ] Deduced a trap composed of 43 places in 419 ms of which 1 ms to minimize.
[2022-05-17 21:57:56] [INFO ] Deduced a trap composed of 137 places in 459 ms of which 1 ms to minimize.
[2022-05-17 21:57:56] [INFO ] Deduced a trap composed of 169 places in 417 ms of which 1 ms to minimize.
[2022-05-17 21:57:57] [INFO ] Deduced a trap composed of 89 places in 418 ms of which 1 ms to minimize.
[2022-05-17 21:57:57] [INFO ] Deduced a trap composed of 76 places in 409 ms of which 1 ms to minimize.
[2022-05-17 21:57:58] [INFO ] Deduced a trap composed of 34 places in 427 ms of which 1 ms to minimize.
[2022-05-17 21:57:58] [INFO ] Deduced a trap composed of 113 places in 427 ms of which 1 ms to minimize.
[2022-05-17 21:57:59] [INFO ] Deduced a trap composed of 165 places in 412 ms of which 1 ms to minimize.
[2022-05-17 21:57:59] [INFO ] Deduced a trap composed of 44 places in 430 ms of which 1 ms to minimize.
[2022-05-17 21:58:00] [INFO ] Deduced a trap composed of 23 places in 409 ms of which 0 ms to minimize.
[2022-05-17 21:58:00] [INFO ] Deduced a trap composed of 28 places in 436 ms of which 1 ms to minimize.
[2022-05-17 21:58:01] [INFO ] Deduced a trap composed of 71 places in 426 ms of which 6 ms to minimize.
[2022-05-17 21:58:01] [INFO ] Deduced a trap composed of 53 places in 422 ms of which 1 ms to minimize.
[2022-05-17 21:58:01] [INFO ] Deduced a trap composed of 89 places in 446 ms of which 1 ms to minimize.
[2022-05-17 21:58:02] [INFO ] Deduced a trap composed of 76 places in 431 ms of which 0 ms to minimize.
[2022-05-17 21:58:02] [INFO ] Deduced a trap composed of 80 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:58:03] [INFO ] Deduced a trap composed of 99 places in 417 ms of which 0 ms to minimize.
[2022-05-17 21:58:03] [INFO ] Deduced a trap composed of 78 places in 363 ms of which 0 ms to minimize.
[2022-05-17 21:58:04] [INFO ] Deduced a trap composed of 143 places in 414 ms of which 1 ms to minimize.
[2022-05-17 21:58:04] [INFO ] Deduced a trap composed of 53 places in 402 ms of which 0 ms to minimize.
[2022-05-17 21:58:05] [INFO ] Deduced a trap composed of 32 places in 414 ms of which 1 ms to minimize.
[2022-05-17 21:58:05] [INFO ] Deduced a trap composed of 40 places in 405 ms of which 1 ms to minimize.
[2022-05-17 21:58:06] [INFO ] Deduced a trap composed of 36 places in 417 ms of which 1 ms to minimize.
[2022-05-17 21:58:06] [INFO ] Deduced a trap composed of 21 places in 406 ms of which 1 ms to minimize.
[2022-05-17 21:58:07] [INFO ] Deduced a trap composed of 81 places in 413 ms of which 1 ms to minimize.
[2022-05-17 21:58:07] [INFO ] Deduced a trap composed of 25 places in 421 ms of which 1 ms to minimize.
[2022-05-17 21:58:08] [INFO ] Deduced a trap composed of 77 places in 414 ms of which 1 ms to minimize.
[2022-05-17 21:58:08] [INFO ] Deduced a trap composed of 93 places in 409 ms of which 1 ms to minimize.
[2022-05-17 21:58:09] [INFO ] Deduced a trap composed of 60 places in 411 ms of which 1 ms to minimize.
[2022-05-17 21:58:09] [INFO ] Deduced a trap composed of 43 places in 423 ms of which 1 ms to minimize.
[2022-05-17 21:58:10] [INFO ] Deduced a trap composed of 77 places in 247 ms of which 1 ms to minimize.
[2022-05-17 21:58:10] [INFO ] Deduced a trap composed of 123 places in 204 ms of which 0 ms to minimize.
[2022-05-17 21:58:10] [INFO ] Deduced a trap composed of 95 places in 209 ms of which 0 ms to minimize.
[2022-05-17 21:58:10] [INFO ] Deduced a trap composed of 93 places in 202 ms of which 0 ms to minimize.
[2022-05-17 21:58:11] [INFO ] Deduced a trap composed of 88 places in 205 ms of which 1 ms to minimize.
[2022-05-17 21:58:11] [INFO ] Deduced a trap composed of 24 places in 409 ms of which 1 ms to minimize.
[2022-05-17 21:58:12] [INFO ] Deduced a trap composed of 20 places in 414 ms of which 1 ms to minimize.
[2022-05-17 21:58:12] [INFO ] Deduced a trap composed of 13 places in 402 ms of which 1 ms to minimize.
[2022-05-17 21:58:12] [INFO ] Deduced a trap composed of 126 places in 210 ms of which 0 ms to minimize.
[2022-05-17 21:58:13] [INFO ] Deduced a trap composed of 121 places in 298 ms of which 0 ms to minimize.
[2022-05-17 21:58:13] [INFO ] Deduced a trap composed of 122 places in 297 ms of which 1 ms to minimize.
[2022-05-17 21:58:13] [INFO ] Deduced a trap composed of 89 places in 297 ms of which 1 ms to minimize.
[2022-05-17 21:58:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-05-17 21:58:14] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2022-05-17 21:58:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:58:14] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2022-05-17 21:58:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:58:14] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 21:58:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:58:14] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2022-05-17 21:58:15] [INFO ] [Nat]Added 546 Read/Feed constraints in 94 ms returned sat
[2022-05-17 21:58:15] [INFO ] Deduced a trap composed of 17 places in 351 ms of which 1 ms to minimize.
[2022-05-17 21:58:15] [INFO ] Deduced a trap composed of 32 places in 346 ms of which 0 ms to minimize.
[2022-05-17 21:58:16] [INFO ] Deduced a trap composed of 15 places in 340 ms of which 1 ms to minimize.
[2022-05-17 21:58:16] [INFO ] Deduced a trap composed of 141 places in 343 ms of which 0 ms to minimize.
[2022-05-17 21:58:17] [INFO ] Deduced a trap composed of 131 places in 391 ms of which 0 ms to minimize.
[2022-05-17 21:58:17] [INFO ] Deduced a trap composed of 50 places in 357 ms of which 1 ms to minimize.
[2022-05-17 21:58:17] [INFO ] Deduced a trap composed of 145 places in 350 ms of which 1 ms to minimize.
[2022-05-17 21:58:18] [INFO ] Deduced a trap composed of 122 places in 366 ms of which 0 ms to minimize.
[2022-05-17 21:58:18] [INFO ] Deduced a trap composed of 35 places in 349 ms of which 0 ms to minimize.
[2022-05-17 21:58:19] [INFO ] Deduced a trap composed of 33 places in 359 ms of which 0 ms to minimize.
[2022-05-17 21:58:19] [INFO ] Deduced a trap composed of 23 places in 350 ms of which 1 ms to minimize.
[2022-05-17 21:58:20] [INFO ] Deduced a trap composed of 68 places in 362 ms of which 0 ms to minimize.
[2022-05-17 21:58:20] [INFO ] Deduced a trap composed of 31 places in 348 ms of which 1 ms to minimize.
[2022-05-17 21:58:20] [INFO ] Deduced a trap composed of 42 places in 350 ms of which 1 ms to minimize.
[2022-05-17 21:58:21] [INFO ] Deduced a trap composed of 133 places in 350 ms of which 0 ms to minimize.
[2022-05-17 21:58:21] [INFO ] Deduced a trap composed of 75 places in 282 ms of which 1 ms to minimize.
[2022-05-17 21:58:22] [INFO ] Deduced a trap composed of 101 places in 333 ms of which 0 ms to minimize.
[2022-05-17 21:58:22] [INFO ] Deduced a trap composed of 84 places in 342 ms of which 1 ms to minimize.
[2022-05-17 21:58:22] [INFO ] Deduced a trap composed of 99 places in 338 ms of which 1 ms to minimize.
[2022-05-17 21:58:23] [INFO ] Deduced a trap composed of 48 places in 330 ms of which 1 ms to minimize.
[2022-05-17 21:58:23] [INFO ] Deduced a trap composed of 13 places in 335 ms of which 1 ms to minimize.
[2022-05-17 21:58:24] [INFO ] Deduced a trap composed of 17 places in 329 ms of which 1 ms to minimize.
[2022-05-17 21:58:24] [INFO ] Deduced a trap composed of 171 places in 339 ms of which 1 ms to minimize.
[2022-05-17 21:58:24] [INFO ] Deduced a trap composed of 63 places in 361 ms of which 1 ms to minimize.
[2022-05-17 21:58:25] [INFO ] Deduced a trap composed of 43 places in 364 ms of which 1 ms to minimize.
[2022-05-17 21:58:25] [INFO ] Deduced a trap composed of 107 places in 365 ms of which 1 ms to minimize.
[2022-05-17 21:58:26] [INFO ] Deduced a trap composed of 97 places in 333 ms of which 1 ms to minimize.
[2022-05-17 21:58:26] [INFO ] Deduced a trap composed of 13 places in 307 ms of which 1 ms to minimize.
[2022-05-17 21:58:26] [INFO ] Deduced a trap composed of 28 places in 336 ms of which 1 ms to minimize.
[2022-05-17 21:58:27] [INFO ] Deduced a trap composed of 13 places in 329 ms of which 1 ms to minimize.
[2022-05-17 21:58:27] [INFO ] Deduced a trap composed of 71 places in 293 ms of which 6 ms to minimize.
[2022-05-17 21:58:28] [INFO ] Deduced a trap composed of 67 places in 329 ms of which 0 ms to minimize.
[2022-05-17 21:58:28] [INFO ] Deduced a trap composed of 99 places in 324 ms of which 1 ms to minimize.
[2022-05-17 21:58:28] [INFO ] Deduced a trap composed of 100 places in 341 ms of which 0 ms to minimize.
[2022-05-17 21:58:29] [INFO ] Deduced a trap composed of 79 places in 340 ms of which 1 ms to minimize.
[2022-05-17 21:58:29] [INFO ] Deduced a trap composed of 111 places in 339 ms of which 1 ms to minimize.
[2022-05-17 21:58:30] [INFO ] Deduced a trap composed of 65 places in 341 ms of which 0 ms to minimize.
[2022-05-17 21:58:30] [INFO ] Deduced a trap composed of 28 places in 368 ms of which 1 ms to minimize.
[2022-05-17 21:58:30] [INFO ] Deduced a trap composed of 34 places in 368 ms of which 1 ms to minimize.
[2022-05-17 21:58:31] [INFO ] Deduced a trap composed of 54 places in 372 ms of which 1 ms to minimize.
[2022-05-17 21:58:31] [INFO ] Deduced a trap composed of 57 places in 350 ms of which 1 ms to minimize.
[2022-05-17 21:58:32] [INFO ] Deduced a trap composed of 47 places in 381 ms of which 0 ms to minimize.
[2022-05-17 21:58:32] [INFO ] Deduced a trap composed of 13 places in 383 ms of which 1 ms to minimize.
[2022-05-17 21:58:33] [INFO ] Deduced a trap composed of 68 places in 351 ms of which 1 ms to minimize.
[2022-05-17 21:58:33] [INFO ] Deduced a trap composed of 105 places in 357 ms of which 1 ms to minimize.
[2022-05-17 21:58:33] [INFO ] Deduced a trap composed of 43 places in 367 ms of which 1 ms to minimize.
[2022-05-17 21:58:34] [INFO ] Deduced a trap composed of 104 places in 352 ms of which 1 ms to minimize.
[2022-05-17 21:58:34] [INFO ] Deduced a trap composed of 75 places in 347 ms of which 0 ms to minimize.
[2022-05-17 21:58:35] [INFO ] Deduced a trap composed of 54 places in 387 ms of which 1 ms to minimize.
[2022-05-17 21:58:35] [INFO ] Deduced a trap composed of 75 places in 371 ms of which 1 ms to minimize.
[2022-05-17 21:58:36] [INFO ] Deduced a trap composed of 70 places in 369 ms of which 1 ms to minimize.
[2022-05-17 21:58:36] [INFO ] Deduced a trap composed of 66 places in 375 ms of which 0 ms to minimize.
[2022-05-17 21:58:36] [INFO ] Deduced a trap composed of 21 places in 369 ms of which 1 ms to minimize.
[2022-05-17 21:58:37] [INFO ] Deduced a trap composed of 113 places in 388 ms of which 1 ms to minimize.
[2022-05-17 21:58:37] [INFO ] Deduced a trap composed of 57 places in 392 ms of which 0 ms to minimize.
[2022-05-17 21:58:38] [INFO ] Deduced a trap composed of 56 places in 382 ms of which 1 ms to minimize.
[2022-05-17 21:58:38] [INFO ] Deduced a trap composed of 131 places in 364 ms of which 1 ms to minimize.
[2022-05-17 21:58:39] [INFO ] Deduced a trap composed of 95 places in 371 ms of which 1 ms to minimize.
[2022-05-17 21:58:39] [INFO ] Deduced a trap composed of 61 places in 373 ms of which 1 ms to minimize.
[2022-05-17 21:58:40] [INFO ] Deduced a trap composed of 102 places in 373 ms of which 1 ms to minimize.
[2022-05-17 21:58:40] [INFO ] Deduced a trap composed of 182 places in 358 ms of which 1 ms to minimize.
[2022-05-17 21:58:40] [INFO ] Deduced a trap composed of 155 places in 388 ms of which 0 ms to minimize.
[2022-05-17 21:58:41] [INFO ] Deduced a trap composed of 182 places in 370 ms of which 1 ms to minimize.
[2022-05-17 21:58:41] [INFO ] Deduced a trap composed of 95 places in 379 ms of which 1 ms to minimize.
[2022-05-17 21:58:42] [INFO ] Deduced a trap composed of 97 places in 379 ms of which 0 ms to minimize.
[2022-05-17 21:58:42] [INFO ] Deduced a trap composed of 115 places in 401 ms of which 1 ms to minimize.
[2022-05-17 21:58:43] [INFO ] Deduced a trap composed of 75 places in 404 ms of which 1 ms to minimize.
[2022-05-17 21:58:43] [INFO ] Deduced a trap composed of 65 places in 397 ms of which 1 ms to minimize.
[2022-05-17 21:58:44] [INFO ] Deduced a trap composed of 171 places in 389 ms of which 1 ms to minimize.
[2022-05-17 21:58:44] [INFO ] Deduced a trap composed of 100 places in 371 ms of which 1 ms to minimize.
[2022-05-17 21:58:44] [INFO ] Deduced a trap composed of 52 places in 382 ms of which 1 ms to minimize.
[2022-05-17 21:58:45] [INFO ] Deduced a trap composed of 56 places in 390 ms of which 0 ms to minimize.
[2022-05-17 21:58:45] [INFO ] Deduced a trap composed of 43 places in 374 ms of which 0 ms to minimize.
[2022-05-17 21:58:46] [INFO ] Deduced a trap composed of 117 places in 280 ms of which 1 ms to minimize.
[2022-05-17 21:58:46] [INFO ] Deduced a trap composed of 61 places in 275 ms of which 1 ms to minimize.
[2022-05-17 21:58:46] [INFO ] Deduced a trap composed of 140 places in 258 ms of which 1 ms to minimize.
[2022-05-17 21:58:47] [INFO ] Deduced a trap composed of 104 places in 259 ms of which 1 ms to minimize.
[2022-05-17 21:58:47] [INFO ] Deduced a trap composed of 55 places in 396 ms of which 1 ms to minimize.
[2022-05-17 21:58:48] [INFO ] Deduced a trap composed of 102 places in 368 ms of which 1 ms to minimize.
[2022-05-17 21:58:48] [INFO ] Deduced a trap composed of 69 places in 365 ms of which 1 ms to minimize.
[2022-05-17 21:58:49] [INFO ] Deduced a trap composed of 45 places in 362 ms of which 1 ms to minimize.
[2022-05-17 21:58:49] [INFO ] Deduced a trap composed of 172 places in 355 ms of which 0 ms to minimize.
[2022-05-17 21:58:50] [INFO ] Deduced a trap composed of 43 places in 341 ms of which 1 ms to minimize.
[2022-05-17 21:58:50] [INFO ] Deduced a trap composed of 51 places in 352 ms of which 1 ms to minimize.
[2022-05-17 21:58:50] [INFO ] Deduced a trap composed of 36 places in 373 ms of which 1 ms to minimize.
[2022-05-17 21:58:51] [INFO ] Deduced a trap composed of 91 places in 354 ms of which 1 ms to minimize.
[2022-05-17 21:58:51] [INFO ] Deduced a trap composed of 111 places in 347 ms of which 1 ms to minimize.
[2022-05-17 21:58:52] [INFO ] Deduced a trap composed of 97 places in 353 ms of which 1 ms to minimize.
[2022-05-17 21:58:52] [INFO ] Deduced a trap composed of 81 places in 345 ms of which 1 ms to minimize.
[2022-05-17 21:58:52] [INFO ] Deduced a trap composed of 77 places in 339 ms of which 0 ms to minimize.
[2022-05-17 21:58:53] [INFO ] Deduced a trap composed of 111 places in 337 ms of which 1 ms to minimize.
[2022-05-17 21:58:53] [INFO ] Deduced a trap composed of 124 places in 333 ms of which 0 ms to minimize.
[2022-05-17 21:58:54] [INFO ] Deduced a trap composed of 99 places in 336 ms of which 1 ms to minimize.
[2022-05-17 21:58:54] [INFO ] Deduced a trap composed of 42 places in 332 ms of which 1 ms to minimize.
[2022-05-17 21:58:54] [INFO ] Deduced a trap composed of 151 places in 186 ms of which 1 ms to minimize.
[2022-05-17 21:58:55] [INFO ] Deduced a trap composed of 84 places in 333 ms of which 1 ms to minimize.
[2022-05-17 21:58:55] [INFO ] Deduced a trap composed of 11 places in 327 ms of which 0 ms to minimize.
[2022-05-17 21:58:55] [INFO ] Deduced a trap composed of 95 places in 237 ms of which 1 ms to minimize.
[2022-05-17 21:58:56] [INFO ] Deduced a trap composed of 57 places in 328 ms of which 0 ms to minimize.
[2022-05-17 21:58:56] [INFO ] Deduced a trap composed of 113 places in 327 ms of which 1 ms to minimize.
[2022-05-17 21:58:57] [INFO ] Deduced a trap composed of 39 places in 395 ms of which 1 ms to minimize.
[2022-05-17 21:58:57] [INFO ] Deduced a trap composed of 28 places in 378 ms of which 1 ms to minimize.
[2022-05-17 21:58:58] [INFO ] Deduced a trap composed of 126 places in 392 ms of which 1 ms to minimize.
[2022-05-17 21:58:58] [INFO ] Deduced a trap composed of 15 places in 383 ms of which 1 ms to minimize.
[2022-05-17 21:58:58] [INFO ] Deduced a trap composed of 33 places in 355 ms of which 1 ms to minimize.
[2022-05-17 21:58:59] [INFO ] Deduced a trap composed of 82 places in 352 ms of which 1 ms to minimize.
[2022-05-17 21:58:59] [INFO ] Deduced a trap composed of 31 places in 357 ms of which 1 ms to minimize.
[2022-05-17 21:58:59] [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.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-05-17 21:58:59] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2022-05-17 21:58:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:59:00] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2022-05-17 21:59:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:59:00] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 21:59:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:59:00] [INFO ] [Nat]Absence check using state equation in 394 ms returned sat
[2022-05-17 21:59:00] [INFO ] [Nat]Added 546 Read/Feed constraints in 91 ms returned sat
[2022-05-17 21:59:01] [INFO ] Deduced a trap composed of 17 places in 377 ms of which 1 ms to minimize.
[2022-05-17 21:59:01] [INFO ] Deduced a trap composed of 32 places in 369 ms of which 1 ms to minimize.
[2022-05-17 21:59:02] [INFO ] Deduced a trap composed of 15 places in 370 ms of which 0 ms to minimize.
[2022-05-17 21:59:02] [INFO ] Deduced a trap composed of 141 places in 373 ms of which 1 ms to minimize.
[2022-05-17 21:59:03] [INFO ] Deduced a trap composed of 131 places in 369 ms of which 1 ms to minimize.
[2022-05-17 21:59:03] [INFO ] Deduced a trap composed of 50 places in 354 ms of which 0 ms to minimize.
[2022-05-17 21:59:03] [INFO ] Deduced a trap composed of 145 places in 349 ms of which 1 ms to minimize.
[2022-05-17 21:59:04] [INFO ] Deduced a trap composed of 122 places in 367 ms of which 1 ms to minimize.
[2022-05-17 21:59:04] [INFO ] Deduced a trap composed of 35 places in 363 ms of which 0 ms to minimize.
[2022-05-17 21:59:05] [INFO ] Deduced a trap composed of 33 places in 361 ms of which 1 ms to minimize.
[2022-05-17 21:59:05] [INFO ] Deduced a trap composed of 23 places in 360 ms of which 1 ms to minimize.
[2022-05-17 21:59:06] [INFO ] Deduced a trap composed of 68 places in 374 ms of which 1 ms to minimize.
[2022-05-17 21:59:06] [INFO ] Deduced a trap composed of 31 places in 374 ms of which 1 ms to minimize.
[2022-05-17 21:59:06] [INFO ] Deduced a trap composed of 42 places in 352 ms of which 1 ms to minimize.
[2022-05-17 21:59:07] [INFO ] Deduced a trap composed of 133 places in 357 ms of which 1 ms to minimize.
[2022-05-17 21:59:07] [INFO ] Deduced a trap composed of 75 places in 290 ms of which 1 ms to minimize.
[2022-05-17 21:59:08] [INFO ] Deduced a trap composed of 101 places in 327 ms of which 0 ms to minimize.
[2022-05-17 21:59:08] [INFO ] Deduced a trap composed of 84 places in 335 ms of which 1 ms to minimize.
[2022-05-17 21:59:08] [INFO ] Deduced a trap composed of 99 places in 333 ms of which 1 ms to minimize.
[2022-05-17 21:59:09] [INFO ] Deduced a trap composed of 48 places in 337 ms of which 1 ms to minimize.
[2022-05-17 21:59:09] [INFO ] Deduced a trap composed of 13 places in 322 ms of which 0 ms to minimize.
[2022-05-17 21:59:10] [INFO ] Deduced a trap composed of 17 places in 323 ms of which 1 ms to minimize.
[2022-05-17 21:59:10] [INFO ] Deduced a trap composed of 171 places in 334 ms of which 1 ms to minimize.
[2022-05-17 21:59:10] [INFO ] Deduced a trap composed of 63 places in 344 ms of which 1 ms to minimize.
[2022-05-17 21:59:11] [INFO ] Deduced a trap composed of 43 places in 334 ms of which 1 ms to minimize.
[2022-05-17 21:59:11] [INFO ] Deduced a trap composed of 107 places in 314 ms of which 0 ms to minimize.
[2022-05-17 21:59:12] [INFO ] Deduced a trap composed of 97 places in 319 ms of which 1 ms to minimize.
[2022-05-17 21:59:12] [INFO ] Deduced a trap composed of 13 places in 324 ms of which 1 ms to minimize.
[2022-05-17 21:59:12] [INFO ] Deduced a trap composed of 28 places in 333 ms of which 1 ms to minimize.
[2022-05-17 21:59:13] [INFO ] Deduced a trap composed of 13 places in 318 ms of which 1 ms to minimize.
[2022-05-17 21:59:13] [INFO ] Deduced a trap composed of 71 places in 292 ms of which 1 ms to minimize.
[2022-05-17 21:59:13] [INFO ] Deduced a trap composed of 67 places in 327 ms of which 1 ms to minimize.
[2022-05-17 21:59:14] [INFO ] Deduced a trap composed of 99 places in 331 ms of which 1 ms to minimize.
[2022-05-17 21:59:14] [INFO ] Deduced a trap composed of 100 places in 321 ms of which 1 ms to minimize.
[2022-05-17 21:59:15] [INFO ] Deduced a trap composed of 79 places in 347 ms of which 1 ms to minimize.
[2022-05-17 21:59:15] [INFO ] Deduced a trap composed of 111 places in 327 ms of which 0 ms to minimize.
[2022-05-17 21:59:15] [INFO ] Deduced a trap composed of 65 places in 326 ms of which 1 ms to minimize.
[2022-05-17 21:59:16] [INFO ] Deduced a trap composed of 28 places in 361 ms of which 1 ms to minimize.
[2022-05-17 21:59:16] [INFO ] Deduced a trap composed of 34 places in 351 ms of which 1 ms to minimize.
[2022-05-17 21:59:17] [INFO ] Deduced a trap composed of 54 places in 376 ms of which 1 ms to minimize.
[2022-05-17 21:59:17] [INFO ] Deduced a trap composed of 57 places in 349 ms of which 0 ms to minimize.
[2022-05-17 21:59:18] [INFO ] Deduced a trap composed of 47 places in 390 ms of which 1 ms to minimize.
[2022-05-17 21:59:18] [INFO ] Deduced a trap composed of 13 places in 379 ms of which 1 ms to minimize.
[2022-05-17 21:59:18] [INFO ] Deduced a trap composed of 68 places in 350 ms of which 1 ms to minimize.
[2022-05-17 21:59:19] [INFO ] Deduced a trap composed of 105 places in 373 ms of which 1 ms to minimize.
[2022-05-17 21:59:19] [INFO ] Deduced a trap composed of 43 places in 386 ms of which 0 ms to minimize.
[2022-05-17 21:59:20] [INFO ] Deduced a trap composed of 104 places in 352 ms of which 1 ms to minimize.
[2022-05-17 21:59:20] [INFO ] Deduced a trap composed of 75 places in 347 ms of which 1 ms to minimize.
[2022-05-17 21:59:21] [INFO ] Deduced a trap composed of 54 places in 380 ms of which 1 ms to minimize.
[2022-05-17 21:59:21] [INFO ] Deduced a trap composed of 75 places in 401 ms of which 0 ms to minimize.
[2022-05-17 21:59:21] [INFO ] Deduced a trap composed of 70 places in 383 ms of which 0 ms to minimize.
[2022-05-17 21:59:22] [INFO ] Deduced a trap composed of 66 places in 382 ms of which 1 ms to minimize.
[2022-05-17 21:59:22] [INFO ] Deduced a trap composed of 21 places in 371 ms of which 1 ms to minimize.
[2022-05-17 21:59:23] [INFO ] Deduced a trap composed of 113 places in 385 ms of which 0 ms to minimize.
[2022-05-17 21:59:23] [INFO ] Deduced a trap composed of 57 places in 398 ms of which 1 ms to minimize.
[2022-05-17 21:59:24] [INFO ] Deduced a trap composed of 56 places in 405 ms of which 0 ms to minimize.
[2022-05-17 21:59:24] [INFO ] Deduced a trap composed of 131 places in 356 ms of which 1 ms to minimize.
[2022-05-17 21:59:25] [INFO ] Deduced a trap composed of 95 places in 372 ms of which 1 ms to minimize.
[2022-05-17 21:59:25] [INFO ] Deduced a trap composed of 61 places in 359 ms of which 0 ms to minimize.
[2022-05-17 21:59:25] [INFO ] Deduced a trap composed of 102 places in 359 ms of which 1 ms to minimize.
[2022-05-17 21:59:26] [INFO ] Deduced a trap composed of 182 places in 357 ms of which 1 ms to minimize.
[2022-05-17 21:59:26] [INFO ] Deduced a trap composed of 155 places in 350 ms of which 0 ms to minimize.
[2022-05-17 21:59:27] [INFO ] Deduced a trap composed of 182 places in 365 ms of which 0 ms to minimize.
[2022-05-17 21:59:27] [INFO ] Deduced a trap composed of 95 places in 386 ms of which 1 ms to minimize.
[2022-05-17 21:59:28] [INFO ] Deduced a trap composed of 97 places in 382 ms of which 1 ms to minimize.
[2022-05-17 21:59:28] [INFO ] Deduced a trap composed of 115 places in 404 ms of which 0 ms to minimize.
[2022-05-17 21:59:29] [INFO ] Deduced a trap composed of 75 places in 390 ms of which 1 ms to minimize.
[2022-05-17 21:59:29] [INFO ] Deduced a trap composed of 65 places in 393 ms of which 1 ms to minimize.
[2022-05-17 21:59:29] [INFO ] Deduced a trap composed of 171 places in 382 ms of which 1 ms to minimize.
[2022-05-17 21:59:30] [INFO ] Deduced a trap composed of 100 places in 384 ms of which 0 ms to minimize.
[2022-05-17 21:59:30] [INFO ] Deduced a trap composed of 52 places in 373 ms of which 0 ms to minimize.
[2022-05-17 21:59:31] [INFO ] Deduced a trap composed of 56 places in 387 ms of which 1 ms to minimize.
[2022-05-17 21:59:31] [INFO ] Deduced a trap composed of 43 places in 370 ms of which 0 ms to minimize.
[2022-05-17 21:59:32] [INFO ] Deduced a trap composed of 117 places in 275 ms of which 0 ms to minimize.
[2022-05-17 21:59:32] [INFO ] Deduced a trap composed of 61 places in 274 ms of which 1 ms to minimize.
[2022-05-17 21:59:32] [INFO ] Deduced a trap composed of 140 places in 268 ms of which 0 ms to minimize.
[2022-05-17 21:59:33] [INFO ] Deduced a trap composed of 104 places in 258 ms of which 1 ms to minimize.
[2022-05-17 21:59:33] [INFO ] Deduced a trap composed of 55 places in 384 ms of which 1 ms to minimize.
[2022-05-17 21:59:34] [INFO ] Deduced a trap composed of 102 places in 363 ms of which 1 ms to minimize.
[2022-05-17 21:59:34] [INFO ] Deduced a trap composed of 69 places in 360 ms of which 1 ms to minimize.
[2022-05-17 21:59:34] [INFO ] Deduced a trap composed of 45 places in 349 ms of which 1 ms to minimize.
[2022-05-17 21:59:35] [INFO ] Deduced a trap composed of 172 places in 355 ms of which 1 ms to minimize.
[2022-05-17 21:59:35] [INFO ] Deduced a trap composed of 43 places in 344 ms of which 0 ms to minimize.
[2022-05-17 21:59:36] [INFO ] Deduced a trap composed of 51 places in 364 ms of which 1 ms to minimize.
[2022-05-17 21:59:36] [INFO ] Deduced a trap composed of 36 places in 364 ms of which 1 ms to minimize.
[2022-05-17 21:59:37] [INFO ] Deduced a trap composed of 91 places in 360 ms of which 1 ms to minimize.
[2022-05-17 21:59:37] [INFO ] Deduced a trap composed of 111 places in 353 ms of which 1 ms to minimize.
[2022-05-17 21:59:37] [INFO ] Deduced a trap composed of 97 places in 355 ms of which 1 ms to minimize.
[2022-05-17 21:59:38] [INFO ] Deduced a trap composed of 81 places in 347 ms of which 1 ms to minimize.
[2022-05-17 21:59:38] [INFO ] Deduced a trap composed of 77 places in 350 ms of which 1 ms to minimize.
[2022-05-17 21:59:39] [INFO ] Deduced a trap composed of 111 places in 361 ms of which 0 ms to minimize.
[2022-05-17 21:59:39] [INFO ] Deduced a trap composed of 124 places in 345 ms of which 1 ms to minimize.
[2022-05-17 21:59:39] [INFO ] Deduced a trap composed of 99 places in 338 ms of which 1 ms to minimize.
[2022-05-17 21:59:40] [INFO ] Deduced a trap composed of 42 places in 333 ms of which 1 ms to minimize.
[2022-05-17 21:59:40] [INFO ] Deduced a trap composed of 151 places in 183 ms of which 0 ms to minimize.
[2022-05-17 21:59:41] [INFO ] Deduced a trap composed of 84 places in 329 ms of which 1 ms to minimize.
[2022-05-17 21:59:41] [INFO ] Deduced a trap composed of 11 places in 317 ms of which 0 ms to minimize.
[2022-05-17 21:59:41] [INFO ] Deduced a trap composed of 95 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:59:42] [INFO ] Deduced a trap composed of 57 places in 316 ms of which 1 ms to minimize.
[2022-05-17 21:59:42] [INFO ] Deduced a trap composed of 113 places in 322 ms of which 1 ms to minimize.
[2022-05-17 21:59:42] [INFO ] Deduced a trap composed of 39 places in 383 ms of which 0 ms to minimize.
[2022-05-17 21:59:43] [INFO ] Deduced a trap composed of 28 places in 376 ms of which 1 ms to minimize.
[2022-05-17 21:59:43] [INFO ] Deduced a trap composed of 126 places in 400 ms of which 1 ms to minimize.
[2022-05-17 21:59:44] [INFO ] Deduced a trap composed of 15 places in 375 ms of which 1 ms to minimize.
[2022-05-17 21:59:44] [INFO ] Deduced a trap composed of 33 places in 322 ms of which 1 ms to minimize.
[2022-05-17 21:59:45] [INFO ] Deduced a trap composed of 82 places in 329 ms of which 1 ms to minimize.
[2022-05-17 21:59:45] [INFO ] Deduced a trap composed of 31 places in 341 ms of which 1 ms to minimize.
[2022-05-17 21:59: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 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)
[2022-05-17 21:59:45] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 21:59:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:59:46] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2022-05-17 21:59:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:59:46] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2022-05-17 21:59:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:59:46] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2022-05-17 21:59:46] [INFO ] [Nat]Added 546 Read/Feed constraints in 93 ms returned sat
[2022-05-17 21:59:47] [INFO ] Deduced a trap composed of 29 places in 410 ms of which 1 ms to minimize.
[2022-05-17 21:59:47] [INFO ] Deduced a trap composed of 99 places in 458 ms of which 0 ms to minimize.
[2022-05-17 21:59:48] [INFO ] Deduced a trap composed of 54 places in 425 ms of which 0 ms to minimize.
[2022-05-17 21:59:48] [INFO ] Deduced a trap composed of 37 places in 428 ms of which 1 ms to minimize.
[2022-05-17 21:59:49] [INFO ] Deduced a trap composed of 37 places in 430 ms of which 1 ms to minimize.
[2022-05-17 21:59:49] [INFO ] Deduced a trap composed of 71 places in 429 ms of which 1 ms to minimize.
[2022-05-17 21:59:50] [INFO ] Deduced a trap composed of 126 places in 422 ms of which 1 ms to minimize.
[2022-05-17 21:59:50] [INFO ] Deduced a trap composed of 67 places in 440 ms of which 1 ms to minimize.
[2022-05-17 21:59:51] [INFO ] Deduced a trap composed of 43 places in 410 ms of which 1 ms to minimize.
[2022-05-17 21:59:51] [INFO ] Deduced a trap composed of 35 places in 424 ms of which 1 ms to minimize.
[2022-05-17 21:59:52] [INFO ] Deduced a trap composed of 92 places in 417 ms of which 1 ms to minimize.
[2022-05-17 21:59:52] [INFO ] Deduced a trap composed of 31 places in 430 ms of which 0 ms to minimize.
[2022-05-17 21:59:53] [INFO ] Deduced a trap composed of 79 places in 446 ms of which 1 ms to minimize.
[2022-05-17 21:59:53] [INFO ] Deduced a trap composed of 104 places in 433 ms of which 1 ms to minimize.
[2022-05-17 21:59:54] [INFO ] Deduced a trap composed of 41 places in 422 ms of which 1 ms to minimize.
[2022-05-17 21:59:54] [INFO ] Deduced a trap composed of 44 places in 420 ms of which 1 ms to minimize.
[2022-05-17 21:59:55] [INFO ] Deduced a trap composed of 73 places in 423 ms of which 1 ms to minimize.
[2022-05-17 21:59:55] [INFO ] Deduced a trap composed of 67 places in 426 ms of which 1 ms to minimize.
[2022-05-17 21:59:56] [INFO ] Deduced a trap composed of 67 places in 437 ms of which 1 ms to minimize.
[2022-05-17 21:59:56] [INFO ] Deduced a trap composed of 79 places in 427 ms of which 1 ms to minimize.
[2022-05-17 21:59:57] [INFO ] Deduced a trap composed of 105 places in 429 ms of which 1 ms to minimize.
[2022-05-17 21:59:57] [INFO ] Deduced a trap composed of 138 places in 412 ms of which 1 ms to minimize.
[2022-05-17 21:59:57] [INFO ] Deduced a trap composed of 34 places in 434 ms of which 1 ms to minimize.
[2022-05-17 21:59:58] [INFO ] Deduced a trap composed of 73 places in 417 ms of which 1 ms to minimize.
[2022-05-17 21:59:58] [INFO ] Deduced a trap composed of 34 places in 425 ms of which 1 ms to minimize.
[2022-05-17 21:59:59] [INFO ] Deduced a trap composed of 113 places in 415 ms of which 1 ms to minimize.
[2022-05-17 21:59:59] [INFO ] Deduced a trap composed of 61 places in 447 ms of which 1 ms to minimize.
[2022-05-17 22:00:00] [INFO ] Deduced a trap composed of 32 places in 444 ms of which 1 ms to minimize.
[2022-05-17 22:00:00] [INFO ] Deduced a trap composed of 64 places in 427 ms of which 1 ms to minimize.
[2022-05-17 22:00:01] [INFO ] Deduced a trap composed of 100 places in 432 ms of which 1 ms to minimize.
[2022-05-17 22:00:01] [INFO ] Deduced a trap composed of 28 places in 417 ms of which 1 ms to minimize.
[2022-05-17 22:00:02] [INFO ] Deduced a trap composed of 21 places in 415 ms of which 1 ms to minimize.
[2022-05-17 22:00:02] [INFO ] Deduced a trap composed of 109 places in 437 ms of which 1 ms to minimize.
[2022-05-17 22:00:03] [INFO ] Deduced a trap composed of 29 places in 427 ms of which 1 ms to minimize.
[2022-05-17 22:00:03] [INFO ] Deduced a trap composed of 184 places in 434 ms of which 1 ms to minimize.
[2022-05-17 22:00:04] [INFO ] Deduced a trap composed of 85 places in 415 ms of which 1 ms to minimize.
[2022-05-17 22:00:04] [INFO ] Deduced a trap composed of 71 places in 409 ms of which 1 ms to minimize.
[2022-05-17 22:00:05] [INFO ] Deduced a trap composed of 75 places in 417 ms of which 0 ms to minimize.
[2022-05-17 22:00:05] [INFO ] Deduced a trap composed of 85 places in 419 ms of which 1 ms to minimize.
[2022-05-17 22:00:06] [INFO ] Deduced a trap composed of 37 places in 423 ms of which 1 ms to minimize.
[2022-05-17 22:00:06] [INFO ] Deduced a trap composed of 52 places in 437 ms of which 1 ms to minimize.
[2022-05-17 22:00:07] [INFO ] Deduced a trap composed of 23 places in 430 ms of which 1 ms to minimize.
[2022-05-17 22:00:07] [INFO ] Deduced a trap composed of 64 places in 425 ms of which 0 ms to minimize.
[2022-05-17 22:00:08] [INFO ] Deduced a trap composed of 86 places in 434 ms of which 0 ms to minimize.
[2022-05-17 22:00:08] [INFO ] Deduced a trap composed of 17 places in 428 ms of which 1 ms to minimize.
[2022-05-17 22:00:09] [INFO ] Deduced a trap composed of 87 places in 424 ms of which 1 ms to minimize.
[2022-05-17 22:00:09] [INFO ] Deduced a trap composed of 54 places in 414 ms of which 1 ms to minimize.
[2022-05-17 22:00:10] [INFO ] Deduced a trap composed of 43 places in 425 ms of which 0 ms to minimize.
[2022-05-17 22:00:10] [INFO ] Deduced a trap composed of 51 places in 401 ms of which 1 ms to minimize.
[2022-05-17 22:00:11] [INFO ] Deduced a trap composed of 13 places in 422 ms of which 0 ms to minimize.
[2022-05-17 22:00:11] [INFO ] Deduced a trap composed of 76 places in 429 ms of which 0 ms to minimize.
[2022-05-17 22:00:12] [INFO ] Deduced a trap composed of 61 places in 437 ms of which 1 ms to minimize.
[2022-05-17 22:00:12] [INFO ] Deduced a trap composed of 89 places in 251 ms of which 1 ms to minimize.
[2022-05-17 22:00:13] [INFO ] Deduced a trap composed of 52 places in 433 ms of which 1 ms to minimize.
[2022-05-17 22:00:13] [INFO ] Deduced a trap composed of 43 places in 443 ms of which 1 ms to minimize.
[2022-05-17 22:00:14] [INFO ] Deduced a trap composed of 137 places in 418 ms of which 1 ms to minimize.
[2022-05-17 22:00:14] [INFO ] Deduced a trap composed of 169 places in 406 ms of which 1 ms to minimize.
[2022-05-17 22:00:14] [INFO ] Deduced a trap composed of 89 places in 430 ms of which 1 ms to minimize.
[2022-05-17 22:00:15] [INFO ] Deduced a trap composed of 76 places in 427 ms of which 1 ms to minimize.
[2022-05-17 22:00:15] [INFO ] Deduced a trap composed of 34 places in 397 ms of which 0 ms to minimize.
[2022-05-17 22:00:16] [INFO ] Deduced a trap composed of 113 places in 435 ms of which 1 ms to minimize.
[2022-05-17 22:00:16] [INFO ] Deduced a trap composed of 165 places in 382 ms of which 1 ms to minimize.
[2022-05-17 22:00:17] [INFO ] Deduced a trap composed of 44 places in 419 ms of which 1 ms to minimize.
[2022-05-17 22:00:17] [INFO ] Deduced a trap composed of 23 places in 404 ms of which 0 ms to minimize.
[2022-05-17 22:00:18] [INFO ] Deduced a trap composed of 28 places in 400 ms of which 1 ms to minimize.
[2022-05-17 22:00:18] [INFO ] Deduced a trap composed of 71 places in 393 ms of which 1 ms to minimize.
[2022-05-17 22:00:19] [INFO ] Deduced a trap composed of 53 places in 402 ms of which 1 ms to minimize.
[2022-05-17 22:00:19] [INFO ] Deduced a trap composed of 89 places in 429 ms of which 0 ms to minimize.
[2022-05-17 22:00:20] [INFO ] Deduced a trap composed of 76 places in 414 ms of which 0 ms to minimize.
[2022-05-17 22:00:20] [INFO ] Deduced a trap composed of 80 places in 394 ms of which 1 ms to minimize.
[2022-05-17 22:00:21] [INFO ] Deduced a trap composed of 99 places in 400 ms of which 1 ms to minimize.
[2022-05-17 22:00:21] [INFO ] Deduced a trap composed of 78 places in 355 ms of which 1 ms to minimize.
[2022-05-17 22:00:22] [INFO ] Deduced a trap composed of 143 places in 433 ms of which 1 ms to minimize.
[2022-05-17 22:00:22] [INFO ] Deduced a trap composed of 53 places in 418 ms of which 1 ms to minimize.
[2022-05-17 22:00:23] [INFO ] Deduced a trap composed of 32 places in 444 ms of which 1 ms to minimize.
[2022-05-17 22:00:23] [INFO ] Deduced a trap composed of 40 places in 438 ms of which 0 ms to minimize.
[2022-05-17 22:00:24] [INFO ] Deduced a trap composed of 36 places in 429 ms of which 1 ms to minimize.
[2022-05-17 22:00:24] [INFO ] Deduced a trap composed of 21 places in 426 ms of which 1 ms to minimize.
[2022-05-17 22:00:25] [INFO ] Deduced a trap composed of 81 places in 421 ms of which 1 ms to minimize.
[2022-05-17 22:00:25] [INFO ] Deduced a trap composed of 25 places in 435 ms of which 0 ms to minimize.
[2022-05-17 22:00:26] [INFO ] Deduced a trap composed of 77 places in 410 ms of which 1 ms to minimize.
[2022-05-17 22:00:26] [INFO ] Deduced a trap composed of 93 places in 428 ms of which 1 ms to minimize.
[2022-05-17 22:00:27] [INFO ] Deduced a trap composed of 60 places in 439 ms of which 1 ms to minimize.
[2022-05-17 22:00:27] [INFO ] Deduced a trap composed of 43 places in 426 ms of which 1 ms to minimize.
[2022-05-17 22:00:27] [INFO ] Deduced a trap composed of 77 places in 259 ms of which 0 ms to minimize.
[2022-05-17 22:00:28] [INFO ] Deduced a trap composed of 123 places in 212 ms of which 0 ms to minimize.
[2022-05-17 22:00:28] [INFO ] Deduced a trap composed of 95 places in 212 ms of which 1 ms to minimize.
[2022-05-17 22:00:28] [INFO ] Deduced a trap composed of 93 places in 225 ms of which 0 ms to minimize.
[2022-05-17 22:00:28] [INFO ] Deduced a trap composed of 88 places in 219 ms of which 0 ms to minimize.
[2022-05-17 22:00:29] [INFO ] Deduced a trap composed of 24 places in 424 ms of which 0 ms to minimize.
[2022-05-17 22:00:29] [INFO ] Deduced a trap composed of 20 places in 422 ms of which 1 ms to minimize.
[2022-05-17 22:00:30] [INFO ] Deduced a trap composed of 13 places in 405 ms of which 1 ms to minimize.
[2022-05-17 22:00:30] [INFO ] Deduced a trap composed of 126 places in 204 ms of which 0 ms to minimize.
[2022-05-17 22:00:31] [INFO ] Deduced a trap composed of 121 places in 301 ms of which 1 ms to minimize.
[2022-05-17 22:00:31] [INFO ] Deduced a trap composed of 2 places in 483 ms of which 1 ms to minimize.
[2022-05-17 22:00:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
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) : [8, 8, 8, 8, 8] Max seen :[7, 7, 1, 1, 7]
Support contains 456 out of 1096 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 28 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1096/1096 places, 2208/2208 transitions.
Starting structural reductions, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 28 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2022-05-17 22:00:31] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 22:00:31] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-17 22:00:32] [INFO ] Implicit Places using invariants in 366 ms returned []
[2022-05-17 22:00:32] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 22:00:32] [INFO ] Computed 23 place invariants in 21 ms
[2022-05-17 22:00:32] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:00:39] [INFO ] Implicit Places using invariants and state equation in 7202 ms returned []
Implicit Place search using SMT with State Equation took 7571 ms to find 0 implicit places.
[2022-05-17 22:00:39] [INFO ] Redundant transitions in 55 ms returned []
[2022-05-17 22:00:39] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 22:00:39] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-17 22:00:40] [INFO ] Dead Transitions using invariants and state equation in 760 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1096/1096 places, 2208/2208 transitions.
Starting property specific reduction for Peterson-COL-7-UpperBounds-01
Normalized transition count is 1872 out of 2208 initially.
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 22:00:40] [INFO ] Computed 23 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :3
[2022-05-17 22:00:40] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 22:00:40] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-17 22:00:40] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 22:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:00:40] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2022-05-17 22:00:40] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:00:40] [INFO ] [Real]Added 546 Read/Feed constraints in 83 ms returned sat
[2022-05-17 22:00:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:00:41] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 22:00:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:00:41] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2022-05-17 22:00:41] [INFO ] [Nat]Added 546 Read/Feed constraints in 90 ms returned sat
[2022-05-17 22:00:42] [INFO ] Deduced a trap composed of 63 places in 383 ms of which 1 ms to minimize.
[2022-05-17 22:00:42] [INFO ] Deduced a trap composed of 67 places in 376 ms of which 0 ms to minimize.
[2022-05-17 22:00:42] [INFO ] Deduced a trap composed of 51 places in 409 ms of which 1 ms to minimize.
[2022-05-17 22:00:43] [INFO ] Deduced a trap composed of 65 places in 395 ms of which 1 ms to minimize.
[2022-05-17 22:00:43] [INFO ] Deduced a trap composed of 79 places in 402 ms of which 1 ms to minimize.
[2022-05-17 22:00:44] [INFO ] Deduced a trap composed of 65 places in 390 ms of which 1 ms to minimize.
[2022-05-17 22:00:44] [INFO ] Deduced a trap composed of 50 places in 376 ms of which 1 ms to minimize.
[2022-05-17 22:00:45] [INFO ] Deduced a trap composed of 57 places in 379 ms of which 1 ms to minimize.
[2022-05-17 22:00:45] [INFO ] Deduced a trap composed of 49 places in 400 ms of which 0 ms to minimize.
[2022-05-17 22:00:46] [INFO ] Deduced a trap composed of 95 places in 382 ms of which 1 ms to minimize.
[2022-05-17 22:00:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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) : [448] Max seen :[4]
Support contains 448 out of 1096 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 1096 transition count 2200
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1088 transition count 2200
Applied a total of 16 rules in 42 ms. Remains 1088 /1096 variables (removed 8) and now considering 2200/2208 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1096 places, 2200/2208 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:00:46] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9055 ms. (steps per millisecond=110 ) properties (out of 1) seen :7
Interrupted Best-First random walk after 673895 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=134 ) properties seen :{0=1}
[2022-05-17 22:01:00] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:01:00] [INFO ] Computed 23 place invariants in 14 ms
[2022-05-17 22:01:00] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 22:01:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:01:00] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2022-05-17 22:01:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:01:00] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2022-05-17 22:01:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:01:01] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2022-05-17 22:01:01] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:01:01] [INFO ] [Nat]Added 546 Read/Feed constraints in 131 ms returned sat
[2022-05-17 22:01:01] [INFO ] Deduced a trap composed of 102 places in 414 ms of which 1 ms to minimize.
[2022-05-17 22:01:02] [INFO ] Deduced a trap composed of 41 places in 472 ms of which 0 ms to minimize.
[2022-05-17 22:01:02] [INFO ] Deduced a trap composed of 66 places in 418 ms of which 0 ms to minimize.
[2022-05-17 22:01:03] [INFO ] Deduced a trap composed of 123 places in 427 ms of which 1 ms to minimize.
[2022-05-17 22:01:03] [INFO ] Deduced a trap composed of 66 places in 415 ms of which 1 ms to minimize.
[2022-05-17 22:01:04] [INFO ] Deduced a trap composed of 103 places in 427 ms of which 1 ms to minimize.
[2022-05-17 22:01:04] [INFO ] Deduced a trap composed of 49 places in 417 ms of which 1 ms to minimize.
[2022-05-17 22:01:05] [INFO ] Deduced a trap composed of 13 places in 452 ms of which 1 ms to minimize.
[2022-05-17 22:01:05] [INFO ] Deduced a trap composed of 111 places in 414 ms of which 1 ms to minimize.
[2022-05-17 22:01:06] [INFO ] Deduced a trap composed of 45 places in 393 ms of which 0 ms to minimize.
[2022-05-17 22:01:06] [INFO ] Deduced a trap composed of 39 places in 420 ms of which 1 ms to minimize.
[2022-05-17 22:01:07] [INFO ] Deduced a trap composed of 55 places in 420 ms of which 1 ms to minimize.
[2022-05-17 22:01:07] [INFO ] Deduced a trap composed of 96 places in 418 ms of which 1 ms to minimize.
[2022-05-17 22:01:08] [INFO ] Deduced a trap composed of 37 places in 433 ms of which 1 ms to minimize.
[2022-05-17 22:01:08] [INFO ] Deduced a trap composed of 21 places in 398 ms of which 1 ms to minimize.
[2022-05-17 22:01:09] [INFO ] Deduced a trap composed of 104 places in 439 ms of which 0 ms to minimize.
[2022-05-17 22:01:09] [INFO ] Deduced a trap composed of 134 places in 413 ms of which 1 ms to minimize.
[2022-05-17 22:01:10] [INFO ] Deduced a trap composed of 49 places in 413 ms of which 1 ms to minimize.
[2022-05-17 22:01:10] [INFO ] Deduced a trap composed of 21 places in 419 ms of which 1 ms to minimize.
[2022-05-17 22:01:11] [INFO ] Deduced a trap composed of 40 places in 424 ms of which 0 ms to minimize.
[2022-05-17 22:01:11] [INFO ] Deduced a trap composed of 52 places in 416 ms of which 1 ms to minimize.
[2022-05-17 22:01:12] [INFO ] Deduced a trap composed of 43 places in 428 ms of which 1 ms to minimize.
[2022-05-17 22:01:12] [INFO ] Deduced a trap composed of 71 places in 384 ms of which 1 ms to minimize.
[2022-05-17 22:01:13] [INFO ] Deduced a trap composed of 75 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:01:13] [INFO ] Deduced a trap composed of 107 places in 385 ms of which 1 ms to minimize.
[2022-05-17 22:01:13] [INFO ] Deduced a trap composed of 105 places in 394 ms of which 0 ms to minimize.
[2022-05-17 22:01:14] [INFO ] Deduced a trap composed of 90 places in 375 ms of which 1 ms to minimize.
[2022-05-17 22:01:14] [INFO ] Deduced a trap composed of 82 places in 390 ms of which 1 ms to minimize.
[2022-05-17 22:01:15] [INFO ] Deduced a trap composed of 120 places in 394 ms of which 1 ms to minimize.
[2022-05-17 22:01:15] [INFO ] Deduced a trap composed of 161 places in 402 ms of which 1 ms to minimize.
[2022-05-17 22:01:16] [INFO ] Deduced a trap composed of 121 places in 399 ms of which 1 ms to minimize.
[2022-05-17 22:01:16] [INFO ] Deduced a trap composed of 73 places in 390 ms of which 1 ms to minimize.
[2022-05-17 22:01:17] [INFO ] Deduced a trap composed of 114 places in 393 ms of which 1 ms to minimize.
[2022-05-17 22:01:17] [INFO ] Deduced a trap composed of 81 places in 372 ms of which 1 ms to minimize.
[2022-05-17 22:01:17] [INFO ] Deduced a trap composed of 86 places in 381 ms of which 1 ms to minimize.
[2022-05-17 22:01:18] [INFO ] Deduced a trap composed of 95 places in 385 ms of which 1 ms to minimize.
[2022-05-17 22:01:18] [INFO ] Deduced a trap composed of 98 places in 372 ms of which 0 ms to minimize.
[2022-05-17 22:01:19] [INFO ] Deduced a trap composed of 133 places in 390 ms of which 1 ms to minimize.
[2022-05-17 22:01:19] [INFO ] Deduced a trap composed of 177 places in 378 ms of which 1 ms to minimize.
[2022-05-17 22:01:20] [INFO ] Deduced a trap composed of 142 places in 375 ms of which 1 ms to minimize.
[2022-05-17 22:01:20] [INFO ] Deduced a trap composed of 134 places in 374 ms of which 1 ms to minimize.
[2022-05-17 22:01:21] [INFO ] Deduced a trap composed of 117 places in 404 ms of which 1 ms to minimize.
[2022-05-17 22:01:21] [INFO ] Deduced a trap composed of 115 places in 391 ms of which 1 ms to minimize.
[2022-05-17 22:01:22] [INFO ] Deduced a trap composed of 95 places in 384 ms of which 1 ms to minimize.
[2022-05-17 22:01:22] [INFO ] Deduced a trap composed of 89 places in 399 ms of which 1 ms to minimize.
[2022-05-17 22:01:22] [INFO ] Deduced a trap composed of 129 places in 388 ms of which 0 ms to minimize.
[2022-05-17 22:01:23] [INFO ] Deduced a trap composed of 71 places in 388 ms of which 1 ms to minimize.
[2022-05-17 22:01:23] [INFO ] Deduced a trap composed of 65 places in 442 ms of which 1 ms to minimize.
[2022-05-17 22:01:24] [INFO ] Deduced a trap composed of 92 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:01:24] [INFO ] Deduced a trap composed of 63 places in 407 ms of which 1 ms to minimize.
[2022-05-17 22:01:25] [INFO ] Deduced a trap composed of 114 places in 414 ms of which 1 ms to minimize.
[2022-05-17 22:01:25] [INFO ] Deduced a trap composed of 63 places in 409 ms of which 1 ms to minimize.
[2022-05-17 22:01:26] [INFO ] Deduced a trap composed of 66 places in 389 ms of which 1 ms to minimize.
[2022-05-17 22:01:26] [INFO ] Deduced a trap composed of 78 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:01:27] [INFO ] Deduced a trap composed of 24 places in 380 ms of which 1 ms to minimize.
[2022-05-17 22:01:27] [INFO ] Deduced a trap composed of 21 places in 415 ms of which 1 ms to minimize.
[2022-05-17 22:01:28] [INFO ] Deduced a trap composed of 28 places in 401 ms of which 1 ms to minimize.
[2022-05-17 22:01:28] [INFO ] Deduced a trap composed of 28 places in 380 ms of which 0 ms to minimize.
[2022-05-17 22:01:28] [INFO ] Deduced a trap composed of 13 places in 386 ms of which 1 ms to minimize.
[2022-05-17 22:01:29] [INFO ] Deduced a trap composed of 13 places in 407 ms of which 1 ms to minimize.
[2022-05-17 22:01:29] [INFO ] Deduced a trap composed of 141 places in 404 ms of which 1 ms to minimize.
[2022-05-17 22:01:30] [INFO ] Deduced a trap composed of 59 places in 439 ms of which 1 ms to minimize.
[2022-05-17 22:01:30] [INFO ] Deduced a trap composed of 62 places in 390 ms of which 1 ms to minimize.
[2022-05-17 22:01:31] [INFO ] Deduced a trap composed of 80 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:01:31] [INFO ] Deduced a trap composed of 71 places in 403 ms of which 0 ms to minimize.
[2022-05-17 22:01:32] [INFO ] Deduced a trap composed of 70 places in 398 ms of which 0 ms to minimize.
[2022-05-17 22:01:32] [INFO ] Deduced a trap composed of 57 places in 398 ms of which 1 ms to minimize.
[2022-05-17 22:01:33] [INFO ] Deduced a trap composed of 172 places in 418 ms of which 1 ms to minimize.
[2022-05-17 22:01:33] [INFO ] Deduced a trap composed of 40 places in 386 ms of which 0 ms to minimize.
[2022-05-17 22:01:34] [INFO ] Deduced a trap composed of 38 places in 387 ms of which 1 ms to minimize.
[2022-05-17 22:01:34] [INFO ] Deduced a trap composed of 100 places in 370 ms of which 0 ms to minimize.
[2022-05-17 22:01:34] [INFO ] Deduced a trap composed of 106 places in 369 ms of which 1 ms to minimize.
[2022-05-17 22:01:35] [INFO ] Deduced a trap composed of 91 places in 380 ms of which 1 ms to minimize.
[2022-05-17 22:01:35] [INFO ] Deduced a trap composed of 90 places in 382 ms of which 1 ms to minimize.
[2022-05-17 22:01:36] [INFO ] Deduced a trap composed of 91 places in 372 ms of which 1 ms to minimize.
[2022-05-17 22:01:36] [INFO ] Deduced a trap composed of 92 places in 381 ms of which 1 ms to minimize.
[2022-05-17 22:01:37] [INFO ] Deduced a trap composed of 39 places in 382 ms of which 0 ms to minimize.
[2022-05-17 22:01:37] [INFO ] Deduced a trap composed of 123 places in 355 ms of which 1 ms to minimize.
[2022-05-17 22:01:38] [INFO ] Deduced a trap composed of 33 places in 351 ms of which 1 ms to minimize.
[2022-05-17 22:01:38] [INFO ] Deduced a trap composed of 153 places in 379 ms of which 1 ms to minimize.
[2022-05-17 22:01:38] [INFO ] Deduced a trap composed of 190 places in 374 ms of which 1 ms to minimize.
[2022-05-17 22:01:39] [INFO ] Deduced a trap composed of 53 places in 386 ms of which 1 ms to minimize.
[2022-05-17 22:01:39] [INFO ] Deduced a trap composed of 90 places in 371 ms of which 1 ms to minimize.
[2022-05-17 22:01:40] [INFO ] Deduced a trap composed of 94 places in 371 ms of which 1 ms to minimize.
[2022-05-17 22:01:40] [INFO ] Deduced a trap composed of 113 places in 363 ms of which 0 ms to minimize.
[2022-05-17 22:01:41] [INFO ] Deduced a trap composed of 134 places in 401 ms of which 1 ms to minimize.
[2022-05-17 22:01:41] [INFO ] Deduced a trap composed of 95 places in 340 ms of which 1 ms to minimize.
[2022-05-17 22:01:41] [INFO ] Deduced a trap composed of 73 places in 373 ms of which 1 ms to minimize.
[2022-05-17 22:01:42] [INFO ] Deduced a trap composed of 120 places in 372 ms of which 1 ms to minimize.
[2022-05-17 22:01:42] [INFO ] Deduced a trap composed of 75 places in 372 ms of which 1 ms to minimize.
[2022-05-17 22:01:43] [INFO ] Deduced a trap composed of 62 places in 376 ms of which 1 ms to minimize.
[2022-05-17 22:01:43] [INFO ] Deduced a trap composed of 91 places in 386 ms of which 1 ms to minimize.
[2022-05-17 22:01:44] [INFO ] Deduced a trap composed of 161 places in 301 ms of which 0 ms to minimize.
[2022-05-17 22:01:44] [INFO ] Deduced a trap composed of 134 places in 305 ms of which 0 ms to minimize.
[2022-05-17 22:01:44] [INFO ] Deduced a trap composed of 132 places in 305 ms of which 0 ms to minimize.
[2022-05-17 22:01:45] [INFO ] Deduced a trap composed of 95 places in 258 ms of which 0 ms to minimize.
[2022-05-17 22:01:45] [INFO ] Deduced a trap composed of 25 places in 401 ms of which 1 ms to minimize.
[2022-05-17 22:01:46] [INFO ] Deduced a trap composed of 126 places in 368 ms of which 1 ms to minimize.
[2022-05-17 22:01:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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) : [448] Max seen :[7]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 45 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 39 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2022-05-17 22:01:46] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:01:46] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 22:01:46] [INFO ] Implicit Places using invariants in 363 ms returned []
[2022-05-17 22:01:46] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:01:46] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 22:01:47] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:01:53] [INFO ] Implicit Places using invariants and state equation in 7104 ms returned []
Implicit Place search using SMT with State Equation took 7469 ms to find 0 implicit places.
[2022-05-17 22:01:53] [INFO ] Redundant transitions in 42 ms returned []
[2022-05-17 22:01:53] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:01:53] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 22:01:54] [INFO ] Dead Transitions using invariants and state equation in 752 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:01:54] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9116 ms. (steps per millisecond=109 ) properties (out of 1) seen :7
Interrupted Best-First random walk after 661915 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=132 ) properties seen :{0=1}
[2022-05-17 22:02:08] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:02:08] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-17 22:02:08] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 22:02:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:02:09] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2022-05-17 22:02:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:02:09] [INFO ] [Nat]Absence check using 23 positive place invariants in 16 ms returned sat
[2022-05-17 22:02:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:02:09] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2022-05-17 22:02:09] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:02:09] [INFO ] [Nat]Added 546 Read/Feed constraints in 140 ms returned sat
[2022-05-17 22:02:10] [INFO ] Deduced a trap composed of 102 places in 421 ms of which 1 ms to minimize.
[2022-05-17 22:02:10] [INFO ] Deduced a trap composed of 41 places in 412 ms of which 0 ms to minimize.
[2022-05-17 22:02:11] [INFO ] Deduced a trap composed of 66 places in 415 ms of which 1 ms to minimize.
[2022-05-17 22:02:11] [INFO ] Deduced a trap composed of 123 places in 410 ms of which 1 ms to minimize.
[2022-05-17 22:02:12] [INFO ] Deduced a trap composed of 66 places in 413 ms of which 0 ms to minimize.
[2022-05-17 22:02:12] [INFO ] Deduced a trap composed of 103 places in 433 ms of which 1 ms to minimize.
[2022-05-17 22:02:13] [INFO ] Deduced a trap composed of 49 places in 419 ms of which 1 ms to minimize.
[2022-05-17 22:02:13] [INFO ] Deduced a trap composed of 13 places in 433 ms of which 0 ms to minimize.
[2022-05-17 22:02:14] [INFO ] Deduced a trap composed of 111 places in 418 ms of which 1 ms to minimize.
[2022-05-17 22:02:14] [INFO ] Deduced a trap composed of 45 places in 412 ms of which 1 ms to minimize.
[2022-05-17 22:02:15] [INFO ] Deduced a trap composed of 39 places in 415 ms of which 1 ms to minimize.
[2022-05-17 22:02:15] [INFO ] Deduced a trap composed of 55 places in 416 ms of which 1 ms to minimize.
[2022-05-17 22:02:16] [INFO ] Deduced a trap composed of 96 places in 418 ms of which 1 ms to minimize.
[2022-05-17 22:02:16] [INFO ] Deduced a trap composed of 37 places in 434 ms of which 1 ms to minimize.
[2022-05-17 22:02:17] [INFO ] Deduced a trap composed of 21 places in 416 ms of which 1 ms to minimize.
[2022-05-17 22:02:17] [INFO ] Deduced a trap composed of 104 places in 415 ms of which 1 ms to minimize.
[2022-05-17 22:02:18] [INFO ] Deduced a trap composed of 134 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:02:18] [INFO ] Deduced a trap composed of 49 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:02:18] [INFO ] Deduced a trap composed of 21 places in 399 ms of which 1 ms to minimize.
[2022-05-17 22:02:19] [INFO ] Deduced a trap composed of 40 places in 409 ms of which 1 ms to minimize.
[2022-05-17 22:02:19] [INFO ] Deduced a trap composed of 52 places in 410 ms of which 1 ms to minimize.
[2022-05-17 22:02:20] [INFO ] Deduced a trap composed of 43 places in 428 ms of which 1 ms to minimize.
[2022-05-17 22:02:20] [INFO ] Deduced a trap composed of 71 places in 404 ms of which 1 ms to minimize.
[2022-05-17 22:02:21] [INFO ] Deduced a trap composed of 75 places in 404 ms of which 1 ms to minimize.
[2022-05-17 22:02:21] [INFO ] Deduced a trap composed of 107 places in 402 ms of which 0 ms to minimize.
[2022-05-17 22:02:22] [INFO ] Deduced a trap composed of 105 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:02:22] [INFO ] Deduced a trap composed of 90 places in 370 ms of which 1 ms to minimize.
[2022-05-17 22:02:23] [INFO ] Deduced a trap composed of 82 places in 402 ms of which 1 ms to minimize.
[2022-05-17 22:02:23] [INFO ] Deduced a trap composed of 120 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:02:24] [INFO ] Deduced a trap composed of 161 places in 402 ms of which 1 ms to minimize.
[2022-05-17 22:02:24] [INFO ] Deduced a trap composed of 121 places in 400 ms of which 1 ms to minimize.
[2022-05-17 22:02:25] [INFO ] Deduced a trap composed of 73 places in 401 ms of which 1 ms to minimize.
[2022-05-17 22:02:25] [INFO ] Deduced a trap composed of 114 places in 380 ms of which 0 ms to minimize.
[2022-05-17 22:02:25] [INFO ] Deduced a trap composed of 81 places in 391 ms of which 1 ms to minimize.
[2022-05-17 22:02:26] [INFO ] Deduced a trap composed of 86 places in 379 ms of which 1 ms to minimize.
[2022-05-17 22:02:26] [INFO ] Deduced a trap composed of 95 places in 399 ms of which 1 ms to minimize.
[2022-05-17 22:02:27] [INFO ] Deduced a trap composed of 98 places in 404 ms of which 0 ms to minimize.
[2022-05-17 22:02:27] [INFO ] Deduced a trap composed of 133 places in 400 ms of which 1 ms to minimize.
[2022-05-17 22:02:28] [INFO ] Deduced a trap composed of 177 places in 390 ms of which 0 ms to minimize.
[2022-05-17 22:02:28] [INFO ] Deduced a trap composed of 142 places in 389 ms of which 0 ms to minimize.
[2022-05-17 22:02:29] [INFO ] Deduced a trap composed of 134 places in 398 ms of which 1 ms to minimize.
[2022-05-17 22:02:29] [INFO ] Deduced a trap composed of 117 places in 391 ms of which 1 ms to minimize.
[2022-05-17 22:02:30] [INFO ] Deduced a trap composed of 115 places in 380 ms of which 0 ms to minimize.
[2022-05-17 22:02:30] [INFO ] Deduced a trap composed of 95 places in 400 ms of which 1 ms to minimize.
[2022-05-17 22:02:31] [INFO ] Deduced a trap composed of 89 places in 399 ms of which 1 ms to minimize.
[2022-05-17 22:02:31] [INFO ] Deduced a trap composed of 129 places in 404 ms of which 1 ms to minimize.
[2022-05-17 22:02:31] [INFO ] Deduced a trap composed of 71 places in 385 ms of which 1 ms to minimize.
[2022-05-17 22:02:32] [INFO ] Deduced a trap composed of 65 places in 407 ms of which 1 ms to minimize.
[2022-05-17 22:02:32] [INFO ] Deduced a trap composed of 92 places in 401 ms of which 1 ms to minimize.
[2022-05-17 22:02:33] [INFO ] Deduced a trap composed of 63 places in 408 ms of which 1 ms to minimize.
[2022-05-17 22:02:33] [INFO ] Deduced a trap composed of 114 places in 401 ms of which 0 ms to minimize.
[2022-05-17 22:02:34] [INFO ] Deduced a trap composed of 63 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:02:34] [INFO ] Deduced a trap composed of 66 places in 377 ms of which 0 ms to minimize.
[2022-05-17 22:02:35] [INFO ] Deduced a trap composed of 78 places in 395 ms of which 1 ms to minimize.
[2022-05-17 22:02:35] [INFO ] Deduced a trap composed of 24 places in 384 ms of which 1 ms to minimize.
[2022-05-17 22:02:36] [INFO ] Deduced a trap composed of 21 places in 382 ms of which 1 ms to minimize.
[2022-05-17 22:02:36] [INFO ] Deduced a trap composed of 28 places in 384 ms of which 0 ms to minimize.
[2022-05-17 22:02:36] [INFO ] Deduced a trap composed of 28 places in 381 ms of which 1 ms to minimize.
[2022-05-17 22:02:37] [INFO ] Deduced a trap composed of 13 places in 375 ms of which 1 ms to minimize.
[2022-05-17 22:02:37] [INFO ] Deduced a trap composed of 13 places in 379 ms of which 1 ms to minimize.
[2022-05-17 22:02:38] [INFO ] Deduced a trap composed of 141 places in 399 ms of which 1 ms to minimize.
[2022-05-17 22:02:38] [INFO ] Deduced a trap composed of 59 places in 391 ms of which 1 ms to minimize.
[2022-05-17 22:02:39] [INFO ] Deduced a trap composed of 62 places in 380 ms of which 1 ms to minimize.
[2022-05-17 22:02:39] [INFO ] Deduced a trap composed of 80 places in 378 ms of which 1 ms to minimize.
[2022-05-17 22:02:40] [INFO ] Deduced a trap composed of 71 places in 366 ms of which 1 ms to minimize.
[2022-05-17 22:02:40] [INFO ] Deduced a trap composed of 70 places in 389 ms of which 0 ms to minimize.
[2022-05-17 22:02:40] [INFO ] Deduced a trap composed of 57 places in 399 ms of which 1 ms to minimize.
[2022-05-17 22:02:41] [INFO ] Deduced a trap composed of 172 places in 388 ms of which 0 ms to minimize.
[2022-05-17 22:02:41] [INFO ] Deduced a trap composed of 40 places in 374 ms of which 1 ms to minimize.
[2022-05-17 22:02:42] [INFO ] Deduced a trap composed of 38 places in 376 ms of which 1 ms to minimize.
[2022-05-17 22:02:42] [INFO ] Deduced a trap composed of 100 places in 373 ms of which 1 ms to minimize.
[2022-05-17 22:02:43] [INFO ] Deduced a trap composed of 106 places in 380 ms of which 0 ms to minimize.
[2022-05-17 22:02:43] [INFO ] Deduced a trap composed of 91 places in 383 ms of which 1 ms to minimize.
[2022-05-17 22:02:44] [INFO ] Deduced a trap composed of 90 places in 387 ms of which 0 ms to minimize.
[2022-05-17 22:02:44] [INFO ] Deduced a trap composed of 91 places in 381 ms of which 1 ms to minimize.
[2022-05-17 22:02:44] [INFO ] Deduced a trap composed of 92 places in 373 ms of which 1 ms to minimize.
[2022-05-17 22:02:45] [INFO ] Deduced a trap composed of 39 places in 381 ms of which 1 ms to minimize.
[2022-05-17 22:02:45] [INFO ] Deduced a trap composed of 123 places in 354 ms of which 1 ms to minimize.
[2022-05-17 22:02:46] [INFO ] Deduced a trap composed of 33 places in 365 ms of which 1 ms to minimize.
[2022-05-17 22:02:46] [INFO ] Deduced a trap composed of 153 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:02:47] [INFO ] Deduced a trap composed of 190 places in 394 ms of which 1 ms to minimize.
[2022-05-17 22:02:47] [INFO ] Deduced a trap composed of 53 places in 394 ms of which 0 ms to minimize.
[2022-05-17 22:02:48] [INFO ] Deduced a trap composed of 90 places in 385 ms of which 1 ms to minimize.
[2022-05-17 22:02:48] [INFO ] Deduced a trap composed of 94 places in 395 ms of which 1 ms to minimize.
[2022-05-17 22:02:49] [INFO ] Deduced a trap composed of 113 places in 387 ms of which 1 ms to minimize.
[2022-05-17 22:02:49] [INFO ] Deduced a trap composed of 134 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:02:49] [INFO ] Deduced a trap composed of 95 places in 357 ms of which 1 ms to minimize.
[2022-05-17 22:02:50] [INFO ] Deduced a trap composed of 73 places in 387 ms of which 1 ms to minimize.
[2022-05-17 22:02:50] [INFO ] Deduced a trap composed of 120 places in 377 ms of which 0 ms to minimize.
[2022-05-17 22:02:51] [INFO ] Deduced a trap composed of 75 places in 406 ms of which 1 ms to minimize.
[2022-05-17 22:02:51] [INFO ] Deduced a trap composed of 62 places in 406 ms of which 1 ms to minimize.
[2022-05-17 22:02:52] [INFO ] Deduced a trap composed of 91 places in 380 ms of which 1 ms to minimize.
[2022-05-17 22:02:52] [INFO ] Deduced a trap composed of 161 places in 327 ms of which 1 ms to minimize.
[2022-05-17 22:02:52] [INFO ] Deduced a trap composed of 134 places in 326 ms of which 1 ms to minimize.
[2022-05-17 22:02:53] [INFO ] Deduced a trap composed of 132 places in 303 ms of which 1 ms to minimize.
[2022-05-17 22:02:53] [INFO ] Deduced a trap composed of 95 places in 259 ms of which 1 ms to minimize.
[2022-05-17 22:02:54] [INFO ] Deduced a trap composed of 25 places in 398 ms of which 1 ms to minimize.
[2022-05-17 22:02:54] [INFO ] Deduced a trap composed of 126 places in 371 ms of which 1 ms to minimize.
[2022-05-17 22:02: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) : [448] Max seen :[7]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 37 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 40 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2022-05-17 22:02:54] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:02:54] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-17 22:02:55] [INFO ] Implicit Places using invariants in 374 ms returned []
[2022-05-17 22:02:55] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:02:55] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 22:02:55] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:03:02] [INFO ] Implicit Places using invariants and state equation in 7191 ms returned []
Implicit Place search using SMT with State Equation took 7566 ms to find 0 implicit places.
[2022-05-17 22:03:02] [INFO ] Redundant transitions in 289 ms returned []
[2022-05-17 22:03:02] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:03:02] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-17 22:03:03] [INFO ] Dead Transitions using invariants and state equation in 726 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Ending property specific reduction for Peterson-COL-7-UpperBounds-01 in 143203 ms.
Starting property specific reduction for Peterson-COL-7-UpperBounds-03
Normalized transition count is 1872 out of 2208 initially.
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 22:03:03] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :2
[2022-05-17 22:03:03] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 22:03:03] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-17 22:03:03] [INFO ] [Real]Absence check using 23 positive place invariants in 16 ms returned sat
[2022-05-17 22:03:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:03:03] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2022-05-17 22:03:04] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:03:04] [INFO ] [Real]Added 546 Read/Feed constraints in 82 ms returned sat
[2022-05-17 22:03:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:03:04] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 22:03:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:03:04] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2022-05-17 22:03:04] [INFO ] [Nat]Added 546 Read/Feed constraints in 99 ms returned sat
[2022-05-17 22:03:05] [INFO ] Deduced a trap composed of 29 places in 417 ms of which 0 ms to minimize.
[2022-05-17 22:03:05] [INFO ] Deduced a trap composed of 71 places in 420 ms of which 1 ms to minimize.
[2022-05-17 22:03:06] [INFO ] Deduced a trap composed of 101 places in 401 ms of which 1 ms to minimize.
[2022-05-17 22:03:06] [INFO ] Deduced a trap composed of 148 places in 407 ms of which 1 ms to minimize.
[2022-05-17 22:03:07] [INFO ] Deduced a trap composed of 89 places in 405 ms of which 0 ms to minimize.
[2022-05-17 22:03:07] [INFO ] Deduced a trap composed of 107 places in 410 ms of which 1 ms to minimize.
[2022-05-17 22:03:08] [INFO ] Deduced a trap composed of 91 places in 392 ms of which 1 ms to minimize.
[2022-05-17 22:03:08] [INFO ] Deduced a trap composed of 33 places in 427 ms of which 1 ms to minimize.
[2022-05-17 22:03:09] [INFO ] Deduced a trap composed of 117 places in 398 ms of which 1 ms to minimize.
[2022-05-17 22:03:09] [INFO ] Deduced a trap composed of 117 places in 399 ms of which 1 ms to minimize.
[2022-05-17 22:03:09] [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) : [448] Max seen :[5]
Support contains 448 out of 1096 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 1096 transition count 2200
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1088 transition count 2200
Applied a total of 16 rules in 45 ms. Remains 1088 /1096 variables (removed 8) and now considering 2200/2208 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1096 places, 2200/2208 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:03:09] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9193 ms. (steps per millisecond=108 ) properties (out of 1) seen :7
Interrupted Best-First random walk after 659530 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=131 ) properties seen :{0=3}
[2022-05-17 22:03:23] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:03:23] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-17 22:03:23] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 22:03:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:03:24] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2022-05-17 22:03:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:03:24] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 22:03:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:03:24] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2022-05-17 22:03:24] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:03:24] [INFO ] [Nat]Added 546 Read/Feed constraints in 127 ms returned sat
[2022-05-17 22:03:25] [INFO ] Deduced a trap composed of 102 places in 418 ms of which 0 ms to minimize.
[2022-05-17 22:03:25] [INFO ] Deduced a trap composed of 41 places in 407 ms of which 1 ms to minimize.
[2022-05-17 22:03:26] [INFO ] Deduced a trap composed of 66 places in 402 ms of which 1 ms to minimize.
[2022-05-17 22:03:26] [INFO ] Deduced a trap composed of 123 places in 417 ms of which 1 ms to minimize.
[2022-05-17 22:03:27] [INFO ] Deduced a trap composed of 66 places in 414 ms of which 1 ms to minimize.
[2022-05-17 22:03:27] [INFO ] Deduced a trap composed of 103 places in 412 ms of which 1 ms to minimize.
[2022-05-17 22:03:28] [INFO ] Deduced a trap composed of 49 places in 411 ms of which 1 ms to minimize.
[2022-05-17 22:03:28] [INFO ] Deduced a trap composed of 13 places in 410 ms of which 1 ms to minimize.
[2022-05-17 22:03:29] [INFO ] Deduced a trap composed of 111 places in 399 ms of which 1 ms to minimize.
[2022-05-17 22:03:29] [INFO ] Deduced a trap composed of 45 places in 402 ms of which 1 ms to minimize.
[2022-05-17 22:03:30] [INFO ] Deduced a trap composed of 39 places in 404 ms of which 1 ms to minimize.
[2022-05-17 22:03:30] [INFO ] Deduced a trap composed of 55 places in 399 ms of which 1 ms to minimize.
[2022-05-17 22:03:31] [INFO ] Deduced a trap composed of 96 places in 405 ms of which 1 ms to minimize.
[2022-05-17 22:03:31] [INFO ] Deduced a trap composed of 37 places in 406 ms of which 1 ms to minimize.
[2022-05-17 22:03:32] [INFO ] Deduced a trap composed of 21 places in 401 ms of which 0 ms to minimize.
[2022-05-17 22:03:32] [INFO ] Deduced a trap composed of 104 places in 428 ms of which 1 ms to minimize.
[2022-05-17 22:03:32] [INFO ] Deduced a trap composed of 134 places in 412 ms of which 1 ms to minimize.
[2022-05-17 22:03:33] [INFO ] Deduced a trap composed of 49 places in 415 ms of which 1 ms to minimize.
[2022-05-17 22:03:33] [INFO ] Deduced a trap composed of 21 places in 411 ms of which 1 ms to minimize.
[2022-05-17 22:03:34] [INFO ] Deduced a trap composed of 40 places in 404 ms of which 1 ms to minimize.
[2022-05-17 22:03:34] [INFO ] Deduced a trap composed of 52 places in 410 ms of which 1 ms to minimize.
[2022-05-17 22:03:35] [INFO ] Deduced a trap composed of 43 places in 415 ms of which 1 ms to minimize.
[2022-05-17 22:03:35] [INFO ] Deduced a trap composed of 71 places in 375 ms of which 1 ms to minimize.
[2022-05-17 22:03:36] [INFO ] Deduced a trap composed of 75 places in 380 ms of which 1 ms to minimize.
[2022-05-17 22:03:36] [INFO ] Deduced a trap composed of 107 places in 379 ms of which 1 ms to minimize.
[2022-05-17 22:03:37] [INFO ] Deduced a trap composed of 105 places in 375 ms of which 0 ms to minimize.
[2022-05-17 22:03:37] [INFO ] Deduced a trap composed of 90 places in 367 ms of which 1 ms to minimize.
[2022-05-17 22:03:38] [INFO ] Deduced a trap composed of 82 places in 377 ms of which 1 ms to minimize.
[2022-05-17 22:03:38] [INFO ] Deduced a trap composed of 120 places in 376 ms of which 1 ms to minimize.
[2022-05-17 22:03:38] [INFO ] Deduced a trap composed of 161 places in 418 ms of which 1 ms to minimize.
[2022-05-17 22:03:39] [INFO ] Deduced a trap composed of 121 places in 383 ms of which 1 ms to minimize.
[2022-05-17 22:03:39] [INFO ] Deduced a trap composed of 73 places in 382 ms of which 1 ms to minimize.
[2022-05-17 22:03:40] [INFO ] Deduced a trap composed of 114 places in 383 ms of which 1 ms to minimize.
[2022-05-17 22:03:40] [INFO ] Deduced a trap composed of 81 places in 377 ms of which 1 ms to minimize.
[2022-05-17 22:03:41] [INFO ] Deduced a trap composed of 86 places in 394 ms of which 1 ms to minimize.
[2022-05-17 22:03:41] [INFO ] Deduced a trap composed of 95 places in 437 ms of which 1 ms to minimize.
[2022-05-17 22:03:42] [INFO ] Deduced a trap composed of 98 places in 405 ms of which 1 ms to minimize.
[2022-05-17 22:03:42] [INFO ] Deduced a trap composed of 133 places in 391 ms of which 1 ms to minimize.
[2022-05-17 22:03:43] [INFO ] Deduced a trap composed of 177 places in 387 ms of which 1 ms to minimize.
[2022-05-17 22:03:43] [INFO ] Deduced a trap composed of 142 places in 392 ms of which 1 ms to minimize.
[2022-05-17 22:03:43] [INFO ] Deduced a trap composed of 134 places in 392 ms of which 0 ms to minimize.
[2022-05-17 22:03:44] [INFO ] Deduced a trap composed of 117 places in 391 ms of which 1 ms to minimize.
[2022-05-17 22:03:44] [INFO ] Deduced a trap composed of 115 places in 379 ms of which 1 ms to minimize.
[2022-05-17 22:03:45] [INFO ] Deduced a trap composed of 95 places in 371 ms of which 1 ms to minimize.
[2022-05-17 22:03:45] [INFO ] Deduced a trap composed of 89 places in 370 ms of which 0 ms to minimize.
[2022-05-17 22:03:46] [INFO ] Deduced a trap composed of 129 places in 382 ms of which 0 ms to minimize.
[2022-05-17 22:03:46] [INFO ] Deduced a trap composed of 71 places in 365 ms of which 1 ms to minimize.
[2022-05-17 22:03:47] [INFO ] Deduced a trap composed of 65 places in 403 ms of which 0 ms to minimize.
[2022-05-17 22:03:47] [INFO ] Deduced a trap composed of 92 places in 391 ms of which 1 ms to minimize.
[2022-05-17 22:03:47] [INFO ] Deduced a trap composed of 63 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:03:48] [INFO ] Deduced a trap composed of 114 places in 418 ms of which 1 ms to minimize.
[2022-05-17 22:03:48] [INFO ] Deduced a trap composed of 63 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:03:49] [INFO ] Deduced a trap composed of 66 places in 375 ms of which 1 ms to minimize.
[2022-05-17 22:03:49] [INFO ] Deduced a trap composed of 78 places in 394 ms of which 0 ms to minimize.
[2022-05-17 22:03:50] [INFO ] Deduced a trap composed of 24 places in 372 ms of which 1 ms to minimize.
[2022-05-17 22:03:50] [INFO ] Deduced a trap composed of 21 places in 363 ms of which 1 ms to minimize.
[2022-05-17 22:03:51] [INFO ] Deduced a trap composed of 28 places in 377 ms of which 1 ms to minimize.
[2022-05-17 22:03:51] [INFO ] Deduced a trap composed of 28 places in 420 ms of which 0 ms to minimize.
[2022-05-17 22:03:52] [INFO ] Deduced a trap composed of 13 places in 387 ms of which 1 ms to minimize.
[2022-05-17 22:03:52] [INFO ] Deduced a trap composed of 13 places in 393 ms of which 1 ms to minimize.
[2022-05-17 22:03:52] [INFO ] Deduced a trap composed of 141 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:03:53] [INFO ] Deduced a trap composed of 59 places in 389 ms of which 1 ms to minimize.
[2022-05-17 22:03:53] [INFO ] Deduced a trap composed of 62 places in 392 ms of which 1 ms to minimize.
[2022-05-17 22:03:54] [INFO ] Deduced a trap composed of 80 places in 395 ms of which 1 ms to minimize.
[2022-05-17 22:03:54] [INFO ] Deduced a trap composed of 71 places in 402 ms of which 0 ms to minimize.
[2022-05-17 22:03:55] [INFO ] Deduced a trap composed of 70 places in 404 ms of which 1 ms to minimize.
[2022-05-17 22:03:55] [INFO ] Deduced a trap composed of 57 places in 405 ms of which 1 ms to minimize.
[2022-05-17 22:03:56] [INFO ] Deduced a trap composed of 172 places in 390 ms of which 1 ms to minimize.
[2022-05-17 22:03:56] [INFO ] Deduced a trap composed of 40 places in 390 ms of which 1 ms to minimize.
[2022-05-17 22:03:57] [INFO ] Deduced a trap composed of 38 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:03:57] [INFO ] Deduced a trap composed of 100 places in 392 ms of which 1 ms to minimize.
[2022-05-17 22:03:58] [INFO ] Deduced a trap composed of 106 places in 403 ms of which 1 ms to minimize.
[2022-05-17 22:03:58] [INFO ] Deduced a trap composed of 91 places in 391 ms of which 1 ms to minimize.
[2022-05-17 22:03:58] [INFO ] Deduced a trap composed of 90 places in 375 ms of which 1 ms to minimize.
[2022-05-17 22:03:59] [INFO ] Deduced a trap composed of 91 places in 376 ms of which 1 ms to minimize.
[2022-05-17 22:03:59] [INFO ] Deduced a trap composed of 92 places in 377 ms of which 1 ms to minimize.
[2022-05-17 22:04:00] [INFO ] Deduced a trap composed of 39 places in 394 ms of which 1 ms to minimize.
[2022-05-17 22:04:00] [INFO ] Deduced a trap composed of 123 places in 356 ms of which 0 ms to minimize.
[2022-05-17 22:04:01] [INFO ] Deduced a trap composed of 33 places in 371 ms of which 1 ms to minimize.
[2022-05-17 22:04:01] [INFO ] Deduced a trap composed of 153 places in 383 ms of which 1 ms to minimize.
[2022-05-17 22:04:01] [INFO ] Deduced a trap composed of 190 places in 385 ms of which 1 ms to minimize.
[2022-05-17 22:04:02] [INFO ] Deduced a trap composed of 53 places in 385 ms of which 1 ms to minimize.
[2022-05-17 22:04:02] [INFO ] Deduced a trap composed of 90 places in 381 ms of which 1 ms to minimize.
[2022-05-17 22:04:03] [INFO ] Deduced a trap composed of 94 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:04:03] [INFO ] Deduced a trap composed of 113 places in 376 ms of which 1 ms to minimize.
[2022-05-17 22:04:04] [INFO ] Deduced a trap composed of 134 places in 390 ms of which 1 ms to minimize.
[2022-05-17 22:04:04] [INFO ] Deduced a trap composed of 95 places in 343 ms of which 0 ms to minimize.
[2022-05-17 22:04:05] [INFO ] Deduced a trap composed of 73 places in 393 ms of which 1 ms to minimize.
[2022-05-17 22:04:05] [INFO ] Deduced a trap composed of 120 places in 392 ms of which 1 ms to minimize.
[2022-05-17 22:04:06] [INFO ] Deduced a trap composed of 75 places in 386 ms of which 1 ms to minimize.
[2022-05-17 22:04:06] [INFO ] Deduced a trap composed of 62 places in 382 ms of which 1 ms to minimize.
[2022-05-17 22:04:06] [INFO ] Deduced a trap composed of 91 places in 373 ms of which 1 ms to minimize.
[2022-05-17 22:04:07] [INFO ] Deduced a trap composed of 161 places in 327 ms of which 1 ms to minimize.
[2022-05-17 22:04:07] [INFO ] Deduced a trap composed of 134 places in 328 ms of which 1 ms to minimize.
[2022-05-17 22:04:08] [INFO ] Deduced a trap composed of 132 places in 326 ms of which 1 ms to minimize.
[2022-05-17 22:04:08] [INFO ] Deduced a trap composed of 95 places in 267 ms of which 1 ms to minimize.
[2022-05-17 22:04:08] [INFO ] Deduced a trap composed of 25 places in 413 ms of which 1 ms to minimize.
[2022-05-17 22:04:09] [INFO ] Deduced a trap composed of 126 places in 407 ms of which 1 ms to minimize.
[2022-05-17 22:04:09] [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) : [448] Max seen :[7]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 24 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 22 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2022-05-17 22:04:09] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:04:09] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 22:04:09] [INFO ] Implicit Places using invariants in 362 ms returned []
[2022-05-17 22:04:09] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:04:09] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 22:04:10] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:04:16] [INFO ] Implicit Places using invariants and state equation in 7075 ms returned []
Implicit Place search using SMT with State Equation took 7438 ms to find 0 implicit places.
[2022-05-17 22:04:16] [INFO ] Redundant transitions in 35 ms returned []
[2022-05-17 22:04:16] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:04:16] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-17 22:04:17] [INFO ] Dead Transitions using invariants and state equation in 765 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:04:17] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9102 ms. (steps per millisecond=109 ) properties (out of 1) seen :6
Interrupted Best-First random walk after 676082 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=135 ) properties seen :{0=2}
[2022-05-17 22:04:31] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:04:31] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-17 22:04:31] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 22:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:04:32] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2022-05-17 22:04:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:04:32] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2022-05-17 22:04:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:04:32] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2022-05-17 22:04:32] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:04:33] [INFO ] [Nat]Added 546 Read/Feed constraints in 132 ms returned sat
[2022-05-17 22:04:33] [INFO ] Deduced a trap composed of 102 places in 415 ms of which 1 ms to minimize.
[2022-05-17 22:04:33] [INFO ] Deduced a trap composed of 41 places in 420 ms of which 1 ms to minimize.
[2022-05-17 22:04:34] [INFO ] Deduced a trap composed of 66 places in 410 ms of which 1 ms to minimize.
[2022-05-17 22:04:34] [INFO ] Deduced a trap composed of 123 places in 408 ms of which 1 ms to minimize.
[2022-05-17 22:04:35] [INFO ] Deduced a trap composed of 66 places in 399 ms of which 1 ms to minimize.
[2022-05-17 22:04:35] [INFO ] Deduced a trap composed of 103 places in 412 ms of which 1 ms to minimize.
[2022-05-17 22:04:36] [INFO ] Deduced a trap composed of 49 places in 406 ms of which 1 ms to minimize.
[2022-05-17 22:04:36] [INFO ] Deduced a trap composed of 13 places in 401 ms of which 1 ms to minimize.
[2022-05-17 22:04:37] [INFO ] Deduced a trap composed of 111 places in 412 ms of which 1 ms to minimize.
[2022-05-17 22:04:37] [INFO ] Deduced a trap composed of 45 places in 398 ms of which 1 ms to minimize.
[2022-05-17 22:04:38] [INFO ] Deduced a trap composed of 39 places in 405 ms of which 1 ms to minimize.
[2022-05-17 22:04:38] [INFO ] Deduced a trap composed of 55 places in 403 ms of which 1 ms to minimize.
[2022-05-17 22:04:39] [INFO ] Deduced a trap composed of 96 places in 408 ms of which 0 ms to minimize.
[2022-05-17 22:04:39] [INFO ] Deduced a trap composed of 37 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:04:40] [INFO ] Deduced a trap composed of 21 places in 416 ms of which 1 ms to minimize.
[2022-05-17 22:04:40] [INFO ] Deduced a trap composed of 104 places in 413 ms of which 1 ms to minimize.
[2022-05-17 22:04:41] [INFO ] Deduced a trap composed of 134 places in 429 ms of which 1 ms to minimize.
[2022-05-17 22:04:41] [INFO ] Deduced a trap composed of 49 places in 395 ms of which 1 ms to minimize.
[2022-05-17 22:04:41] [INFO ] Deduced a trap composed of 21 places in 395 ms of which 1 ms to minimize.
[2022-05-17 22:04:42] [INFO ] Deduced a trap composed of 40 places in 402 ms of which 1 ms to minimize.
[2022-05-17 22:04:42] [INFO ] Deduced a trap composed of 52 places in 400 ms of which 1 ms to minimize.
[2022-05-17 22:04:43] [INFO ] Deduced a trap composed of 43 places in 415 ms of which 0 ms to minimize.
[2022-05-17 22:04:43] [INFO ] Deduced a trap composed of 71 places in 360 ms of which 1 ms to minimize.
[2022-05-17 22:04:44] [INFO ] Deduced a trap composed of 75 places in 370 ms of which 1 ms to minimize.
[2022-05-17 22:04:44] [INFO ] Deduced a trap composed of 107 places in 374 ms of which 1 ms to minimize.
[2022-05-17 22:04:45] [INFO ] Deduced a trap composed of 105 places in 382 ms of which 1 ms to minimize.
[2022-05-17 22:04:45] [INFO ] Deduced a trap composed of 90 places in 389 ms of which 1 ms to minimize.
[2022-05-17 22:04:46] [INFO ] Deduced a trap composed of 82 places in 384 ms of which 0 ms to minimize.
[2022-05-17 22:04:46] [INFO ] Deduced a trap composed of 120 places in 383 ms of which 1 ms to minimize.
[2022-05-17 22:04:46] [INFO ] Deduced a trap composed of 161 places in 383 ms of which 1 ms to minimize.
[2022-05-17 22:04:47] [INFO ] Deduced a trap composed of 121 places in 424 ms of which 1 ms to minimize.
[2022-05-17 22:04:47] [INFO ] Deduced a trap composed of 73 places in 374 ms of which 1 ms to minimize.
[2022-05-17 22:04:48] [INFO ] Deduced a trap composed of 114 places in 380 ms of which 1 ms to minimize.
[2022-05-17 22:04:48] [INFO ] Deduced a trap composed of 81 places in 376 ms of which 1 ms to minimize.
[2022-05-17 22:04:49] [INFO ] Deduced a trap composed of 86 places in 379 ms of which 1 ms to minimize.
[2022-05-17 22:04:49] [INFO ] Deduced a trap composed of 95 places in 386 ms of which 1 ms to minimize.
[2022-05-17 22:04:50] [INFO ] Deduced a trap composed of 98 places in 370 ms of which 1 ms to minimize.
[2022-05-17 22:04:50] [INFO ] Deduced a trap composed of 133 places in 399 ms of which 1 ms to minimize.
[2022-05-17 22:04:50] [INFO ] Deduced a trap composed of 177 places in 373 ms of which 1 ms to minimize.
[2022-05-17 22:04:51] [INFO ] Deduced a trap composed of 142 places in 392 ms of which 1 ms to minimize.
[2022-05-17 22:04:51] [INFO ] Deduced a trap composed of 134 places in 377 ms of which 1 ms to minimize.
[2022-05-17 22:04:52] [INFO ] Deduced a trap composed of 117 places in 380 ms of which 1 ms to minimize.
[2022-05-17 22:04:52] [INFO ] Deduced a trap composed of 115 places in 376 ms of which 1 ms to minimize.
[2022-05-17 22:04:53] [INFO ] Deduced a trap composed of 95 places in 740 ms of which 0 ms to minimize.
[2022-05-17 22:04:53] [INFO ] Deduced a trap composed of 89 places in 389 ms of which 1 ms to minimize.
[2022-05-17 22:04:54] [INFO ] Deduced a trap composed of 129 places in 394 ms of which 1 ms to minimize.
[2022-05-17 22:04:54] [INFO ] Deduced a trap composed of 71 places in 380 ms of which 1 ms to minimize.
[2022-05-17 22:04:55] [INFO ] Deduced a trap composed of 65 places in 421 ms of which 0 ms to minimize.
[2022-05-17 22:04:55] [INFO ] Deduced a trap composed of 92 places in 406 ms of which 1 ms to minimize.
[2022-05-17 22:04:56] [INFO ] Deduced a trap composed of 63 places in 416 ms of which 1 ms to minimize.
[2022-05-17 22:04:56] [INFO ] Deduced a trap composed of 114 places in 417 ms of which 1 ms to minimize.
[2022-05-17 22:04:57] [INFO ] Deduced a trap composed of 63 places in 400 ms of which 1 ms to minimize.
[2022-05-17 22:04:57] [INFO ] Deduced a trap composed of 66 places in 387 ms of which 0 ms to minimize.
[2022-05-17 22:04:58] [INFO ] Deduced a trap composed of 78 places in 385 ms of which 1 ms to minimize.
[2022-05-17 22:04:58] [INFO ] Deduced a trap composed of 24 places in 382 ms of which 0 ms to minimize.
[2022-05-17 22:04:59] [INFO ] Deduced a trap composed of 21 places in 367 ms of which 1 ms to minimize.
[2022-05-17 22:04:59] [INFO ] Deduced a trap composed of 28 places in 379 ms of which 1 ms to minimize.
[2022-05-17 22:04:59] [INFO ] Deduced a trap composed of 28 places in 381 ms of which 1 ms to minimize.
[2022-05-17 22:05:00] [INFO ] Deduced a trap composed of 13 places in 386 ms of which 1 ms to minimize.
[2022-05-17 22:05:00] [INFO ] Deduced a trap composed of 13 places in 404 ms of which 1 ms to minimize.
[2022-05-17 22:05:01] [INFO ] Deduced a trap composed of 141 places in 391 ms of which 0 ms to minimize.
[2022-05-17 22:05:01] [INFO ] Deduced a trap composed of 59 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:05:02] [INFO ] Deduced a trap composed of 62 places in 372 ms of which 1 ms to minimize.
[2022-05-17 22:05:02] [INFO ] Deduced a trap composed of 80 places in 399 ms of which 0 ms to minimize.
[2022-05-17 22:05:03] [INFO ] Deduced a trap composed of 71 places in 386 ms of which 1 ms to minimize.
[2022-05-17 22:05:03] [INFO ] Deduced a trap composed of 70 places in 395 ms of which 1 ms to minimize.
[2022-05-17 22:05:04] [INFO ] Deduced a trap composed of 57 places in 407 ms of which 1 ms to minimize.
[2022-05-17 22:05:04] [INFO ] Deduced a trap composed of 172 places in 393 ms of which 0 ms to minimize.
[2022-05-17 22:05:04] [INFO ] Deduced a trap composed of 40 places in 382 ms of which 0 ms to minimize.
[2022-05-17 22:05:05] [INFO ] Deduced a trap composed of 38 places in 373 ms of which 1 ms to minimize.
[2022-05-17 22:05:05] [INFO ] Deduced a trap composed of 100 places in 372 ms of which 1 ms to minimize.
[2022-05-17 22:05:06] [INFO ] Deduced a trap composed of 106 places in 382 ms of which 1 ms to minimize.
[2022-05-17 22:05:06] [INFO ] Deduced a trap composed of 91 places in 369 ms of which 1 ms to minimize.
[2022-05-17 22:05:07] [INFO ] Deduced a trap composed of 90 places in 380 ms of which 1 ms to minimize.
[2022-05-17 22:05:07] [INFO ] Deduced a trap composed of 91 places in 379 ms of which 1 ms to minimize.
[2022-05-17 22:05:07] [INFO ] Deduced a trap composed of 92 places in 382 ms of which 0 ms to minimize.
[2022-05-17 22:05:08] [INFO ] Deduced a trap composed of 39 places in 387 ms of which 1 ms to minimize.
[2022-05-17 22:05:08] [INFO ] Deduced a trap composed of 123 places in 363 ms of which 1 ms to minimize.
[2022-05-17 22:05:09] [INFO ] Deduced a trap composed of 33 places in 366 ms of which 1 ms to minimize.
[2022-05-17 22:05:09] [INFO ] Deduced a trap composed of 153 places in 394 ms of which 1 ms to minimize.
[2022-05-17 22:05:10] [INFO ] Deduced a trap composed of 190 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:05:10] [INFO ] Deduced a trap composed of 53 places in 404 ms of which 0 ms to minimize.
[2022-05-17 22:05:11] [INFO ] Deduced a trap composed of 90 places in 392 ms of which 0 ms to minimize.
[2022-05-17 22:05:11] [INFO ] Deduced a trap composed of 94 places in 380 ms of which 1 ms to minimize.
[2022-05-17 22:05:12] [INFO ] Deduced a trap composed of 113 places in 379 ms of which 0 ms to minimize.
[2022-05-17 22:05:12] [INFO ] Deduced a trap composed of 134 places in 383 ms of which 1 ms to minimize.
[2022-05-17 22:05:12] [INFO ] Deduced a trap composed of 95 places in 340 ms of which 1 ms to minimize.
[2022-05-17 22:05:13] [INFO ] Deduced a trap composed of 73 places in 371 ms of which 0 ms to minimize.
[2022-05-17 22:05:13] [INFO ] Deduced a trap composed of 120 places in 380 ms of which 1 ms to minimize.
[2022-05-17 22:05:14] [INFO ] Deduced a trap composed of 75 places in 381 ms of which 0 ms to minimize.
[2022-05-17 22:05:14] [INFO ] Deduced a trap composed of 62 places in 395 ms of which 1 ms to minimize.
[2022-05-17 22:05:15] [INFO ] Deduced a trap composed of 91 places in 383 ms of which 0 ms to minimize.
[2022-05-17 22:05:15] [INFO ] Deduced a trap composed of 161 places in 322 ms of which 1 ms to minimize.
[2022-05-17 22:05:15] [INFO ] Deduced a trap composed of 134 places in 318 ms of which 1 ms to minimize.
[2022-05-17 22:05:16] [INFO ] Deduced a trap composed of 132 places in 323 ms of which 1 ms to minimize.
[2022-05-17 22:05:16] [INFO ] Deduced a trap composed of 95 places in 267 ms of which 1 ms to minimize.
[2022-05-17 22:05:17] [INFO ] Deduced a trap composed of 25 places in 423 ms of which 1 ms to minimize.
[2022-05-17 22:05:17] [INFO ] Deduced a trap composed of 126 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:05:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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) : [448] Max seen :[7]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 22 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 22 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2022-05-17 22:05:17] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:05:17] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-17 22:05:17] [INFO ] Implicit Places using invariants in 358 ms returned []
[2022-05-17 22:05:17] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:05:17] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 22:05:18] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:05:24] [INFO ] Implicit Places using invariants and state equation in 6693 ms returned []
Implicit Place search using SMT with State Equation took 7052 ms to find 0 implicit places.
[2022-05-17 22:05:24] [INFO ] Redundant transitions in 37 ms returned []
[2022-05-17 22:05:24] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:05:24] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 22:05:25] [INFO ] Dead Transitions using invariants and state equation in 707 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Ending property specific reduction for Peterson-COL-7-UpperBounds-03 in 142170 ms.
Starting property specific reduction for Peterson-COL-7-UpperBounds-07
Normalized transition count is 1872 out of 2208 initially.
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 22:05:25] [INFO ] Computed 23 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
[2022-05-17 22:05:25] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 22:05:25] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-17 22:05:25] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2022-05-17 22:05:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:05:25] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2022-05-17 22:05:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:05:26] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 22:05:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:05:26] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2022-05-17 22:05:26] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:05:26] [INFO ] [Nat]Added 546 Read/Feed constraints in 92 ms returned sat
[2022-05-17 22:05:27] [INFO ] Deduced a trap composed of 17 places in 347 ms of which 1 ms to minimize.
[2022-05-17 22:05:27] [INFO ] Deduced a trap composed of 32 places in 394 ms of which 0 ms to minimize.
[2022-05-17 22:05:27] [INFO ] Deduced a trap composed of 15 places in 349 ms of which 1 ms to minimize.
[2022-05-17 22:05:28] [INFO ] Deduced a trap composed of 141 places in 351 ms of which 1 ms to minimize.
[2022-05-17 22:05:28] [INFO ] Deduced a trap composed of 131 places in 366 ms of which 1 ms to minimize.
[2022-05-17 22:05:29] [INFO ] Deduced a trap composed of 50 places in 358 ms of which 1 ms to minimize.
[2022-05-17 22:05:29] [INFO ] Deduced a trap composed of 145 places in 347 ms of which 1 ms to minimize.
[2022-05-17 22:05:30] [INFO ] Deduced a trap composed of 122 places in 364 ms of which 1 ms to minimize.
[2022-05-17 22:05:30] [INFO ] Deduced a trap composed of 35 places in 337 ms of which 0 ms to minimize.
[2022-05-17 22:05:30] [INFO ] Deduced a trap composed of 33 places in 336 ms of which 1 ms to minimize.
[2022-05-17 22:05:31] [INFO ] Deduced a trap composed of 23 places in 340 ms of which 0 ms to minimize.
[2022-05-17 22:05:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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) : [8] Max seen :[1]
Support contains 8 out of 1096 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 1096 transition count 2103
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 991 transition count 2103
Performed 343 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 343 Pre rules applied. Total rules applied 210 place count 991 transition count 1760
Deduced a syphon composed of 343 places in 1 ms
Reduce places removed 343 places and 0 transitions.
Iterating global reduction 2 with 686 rules applied. Total rules applied 896 place count 648 transition count 1760
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 1008 place count 592 transition count 1704
Applied a total of 1008 rules in 66 ms. Remains 592 /1096 variables (removed 504) and now considering 1704/2208 (removed 504) transitions.
Finished structural reductions, in 1 iterations. Remains : 592/1096 places, 1704/2208 transitions.
Normalized transition count is 1368 out of 1704 initially.
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 22:05:31] [INFO ] Computed 23 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2087 ms. (steps per millisecond=479 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 626 ms. (steps per millisecond=1597 ) properties (out of 1) seen :1
[2022-05-17 22:05:34] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 22:05:34] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 22:05:34] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2022-05-17 22:05:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:05:34] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2022-05-17 22:05:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:05:34] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2022-05-17 22:05:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:05:34] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2022-05-17 22:05:34] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:05:34] [INFO ] [Nat]Added 546 Read/Feed constraints in 56 ms returned sat
[2022-05-17 22:05:34] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 0 ms to minimize.
[2022-05-17 22:05:35] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 1 ms to minimize.
[2022-05-17 22:05:35] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 1 ms to minimize.
[2022-05-17 22:05:35] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 1 ms to minimize.
[2022-05-17 22:05:35] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 1 ms to minimize.
[2022-05-17 22:05:35] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 1 ms to minimize.
[2022-05-17 22:05:36] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 1 ms to minimize.
[2022-05-17 22:05:36] [INFO ] Deduced a trap composed of 90 places in 167 ms of which 0 ms to minimize.
[2022-05-17 22:05:36] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 1 ms to minimize.
[2022-05-17 22:05:36] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 0 ms to minimize.
[2022-05-17 22:05:36] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 0 ms to minimize.
[2022-05-17 22:05:37] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 0 ms to minimize.
[2022-05-17 22:05:37] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 1 ms to minimize.
[2022-05-17 22:05:37] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 1 ms to minimize.
[2022-05-17 22:05:37] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 0 ms to minimize.
[2022-05-17 22:05:38] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 0 ms to minimize.
[2022-05-17 22:05:38] [INFO ] Deduced a trap composed of 48 places in 181 ms of which 0 ms to minimize.
[2022-05-17 22:05:38] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 1 ms to minimize.
[2022-05-17 22:05:38] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 0 ms to minimize.
[2022-05-17 22:05:38] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 1 ms to minimize.
[2022-05-17 22:05:39] [INFO ] Deduced a trap composed of 93 places in 174 ms of which 0 ms to minimize.
[2022-05-17 22:05:39] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 0 ms to minimize.
[2022-05-17 22:05:39] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 1 ms to minimize.
[2022-05-17 22:05:39] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 1 ms to minimize.
[2022-05-17 22:05:40] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 1 ms to minimize.
[2022-05-17 22:05:40] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 0 ms to minimize.
[2022-05-17 22:05:40] [INFO ] Deduced a trap composed of 115 places in 169 ms of which 0 ms to minimize.
[2022-05-17 22:05:40] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 1 ms to minimize.
[2022-05-17 22:05:40] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 1 ms to minimize.
[2022-05-17 22:05:41] [INFO ] Deduced a trap composed of 59 places in 173 ms of which 1 ms to minimize.
[2022-05-17 22:05:41] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 0 ms to minimize.
[2022-05-17 22:05:41] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 1 ms to minimize.
[2022-05-17 22:05:41] [INFO ] Deduced a trap composed of 59 places in 170 ms of which 1 ms to minimize.
[2022-05-17 22:05:41] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 0 ms to minimize.
[2022-05-17 22:05:42] [INFO ] Deduced a trap composed of 84 places in 176 ms of which 0 ms to minimize.
[2022-05-17 22:05:42] [INFO ] Deduced a trap composed of 64 places in 176 ms of which 1 ms to minimize.
[2022-05-17 22:05:42] [INFO ] Deduced a trap composed of 59 places in 172 ms of which 1 ms to minimize.
[2022-05-17 22:05:42] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 0 ms to minimize.
[2022-05-17 22:05:42] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 0 ms to minimize.
[2022-05-17 22:05:43] [INFO ] Deduced a trap composed of 79 places in 162 ms of which 1 ms to minimize.
[2022-05-17 22:05:43] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 0 ms to minimize.
[2022-05-17 22:05:43] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 0 ms to minimize.
[2022-05-17 22:05:43] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 0 ms to minimize.
[2022-05-17 22:05:43] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 0 ms to minimize.
[2022-05-17 22:05:44] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 0 ms to minimize.
[2022-05-17 22:05:44] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 0 ms to minimize.
[2022-05-17 22:05:44] [INFO ] Deduced a trap composed of 69 places in 163 ms of which 1 ms to minimize.
[2022-05-17 22:05:44] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 0 ms to minimize.
[2022-05-17 22:05:44] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 0 ms to minimize.
[2022-05-17 22:05:45] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 1 ms to minimize.
[2022-05-17 22:05:45] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 1 ms to minimize.
[2022-05-17 22:05:45] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 1 ms to minimize.
[2022-05-17 22:05:45] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 0 ms to minimize.
[2022-05-17 22:05:45] [INFO ] Deduced a trap composed of 77 places in 153 ms of which 1 ms to minimize.
[2022-05-17 22:05:46] [INFO ] Deduced a trap composed of 62 places in 159 ms of which 1 ms to minimize.
[2022-05-17 22:05:46] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 1 ms to minimize.
[2022-05-17 22:05:46] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 1 ms to minimize.
[2022-05-17 22:05:46] [INFO ] Deduced a trap composed of 64 places in 152 ms of which 1 ms to minimize.
[2022-05-17 22:05:46] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 0 ms to minimize.
[2022-05-17 22:05:47] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 0 ms to minimize.
[2022-05-17 22:05:47] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 0 ms to minimize.
[2022-05-17 22:05:47] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 0 ms to minimize.
[2022-05-17 22:05:47] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 0 ms to minimize.
[2022-05-17 22:05:47] [INFO ] Deduced a trap composed of 68 places in 163 ms of which 0 ms to minimize.
[2022-05-17 22:05:48] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 1 ms to minimize.
[2022-05-17 22:05:48] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 0 ms to minimize.
[2022-05-17 22:05:48] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 0 ms to minimize.
[2022-05-17 22:05:48] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 1 ms to minimize.
[2022-05-17 22:05:48] [INFO ] Deduced a trap composed of 46 places in 164 ms of which 0 ms to minimize.
[2022-05-17 22:05:49] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 0 ms to minimize.
[2022-05-17 22:05:49] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 0 ms to minimize.
[2022-05-17 22:05:49] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 0 ms to minimize.
[2022-05-17 22:05:49] [INFO ] Deduced a trap composed of 78 places in 160 ms of which 1 ms to minimize.
[2022-05-17 22:05:50] [INFO ] Deduced a trap composed of 62 places in 160 ms of which 0 ms to minimize.
[2022-05-17 22:05:50] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 0 ms to minimize.
[2022-05-17 22:05:50] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 0 ms to minimize.
[2022-05-17 22:05:50] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 0 ms to minimize.
[2022-05-17 22:05:50] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 0 ms to minimize.
[2022-05-17 22:05:51] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 0 ms to minimize.
[2022-05-17 22:05:51] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 0 ms to minimize.
[2022-05-17 22:05:51] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 1 ms to minimize.
[2022-05-17 22:05:51] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 1 ms to minimize.
[2022-05-17 22:05:51] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 0 ms to minimize.
[2022-05-17 22:05:52] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 0 ms to minimize.
[2022-05-17 22:05:52] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 0 ms to minimize.
[2022-05-17 22:05:52] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 1 ms to minimize.
[2022-05-17 22:05:52] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 0 ms to minimize.
[2022-05-17 22:05:52] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 1 ms to minimize.
[2022-05-17 22:05:53] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 1 ms to minimize.
[2022-05-17 22:05:53] [INFO ] Deduced a trap composed of 67 places in 157 ms of which 1 ms to minimize.
[2022-05-17 22:05:53] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 1 ms to minimize.
[2022-05-17 22:05:53] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 1 ms to minimize.
[2022-05-17 22:05:53] [INFO ] Deduced a trap composed of 64 places in 165 ms of which 1 ms to minimize.
[2022-05-17 22:05:54] [INFO ] Deduced a trap composed of 54 places in 164 ms of which 0 ms to minimize.
[2022-05-17 22:05:54] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 1 ms to minimize.
[2022-05-17 22:05:54] [INFO ] Deduced a trap composed of 70 places in 155 ms of which 0 ms to minimize.
[2022-05-17 22:05:54] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 1 ms to minimize.
[2022-05-17 22:05:54] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 0 ms to minimize.
[2022-05-17 22:05:55] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 1 ms to minimize.
[2022-05-17 22:05:55] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 1 ms to minimize.
[2022-05-17 22:05:55] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 0 ms to minimize.
[2022-05-17 22:05:56] [INFO ] Deduced a trap composed of 69 places in 149 ms of which 1 ms to minimize.
[2022-05-17 22:05:56] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 0 ms to minimize.
[2022-05-17 22:05:56] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 0 ms to minimize.
[2022-05-17 22:05:56] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 0 ms to minimize.
[2022-05-17 22:05:56] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 0 ms to minimize.
[2022-05-17 22:05:57] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 1 ms to minimize.
[2022-05-17 22:05:57] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 0 ms to minimize.
[2022-05-17 22:05:57] [INFO ] Deduced a trap composed of 75 places in 148 ms of which 0 ms to minimize.
[2022-05-17 22:05:57] [INFO ] Deduced a trap composed of 69 places in 147 ms of which 1 ms to minimize.
[2022-05-17 22:05:57] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 1 ms to minimize.
[2022-05-17 22:05:57] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 0 ms to minimize.
[2022-05-17 22:05:58] [INFO ] Deduced a trap composed of 104 places in 152 ms of which 0 ms to minimize.
[2022-05-17 22:05:58] [INFO ] Deduced a trap composed of 124 places in 155 ms of which 1 ms to minimize.
[2022-05-17 22:05:58] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 0 ms to minimize.
[2022-05-17 22:05:58] [INFO ] Deduced a trap composed of 58 places in 149 ms of which 1 ms to minimize.
[2022-05-17 22:05:58] [INFO ] Deduced a trap composed of 60 places in 157 ms of which 0 ms to minimize.
[2022-05-17 22:05:59] [INFO ] Deduced a trap composed of 108 places in 160 ms of which 1 ms to minimize.
[2022-05-17 22:05:59] [INFO ] Deduced a trap composed of 78 places in 149 ms of which 0 ms to minimize.
[2022-05-17 22:05:59] [INFO ] Deduced a trap composed of 83 places in 148 ms of which 1 ms to minimize.
[2022-05-17 22:05:59] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 0 ms to minimize.
[2022-05-17 22:05:59] [INFO ] Deduced a trap composed of 65 places in 156 ms of which 0 ms to minimize.
[2022-05-17 22:06:00] [INFO ] Deduced a trap composed of 94 places in 166 ms of which 1 ms to minimize.
[2022-05-17 22:06:00] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 1 ms to minimize.
[2022-05-17 22:06:00] [INFO ] Deduced a trap composed of 72 places in 148 ms of which 1 ms to minimize.
[2022-05-17 22:06:00] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 0 ms to minimize.
[2022-05-17 22:06:00] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 0 ms to minimize.
[2022-05-17 22:06:01] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 1 ms to minimize.
[2022-05-17 22:06:01] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 1 ms to minimize.
[2022-05-17 22:06:01] [INFO ] Deduced a trap composed of 74 places in 175 ms of which 0 ms to minimize.
[2022-05-17 22:06:01] [INFO ] Deduced a trap composed of 49 places in 176 ms of which 1 ms to minimize.
[2022-05-17 22:06:01] [INFO ] Deduced a trap composed of 88 places in 196 ms of which 0 ms to minimize.
[2022-05-17 22:06:02] [INFO ] Deduced a trap composed of 69 places in 184 ms of which 1 ms to minimize.
[2022-05-17 22:06:02] [INFO ] Deduced a trap composed of 62 places in 189 ms of which 1 ms to minimize.
[2022-05-17 22:06:02] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 1 ms to minimize.
[2022-05-17 22:06:02] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 0 ms to minimize.
[2022-05-17 22:06:03] [INFO ] Deduced a trap composed of 40 places in 195 ms of which 1 ms to minimize.
[2022-05-17 22:06:03] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 1 ms to minimize.
[2022-05-17 22:06:03] [INFO ] Deduced a trap composed of 59 places in 175 ms of which 0 ms to minimize.
[2022-05-17 22:06:03] [INFO ] Deduced a trap composed of 53 places in 175 ms of which 0 ms to minimize.
[2022-05-17 22:06:03] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 0 ms to minimize.
[2022-05-17 22:06:04] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 0 ms to minimize.
[2022-05-17 22:06:04] [INFO ] Deduced a trap composed of 71 places in 170 ms of which 1 ms to minimize.
[2022-05-17 22:06:04] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 0 ms to minimize.
[2022-05-17 22:06:04] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 1 ms to minimize.
[2022-05-17 22:06:05] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 0 ms to minimize.
[2022-05-17 22:06:05] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 1 ms to minimize.
[2022-05-17 22:06:05] [INFO ] Deduced a trap composed of 69 places in 167 ms of which 1 ms to minimize.
[2022-05-17 22:06:05] [INFO ] Deduced a trap composed of 77 places in 158 ms of which 1 ms to minimize.
[2022-05-17 22:06:05] [INFO ] Deduced a trap composed of 94 places in 168 ms of which 0 ms to minimize.
[2022-05-17 22:06:06] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 1 ms to minimize.
[2022-05-17 22:06:06] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 0 ms to minimize.
[2022-05-17 22:06:06] [INFO ] Deduced a trap composed of 56 places in 157 ms of which 1 ms to minimize.
[2022-05-17 22:06:06] [INFO ] Deduced a trap composed of 62 places in 160 ms of which 0 ms to minimize.
[2022-05-17 22:06:06] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 0 ms to minimize.
[2022-05-17 22:06:07] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 1 ms to minimize.
[2022-05-17 22:06:07] [INFO ] Deduced a trap composed of 65 places in 179 ms of which 0 ms to minimize.
[2022-05-17 22:06:07] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 0 ms to minimize.
[2022-05-17 22:06:07] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 0 ms to minimize.
[2022-05-17 22:06:07] [INFO ] Deduced a trap composed of 62 places in 171 ms of which 1 ms to minimize.
[2022-05-17 22:06:08] [INFO ] Deduced a trap composed of 121 places in 178 ms of which 0 ms to minimize.
[2022-05-17 22:06:08] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 0 ms to minimize.
[2022-05-17 22:06:08] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 1 ms to minimize.
[2022-05-17 22:06:08] [INFO ] Deduced a trap composed of 78 places in 171 ms of which 1 ms to minimize.
[2022-05-17 22:06:09] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 0 ms to minimize.
[2022-05-17 22:06:09] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 0 ms to minimize.
[2022-05-17 22:06:09] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 1 ms to minimize.
[2022-05-17 22:06:09] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 0 ms to minimize.
[2022-05-17 22:06:09] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 0 ms to minimize.
[2022-05-17 22:06:10] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 0 ms to minimize.
[2022-05-17 22:06:10] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 0 ms to minimize.
[2022-05-17 22:06:10] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 1 ms to minimize.
[2022-05-17 22:06:10] [INFO ] Deduced a trap composed of 52 places in 152 ms of which 0 ms to minimize.
[2022-05-17 22:06:10] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 0 ms to minimize.
[2022-05-17 22:06:11] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 0 ms to minimize.
[2022-05-17 22:06:11] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 0 ms to minimize.
[2022-05-17 22:06:11] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 0 ms to minimize.
[2022-05-17 22:06:11] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 1 ms to minimize.
[2022-05-17 22:06:11] [INFO ] Deduced a trap composed of 69 places in 135 ms of which 0 ms to minimize.
[2022-05-17 22:06:12] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 1 ms to minimize.
[2022-05-17 22:06:12] [INFO ] Deduced a trap composed of 69 places in 131 ms of which 0 ms to minimize.
[2022-05-17 22:06:12] [INFO ] Deduced a trap composed of 60 places in 128 ms of which 0 ms to minimize.
[2022-05-17 22:06:12] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 1 ms to minimize.
[2022-05-17 22:06:12] [INFO ] Deduced a trap composed of 75 places in 153 ms of which 0 ms to minimize.
[2022-05-17 22:06:12] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 0 ms to minimize.
[2022-05-17 22:06:13] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 1 ms to minimize.
[2022-05-17 22:06:13] [INFO ] Deduced a trap composed of 69 places in 152 ms of which 1 ms to minimize.
[2022-05-17 22:06:13] [INFO ] Deduced a trap composed of 117 places in 153 ms of which 0 ms to minimize.
[2022-05-17 22:06:13] [INFO ] Deduced a trap composed of 69 places in 149 ms of which 0 ms to minimize.
[2022-05-17 22:06:13] [INFO ] Deduced a trap composed of 69 places in 152 ms of which 1 ms to minimize.
[2022-05-17 22:06:14] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 1 ms to minimize.
[2022-05-17 22:06:14] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 0 ms to minimize.
[2022-05-17 22:06:14] [INFO ] Deduced a trap composed of 62 places in 159 ms of which 1 ms to minimize.
[2022-05-17 22:06:14] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 0 ms to minimize.
[2022-05-17 22:06:14] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 1 ms to minimize.
[2022-05-17 22:06:15] [INFO ] Deduced a trap composed of 67 places in 162 ms of which 0 ms to minimize.
[2022-05-17 22:06:15] [INFO ] Deduced a trap composed of 59 places in 143 ms of which 1 ms to minimize.
[2022-05-17 22:06:15] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 1 ms to minimize.
[2022-05-17 22:06:15] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 0 ms to minimize.
[2022-05-17 22:06:15] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 1 ms to minimize.
[2022-05-17 22:06:16] [INFO ] Deduced a trap composed of 63 places in 145 ms of which 1 ms to minimize.
[2022-05-17 22:06:16] [INFO ] Deduced a trap composed of 71 places in 142 ms of which 0 ms to minimize.
[2022-05-17 22:06:16] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 0 ms to minimize.
[2022-05-17 22:06:16] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 0 ms to minimize.
[2022-05-17 22:06:16] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 0 ms to minimize.
[2022-05-17 22:06:17] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 1 ms to minimize.
[2022-05-17 22:06:17] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 0 ms to minimize.
[2022-05-17 22:06:17] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 0 ms to minimize.
[2022-05-17 22:06:17] [INFO ] Deduced a trap composed of 57 places in 147 ms of which 1 ms to minimize.
[2022-05-17 22:06:17] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 0 ms to minimize.
[2022-05-17 22:06:17] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 0 ms to minimize.
[2022-05-17 22:06:18] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 1 ms to minimize.
[2022-05-17 22:06:18] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 0 ms to minimize.
[2022-05-17 22:06:18] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 1 ms to minimize.
[2022-05-17 22:06:18] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 1 ms to minimize.
[2022-05-17 22:06:18] [INFO ] Deduced a trap composed of 100 places in 134 ms of which 1 ms to minimize.
[2022-05-17 22:06:19] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 0 ms to minimize.
[2022-05-17 22:06:19] [INFO ] Deduced a trap composed of 69 places in 161 ms of which 0 ms to minimize.
[2022-05-17 22:06:19] [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) : [8] Max seen :[1]
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 18 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 592/592 places, 1704/1704 transitions.
Starting structural reductions, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 18 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2022-05-17 22:06:19] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 22:06:19] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 22:06:19] [INFO ] Implicit Places using invariants in 273 ms returned []
[2022-05-17 22:06:19] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 22:06:19] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 22:06:19] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:06:23] [INFO ] Implicit Places using invariants and state equation in 4071 ms returned []
Implicit Place search using SMT with State Equation took 4345 ms to find 0 implicit places.
[2022-05-17 22:06:23] [INFO ] Redundant transitions in 30 ms returned []
[2022-05-17 22:06:23] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 22:06:23] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 22:06:24] [INFO ] Dead Transitions using invariants and state equation in 504 ms returned []
Finished structural reductions, in 1 iterations. Remains : 592/592 places, 1704/1704 transitions.
Ending property specific reduction for Peterson-COL-7-UpperBounds-07 in 58902 ms.
Starting property specific reduction for Peterson-COL-7-UpperBounds-08
Normalized transition count is 1872 out of 2208 initially.
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 22:06:24] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :1
[2022-05-17 22:06:24] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 22:06:24] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-17 22:06:24] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2022-05-17 22:06:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:06:24] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2022-05-17 22:06:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:06:25] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 22:06:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:06:25] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2022-05-17 22:06:25] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:06:25] [INFO ] [Nat]Added 546 Read/Feed constraints in 96 ms returned sat
[2022-05-17 22:06:25] [INFO ] Deduced a trap composed of 17 places in 356 ms of which 1 ms to minimize.
[2022-05-17 22:06:26] [INFO ] Deduced a trap composed of 32 places in 374 ms of which 1 ms to minimize.
[2022-05-17 22:06:26] [INFO ] Deduced a trap composed of 15 places in 362 ms of which 0 ms to minimize.
[2022-05-17 22:06:27] [INFO ] Deduced a trap composed of 141 places in 355 ms of which 1 ms to minimize.
[2022-05-17 22:06:27] [INFO ] Deduced a trap composed of 131 places in 372 ms of which 1 ms to minimize.
[2022-05-17 22:06:28] [INFO ] Deduced a trap composed of 50 places in 361 ms of which 1 ms to minimize.
[2022-05-17 22:06:28] [INFO ] Deduced a trap composed of 145 places in 353 ms of which 1 ms to minimize.
[2022-05-17 22:06:28] [INFO ] Deduced a trap composed of 122 places in 360 ms of which 1 ms to minimize.
[2022-05-17 22:06:29] [INFO ] Deduced a trap composed of 35 places in 345 ms of which 1 ms to minimize.
[2022-05-17 22:06:29] [INFO ] Deduced a trap composed of 33 places in 352 ms of which 1 ms to minimize.
[2022-05-17 22:06:30] [INFO ] Deduced a trap composed of 23 places in 343 ms of which 1 ms to minimize.
[2022-05-17 22:06:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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) : [8] Max seen :[1]
Support contains 8 out of 1096 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 1096 transition count 2103
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 991 transition count 2103
Performed 343 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 343 Pre rules applied. Total rules applied 210 place count 991 transition count 1760
Deduced a syphon composed of 343 places in 1 ms
Reduce places removed 343 places and 0 transitions.
Iterating global reduction 2 with 686 rules applied. Total rules applied 896 place count 648 transition count 1760
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 1008 place count 592 transition count 1704
Applied a total of 1008 rules in 62 ms. Remains 592 /1096 variables (removed 504) and now considering 1704/2208 (removed 504) transitions.
Finished structural reductions, in 1 iterations. Remains : 592/1096 places, 1704/2208 transitions.
Normalized transition count is 1368 out of 1704 initially.
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 22:06:30] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2023 ms. (steps per millisecond=494 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 633 ms. (steps per millisecond=1579 ) properties (out of 1) seen :1
[2022-05-17 22:06:32] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 22:06:32] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 22:06:32] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2022-05-17 22:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:06:33] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2022-05-17 22:06:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:06:33] [INFO ] [Nat]Absence check using 23 positive place invariants in 9 ms returned sat
[2022-05-17 22:06:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:06:33] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2022-05-17 22:06:33] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:06:33] [INFO ] [Nat]Added 546 Read/Feed constraints in 60 ms returned sat
[2022-05-17 22:06:33] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 0 ms to minimize.
[2022-05-17 22:06:33] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 0 ms to minimize.
[2022-05-17 22:06:34] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 1 ms to minimize.
[2022-05-17 22:06:34] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 1 ms to minimize.
[2022-05-17 22:06:34] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 0 ms to minimize.
[2022-05-17 22:06:34] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 0 ms to minimize.
[2022-05-17 22:06:34] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 1 ms to minimize.
[2022-05-17 22:06:35] [INFO ] Deduced a trap composed of 90 places in 159 ms of which 1 ms to minimize.
[2022-05-17 22:06:35] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 0 ms to minimize.
[2022-05-17 22:06:35] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 1 ms to minimize.
[2022-05-17 22:06:35] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 1 ms to minimize.
[2022-05-17 22:06:35] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 0 ms to minimize.
[2022-05-17 22:06:36] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 1 ms to minimize.
[2022-05-17 22:06:36] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 1 ms to minimize.
[2022-05-17 22:06:36] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 1 ms to minimize.
[2022-05-17 22:06:36] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 0 ms to minimize.
[2022-05-17 22:06:36] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 1 ms to minimize.
[2022-05-17 22:06:37] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 0 ms to minimize.
[2022-05-17 22:06:37] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 1 ms to minimize.
[2022-05-17 22:06:37] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 0 ms to minimize.
[2022-05-17 22:06:37] [INFO ] Deduced a trap composed of 93 places in 164 ms of which 1 ms to minimize.
[2022-05-17 22:06:38] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 0 ms to minimize.
[2022-05-17 22:06:38] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 0 ms to minimize.
[2022-05-17 22:06:38] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 1 ms to minimize.
[2022-05-17 22:06:38] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 1 ms to minimize.
[2022-05-17 22:06:38] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 0 ms to minimize.
[2022-05-17 22:06:39] [INFO ] Deduced a trap composed of 115 places in 164 ms of which 1 ms to minimize.
[2022-05-17 22:06:39] [INFO ] Deduced a trap composed of 53 places in 163 ms of which 1 ms to minimize.
[2022-05-17 22:06:39] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 1 ms to minimize.
[2022-05-17 22:06:39] [INFO ] Deduced a trap composed of 59 places in 163 ms of which 0 ms to minimize.
[2022-05-17 22:06:39] [INFO ] Deduced a trap composed of 56 places in 159 ms of which 1 ms to minimize.
[2022-05-17 22:06:40] [INFO ] Deduced a trap composed of 48 places in 174 ms of which 0 ms to minimize.
[2022-05-17 22:06:40] [INFO ] Deduced a trap composed of 59 places in 160 ms of which 0 ms to minimize.
[2022-05-17 22:06:40] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 0 ms to minimize.
[2022-05-17 22:06:40] [INFO ] Deduced a trap composed of 84 places in 177 ms of which 0 ms to minimize.
[2022-05-17 22:06:40] [INFO ] Deduced a trap composed of 64 places in 201 ms of which 0 ms to minimize.
[2022-05-17 22:06:41] [INFO ] Deduced a trap composed of 59 places in 170 ms of which 0 ms to minimize.
[2022-05-17 22:06:41] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 0 ms to minimize.
[2022-05-17 22:06:41] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 0 ms to minimize.
[2022-05-17 22:06:41] [INFO ] Deduced a trap composed of 79 places in 148 ms of which 1 ms to minimize.
[2022-05-17 22:06:41] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 0 ms to minimize.
[2022-05-17 22:06:42] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 0 ms to minimize.
[2022-05-17 22:06:42] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 0 ms to minimize.
[2022-05-17 22:06:42] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 1 ms to minimize.
[2022-05-17 22:06:42] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 1 ms to minimize.
[2022-05-17 22:06:42] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 0 ms to minimize.
[2022-05-17 22:06:43] [INFO ] Deduced a trap composed of 69 places in 159 ms of which 1 ms to minimize.
[2022-05-17 22:06:43] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 1 ms to minimize.
[2022-05-17 22:06:43] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 1 ms to minimize.
[2022-05-17 22:06:43] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 1 ms to minimize.
[2022-05-17 22:06:43] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 0 ms to minimize.
[2022-05-17 22:06:44] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 0 ms to minimize.
[2022-05-17 22:06:44] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 0 ms to minimize.
[2022-05-17 22:06:44] [INFO ] Deduced a trap composed of 77 places in 153 ms of which 1 ms to minimize.
[2022-05-17 22:06:44] [INFO ] Deduced a trap composed of 62 places in 150 ms of which 0 ms to minimize.
[2022-05-17 22:06:44] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 1 ms to minimize.
[2022-05-17 22:06:45] [INFO ] Deduced a trap composed of 74 places in 160 ms of which 1 ms to minimize.
[2022-05-17 22:06:45] [INFO ] Deduced a trap composed of 64 places in 156 ms of which 0 ms to minimize.
[2022-05-17 22:06:45] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 1 ms to minimize.
[2022-05-17 22:06:45] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 1 ms to minimize.
[2022-05-17 22:06:45] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 1 ms to minimize.
[2022-05-17 22:06:46] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 1 ms to minimize.
[2022-05-17 22:06:46] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 1 ms to minimize.
[2022-05-17 22:06:46] [INFO ] Deduced a trap composed of 68 places in 163 ms of which 0 ms to minimize.
[2022-05-17 22:06:46] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 1 ms to minimize.
[2022-05-17 22:06:46] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 0 ms to minimize.
[2022-05-17 22:06:47] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 1 ms to minimize.
[2022-05-17 22:06:47] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 1 ms to minimize.
[2022-05-17 22:06:47] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 0 ms to minimize.
[2022-05-17 22:06:47] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 1 ms to minimize.
[2022-05-17 22:06:47] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 0 ms to minimize.
[2022-05-17 22:06:47] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 1 ms to minimize.
[2022-05-17 22:06:48] [INFO ] Deduced a trap composed of 78 places in 157 ms of which 0 ms to minimize.
[2022-05-17 22:06:48] [INFO ] Deduced a trap composed of 62 places in 160 ms of which 1 ms to minimize.
[2022-05-17 22:06:48] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 0 ms to minimize.
[2022-05-17 22:06:48] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 0 ms to minimize.
[2022-05-17 22:06:49] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 0 ms to minimize.
[2022-05-17 22:06:49] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 1 ms to minimize.
[2022-05-17 22:06:49] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 0 ms to minimize.
[2022-05-17 22:06:49] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 0 ms to minimize.
[2022-05-17 22:06:49] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 1 ms to minimize.
[2022-05-17 22:06:50] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 1 ms to minimize.
[2022-05-17 22:06:50] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 0 ms to minimize.
[2022-05-17 22:06:50] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 0 ms to minimize.
[2022-05-17 22:06:50] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 1 ms to minimize.
[2022-05-17 22:06:51] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 1 ms to minimize.
[2022-05-17 22:06:51] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 0 ms to minimize.
[2022-05-17 22:06:51] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 0 ms to minimize.
[2022-05-17 22:06:51] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 0 ms to minimize.
[2022-05-17 22:06:51] [INFO ] Deduced a trap composed of 67 places in 157 ms of which 0 ms to minimize.
[2022-05-17 22:06:52] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 1 ms to minimize.
[2022-05-17 22:06:52] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 0 ms to minimize.
[2022-05-17 22:06:52] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 0 ms to minimize.
[2022-05-17 22:06:52] [INFO ] Deduced a trap composed of 54 places in 172 ms of which 1 ms to minimize.
[2022-05-17 22:06:52] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 1 ms to minimize.
[2022-05-17 22:06:53] [INFO ] Deduced a trap composed of 70 places in 161 ms of which 0 ms to minimize.
[2022-05-17 22:06:53] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 0 ms to minimize.
[2022-05-17 22:06:53] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 0 ms to minimize.
[2022-05-17 22:06:53] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 0 ms to minimize.
[2022-05-17 22:06:53] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 1 ms to minimize.
[2022-05-17 22:06:54] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 0 ms to minimize.
[2022-05-17 22:06:54] [INFO ] Deduced a trap composed of 69 places in 159 ms of which 0 ms to minimize.
[2022-05-17 22:06:54] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 0 ms to minimize.
[2022-05-17 22:06:54] [INFO ] Deduced a trap composed of 56 places in 135 ms of which 0 ms to minimize.
[2022-05-17 22:06:55] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 0 ms to minimize.
[2022-05-17 22:06:55] [INFO ] Deduced a trap composed of 47 places in 151 ms of which 1 ms to minimize.
[2022-05-17 22:06:55] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 0 ms to minimize.
[2022-05-17 22:06:55] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 0 ms to minimize.
[2022-05-17 22:06:55] [INFO ] Deduced a trap composed of 75 places in 145 ms of which 1 ms to minimize.
[2022-05-17 22:06:56] [INFO ] Deduced a trap composed of 69 places in 145 ms of which 0 ms to minimize.
[2022-05-17 22:06:56] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 1 ms to minimize.
[2022-05-17 22:06:56] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 0 ms to minimize.
[2022-05-17 22:06:56] [INFO ] Deduced a trap composed of 104 places in 150 ms of which 0 ms to minimize.
[2022-05-17 22:06:56] [INFO ] Deduced a trap composed of 124 places in 152 ms of which 0 ms to minimize.
[2022-05-17 22:06:57] [INFO ] Deduced a trap composed of 67 places in 162 ms of which 1 ms to minimize.
[2022-05-17 22:06:57] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 0 ms to minimize.
[2022-05-17 22:06:57] [INFO ] Deduced a trap composed of 60 places in 153 ms of which 1 ms to minimize.
[2022-05-17 22:06:57] [INFO ] Deduced a trap composed of 108 places in 160 ms of which 1 ms to minimize.
[2022-05-17 22:06:57] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 0 ms to minimize.
[2022-05-17 22:06:57] [INFO ] Deduced a trap composed of 83 places in 151 ms of which 0 ms to minimize.
[2022-05-17 22:06:58] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 0 ms to minimize.
[2022-05-17 22:06:58] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 0 ms to minimize.
[2022-05-17 22:06:58] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 0 ms to minimize.
[2022-05-17 22:06:58] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 0 ms to minimize.
[2022-05-17 22:06:58] [INFO ] Deduced a trap composed of 72 places in 148 ms of which 1 ms to minimize.
[2022-05-17 22:06:59] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 0 ms to minimize.
[2022-05-17 22:06:59] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 0 ms to minimize.
[2022-05-17 22:06:59] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 0 ms to minimize.
[2022-05-17 22:06:59] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 0 ms to minimize.
[2022-05-17 22:06:59] [INFO ] Deduced a trap composed of 74 places in 171 ms of which 1 ms to minimize.
[2022-05-17 22:07:00] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 1 ms to minimize.
[2022-05-17 22:07:00] [INFO ] Deduced a trap composed of 88 places in 191 ms of which 0 ms to minimize.
[2022-05-17 22:07:00] [INFO ] Deduced a trap composed of 69 places in 186 ms of which 0 ms to minimize.
[2022-05-17 22:07:00] [INFO ] Deduced a trap composed of 62 places in 188 ms of which 1 ms to minimize.
[2022-05-17 22:07:01] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 0 ms to minimize.
[2022-05-17 22:07:01] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 0 ms to minimize.
[2022-05-17 22:07:01] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 0 ms to minimize.
[2022-05-17 22:07:01] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 0 ms to minimize.
[2022-05-17 22:07:01] [INFO ] Deduced a trap composed of 59 places in 178 ms of which 1 ms to minimize.
[2022-05-17 22:07:02] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 1 ms to minimize.
[2022-05-17 22:07:02] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 1 ms to minimize.
[2022-05-17 22:07:02] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 0 ms to minimize.
[2022-05-17 22:07:02] [INFO ] Deduced a trap composed of 71 places in 162 ms of which 1 ms to minimize.
[2022-05-17 22:07:03] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 1 ms to minimize.
[2022-05-17 22:07:03] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 0 ms to minimize.
[2022-05-17 22:07:03] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 1 ms to minimize.
[2022-05-17 22:07:03] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 1 ms to minimize.
[2022-05-17 22:07:03] [INFO ] Deduced a trap composed of 69 places in 161 ms of which 1 ms to minimize.
[2022-05-17 22:07:04] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 1 ms to minimize.
[2022-05-17 22:07:04] [INFO ] Deduced a trap composed of 94 places in 170 ms of which 1 ms to minimize.
[2022-05-17 22:07:04] [INFO ] Deduced a trap composed of 56 places in 157 ms of which 1 ms to minimize.
[2022-05-17 22:07:04] [INFO ] Deduced a trap composed of 53 places in 145 ms of which 0 ms to minimize.
[2022-05-17 22:07:04] [INFO ] Deduced a trap composed of 56 places in 170 ms of which 0 ms to minimize.
[2022-05-17 22:07:05] [INFO ] Deduced a trap composed of 62 places in 166 ms of which 1 ms to minimize.
[2022-05-17 22:07:05] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 0 ms to minimize.
[2022-05-17 22:07:05] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 0 ms to minimize.
[2022-05-17 22:07:05] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 1 ms to minimize.
[2022-05-17 22:07:05] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 0 ms to minimize.
[2022-05-17 22:07:06] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 1 ms to minimize.
[2022-05-17 22:07:06] [INFO ] Deduced a trap composed of 62 places in 174 ms of which 0 ms to minimize.
[2022-05-17 22:07:06] [INFO ] Deduced a trap composed of 121 places in 177 ms of which 0 ms to minimize.
[2022-05-17 22:07:06] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 1 ms to minimize.
[2022-05-17 22:07:07] [INFO ] Deduced a trap composed of 54 places in 170 ms of which 0 ms to minimize.
[2022-05-17 22:07:07] [INFO ] Deduced a trap composed of 78 places in 168 ms of which 1 ms to minimize.
[2022-05-17 22:07:07] [INFO ] Deduced a trap composed of 64 places in 184 ms of which 0 ms to minimize.
[2022-05-17 22:07:07] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 0 ms to minimize.
[2022-05-17 22:07:07] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 0 ms to minimize.
[2022-05-17 22:07:08] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 1 ms to minimize.
[2022-05-17 22:07:08] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 0 ms to minimize.
[2022-05-17 22:07:08] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 0 ms to minimize.
[2022-05-17 22:07:08] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 0 ms to minimize.
[2022-05-17 22:07:08] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 0 ms to minimize.
[2022-05-17 22:07:09] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 0 ms to minimize.
[2022-05-17 22:07:09] [INFO ] Deduced a trap composed of 50 places in 175 ms of which 0 ms to minimize.
[2022-05-17 22:07:09] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 0 ms to minimize.
[2022-05-17 22:07:09] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 1 ms to minimize.
[2022-05-17 22:07:09] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 0 ms to minimize.
[2022-05-17 22:07:10] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 0 ms to minimize.
[2022-05-17 22:07:10] [INFO ] Deduced a trap composed of 69 places in 147 ms of which 1 ms to minimize.
[2022-05-17 22:07:10] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 0 ms to minimize.
[2022-05-17 22:07:10] [INFO ] Deduced a trap composed of 69 places in 137 ms of which 0 ms to minimize.
[2022-05-17 22:07:10] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 0 ms to minimize.
[2022-05-17 22:07:11] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 0 ms to minimize.
[2022-05-17 22:07:11] [INFO ] Deduced a trap composed of 75 places in 164 ms of which 0 ms to minimize.
[2022-05-17 22:07:11] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 0 ms to minimize.
[2022-05-17 22:07:11] [INFO ] Deduced a trap composed of 50 places in 161 ms of which 0 ms to minimize.
[2022-05-17 22:07:11] [INFO ] Deduced a trap composed of 69 places in 163 ms of which 1 ms to minimize.
[2022-05-17 22:07:12] [INFO ] Deduced a trap composed of 117 places in 162 ms of which 0 ms to minimize.
[2022-05-17 22:07:12] [INFO ] Deduced a trap composed of 69 places in 162 ms of which 0 ms to minimize.
[2022-05-17 22:07:12] [INFO ] Deduced a trap composed of 69 places in 164 ms of which 0 ms to minimize.
[2022-05-17 22:07:12] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 0 ms to minimize.
[2022-05-17 22:07:12] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 0 ms to minimize.
[2022-05-17 22:07:13] [INFO ] Deduced a trap composed of 62 places in 175 ms of which 0 ms to minimize.
[2022-05-17 22:07:13] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 1 ms to minimize.
[2022-05-17 22:07:13] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 0 ms to minimize.
[2022-05-17 22:07:13] [INFO ] Deduced a trap composed of 67 places in 167 ms of which 0 ms to minimize.
[2022-05-17 22:07:13] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 0 ms to minimize.
[2022-05-17 22:07:14] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 1 ms to minimize.
[2022-05-17 22:07:14] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 0 ms to minimize.
[2022-05-17 22:07:14] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 1 ms to minimize.
[2022-05-17 22:07:14] [INFO ] Deduced a trap composed of 63 places in 148 ms of which 0 ms to minimize.
[2022-05-17 22:07:14] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 0 ms to minimize.
[2022-05-17 22:07:15] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 0 ms to minimize.
[2022-05-17 22:07:15] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 0 ms to minimize.
[2022-05-17 22:07:15] [INFO ] Deduced a trap composed of 47 places in 160 ms of which 0 ms to minimize.
[2022-05-17 22:07:15] [INFO ] Deduced a trap composed of 66 places in 137 ms of which 0 ms to minimize.
[2022-05-17 22:07:15] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 0 ms to minimize.
[2022-05-17 22:07:16] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 0 ms to minimize.
[2022-05-17 22:07:16] [INFO ] Deduced a trap composed of 57 places in 154 ms of which 0 ms to minimize.
[2022-05-17 22:07:16] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 0 ms to minimize.
[2022-05-17 22:07:16] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 0 ms to minimize.
[2022-05-17 22:07:16] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 0 ms to minimize.
[2022-05-17 22:07:17] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 0 ms to minimize.
[2022-05-17 22:07:17] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 1 ms to minimize.
[2022-05-17 22:07:17] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 1 ms to minimize.
[2022-05-17 22:07:17] [INFO ] Deduced a trap composed of 100 places in 139 ms of which 1 ms to minimize.
[2022-05-17 22:07:17] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 0 ms to minimize.
[2022-05-17 22:07:18] [INFO ] Deduced a trap composed of 69 places in 157 ms of which 1 ms to minimize.
[2022-05-17 22:07:18] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 0 ms to minimize.
[2022-05-17 22:07:18] [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) : [8] Max seen :[1]
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 18 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 592/592 places, 1704/1704 transitions.
Starting structural reductions, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 18 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2022-05-17 22:07:18] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 22:07:18] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 22:07:18] [INFO ] Implicit Places using invariants in 286 ms returned []
[2022-05-17 22:07:18] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 22:07:18] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 22:07:18] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:07:22] [INFO ] Implicit Places using invariants and state equation in 4022 ms returned []
Implicit Place search using SMT with State Equation took 4310 ms to find 0 implicit places.
[2022-05-17 22:07:22] [INFO ] Redundant transitions in 32 ms returned []
[2022-05-17 22:07:22] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 22:07:22] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 22:07:23] [INFO ] Dead Transitions using invariants and state equation in 485 ms returned []
Finished structural reductions, in 1 iterations. Remains : 592/592 places, 1704/1704 transitions.
Ending property specific reduction for Peterson-COL-7-UpperBounds-08 in 58905 ms.
Starting property specific reduction for Peterson-COL-7-UpperBounds-12
Normalized transition count is 1872 out of 2208 initially.
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 22:07:23] [INFO ] Computed 23 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :4
[2022-05-17 22:07:23] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 22:07:23] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-17 22:07:23] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 22:07:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:07:23] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2022-05-17 22:07:24] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:07:24] [INFO ] [Real]Added 546 Read/Feed constraints in 85 ms returned sat
[2022-05-17 22:07:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:07:24] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 22:07:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:07:24] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2022-05-17 22:07:24] [INFO ] [Nat]Added 546 Read/Feed constraints in 90 ms returned sat
[2022-05-17 22:07:25] [INFO ] Deduced a trap composed of 63 places in 383 ms of which 1 ms to minimize.
[2022-05-17 22:07:25] [INFO ] Deduced a trap composed of 67 places in 391 ms of which 1 ms to minimize.
[2022-05-17 22:07:26] [INFO ] Deduced a trap composed of 51 places in 390 ms of which 1 ms to minimize.
[2022-05-17 22:07:26] [INFO ] Deduced a trap composed of 65 places in 388 ms of which 1 ms to minimize.
[2022-05-17 22:07:27] [INFO ] Deduced a trap composed of 79 places in 392 ms of which 1 ms to minimize.
[2022-05-17 22:07:27] [INFO ] Deduced a trap composed of 65 places in 391 ms of which 1 ms to minimize.
[2022-05-17 22:07:27] [INFO ] Deduced a trap composed of 50 places in 392 ms of which 1 ms to minimize.
[2022-05-17 22:07:28] [INFO ] Deduced a trap composed of 57 places in 380 ms of which 1 ms to minimize.
[2022-05-17 22:07:28] [INFO ] Deduced a trap composed of 49 places in 388 ms of which 1 ms to minimize.
[2022-05-17 22:07:29] [INFO ] Deduced a trap composed of 95 places in 385 ms of which 1 ms to minimize.
[2022-05-17 22:07:29] [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) : [448] Max seen :[4]
Support contains 448 out of 1096 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 1096 transition count 2200
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1088 transition count 2200
Applied a total of 16 rules in 28 ms. Remains 1088 /1096 variables (removed 8) and now considering 2200/2208 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1096 places, 2200/2208 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:07:29] [INFO ] Computed 23 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9113 ms. (steps per millisecond=109 ) properties (out of 1) seen :7
Interrupted Best-First random walk after 641314 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=128 ) properties seen :{0=1}
[2022-05-17 22:07:43] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:07:43] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-17 22:07:43] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2022-05-17 22:07:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:07:43] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2022-05-17 22:07:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:07:44] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2022-05-17 22:07:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:07:44] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2022-05-17 22:07:44] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:07:44] [INFO ] [Nat]Added 546 Read/Feed constraints in 125 ms returned sat
[2022-05-17 22:07:45] [INFO ] Deduced a trap composed of 102 places in 423 ms of which 1 ms to minimize.
[2022-05-17 22:07:45] [INFO ] Deduced a trap composed of 41 places in 414 ms of which 1 ms to minimize.
[2022-05-17 22:07:46] [INFO ] Deduced a trap composed of 66 places in 419 ms of which 1 ms to minimize.
[2022-05-17 22:07:46] [INFO ] Deduced a trap composed of 123 places in 455 ms of which 0 ms to minimize.
[2022-05-17 22:07:47] [INFO ] Deduced a trap composed of 66 places in 414 ms of which 0 ms to minimize.
[2022-05-17 22:07:47] [INFO ] Deduced a trap composed of 103 places in 423 ms of which 0 ms to minimize.
[2022-05-17 22:07:48] [INFO ] Deduced a trap composed of 49 places in 412 ms of which 1 ms to minimize.
[2022-05-17 22:07:48] [INFO ] Deduced a trap composed of 13 places in 421 ms of which 1 ms to minimize.
[2022-05-17 22:07:49] [INFO ] Deduced a trap composed of 111 places in 412 ms of which 1 ms to minimize.
[2022-05-17 22:07:49] [INFO ] Deduced a trap composed of 45 places in 411 ms of which 1 ms to minimize.
[2022-05-17 22:07:49] [INFO ] Deduced a trap composed of 39 places in 412 ms of which 1 ms to minimize.
[2022-05-17 22:07:50] [INFO ] Deduced a trap composed of 55 places in 418 ms of which 0 ms to minimize.
[2022-05-17 22:07:50] [INFO ] Deduced a trap composed of 96 places in 415 ms of which 0 ms to minimize.
[2022-05-17 22:07:51] [INFO ] Deduced a trap composed of 37 places in 408 ms of which 1 ms to minimize.
[2022-05-17 22:07:51] [INFO ] Deduced a trap composed of 21 places in 409 ms of which 1 ms to minimize.
[2022-05-17 22:07:52] [INFO ] Deduced a trap composed of 104 places in 453 ms of which 1 ms to minimize.
[2022-05-17 22:07:52] [INFO ] Deduced a trap composed of 134 places in 411 ms of which 1 ms to minimize.
[2022-05-17 22:07:53] [INFO ] Deduced a trap composed of 49 places in 408 ms of which 1 ms to minimize.
[2022-05-17 22:07:53] [INFO ] Deduced a trap composed of 21 places in 417 ms of which 1 ms to minimize.
[2022-05-17 22:07:54] [INFO ] Deduced a trap composed of 40 places in 419 ms of which 1 ms to minimize.
[2022-05-17 22:07:54] [INFO ] Deduced a trap composed of 52 places in 414 ms of which 1 ms to minimize.
[2022-05-17 22:07:55] [INFO ] Deduced a trap composed of 43 places in 424 ms of which 1 ms to minimize.
[2022-05-17 22:07:55] [INFO ] Deduced a trap composed of 71 places in 384 ms of which 1 ms to minimize.
[2022-05-17 22:07:56] [INFO ] Deduced a trap composed of 75 places in 374 ms of which 1 ms to minimize.
[2022-05-17 22:07:56] [INFO ] Deduced a trap composed of 107 places in 369 ms of which 1 ms to minimize.
[2022-05-17 22:07:57] [INFO ] Deduced a trap composed of 105 places in 363 ms of which 1 ms to minimize.
[2022-05-17 22:07:57] [INFO ] Deduced a trap composed of 90 places in 381 ms of which 1 ms to minimize.
[2022-05-17 22:07:57] [INFO ] Deduced a trap composed of 82 places in 380 ms of which 1 ms to minimize.
[2022-05-17 22:07:58] [INFO ] Deduced a trap composed of 120 places in 376 ms of which 1 ms to minimize.
[2022-05-17 22:07:58] [INFO ] Deduced a trap composed of 161 places in 401 ms of which 1 ms to minimize.
[2022-05-17 22:07:59] [INFO ] Deduced a trap composed of 121 places in 391 ms of which 1 ms to minimize.
[2022-05-17 22:07:59] [INFO ] Deduced a trap composed of 73 places in 387 ms of which 1 ms to minimize.
[2022-05-17 22:08:00] [INFO ] Deduced a trap composed of 114 places in 391 ms of which 1 ms to minimize.
[2022-05-17 22:08:00] [INFO ] Deduced a trap composed of 81 places in 388 ms of which 1 ms to minimize.
[2022-05-17 22:08:01] [INFO ] Deduced a trap composed of 86 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:08:01] [INFO ] Deduced a trap composed of 95 places in 395 ms of which 1 ms to minimize.
[2022-05-17 22:08:02] [INFO ] Deduced a trap composed of 98 places in 384 ms of which 0 ms to minimize.
[2022-05-17 22:08:02] [INFO ] Deduced a trap composed of 133 places in 386 ms of which 1 ms to minimize.
[2022-05-17 22:08:02] [INFO ] Deduced a trap composed of 177 places in 375 ms of which 1 ms to minimize.
[2022-05-17 22:08:03] [INFO ] Deduced a trap composed of 142 places in 367 ms of which 1 ms to minimize.
[2022-05-17 22:08:03] [INFO ] Deduced a trap composed of 134 places in 365 ms of which 1 ms to minimize.
[2022-05-17 22:08:04] [INFO ] Deduced a trap composed of 117 places in 363 ms of which 0 ms to minimize.
[2022-05-17 22:08:04] [INFO ] Deduced a trap composed of 115 places in 375 ms of which 1 ms to minimize.
[2022-05-17 22:08:05] [INFO ] Deduced a trap composed of 95 places in 393 ms of which 1 ms to minimize.
[2022-05-17 22:08:05] [INFO ] Deduced a trap composed of 89 places in 367 ms of which 1 ms to minimize.
[2022-05-17 22:08:05] [INFO ] Deduced a trap composed of 129 places in 390 ms of which 1 ms to minimize.
[2022-05-17 22:08:06] [INFO ] Deduced a trap composed of 71 places in 385 ms of which 1 ms to minimize.
[2022-05-17 22:08:06] [INFO ] Deduced a trap composed of 65 places in 424 ms of which 1 ms to minimize.
[2022-05-17 22:08:07] [INFO ] Deduced a trap composed of 92 places in 410 ms of which 1 ms to minimize.
[2022-05-17 22:08:07] [INFO ] Deduced a trap composed of 63 places in 409 ms of which 1 ms to minimize.
[2022-05-17 22:08:08] [INFO ] Deduced a trap composed of 114 places in 409 ms of which 0 ms to minimize.
[2022-05-17 22:08:08] [INFO ] Deduced a trap composed of 63 places in 419 ms of which 1 ms to minimize.
[2022-05-17 22:08:09] [INFO ] Deduced a trap composed of 66 places in 388 ms of which 1 ms to minimize.
[2022-05-17 22:08:09] [INFO ] Deduced a trap composed of 78 places in 389 ms of which 1 ms to minimize.
[2022-05-17 22:08:10] [INFO ] Deduced a trap composed of 24 places in 376 ms of which 1 ms to minimize.
[2022-05-17 22:08:10] [INFO ] Deduced a trap composed of 21 places in 384 ms of which 1 ms to minimize.
[2022-05-17 22:08:11] [INFO ] Deduced a trap composed of 28 places in 395 ms of which 1 ms to minimize.
[2022-05-17 22:08:11] [INFO ] Deduced a trap composed of 28 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:08:11] [INFO ] Deduced a trap composed of 13 places in 382 ms of which 1 ms to minimize.
[2022-05-17 22:08:12] [INFO ] Deduced a trap composed of 13 places in 375 ms of which 1 ms to minimize.
[2022-05-17 22:08:12] [INFO ] Deduced a trap composed of 141 places in 371 ms of which 1 ms to minimize.
[2022-05-17 22:08:13] [INFO ] Deduced a trap composed of 59 places in 381 ms of which 1 ms to minimize.
[2022-05-17 22:08:13] [INFO ] Deduced a trap composed of 62 places in 380 ms of which 1 ms to minimize.
[2022-05-17 22:08:14] [INFO ] Deduced a trap composed of 80 places in 383 ms of which 1 ms to minimize.
[2022-05-17 22:08:14] [INFO ] Deduced a trap composed of 71 places in 381 ms of which 0 ms to minimize.
[2022-05-17 22:08:15] [INFO ] Deduced a trap composed of 70 places in 394 ms of which 1 ms to minimize.
[2022-05-17 22:08:15] [INFO ] Deduced a trap composed of 57 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:08:15] [INFO ] Deduced a trap composed of 172 places in 387 ms of which 0 ms to minimize.
[2022-05-17 22:08:16] [INFO ] Deduced a trap composed of 40 places in 377 ms of which 0 ms to minimize.
[2022-05-17 22:08:16] [INFO ] Deduced a trap composed of 38 places in 384 ms of which 1 ms to minimize.
[2022-05-17 22:08:17] [INFO ] Deduced a trap composed of 100 places in 379 ms of which 1 ms to minimize.
[2022-05-17 22:08:17] [INFO ] Deduced a trap composed of 106 places in 385 ms of which 0 ms to minimize.
[2022-05-17 22:08:18] [INFO ] Deduced a trap composed of 91 places in 380 ms of which 1 ms to minimize.
[2022-05-17 22:08:18] [INFO ] Deduced a trap composed of 90 places in 388 ms of which 1 ms to minimize.
[2022-05-17 22:08:19] [INFO ] Deduced a trap composed of 91 places in 374 ms of which 1 ms to minimize.
[2022-05-17 22:08:19] [INFO ] Deduced a trap composed of 92 places in 387 ms of which 1 ms to minimize.
[2022-05-17 22:08:19] [INFO ] Deduced a trap composed of 39 places in 399 ms of which 1 ms to minimize.
[2022-05-17 22:08:20] [INFO ] Deduced a trap composed of 123 places in 366 ms of which 1 ms to minimize.
[2022-05-17 22:08:20] [INFO ] Deduced a trap composed of 33 places in 366 ms of which 1 ms to minimize.
[2022-05-17 22:08:21] [INFO ] Deduced a trap composed of 153 places in 390 ms of which 1 ms to minimize.
[2022-05-17 22:08:21] [INFO ] Deduced a trap composed of 190 places in 390 ms of which 0 ms to minimize.
[2022-05-17 22:08:22] [INFO ] Deduced a trap composed of 53 places in 393 ms of which 1 ms to minimize.
[2022-05-17 22:08:22] [INFO ] Deduced a trap composed of 90 places in 380 ms of which 0 ms to minimize.
[2022-05-17 22:08:23] [INFO ] Deduced a trap composed of 94 places in 389 ms of which 1 ms to minimize.
[2022-05-17 22:08:23] [INFO ] Deduced a trap composed of 113 places in 370 ms of which 0 ms to minimize.
[2022-05-17 22:08:23] [INFO ] Deduced a trap composed of 134 places in 372 ms of which 1 ms to minimize.
[2022-05-17 22:08:24] [INFO ] Deduced a trap composed of 95 places in 338 ms of which 1 ms to minimize.
[2022-05-17 22:08:24] [INFO ] Deduced a trap composed of 73 places in 370 ms of which 1 ms to minimize.
[2022-05-17 22:08:25] [INFO ] Deduced a trap composed of 120 places in 379 ms of which 1 ms to minimize.
[2022-05-17 22:08:25] [INFO ] Deduced a trap composed of 75 places in 389 ms of which 0 ms to minimize.
[2022-05-17 22:08:26] [INFO ] Deduced a trap composed of 62 places in 377 ms of which 1 ms to minimize.
[2022-05-17 22:08:26] [INFO ] Deduced a trap composed of 91 places in 390 ms of which 1 ms to minimize.
[2022-05-17 22:08:26] [INFO ] Deduced a trap composed of 161 places in 311 ms of which 1 ms to minimize.
[2022-05-17 22:08:27] [INFO ] Deduced a trap composed of 134 places in 305 ms of which 1 ms to minimize.
[2022-05-17 22:08:27] [INFO ] Deduced a trap composed of 132 places in 305 ms of which 1 ms to minimize.
[2022-05-17 22:08:28] [INFO ] Deduced a trap composed of 95 places in 261 ms of which 1 ms to minimize.
[2022-05-17 22:08:28] [INFO ] Deduced a trap composed of 25 places in 400 ms of which 1 ms to minimize.
[2022-05-17 22:08:28] [INFO ] Deduced a trap composed of 126 places in 379 ms of which 1 ms to minimize.
[2022-05-17 22:08:29] [INFO ] Deduced a trap composed of 98 places in 370 ms of which 1 ms to minimize.
[2022-05-17 22:08:29] [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) : [448] Max seen :[7]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 23 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 20 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2022-05-17 22:08:29] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:08:29] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 22:08:29] [INFO ] Implicit Places using invariants in 357 ms returned []
[2022-05-17 22:08:29] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:08:29] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-17 22:08:30] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:08:36] [INFO ] Implicit Places using invariants and state equation in 6809 ms returned []
Implicit Place search using SMT with State Equation took 7167 ms to find 0 implicit places.
[2022-05-17 22:08:36] [INFO ] Redundant transitions in 42 ms returned []
[2022-05-17 22:08:36] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:08:36] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-17 22:08:37] [INFO ] Dead Transitions using invariants and state equation in 737 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:08:37] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9158 ms. (steps per millisecond=109 ) properties (out of 1) seen :6
Interrupted Best-First random walk after 665722 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=133 ) properties seen :{0=5}
[2022-05-17 22:08:51] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:08:51] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 22:08:51] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2022-05-17 22:08:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:08:52] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2022-05-17 22:08:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:08:52] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 22:08:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:08:52] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2022-05-17 22:08:52] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:08:52] [INFO ] [Nat]Added 546 Read/Feed constraints in 126 ms returned sat
[2022-05-17 22:08:53] [INFO ] Deduced a trap composed of 102 places in 424 ms of which 0 ms to minimize.
[2022-05-17 22:08:53] [INFO ] Deduced a trap composed of 41 places in 419 ms of which 1 ms to minimize.
[2022-05-17 22:08:54] [INFO ] Deduced a trap composed of 66 places in 417 ms of which 1 ms to minimize.
[2022-05-17 22:08:54] [INFO ] Deduced a trap composed of 123 places in 402 ms of which 1 ms to minimize.
[2022-05-17 22:08:55] [INFO ] Deduced a trap composed of 66 places in 394 ms of which 1 ms to minimize.
[2022-05-17 22:08:55] [INFO ] Deduced a trap composed of 103 places in 405 ms of which 1 ms to minimize.
[2022-05-17 22:08:56] [INFO ] Deduced a trap composed of 49 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:08:56] [INFO ] Deduced a trap composed of 13 places in 402 ms of which 1 ms to minimize.
[2022-05-17 22:08:56] [INFO ] Deduced a trap composed of 111 places in 399 ms of which 1 ms to minimize.
[2022-05-17 22:08:57] [INFO ] Deduced a trap composed of 45 places in 400 ms of which 1 ms to minimize.
[2022-05-17 22:08:57] [INFO ] Deduced a trap composed of 39 places in 404 ms of which 1 ms to minimize.
[2022-05-17 22:08:58] [INFO ] Deduced a trap composed of 55 places in 399 ms of which 1 ms to minimize.
[2022-05-17 22:08:58] [INFO ] Deduced a trap composed of 96 places in 405 ms of which 1 ms to minimize.
[2022-05-17 22:08:59] [INFO ] Deduced a trap composed of 37 places in 417 ms of which 1 ms to minimize.
[2022-05-17 22:08:59] [INFO ] Deduced a trap composed of 21 places in 402 ms of which 1 ms to minimize.
[2022-05-17 22:09:00] [INFO ] Deduced a trap composed of 104 places in 425 ms of which 1 ms to minimize.
[2022-05-17 22:09:00] [INFO ] Deduced a trap composed of 134 places in 411 ms of which 0 ms to minimize.
[2022-05-17 22:09:01] [INFO ] Deduced a trap composed of 49 places in 405 ms of which 1 ms to minimize.
[2022-05-17 22:09:01] [INFO ] Deduced a trap composed of 21 places in 416 ms of which 0 ms to minimize.
[2022-05-17 22:09:02] [INFO ] Deduced a trap composed of 40 places in 418 ms of which 1 ms to minimize.
[2022-05-17 22:09:02] [INFO ] Deduced a trap composed of 52 places in 419 ms of which 1 ms to minimize.
[2022-05-17 22:09:03] [INFO ] Deduced a trap composed of 43 places in 415 ms of which 1 ms to minimize.
[2022-05-17 22:09:03] [INFO ] Deduced a trap composed of 71 places in 386 ms of which 1 ms to minimize.
[2022-05-17 22:09:04] [INFO ] Deduced a trap composed of 75 places in 386 ms of which 1 ms to minimize.
[2022-05-17 22:09:04] [INFO ] Deduced a trap composed of 107 places in 387 ms of which 1 ms to minimize.
[2022-05-17 22:09:04] [INFO ] Deduced a trap composed of 105 places in 379 ms of which 1 ms to minimize.
[2022-05-17 22:09:05] [INFO ] Deduced a trap composed of 90 places in 374 ms of which 1 ms to minimize.
[2022-05-17 22:09:05] [INFO ] Deduced a trap composed of 82 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:09:06] [INFO ] Deduced a trap composed of 120 places in 400 ms of which 0 ms to minimize.
[2022-05-17 22:09:06] [INFO ] Deduced a trap composed of 161 places in 402 ms of which 1 ms to minimize.
[2022-05-17 22:09:07] [INFO ] Deduced a trap composed of 121 places in 401 ms of which 1 ms to minimize.
[2022-05-17 22:09:07] [INFO ] Deduced a trap composed of 73 places in 391 ms of which 1 ms to minimize.
[2022-05-17 22:09:08] [INFO ] Deduced a trap composed of 114 places in 402 ms of which 1 ms to minimize.
[2022-05-17 22:09:08] [INFO ] Deduced a trap composed of 81 places in 393 ms of which 1 ms to minimize.
[2022-05-17 22:09:09] [INFO ] Deduced a trap composed of 86 places in 399 ms of which 0 ms to minimize.
[2022-05-17 22:09:09] [INFO ] Deduced a trap composed of 95 places in 405 ms of which 1 ms to minimize.
[2022-05-17 22:09:09] [INFO ] Deduced a trap composed of 98 places in 397 ms of which 0 ms to minimize.
[2022-05-17 22:09:10] [INFO ] Deduced a trap composed of 133 places in 419 ms of which 0 ms to minimize.
[2022-05-17 22:09:10] [INFO ] Deduced a trap composed of 177 places in 395 ms of which 1 ms to minimize.
[2022-05-17 22:09:11] [INFO ] Deduced a trap composed of 142 places in 400 ms of which 1 ms to minimize.
[2022-05-17 22:09:11] [INFO ] Deduced a trap composed of 134 places in 380 ms of which 1 ms to minimize.
[2022-05-17 22:09:12] [INFO ] Deduced a trap composed of 117 places in 371 ms of which 1 ms to minimize.
[2022-05-17 22:09:12] [INFO ] Deduced a trap composed of 115 places in 384 ms of which 1 ms to minimize.
[2022-05-17 22:09:13] [INFO ] Deduced a trap composed of 95 places in 374 ms of which 0 ms to minimize.
[2022-05-17 22:09:13] [INFO ] Deduced a trap composed of 89 places in 377 ms of which 1 ms to minimize.
[2022-05-17 22:09:14] [INFO ] Deduced a trap composed of 129 places in 386 ms of which 1 ms to minimize.
[2022-05-17 22:09:14] [INFO ] Deduced a trap composed of 71 places in 376 ms of which 1 ms to minimize.
[2022-05-17 22:09:14] [INFO ] Deduced a trap composed of 65 places in 412 ms of which 1 ms to minimize.
[2022-05-17 22:09:15] [INFO ] Deduced a trap composed of 92 places in 399 ms of which 0 ms to minimize.
[2022-05-17 22:09:15] [INFO ] Deduced a trap composed of 63 places in 421 ms of which 1 ms to minimize.
[2022-05-17 22:09:16] [INFO ] Deduced a trap composed of 114 places in 402 ms of which 1 ms to minimize.
[2022-05-17 22:09:16] [INFO ] Deduced a trap composed of 63 places in 402 ms of which 0 ms to minimize.
[2022-05-17 22:09:17] [INFO ] Deduced a trap composed of 66 places in 398 ms of which 1 ms to minimize.
[2022-05-17 22:09:17] [INFO ] Deduced a trap composed of 78 places in 405 ms of which 1 ms to minimize.
[2022-05-17 22:09:18] [INFO ] Deduced a trap composed of 24 places in 393 ms of which 1 ms to minimize.
[2022-05-17 22:09:18] [INFO ] Deduced a trap composed of 21 places in 382 ms of which 0 ms to minimize.
[2022-05-17 22:09:19] [INFO ] Deduced a trap composed of 28 places in 389 ms of which 1 ms to minimize.
[2022-05-17 22:09:19] [INFO ] Deduced a trap composed of 28 places in 397 ms of which 1 ms to minimize.
[2022-05-17 22:09:20] [INFO ] Deduced a trap composed of 13 places in 378 ms of which 1 ms to minimize.
[2022-05-17 22:09:20] [INFO ] Deduced a trap composed of 13 places in 394 ms of which 0 ms to minimize.
[2022-05-17 22:09:20] [INFO ] Deduced a trap composed of 141 places in 386 ms of which 0 ms to minimize.
[2022-05-17 22:09:21] [INFO ] Deduced a trap composed of 59 places in 419 ms of which 1 ms to minimize.
[2022-05-17 22:09:21] [INFO ] Deduced a trap composed of 62 places in 394 ms of which 0 ms to minimize.
[2022-05-17 22:09:22] [INFO ] Deduced a trap composed of 80 places in 401 ms of which 0 ms to minimize.
[2022-05-17 22:09:22] [INFO ] Deduced a trap composed of 71 places in 381 ms of which 1 ms to minimize.
[2022-05-17 22:09:23] [INFO ] Deduced a trap composed of 70 places in 389 ms of which 0 ms to minimize.
[2022-05-17 22:09:23] [INFO ] Deduced a trap composed of 57 places in 394 ms of which 0 ms to minimize.
[2022-05-17 22:09:24] [INFO ] Deduced a trap composed of 172 places in 384 ms of which 1 ms to minimize.
[2022-05-17 22:09:24] [INFO ] Deduced a trap composed of 40 places in 384 ms of which 1 ms to minimize.
[2022-05-17 22:09:25] [INFO ] Deduced a trap composed of 38 places in 383 ms of which 1 ms to minimize.
[2022-05-17 22:09:25] [INFO ] Deduced a trap composed of 100 places in 382 ms of which 1 ms to minimize.
[2022-05-17 22:09:25] [INFO ] Deduced a trap composed of 106 places in 393 ms of which 1 ms to minimize.
[2022-05-17 22:09:26] [INFO ] Deduced a trap composed of 91 places in 388 ms of which 0 ms to minimize.
[2022-05-17 22:09:26] [INFO ] Deduced a trap composed of 90 places in 414 ms of which 1 ms to minimize.
[2022-05-17 22:09:27] [INFO ] Deduced a trap composed of 91 places in 385 ms of which 1 ms to minimize.
[2022-05-17 22:09:27] [INFO ] Deduced a trap composed of 92 places in 386 ms of which 1 ms to minimize.
[2022-05-17 22:09:28] [INFO ] Deduced a trap composed of 39 places in 392 ms of which 1 ms to minimize.
[2022-05-17 22:09:28] [INFO ] Deduced a trap composed of 123 places in 377 ms of which 1 ms to minimize.
[2022-05-17 22:09:29] [INFO ] Deduced a trap composed of 33 places in 377 ms of which 1 ms to minimize.
[2022-05-17 22:09:29] [INFO ] Deduced a trap composed of 153 places in 404 ms of which 0 ms to minimize.
[2022-05-17 22:09:30] [INFO ] Deduced a trap composed of 190 places in 406 ms of which 1 ms to minimize.
[2022-05-17 22:09:30] [INFO ] Deduced a trap composed of 53 places in 396 ms of which 1 ms to minimize.
[2022-05-17 22:09:30] [INFO ] Deduced a trap composed of 90 places in 389 ms of which 1 ms to minimize.
[2022-05-17 22:09:31] [INFO ] Deduced a trap composed of 94 places in 403 ms of which 1 ms to minimize.
[2022-05-17 22:09:31] [INFO ] Deduced a trap composed of 113 places in 392 ms of which 1 ms to minimize.
[2022-05-17 22:09:32] [INFO ] Deduced a trap composed of 134 places in 416 ms of which 1 ms to minimize.
[2022-05-17 22:09:32] [INFO ] Deduced a trap composed of 95 places in 353 ms of which 1 ms to minimize.
[2022-05-17 22:09:33] [INFO ] Deduced a trap composed of 73 places in 387 ms of which 1 ms to minimize.
[2022-05-17 22:09:33] [INFO ] Deduced a trap composed of 120 places in 375 ms of which 1 ms to minimize.
[2022-05-17 22:09:34] [INFO ] Deduced a trap composed of 75 places in 388 ms of which 0 ms to minimize.
[2022-05-17 22:09:34] [INFO ] Deduced a trap composed of 62 places in 371 ms of which 1 ms to minimize.
[2022-05-17 22:09:34] [INFO ] Deduced a trap composed of 91 places in 364 ms of which 1 ms to minimize.
[2022-05-17 22:09:35] [INFO ] Deduced a trap composed of 161 places in 326 ms of which 1 ms to minimize.
[2022-05-17 22:09:35] [INFO ] Deduced a trap composed of 134 places in 302 ms of which 1 ms to minimize.
[2022-05-17 22:09:36] [INFO ] Deduced a trap composed of 132 places in 306 ms of which 1 ms to minimize.
[2022-05-17 22:09:36] [INFO ] Deduced a trap composed of 95 places in 261 ms of which 1 ms to minimize.
[2022-05-17 22:09:36] [INFO ] Deduced a trap composed of 25 places in 398 ms of which 0 ms to minimize.
[2022-05-17 22:09:37] [INFO ] Deduced a trap composed of 126 places in 376 ms of which 1 ms to minimize.
[2022-05-17 22:09:37] [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) : [448] Max seen :[7]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 21 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 20 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2022-05-17 22:09:37] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:09:37] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-17 22:09:37] [INFO ] Implicit Places using invariants in 353 ms returned []
[2022-05-17 22:09:37] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:09:37] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 22:09:38] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-05-17 22:09:44] [INFO ] Implicit Places using invariants and state equation in 6708 ms returned []
Implicit Place search using SMT with State Equation took 7062 ms to find 0 implicit places.
[2022-05-17 22:09:44] [INFO ] Redundant transitions in 36 ms returned []
[2022-05-17 22:09:44] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 22:09:44] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 22:09:45] [INFO ] Dead Transitions using invariants and state equation in 742 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Ending property specific reduction for Peterson-COL-7-UpperBounds-12 in 141962 ms.
[2022-05-17 22:09:45] [INFO ] Flatten gal took : 166 ms
[2022-05-17 22:09:45] [INFO ] Applying decomposition
[2022-05-17 22:09:45] [INFO ] Flatten gal took : 121 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/graph3031497352562000170.txt, -o, /tmp/graph3031497352562000170.bin, -w, /tmp/graph3031497352562000170.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/graph3031497352562000170.bin, -l, -1, -v, -w, /tmp/graph3031497352562000170.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-17 22:09:45] [INFO ] Decomposing Gal with order
[2022-05-17 22:09:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 22:09:46] [INFO ] Removed a total of 3174 redundant transitions.
[2022-05-17 22:09:46] [INFO ] Flatten gal took : 193 ms
[2022-05-17 22:09:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 52 ms.
[2022-05-17 22:09:46] [INFO ] Time to serialize gal into /tmp/UpperBounds141421207454924624.gal : 30 ms
[2022-05-17 22:09:46] [INFO ] Time to serialize properties into /tmp/UpperBounds7548828761403767928.prop : 2 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/UpperBounds141421207454924624.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7548828761403767928.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/UpperBounds141421207454924624.gal -t CGAL -reachable-file /tmp/UpperBounds7548828761403767928.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds7548828761403767928.prop.
Detected timeout of ITS tools.
[2022-05-17 22:38:32] [INFO ] Applying decomposition
[2022-05-17 22:38:32] [INFO ] Flatten gal took : 332 ms
[2022-05-17 22:38:33] [INFO ] Decomposing Gal with order
[2022-05-17 22:38:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 22:38:35] [INFO ] Removed a total of 3336 redundant transitions.
[2022-05-17 22:38:35] [INFO ] Flatten gal took : 1819 ms
[2022-05-17 22:38:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 67 ms.
[2022-05-17 22:38:35] [INFO ] Time to serialize gal into /tmp/UpperBounds16153578636901671656.gal : 136 ms
[2022-05-17 22:38:35] [INFO ] Time to serialize properties into /tmp/UpperBounds10969202460104004052.prop : 11 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/UpperBounds16153578636901671656.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds10969202460104004052.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/UpperBounds16153578636901671656.gal -t CGAL -reachable-file /tmp/UpperBounds10969202460104004052.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds10969202460104004052.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="Peterson-COL-7"
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 Peterson-COL-7, 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 r179-tall-165277026700016"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-7.tgz
mv Peterson-COL-7 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 ;