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.r168-tall-165277016100045.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-COL-7, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016100045
=====================================================================

--------------------
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 1652778852644

Running Version 202205111006
[2022-05-17 09:14:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 09:14:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 09:14:13] [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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-17 09:14:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 09:14:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 590 ms
[2022-05-17 09:14:14] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 2048 PT places and 3384.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-17 09:14:14] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 5 ms.
[2022-05-17 09:14:14] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2022-05-17 09:14:14] [INFO ] Computed 1 place invariants in 5 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
// Phase 1: matrix 14 rows 9 cols
[2022-05-17 09:14:14] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-17 09:14:14] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-17 09:14:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:14] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 09:14:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:14:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 09:14:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:14] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-17 09:14:14] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 09:14:14] [INFO ] Added : 11 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 09:14:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 09:14:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:14] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 09:14:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:14:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 09:14:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:14] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 09:14:14] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 09:14:14] [INFO ] Added : 11 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 7 ms.
[2022-05-17 09:14:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 09:14:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:14] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 09:14:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:14:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 09:14:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:14] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 09:14:14] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 09:14:15] [INFO ] Added : 11 causal constraints over 4 iterations in 16 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 09:14:15] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 09:14:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:15] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 09:14:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:14:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 09:14:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:15] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 09:14:15] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 09:14:15] [INFO ] Added : 11 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 09:14:15] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-17 09:14:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:15] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-17 09:14:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:14:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 09:14:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:15] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-17 09:14:15] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 09:14:15] [INFO ] Added : 12 causal constraints over 4 iterations in 17 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 09:14:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 09:14:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:15] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 09:14:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:14:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 09:14:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:15] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-17 09:14:15] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 09:14:15] [INFO ] Added : 12 causal constraints over 4 iterations in 17 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 09:14:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 09:14:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:15] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 09:14:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:14:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 09:14:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:15] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-17 09:14:15] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 09:14:15] [INFO ] Added : 11 causal constraints over 4 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2022-05-17 09:14:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 09:14:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:15] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-17 09:14:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:14:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 09:14:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:15] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 09:14:15] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 09:14:15] [INFO ] Added : 11 causal constraints over 4 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 09:14:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 09:14:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:15] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 09:14:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:14:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 09:14:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:15] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-17 09:14:15] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 09:14:15] [INFO ] Added : 11 causal constraints over 4 iterations in 22 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 09:14:15] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 09:14:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 09:14:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:14:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 09:14:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:15] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 09:14:15] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 09:14:15] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 09:14:15] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-05-17 09:14:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:15] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-17 09:14:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:14:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 09:14:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:15] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-17 09:14:15] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 09:14:15] [INFO ] Added : 11 causal constraints over 4 iterations in 11 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]
Domain [Process(8), Tour(7), Process(8)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 7)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-17 09:14:15] [INFO ] Unfolded HLPN to a Petri net with 2048 places and 3208 transitions 10032 arcs in 55 ms.
[2022-05-17 09:14:15] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Deduced a syphon composed of 56 places in 22 ms
Reduce places removed 56 places and 112 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 11) seen :37
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :29
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 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 10) seen :20
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 :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :33
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 :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) 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 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :31
[2022-05-17 09:14:16] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 09:14:16] [INFO ] Computed 31 place invariants in 30 ms
[2022-05-17 09:14:16] [INFO ] [Real]Absence check using 23 positive place invariants in 37 ms returned sat
[2022-05-17 09:14:16] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 14 ms returned sat
[2022-05-17 09:14:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:17] [INFO ] [Real]Absence check using state equation in 864 ms returned sat
[2022-05-17 09:14:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:14:18] [INFO ] [Nat]Absence check using 23 positive place invariants in 38 ms returned sat
[2022-05-17 09:14:18] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2022-05-17 09:14:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:19] [INFO ] [Nat]Absence check using state equation in 804 ms returned sat
[2022-05-17 09:14:19] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:14:19] [INFO ] [Nat]Added 497 Read/Feed constraints in 160 ms returned sat
[2022-05-17 09:14:20] [INFO ] Deduced a trap composed of 31 places in 1019 ms of which 7 ms to minimize.
[2022-05-17 09:14:21] [INFO ] Deduced a trap composed of 74 places in 985 ms of which 5 ms to minimize.
[2022-05-17 09:14:22] [INFO ] Deduced a trap composed of 40 places in 973 ms of which 5 ms to minimize.
[2022-05-17 09:14:23] [INFO ] Deduced a trap composed of 34 places in 947 ms of which 2 ms to minimize.
[2022-05-17 09:14: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 09:14:23] [INFO ] [Real]Absence check using 23 positive place invariants in 37 ms returned sat
[2022-05-17 09:14:23] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 14 ms returned sat
[2022-05-17 09:14:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:24] [INFO ] [Real]Absence check using state equation in 839 ms returned sat
[2022-05-17 09:14:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:14:25] [INFO ] [Nat]Absence check using 23 positive place invariants in 34 ms returned sat
[2022-05-17 09:14:25] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2022-05-17 09:14:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:25] [INFO ] [Nat]Absence check using state equation in 815 ms returned sat
[2022-05-17 09:14:26] [INFO ] [Nat]Added 497 Read/Feed constraints in 247 ms returned sat
[2022-05-17 09:14:27] [INFO ] Deduced a trap composed of 32 places in 913 ms of which 2 ms to minimize.
[2022-05-17 09:14:28] [INFO ] Deduced a trap composed of 33 places in 968 ms of which 5 ms to minimize.
[2022-05-17 09:14:29] [INFO ] Deduced a trap composed of 40 places in 956 ms of which 1 ms to minimize.
[2022-05-17 09:14:30] [INFO ] Deduced a trap composed of 40 places in 998 ms of which 2 ms to minimize.
[2022-05-17 09:14: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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 09:14:30] [INFO ] [Real]Absence check using 23 positive place invariants in 58 ms returned sat
[2022-05-17 09:14:30] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 15 ms returned sat
[2022-05-17 09:14:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:31] [INFO ] [Real]Absence check using state equation in 828 ms returned sat
[2022-05-17 09:14:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:14:31] [INFO ] [Nat]Absence check using 23 positive place invariants in 35 ms returned sat
[2022-05-17 09:14:31] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2022-05-17 09:14:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:32] [INFO ] [Nat]Absence check using state equation in 793 ms returned sat
[2022-05-17 09:14:32] [INFO ] [Nat]Added 497 Read/Feed constraints in 177 ms returned sat
[2022-05-17 09:14:33] [INFO ] Deduced a trap composed of 31 places in 963 ms of which 1 ms to minimize.
[2022-05-17 09:14:34] [INFO ] Deduced a trap composed of 74 places in 972 ms of which 1 ms to minimize.
[2022-05-17 09:14:36] [INFO ] Deduced a trap composed of 40 places in 903 ms of which 1 ms to minimize.
[2022-05-17 09:14:37] [INFO ] Deduced a trap composed of 34 places in 915 ms of which 1 ms to minimize.
[2022-05-17 09:14: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 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 09:14:37] [INFO ] [Real]Absence check using 23 positive place invariants in 31 ms returned sat
[2022-05-17 09:14:37] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2022-05-17 09:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:38] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2022-05-17 09:14:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:14:38] [INFO ] [Nat]Absence check using 23 positive place invariants in 32 ms returned sat
[2022-05-17 09:14:38] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2022-05-17 09:14:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:39] [INFO ] [Nat]Absence check using state equation in 831 ms returned sat
[2022-05-17 09:14:39] [INFO ] [Nat]Added 497 Read/Feed constraints in 270 ms returned sat
[2022-05-17 09:14:40] [INFO ] Deduced a trap composed of 13 places in 914 ms of which 2 ms to minimize.
[2022-05-17 09:14:41] [INFO ] Deduced a trap composed of 17 places in 924 ms of which 4 ms to minimize.
[2022-05-17 09:14:43] [INFO ] Deduced a trap composed of 17 places in 937 ms of which 2 ms to minimize.
[2022-05-17 09:14:44] [INFO ] Deduced a trap composed of 46 places in 862 ms of which 1 ms to minimize.
[2022-05-17 09:14:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 09:14:44] [INFO ] [Real]Absence check using 23 positive place invariants in 34 ms returned sat
[2022-05-17 09:14:44] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 14 ms returned sat
[2022-05-17 09:14:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:45] [INFO ] [Real]Absence check using state equation in 864 ms returned sat
[2022-05-17 09:14:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:14:45] [INFO ] [Nat]Absence check using 23 positive place invariants in 35 ms returned sat
[2022-05-17 09:14:45] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 11 ms returned sat
[2022-05-17 09:14:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:46] [INFO ] [Nat]Absence check using state equation in 830 ms returned sat
[2022-05-17 09:14:46] [INFO ] [Nat]Added 497 Read/Feed constraints in 246 ms returned sat
[2022-05-17 09:14:47] [INFO ] Deduced a trap composed of 13 places in 893 ms of which 2 ms to minimize.
[2022-05-17 09:14:48] [INFO ] Deduced a trap composed of 17 places in 867 ms of which 2 ms to minimize.
[2022-05-17 09:14:49] [INFO ] Deduced a trap composed of 17 places in 911 ms of which 2 ms to minimize.
[2022-05-17 09:14:50] [INFO ] Deduced a trap composed of 46 places in 926 ms of which 2 ms to minimize.
[2022-05-17 09:14:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 09:14:51] [INFO ] [Real]Absence check using 23 positive place invariants in 32 ms returned sat
[2022-05-17 09:14:51] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 21 ms returned sat
[2022-05-17 09:14:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:52] [INFO ] [Real]Absence check using state equation in 829 ms returned sat
[2022-05-17 09:14:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:14:52] [INFO ] [Nat]Absence check using 23 positive place invariants in 36 ms returned sat
[2022-05-17 09:14:52] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 14 ms returned sat
[2022-05-17 09:14:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:53] [INFO ] [Nat]Absence check using state equation in 835 ms returned sat
[2022-05-17 09:14:53] [INFO ] [Nat]Added 497 Read/Feed constraints in 233 ms returned sat
[2022-05-17 09:14:54] [INFO ] Deduced a trap composed of 32 places in 896 ms of which 1 ms to minimize.
[2022-05-17 09:14:55] [INFO ] Deduced a trap composed of 33 places in 972 ms of which 4 ms to minimize.
[2022-05-17 09:14:56] [INFO ] Deduced a trap composed of 40 places in 956 ms of which 2 ms to minimize.
[2022-05-17 09:14:57] [INFO ] Deduced a trap composed of 40 places in 902 ms of which 2 ms to minimize.
[2022-05-17 09:14:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 09:14:57] [INFO ] [Real]Absence check using 23 positive place invariants in 33 ms returned sat
[2022-05-17 09:14:57] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2022-05-17 09:14:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:58] [INFO ] [Real]Absence check using state equation in 838 ms returned sat
[2022-05-17 09:14:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:14:58] [INFO ] [Nat]Absence check using 23 positive place invariants in 35 ms returned sat
[2022-05-17 09:14:58] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 20 ms returned sat
[2022-05-17 09:14:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:59] [INFO ] [Nat]Absence check using state equation in 852 ms returned sat
[2022-05-17 09:15:00] [INFO ] [Nat]Added 497 Read/Feed constraints in 257 ms returned sat
[2022-05-17 09:15:01] [INFO ] Deduced a trap composed of 32 places in 923 ms of which 2 ms to minimize.
[2022-05-17 09:15:02] [INFO ] Deduced a trap composed of 33 places in 964 ms of which 1 ms to minimize.
[2022-05-17 09:15:03] [INFO ] Deduced a trap composed of 40 places in 961 ms of which 1 ms to minimize.
[2022-05-17 09:15:04] [INFO ] Deduced a trap composed of 40 places in 964 ms of which 2 ms to minimize.
[2022-05-17 09:15:04] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 09:15:04] [INFO ] [Real]Absence check using 23 positive place invariants in 33 ms returned sat
[2022-05-17 09:15:04] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 14 ms returned sat
[2022-05-17 09:15:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:15:05] [INFO ] [Real]Absence check using state equation in 823 ms returned sat
[2022-05-17 09:15:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:15:05] [INFO ] [Nat]Absence check using 23 positive place invariants in 36 ms returned sat
[2022-05-17 09:15:05] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2022-05-17 09:15:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:15:06] [INFO ] [Nat]Absence check using state equation in 796 ms returned sat
[2022-05-17 09:15:06] [INFO ] [Nat]Added 497 Read/Feed constraints in 178 ms returned sat
[2022-05-17 09:15:07] [INFO ] Deduced a trap composed of 31 places in 964 ms of which 2 ms to minimize.
[2022-05-17 09:15:08] [INFO ] Deduced a trap composed of 74 places in 967 ms of which 2 ms to minimize.
[2022-05-17 09:15:09] [INFO ] Deduced a trap composed of 40 places in 941 ms of which 2 ms to minimize.
[2022-05-17 09:15:10] [INFO ] Deduced a trap composed of 34 places in 862 ms of which 1 ms to minimize.
[2022-05-17 09:15:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 09:15:11] [INFO ] [Real]Absence check using 23 positive place invariants in 32 ms returned sat
[2022-05-17 09:15:11] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 19 ms returned sat
[2022-05-17 09:15:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:15:11] [INFO ] [Real]Absence check using state equation in 807 ms returned sat
[2022-05-17 09:15:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:15:12] [INFO ] [Nat]Absence check using 23 positive place invariants in 34 ms returned sat
[2022-05-17 09:15:12] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2022-05-17 09:15:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:15:13] [INFO ] [Nat]Absence check using state equation in 871 ms returned sat
[2022-05-17 09:15:13] [INFO ] [Nat]Added 497 Read/Feed constraints in 247 ms returned sat
[2022-05-17 09:15:14] [INFO ] Deduced a trap composed of 32 places in 911 ms of which 1 ms to minimize.
[2022-05-17 09:15:15] [INFO ] Deduced a trap composed of 33 places in 887 ms of which 2 ms to minimize.
[2022-05-17 09:15:16] [INFO ] Deduced a trap composed of 40 places in 965 ms of which 2 ms to minimize.
[2022-05-17 09:15:17] [INFO ] Deduced a trap composed of 40 places in 954 ms of which 2 ms to minimize.
[2022-05-17 09:15: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 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [8, 8, 8, 8, 8, 8, 8, 8, 8] Max seen :[2, 7, 2, 1, 1, 7, 7, 2, 7]
Support contains 512 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 328 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 09:15:17] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 22367 ms. (steps per millisecond=44 ) properties (out of 9) seen :40
Interrupted Best-First random walk after 766748 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=153 ) properties seen 22
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4217 ms. (steps per millisecond=237 ) properties (out of 9) seen :31
Interrupted Best-First random walk after 529102 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=105 ) properties seen 18
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3582 ms. (steps per millisecond=279 ) properties (out of 9) seen :24
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3540 ms. (steps per millisecond=282 ) properties (out of 9) seen :21
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4042 ms. (steps per millisecond=247 ) properties (out of 9) seen :28
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4055 ms. (steps per millisecond=246 ) properties (out of 9) seen :31
Finished Best-First random walk after 544042 steps, including 1 resets, run visited all 9 properties in 5001 ms. (steps per millisecond=108 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4039 ms. (steps per millisecond=247 ) properties (out of 9) seen :34
[2022-05-17 09:16:18] [INFO ] Flow matrix only has 1920 transitions (discarded 336 similar events)
// Phase 1: matrix 1920 rows 1152 cols
[2022-05-17 09:16:18] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-17 09:16:18] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 09:16:18] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 9 ms returned sat
[2022-05-17 09:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:16:19] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2022-05-17 09:16:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:16:19] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 09:16:19] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 09:16:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:16:20] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2022-05-17 09:16:20] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:16:20] [INFO ] [Nat]Added 497 Read/Feed constraints in 171 ms returned sat
[2022-05-17 09:16:20] [INFO ] Deduced a trap composed of 134 places in 464 ms of which 1 ms to minimize.
[2022-05-17 09:16:21] [INFO ] Deduced a trap composed of 91 places in 455 ms of which 1 ms to minimize.
[2022-05-17 09:16:21] [INFO ] Deduced a trap composed of 130 places in 481 ms of which 1 ms to minimize.
[2022-05-17 09:16:22] [INFO ] Deduced a trap composed of 97 places in 474 ms of which 1 ms to minimize.
[2022-05-17 09:16:22] [INFO ] Deduced a trap composed of 70 places in 462 ms of which 1 ms to minimize.
[2022-05-17 09:16:23] [INFO ] Deduced a trap composed of 147 places in 432 ms of which 1 ms to minimize.
[2022-05-17 09:16:23] [INFO ] Deduced a trap composed of 167 places in 443 ms of which 1 ms to minimize.
[2022-05-17 09:16:24] [INFO ] Deduced a trap composed of 145 places in 431 ms of which 1 ms to minimize.
[2022-05-17 09:16:24] [INFO ] Deduced a trap composed of 151 places in 433 ms of which 0 ms to minimize.
[2022-05-17 09:16:25] [INFO ] Deduced a trap composed of 106 places in 402 ms of which 4 ms to minimize.
[2022-05-17 09:16:25] [INFO ] Deduced a trap composed of 128 places in 387 ms of which 1 ms to minimize.
[2022-05-17 09:16:26] [INFO ] Deduced a trap composed of 93 places in 387 ms of which 1 ms to minimize.
[2022-05-17 09:16:26] [INFO ] Deduced a trap composed of 143 places in 365 ms of which 1 ms to minimize.
[2022-05-17 09:16:26] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6580 ms
[2022-05-17 09:16:26] [INFO ] Computed and/alt/rep : 1800/5000/1800 causal constraints (skipped 112 transitions) in 113 ms.
[2022-05-17 09:16:30] [INFO ] Deduced a trap composed of 36 places in 396 ms of which 1 ms to minimize.
[2022-05-17 09:16:30] [INFO ] Deduced a trap composed of 58 places in 447 ms of which 1 ms to minimize.
[2022-05-17 09:16:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1112 ms
[2022-05-17 09:16:31] [INFO ] Added : 128 causal constraints over 26 iterations in 4346 ms. Result :sat
Minimization took 606 ms.
[2022-05-17 09:16:32] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 09:16:32] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 9 ms returned sat
[2022-05-17 09:16:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:16:32] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2022-05-17 09:16:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:16:32] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 09:16:32] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 09:16:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:16:33] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2022-05-17 09:16:33] [INFO ] [Nat]Added 497 Read/Feed constraints in 126 ms returned sat
[2022-05-17 09:16:33] [INFO ] Deduced a trap composed of 25 places in 384 ms of which 1 ms to minimize.
[2022-05-17 09:16:34] [INFO ] Deduced a trap composed of 21 places in 421 ms of which 1 ms to minimize.
[2022-05-17 09:16:34] [INFO ] Deduced a trap composed of 25 places in 411 ms of which 1 ms to minimize.
[2022-05-17 09:16:35] [INFO ] Deduced a trap composed of 25 places in 431 ms of which 1 ms to minimize.
[2022-05-17 09:16:35] [INFO ] Deduced a trap composed of 25 places in 385 ms of which 1 ms to minimize.
[2022-05-17 09:16:36] [INFO ] Deduced a trap composed of 25 places in 415 ms of which 4 ms to minimize.
[2022-05-17 09:16:36] [INFO ] Deduced a trap composed of 22 places in 394 ms of which 2 ms to minimize.
[2022-05-17 09:16:36] [INFO ] Deduced a trap composed of 21 places in 410 ms of which 1 ms to minimize.
[2022-05-17 09:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 3721 ms
[2022-05-17 09:16:37] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 09:16:37] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 09:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:16:37] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2022-05-17 09:16:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:16:37] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 09:16:37] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 09:16:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:16:38] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2022-05-17 09:16:38] [INFO ] [Nat]Added 497 Read/Feed constraints in 164 ms returned sat
[2022-05-17 09:16:38] [INFO ] Deduced a trap composed of 134 places in 505 ms of which 1 ms to minimize.
[2022-05-17 09:16:39] [INFO ] Deduced a trap composed of 91 places in 496 ms of which 1 ms to minimize.
[2022-05-17 09:16:40] [INFO ] Deduced a trap composed of 130 places in 505 ms of which 1 ms to minimize.
[2022-05-17 09:16:40] [INFO ] Deduced a trap composed of 97 places in 511 ms of which 1 ms to minimize.
[2022-05-17 09:16:41] [INFO ] Deduced a trap composed of 70 places in 489 ms of which 0 ms to minimize.
[2022-05-17 09:16:41] [INFO ] Deduced a trap composed of 147 places in 446 ms of which 1 ms to minimize.
[2022-05-17 09:16:42] [INFO ] Deduced a trap composed of 167 places in 450 ms of which 0 ms to minimize.
[2022-05-17 09:16:42] [INFO ] Deduced a trap composed of 145 places in 436 ms of which 1 ms to minimize.
[2022-05-17 09:16:43] [INFO ] Deduced a trap composed of 151 places in 445 ms of which 3 ms to minimize.
[2022-05-17 09:16:43] [INFO ] Deduced a trap composed of 106 places in 381 ms of which 1 ms to minimize.
[2022-05-17 09:16:44] [INFO ] Deduced a trap composed of 128 places in 400 ms of which 0 ms to minimize.
[2022-05-17 09:16:44] [INFO ] Deduced a trap composed of 93 places in 388 ms of which 1 ms to minimize.
[2022-05-17 09:16:45] [INFO ] Deduced a trap composed of 143 places in 376 ms of which 1 ms to minimize.
[2022-05-17 09:16:45] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6792 ms
[2022-05-17 09:16:45] [INFO ] Computed and/alt/rep : 1800/5000/1800 causal constraints (skipped 112 transitions) in 121 ms.
[2022-05-17 09:16:48] [INFO ] Deduced a trap composed of 36 places in 420 ms of which 1 ms to minimize.
[2022-05-17 09:16:49] [INFO ] Deduced a trap composed of 58 places in 427 ms of which 1 ms to minimize.
[2022-05-17 09:16:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1141 ms
[2022-05-17 09:16:49] [INFO ] Added : 128 causal constraints over 26 iterations in 4420 ms. Result :sat
Minimization took 630 ms.
[2022-05-17 09:16:50] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 09:16:50] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 09:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:16:50] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2022-05-17 09:16:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:16:51] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 09:16:51] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 09:16:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:16:51] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2022-05-17 09:16:51] [INFO ] [Nat]Added 497 Read/Feed constraints in 163 ms returned sat
[2022-05-17 09:16:52] [INFO ] Deduced a trap composed of 32 places in 402 ms of which 1 ms to minimize.
[2022-05-17 09:16:52] [INFO ] Deduced a trap composed of 28 places in 412 ms of which 1 ms to minimize.
[2022-05-17 09:16:53] [INFO ] Deduced a trap composed of 49 places in 404 ms of which 1 ms to minimize.
[2022-05-17 09:16:53] [INFO ] Deduced a trap composed of 15 places in 421 ms of which 0 ms to minimize.
[2022-05-17 09:16:54] [INFO ] Deduced a trap composed of 13 places in 417 ms of which 1 ms to minimize.
[2022-05-17 09:16:54] [INFO ] Deduced a trap composed of 105 places in 412 ms of which 1 ms to minimize.
[2022-05-17 09:16:55] [INFO ] Deduced a trap composed of 57 places in 402 ms of which 1 ms to minimize.
[2022-05-17 09:16:55] [INFO ] Deduced a trap composed of 13 places in 379 ms of which 0 ms to minimize.
[2022-05-17 09:16:56] [INFO ] Deduced a trap composed of 57 places in 445 ms of which 1 ms to minimize.
[2022-05-17 09:16:56] [INFO ] Deduced a trap composed of 58 places in 419 ms of which 1 ms to minimize.
[2022-05-17 09:16:57] [INFO ] Deduced a trap composed of 13 places in 422 ms of which 0 ms to minimize.
[2022-05-17 09:16:57] [INFO ] Deduced a trap composed of 75 places in 386 ms of which 1 ms to minimize.
[2022-05-17 09:16:57] [INFO ] Deduced a trap composed of 72 places in 385 ms of which 0 ms to minimize.
[2022-05-17 09:16:58] [INFO ] Deduced a trap composed of 53 places in 374 ms of which 1 ms to minimize.
[2022-05-17 09:16:58] [INFO ] Deduced a trap composed of 45 places in 379 ms of which 0 ms to minimize.
[2022-05-17 09:16:59] [INFO ] Deduced a trap composed of 34 places in 414 ms of which 1 ms to minimize.
[2022-05-17 09:17:00] [INFO ] Deduced a trap composed of 52 places in 378 ms of which 1 ms to minimize.
[2022-05-17 09:17:00] [INFO ] Deduced a trap composed of 25 places in 430 ms of which 0 ms to minimize.
[2022-05-17 09:17:01] [INFO ] Deduced a trap composed of 69 places in 374 ms of which 1 ms to minimize.
[2022-05-17 09:17:01] [INFO ] Deduced a trap composed of 76 places in 429 ms of which 0 ms to minimize.
[2022-05-17 09:17:01] [INFO ] Deduced a trap composed of 34 places in 398 ms of which 0 ms to minimize.
[2022-05-17 09:17:02] [INFO ] Deduced a trap composed of 82 places in 386 ms of which 0 ms to minimize.
[2022-05-17 09:17:02] [INFO ] Deduced a trap composed of 28 places in 372 ms of which 1 ms to minimize.
[2022-05-17 09:17:03] [INFO ] Deduced a trap composed of 76 places in 378 ms of which 0 ms to minimize.
[2022-05-17 09:17:03] [INFO ] Deduced a trap composed of 15 places in 431 ms of which 1 ms to minimize.
[2022-05-17 09:17:04] [INFO ] Deduced a trap composed of 15 places in 425 ms of which 1 ms to minimize.
[2022-05-17 09:17:04] [INFO ] Deduced a trap composed of 86 places in 413 ms of which 1 ms to minimize.
[2022-05-17 09:17:05] [INFO ] Deduced a trap composed of 63 places in 367 ms of which 1 ms to minimize.
[2022-05-17 09:17:05] [INFO ] Deduced a trap composed of 93 places in 376 ms of which 1 ms to minimize.
[2022-05-17 09:17:06] [INFO ] Deduced a trap composed of 51 places in 388 ms of which 1 ms to minimize.
[2022-05-17 09:17:06] [INFO ] Deduced a trap composed of 44 places in 381 ms of which 0 ms to minimize.
[2022-05-17 09:17:07] [INFO ] Deduced a trap composed of 51 places in 359 ms of which 1 ms to minimize.
[2022-05-17 09:17:07] [INFO ] Deduced a trap composed of 43 places in 364 ms of which 1 ms to minimize.
[2022-05-17 09:17:07] [INFO ] Deduced a trap composed of 32 places in 366 ms of which 0 ms to minimize.
[2022-05-17 09:17:08] [INFO ] Deduced a trap composed of 45 places in 375 ms of which 0 ms to minimize.
[2022-05-17 09:17:08] [INFO ] Deduced a trap composed of 86 places in 412 ms of which 0 ms to minimize.
[2022-05-17 09:17:09] [INFO ] Deduced a trap composed of 79 places in 380 ms of which 1 ms to minimize.
[2022-05-17 09:17:09] [INFO ] Deduced a trap composed of 44 places in 404 ms of which 1 ms to minimize.
[2022-05-17 09:17:10] [INFO ] Deduced a trap composed of 53 places in 381 ms of which 1 ms to minimize.
[2022-05-17 09:17:10] [INFO ] Deduced a trap composed of 34 places in 379 ms of which 1 ms to minimize.
[2022-05-17 09:17:13] [INFO ] Deduced a trap composed of 13 places in 429 ms of which 2 ms to minimize.
[2022-05-17 09:17:14] [INFO ] Deduced a trap composed of 57 places in 391 ms of which 1 ms to minimize.
[2022-05-17 09:17:14] [INFO ] Deduced a trap composed of 39 places in 400 ms of which 1 ms to minimize.
[2022-05-17 09:17:15] [INFO ] Deduced a trap composed of 121 places in 381 ms of which 1 ms to minimize.
[2022-05-17 09:17:15] [INFO ] Deduced a trap composed of 68 places in 419 ms of which 1 ms to minimize.
[2022-05-17 09:17:16] [INFO ] Deduced a trap composed of 38 places in 390 ms of which 1 ms to minimize.
[2022-05-17 09:17:16] [INFO ] Deduced a trap composed of 19 places in 404 ms of which 1 ms to minimize.
[2022-05-17 09:17:17] [INFO ] Deduced a trap composed of 51 places in 380 ms of which 1 ms to minimize.
[2022-05-17 09:17:17] [INFO ] Deduced a trap composed of 51 places in 383 ms of which 1 ms to minimize.
[2022-05-17 09:17:18] [INFO ] Deduced a trap composed of 19 places in 406 ms of which 1 ms to minimize.
[2022-05-17 09:17:18] [INFO ] Deduced a trap composed of 28 places in 393 ms of which 1 ms to minimize.
[2022-05-17 09:17:19] [INFO ] Deduced a trap composed of 99 places in 425 ms of which 1 ms to minimize.
[2022-05-17 09:17:19] [INFO ] Deduced a trap composed of 15 places in 399 ms of which 1 ms to minimize.
[2022-05-17 09:17:20] [INFO ] Deduced a trap composed of 41 places in 407 ms of which 1 ms to minimize.
[2022-05-17 09:17:20] [INFO ] Deduced a trap composed of 140 places in 394 ms of which 0 ms to minimize.
[2022-05-17 09:17:21] [INFO ] Deduced a trap composed of 70 places in 371 ms of which 1 ms to minimize.
[2022-05-17 09:17:21] [INFO ] Deduced a trap composed of 129 places in 404 ms of which 1 ms to minimize.
[2022-05-17 09:17:22] [INFO ] Deduced a trap composed of 53 places in 366 ms of which 1 ms to minimize.
[2022-05-17 09:17:22] [INFO ] Deduced a trap composed of 128 places in 384 ms of which 1 ms to minimize.
[2022-05-17 09:17:23] [INFO ] Deduced a trap composed of 57 places in 400 ms of which 1 ms to minimize.
[2022-05-17 09:17:24] [INFO ] Deduced a trap composed of 32 places in 367 ms of which 1 ms to minimize.
[2022-05-17 09:17:24] [INFO ] Deduced a trap composed of 63 places in 389 ms of which 1 ms to minimize.
[2022-05-17 09:17:25] [INFO ] Deduced a trap composed of 39 places in 409 ms of which 1 ms to minimize.
[2022-05-17 09:17:25] [INFO ] Deduced a trap composed of 57 places in 423 ms of which 1 ms to minimize.
[2022-05-17 09:17:26] [INFO ] Deduced a trap composed of 39 places in 383 ms of which 1 ms to minimize.
[2022-05-17 09:17:26] [INFO ] Deduced a trap composed of 102 places in 416 ms of which 1 ms to minimize.
[2022-05-17 09:17:26] [INFO ] Deduced a trap composed of 114 places in 406 ms of which 1 ms to minimize.
[2022-05-17 09:17:27] [INFO ] Deduced a trap composed of 51 places in 440 ms of which 1 ms to minimize.
[2022-05-17 09:17:27] [INFO ] Deduced a trap composed of 101 places in 368 ms of which 1 ms to minimize.
[2022-05-17 09:17:28] [INFO ] Deduced a trap composed of 139 places in 397 ms of which 1 ms to minimize.
[2022-05-17 09:17:28] [INFO ] Deduced a trap composed of 114 places in 377 ms of which 1 ms to minimize.
[2022-05-17 09:17:29] [INFO ] Deduced a trap composed of 82 places in 393 ms of which 1 ms to minimize.
[2022-05-17 09:17:29] [INFO ] Deduced a trap composed of 57 places in 371 ms of which 1 ms to minimize.
[2022-05-17 09:17:30] [INFO ] Deduced a trap composed of 55 places in 353 ms of which 1 ms to minimize.
[2022-05-17 09:17:30] [INFO ] Deduced a trap composed of 55 places in 401 ms of which 1 ms to minimize.
[2022-05-17 09:17:31] [INFO ] Deduced a trap composed of 142 places in 374 ms of which 1 ms to minimize.
[2022-05-17 09:17:31] [INFO ] Deduced a trap composed of 38 places in 429 ms of which 1 ms to minimize.
[2022-05-17 09:17:32] [INFO ] Deduced a trap composed of 149 places in 336 ms of which 0 ms to minimize.
[2022-05-17 09:17:32] [INFO ] Deduced a trap composed of 127 places in 383 ms of which 1 ms to minimize.
[2022-05-17 09:17:32] [INFO ] Deduced a trap composed of 132 places in 365 ms of which 0 ms to minimize.
[2022-05-17 09:17:33] [INFO ] Deduced a trap composed of 120 places in 362 ms of which 1 ms to minimize.
[2022-05-17 09:17:33] [INFO ] Deduced a trap composed of 134 places in 359 ms of which 1 ms to minimize.
[2022-05-17 09:17:34] [INFO ] Deduced a trap composed of 120 places in 368 ms of which 1 ms to minimize.
[2022-05-17 09:17:34] [INFO ] Deduced a trap composed of 147 places in 364 ms of which 1 ms to minimize.
[2022-05-17 09:17:35] [INFO ] Deduced a trap composed of 82 places in 370 ms of which 1 ms to minimize.
[2022-05-17 09:17:35] [INFO ] Deduced a trap composed of 89 places in 373 ms of which 1 ms to minimize.
[2022-05-17 09:17:36] [INFO ] Deduced a trap composed of 95 places in 374 ms of which 1 ms to minimize.
[2022-05-17 09:17:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 09:17:36] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 09:17:36] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 09:17:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:17:36] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2022-05-17 09:17:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:17:36] [INFO ] [Nat]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 09:17:36] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 09:17:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:17:37] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2022-05-17 09:17:37] [INFO ] [Nat]Added 497 Read/Feed constraints in 163 ms returned sat
[2022-05-17 09:17:37] [INFO ] Deduced a trap composed of 32 places in 401 ms of which 1 ms to minimize.
[2022-05-17 09:17:38] [INFO ] Deduced a trap composed of 28 places in 402 ms of which 1 ms to minimize.
[2022-05-17 09:17:38] [INFO ] Deduced a trap composed of 49 places in 399 ms of which 1 ms to minimize.
[2022-05-17 09:17:39] [INFO ] Deduced a trap composed of 15 places in 400 ms of which 1 ms to minimize.
[2022-05-17 09:17:39] [INFO ] Deduced a trap composed of 13 places in 401 ms of which 1 ms to minimize.
[2022-05-17 09:17:40] [INFO ] Deduced a trap composed of 105 places in 409 ms of which 1 ms to minimize.
[2022-05-17 09:17:40] [INFO ] Deduced a trap composed of 57 places in 417 ms of which 1 ms to minimize.
[2022-05-17 09:17:41] [INFO ] Deduced a trap composed of 13 places in 415 ms of which 1 ms to minimize.
[2022-05-17 09:17:41] [INFO ] Deduced a trap composed of 57 places in 439 ms of which 1 ms to minimize.
[2022-05-17 09:17:42] [INFO ] Deduced a trap composed of 58 places in 419 ms of which 1 ms to minimize.
[2022-05-17 09:17:42] [INFO ] Deduced a trap composed of 13 places in 406 ms of which 1 ms to minimize.
[2022-05-17 09:17:43] [INFO ] Deduced a trap composed of 75 places in 389 ms of which 1 ms to minimize.
[2022-05-17 09:17:43] [INFO ] Deduced a trap composed of 72 places in 405 ms of which 1 ms to minimize.
[2022-05-17 09:17:44] [INFO ] Deduced a trap composed of 53 places in 382 ms of which 1 ms to minimize.
[2022-05-17 09:17:44] [INFO ] Deduced a trap composed of 45 places in 384 ms of which 1 ms to minimize.
[2022-05-17 09:17:45] [INFO ] Deduced a trap composed of 34 places in 399 ms of which 1 ms to minimize.
[2022-05-17 09:17:45] [INFO ] Deduced a trap composed of 52 places in 394 ms of which 1 ms to minimize.
[2022-05-17 09:17:46] [INFO ] Deduced a trap composed of 25 places in 386 ms of which 1 ms to minimize.
[2022-05-17 09:17:46] [INFO ] Deduced a trap composed of 69 places in 387 ms of which 1 ms to minimize.
[2022-05-17 09:17:47] [INFO ] Deduced a trap composed of 76 places in 423 ms of which 1 ms to minimize.
[2022-05-17 09:17:47] [INFO ] Deduced a trap composed of 34 places in 395 ms of which 1 ms to minimize.
[2022-05-17 09:17:48] [INFO ] Deduced a trap composed of 82 places in 392 ms of which 1 ms to minimize.
[2022-05-17 09:17:48] [INFO ] Deduced a trap composed of 28 places in 395 ms of which 1 ms to minimize.
[2022-05-17 09:17:49] [INFO ] Deduced a trap composed of 76 places in 391 ms of which 1 ms to minimize.
[2022-05-17 09:17:49] [INFO ] Deduced a trap composed of 15 places in 386 ms of which 0 ms to minimize.
[2022-05-17 09:17:50] [INFO ] Deduced a trap composed of 15 places in 383 ms of which 1 ms to minimize.
[2022-05-17 09:17:50] [INFO ] Deduced a trap composed of 86 places in 384 ms of which 1 ms to minimize.
[2022-05-17 09:17:50] [INFO ] Deduced a trap composed of 63 places in 393 ms of which 1 ms to minimize.
[2022-05-17 09:17:51] [INFO ] Deduced a trap composed of 93 places in 397 ms of which 1 ms to minimize.
[2022-05-17 09:17:51] [INFO ] Deduced a trap composed of 51 places in 383 ms of which 1 ms to minimize.
[2022-05-17 09:17:52] [INFO ] Deduced a trap composed of 44 places in 380 ms of which 1 ms to minimize.
[2022-05-17 09:17:52] [INFO ] Deduced a trap composed of 51 places in 384 ms of which 0 ms to minimize.
[2022-05-17 09:17:53] [INFO ] Deduced a trap composed of 43 places in 388 ms of which 1 ms to minimize.
[2022-05-17 09:17:53] [INFO ] Deduced a trap composed of 32 places in 418 ms of which 1 ms to minimize.
[2022-05-17 09:17:54] [INFO ] Deduced a trap composed of 45 places in 382 ms of which 1 ms to minimize.
[2022-05-17 09:17:54] [INFO ] Deduced a trap composed of 86 places in 413 ms of which 1 ms to minimize.
[2022-05-17 09:17:55] [INFO ] Deduced a trap composed of 79 places in 382 ms of which 1 ms to minimize.
[2022-05-17 09:17:55] [INFO ] Deduced a trap composed of 44 places in 415 ms of which 0 ms to minimize.
[2022-05-17 09:17:56] [INFO ] Deduced a trap composed of 53 places in 394 ms of which 1 ms to minimize.
[2022-05-17 09:17:56] [INFO ] Deduced a trap composed of 34 places in 391 ms of which 1 ms to minimize.
[2022-05-17 09:17:59] [INFO ] Deduced a trap composed of 13 places in 452 ms of which 1 ms to minimize.
[2022-05-17 09:18:00] [INFO ] Deduced a trap composed of 57 places in 419 ms of which 1 ms to minimize.
[2022-05-17 09:18:00] [INFO ] Deduced a trap composed of 39 places in 439 ms of which 1 ms to minimize.
[2022-05-17 09:18:01] [INFO ] Deduced a trap composed of 121 places in 436 ms of which 1 ms to minimize.
[2022-05-17 09:18:01] [INFO ] Deduced a trap composed of 68 places in 422 ms of which 1 ms to minimize.
[2022-05-17 09:18:02] [INFO ] Deduced a trap composed of 38 places in 401 ms of which 1 ms to minimize.
[2022-05-17 09:18:02] [INFO ] Deduced a trap composed of 19 places in 410 ms of which 1 ms to minimize.
[2022-05-17 09:18:03] [INFO ] Deduced a trap composed of 51 places in 375 ms of which 1 ms to minimize.
[2022-05-17 09:18:03] [INFO ] Deduced a trap composed of 51 places in 377 ms of which 1 ms to minimize.
[2022-05-17 09:18:04] [INFO ] Deduced a trap composed of 19 places in 391 ms of which 1 ms to minimize.
[2022-05-17 09:18:04] [INFO ] Deduced a trap composed of 28 places in 403 ms of which 1 ms to minimize.
[2022-05-17 09:18:05] [INFO ] Deduced a trap composed of 99 places in 417 ms of which 1 ms to minimize.
[2022-05-17 09:18:05] [INFO ] Deduced a trap composed of 15 places in 410 ms of which 1 ms to minimize.
[2022-05-17 09:18:06] [INFO ] Deduced a trap composed of 41 places in 398 ms of which 1 ms to minimize.
[2022-05-17 09:18:06] [INFO ] Deduced a trap composed of 140 places in 376 ms of which 1 ms to minimize.
[2022-05-17 09:18:07] [INFO ] Deduced a trap composed of 70 places in 387 ms of which 1 ms to minimize.
[2022-05-17 09:18:07] [INFO ] Deduced a trap composed of 129 places in 382 ms of which 1 ms to minimize.
[2022-05-17 09:18:08] [INFO ] Deduced a trap composed of 53 places in 383 ms of which 1 ms to minimize.
[2022-05-17 09:18:08] [INFO ] Deduced a trap composed of 128 places in 393 ms of which 1 ms to minimize.
[2022-05-17 09:18:09] [INFO ] Deduced a trap composed of 57 places in 377 ms of which 1 ms to minimize.
[2022-05-17 09:18:10] [INFO ] Deduced a trap composed of 32 places in 389 ms of which 1 ms to minimize.
[2022-05-17 09:18:10] [INFO ] Deduced a trap composed of 63 places in 353 ms of which 1 ms to minimize.
[2022-05-17 09:18:11] [INFO ] Deduced a trap composed of 39 places in 395 ms of which 1 ms to minimize.
[2022-05-17 09:18:11] [INFO ] Deduced a trap composed of 57 places in 399 ms of which 1 ms to minimize.
[2022-05-17 09:18:12] [INFO ] Deduced a trap composed of 39 places in 385 ms of which 1 ms to minimize.
[2022-05-17 09:18:12] [INFO ] Deduced a trap composed of 102 places in 379 ms of which 1 ms to minimize.
[2022-05-17 09:18:13] [INFO ] Deduced a trap composed of 114 places in 385 ms of which 0 ms to minimize.
[2022-05-17 09:18:13] [INFO ] Deduced a trap composed of 51 places in 386 ms of which 1 ms to minimize.
[2022-05-17 09:18:13] [INFO ] Deduced a trap composed of 101 places in 372 ms of which 1 ms to minimize.
[2022-05-17 09:18:14] [INFO ] Deduced a trap composed of 139 places in 379 ms of which 0 ms to minimize.
[2022-05-17 09:18:14] [INFO ] Deduced a trap composed of 114 places in 372 ms of which 3 ms to minimize.
[2022-05-17 09:18:15] [INFO ] Deduced a trap composed of 82 places in 363 ms of which 1 ms to minimize.
[2022-05-17 09:18:15] [INFO ] Deduced a trap composed of 57 places in 381 ms of which 0 ms to minimize.
[2022-05-17 09:18:16] [INFO ] Deduced a trap composed of 55 places in 364 ms of which 0 ms to minimize.
[2022-05-17 09:18:16] [INFO ] Deduced a trap composed of 55 places in 418 ms of which 1 ms to minimize.
[2022-05-17 09:18:17] [INFO ] Deduced a trap composed of 142 places in 373 ms of which 1 ms to minimize.
[2022-05-17 09:18:17] [INFO ] Deduced a trap composed of 38 places in 376 ms of which 0 ms to minimize.
[2022-05-17 09:18:17] [INFO ] Deduced a trap composed of 149 places in 353 ms of which 1 ms to minimize.
[2022-05-17 09:18:18] [INFO ] Deduced a trap composed of 127 places in 351 ms of which 1 ms to minimize.
[2022-05-17 09:18:18] [INFO ] Deduced a trap composed of 132 places in 348 ms of which 1 ms to minimize.
[2022-05-17 09:18:19] [INFO ] Deduced a trap composed of 120 places in 351 ms of which 1 ms to minimize.
[2022-05-17 09:18:19] [INFO ] Deduced a trap composed of 134 places in 357 ms of which 1 ms to minimize.
[2022-05-17 09:18:20] [INFO ] Deduced a trap composed of 120 places in 346 ms of which 0 ms to minimize.
[2022-05-17 09:18:20] [INFO ] Deduced a trap composed of 147 places in 350 ms of which 1 ms to minimize.
[2022-05-17 09:18:20] [INFO ] Deduced a trap composed of 82 places in 347 ms of which 1 ms to minimize.
[2022-05-17 09:18:21] [INFO ] Deduced a trap composed of 89 places in 348 ms of which 1 ms to minimize.
[2022-05-17 09:18:21] [INFO ] Deduced a trap composed of 95 places in 392 ms of which 1 ms to minimize.
[2022-05-17 09:18:21] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 09:18:21] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 09:18:21] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 09:18:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:18:22] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2022-05-17 09:18:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:18:22] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 09:18:22] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 09:18:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:18:23] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2022-05-17 09:18:23] [INFO ] [Nat]Added 497 Read/Feed constraints in 136 ms returned sat
[2022-05-17 09:18:23] [INFO ] Deduced a trap composed of 25 places in 397 ms of which 1 ms to minimize.
[2022-05-17 09:18:24] [INFO ] Deduced a trap composed of 21 places in 391 ms of which 1 ms to minimize.
[2022-05-17 09:18:24] [INFO ] Deduced a trap composed of 25 places in 384 ms of which 1 ms to minimize.
[2022-05-17 09:18:24] [INFO ] Deduced a trap composed of 25 places in 393 ms of which 1 ms to minimize.
[2022-05-17 09:18:25] [INFO ] Deduced a trap composed of 25 places in 400 ms of which 1 ms to minimize.
[2022-05-17 09:18:25] [INFO ] Deduced a trap composed of 25 places in 430 ms of which 1 ms to minimize.
[2022-05-17 09:18:26] [INFO ] Deduced a trap composed of 22 places in 409 ms of which 1 ms to minimize.
[2022-05-17 09:18:26] [INFO ] Deduced a trap composed of 21 places in 387 ms of which 3 ms to minimize.
[2022-05-17 09:18:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 3690 ms
[2022-05-17 09:18:26] [INFO ] [Real]Absence check using 23 positive place invariants in 23 ms returned sat
[2022-05-17 09:18:26] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 09:18:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:18:27] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2022-05-17 09:18:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:18:27] [INFO ] [Nat]Absence check using 23 positive place invariants in 42 ms returned sat
[2022-05-17 09:18:27] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 09:18:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:18:28] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2022-05-17 09:18:28] [INFO ] [Nat]Added 497 Read/Feed constraints in 131 ms returned sat
[2022-05-17 09:18:28] [INFO ] Deduced a trap composed of 25 places in 441 ms of which 1 ms to minimize.
[2022-05-17 09:18:29] [INFO ] Deduced a trap composed of 21 places in 402 ms of which 1 ms to minimize.
[2022-05-17 09:18:29] [INFO ] Deduced a trap composed of 25 places in 400 ms of which 1 ms to minimize.
[2022-05-17 09:18:30] [INFO ] Deduced a trap composed of 25 places in 413 ms of which 1 ms to minimize.
[2022-05-17 09:18:30] [INFO ] Deduced a trap composed of 25 places in 451 ms of which 1 ms to minimize.
[2022-05-17 09:18:31] [INFO ] Deduced a trap composed of 25 places in 400 ms of which 1 ms to minimize.
[2022-05-17 09:18:31] [INFO ] Deduced a trap composed of 22 places in 395 ms of which 0 ms to minimize.
[2022-05-17 09:18:31] [INFO ] Deduced a trap composed of 21 places in 393 ms of which 1 ms to minimize.
[2022-05-17 09:18:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 3782 ms
[2022-05-17 09:18:32] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 09:18:32] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 09:18:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:18:32] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2022-05-17 09:18:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:18:32] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 09:18:32] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 09:18:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:18:33] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2022-05-17 09:18:33] [INFO ] [Nat]Added 497 Read/Feed constraints in 170 ms returned sat
[2022-05-17 09:18:33] [INFO ] Deduced a trap composed of 134 places in 508 ms of which 1 ms to minimize.
[2022-05-17 09:18:34] [INFO ] Deduced a trap composed of 91 places in 474 ms of which 1 ms to minimize.
[2022-05-17 09:18:35] [INFO ] Deduced a trap composed of 130 places in 496 ms of which 1 ms to minimize.
[2022-05-17 09:18:35] [INFO ] Deduced a trap composed of 97 places in 492 ms of which 1 ms to minimize.
[2022-05-17 09:18:36] [INFO ] Deduced a trap composed of 70 places in 476 ms of which 1 ms to minimize.
[2022-05-17 09:18:36] [INFO ] Deduced a trap composed of 147 places in 433 ms of which 1 ms to minimize.
[2022-05-17 09:18:37] [INFO ] Deduced a trap composed of 167 places in 439 ms of which 1 ms to minimize.
[2022-05-17 09:18:37] [INFO ] Deduced a trap composed of 145 places in 420 ms of which 1 ms to minimize.
[2022-05-17 09:18:38] [INFO ] Deduced a trap composed of 151 places in 419 ms of which 1 ms to minimize.
[2022-05-17 09:18:38] [INFO ] Deduced a trap composed of 106 places in 385 ms of which 1 ms to minimize.
[2022-05-17 09:18:39] [INFO ] Deduced a trap composed of 128 places in 406 ms of which 1 ms to minimize.
[2022-05-17 09:18:39] [INFO ] Deduced a trap composed of 93 places in 378 ms of which 0 ms to minimize.
[2022-05-17 09:18:39] [INFO ] Deduced a trap composed of 143 places in 385 ms of which 1 ms to minimize.
[2022-05-17 09:18:40] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6660 ms
[2022-05-17 09:18:40] [INFO ] Computed and/alt/rep : 1800/5000/1800 causal constraints (skipped 112 transitions) in 107 ms.
[2022-05-17 09:18:43] [INFO ] Deduced a trap composed of 36 places in 414 ms of which 1 ms to minimize.
[2022-05-17 09:18:44] [INFO ] Deduced a trap composed of 58 places in 405 ms of which 0 ms to minimize.
[2022-05-17 09:18:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1104 ms
[2022-05-17 09:18:44] [INFO ] Added : 128 causal constraints over 26 iterations in 4360 ms. Result :sat
Minimization took 631 ms.
[2022-05-17 09:18:45] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 09:18:45] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 9 ms returned sat
[2022-05-17 09:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:18:45] [INFO ] [Real]Absence check using state equation in 430 ms returned sat
[2022-05-17 09:18:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:18:45] [INFO ] [Nat]Absence check using 23 positive place invariants in 37 ms returned sat
[2022-05-17 09:18:45] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 09:18:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:18:46] [INFO ] [Nat]Absence check using state equation in 437 ms returned sat
[2022-05-17 09:18:46] [INFO ] [Nat]Added 497 Read/Feed constraints in 126 ms returned sat
[2022-05-17 09:18:46] [INFO ] Deduced a trap composed of 25 places in 394 ms of which 1 ms to minimize.
[2022-05-17 09:18:47] [INFO ] Deduced a trap composed of 21 places in 410 ms of which 1 ms to minimize.
[2022-05-17 09:18:47] [INFO ] Deduced a trap composed of 25 places in 401 ms of which 0 ms to minimize.
[2022-05-17 09:18:48] [INFO ] Deduced a trap composed of 25 places in 395 ms of which 1 ms to minimize.
[2022-05-17 09:18:48] [INFO ] Deduced a trap composed of 25 places in 406 ms of which 1 ms to minimize.
[2022-05-17 09:18:49] [INFO ] Deduced a trap composed of 25 places in 396 ms of which 1 ms to minimize.
[2022-05-17 09:18:49] [INFO ] Deduced a trap composed of 22 places in 391 ms of which 1 ms to minimize.
[2022-05-17 09:18:50] [INFO ] Deduced a trap composed of 21 places in 393 ms of which 0 ms to minimize.
[2022-05-17 09:18:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 3642 ms
Current structural bounds on expressions (after SMT) : [8, 7, 8, 8, 8, 7, 7, 8, 7] Max seen :[6, 7, 6, 1, 1, 7, 7, 6, 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
Support contains 456 out of 1152 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 2 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 84 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 09:19:19] [INFO ] Computed 31 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 24818 ms. (steps per millisecond=40 ) properties (out of 5) seen :20
Interrupted Best-First random walk after 563437 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=112 ) properties seen 6
Interrupted Best-First random walk after 577765 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=115 ) properties seen 9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3162 ms. (steps per millisecond=316 ) properties (out of 5) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3155 ms. (steps per millisecond=316 ) properties (out of 5) seen :5
Interrupted Best-First random walk after 544636 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=108 ) properties seen 3
[2022-05-17 09:20:06] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1104 cols
[2022-05-17 09:20:06] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-17 09:20:06] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 09:20:06] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 09:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:20:06] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2022-05-17 09:20:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:20:06] [INFO ] [Nat]Absence check using 23 positive place invariants in 17 ms returned sat
[2022-05-17 09:20:06] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-17 09:20:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:20:07] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2022-05-17 09:20:07] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:20:07] [INFO ] [Nat]Added 497 Read/Feed constraints in 138 ms returned sat
[2022-05-17 09:20:07] [INFO ] Deduced a trap composed of 154 places in 461 ms of which 1 ms to minimize.
[2022-05-17 09:20:08] [INFO ] Deduced a trap composed of 99 places in 458 ms of which 1 ms to minimize.
[2022-05-17 09:20:08] [INFO ] Deduced a trap composed of 113 places in 430 ms of which 1 ms to minimize.
[2022-05-17 09:20:09] [INFO ] Deduced a trap composed of 139 places in 438 ms of which 1 ms to minimize.
[2022-05-17 09:20:09] [INFO ] Deduced a trap composed of 134 places in 442 ms of which 0 ms to minimize.
[2022-05-17 09:20:10] [INFO ] Deduced a trap composed of 119 places in 430 ms of which 1 ms to minimize.
[2022-05-17 09:20:10] [INFO ] Deduced a trap composed of 125 places in 455 ms of which 1 ms to minimize.
[2022-05-17 09:20:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3622 ms
[2022-05-17 09:20:11] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 84 ms.
[2022-05-17 09:20:16] [INFO ] Deduced a trap composed of 151 places in 419 ms of which 1 ms to minimize.
[2022-05-17 09:20:16] [INFO ] Deduced a trap composed of 139 places in 422 ms of which 1 ms to minimize.
[2022-05-17 09:20:17] [INFO ] Deduced a trap composed of 210 places in 430 ms of which 1 ms to minimize.
[2022-05-17 09:20:17] [INFO ] Deduced a trap composed of 87 places in 448 ms of which 1 ms to minimize.
[2022-05-17 09:20:18] [INFO ] Deduced a trap composed of 135 places in 493 ms of which 1 ms to minimize.
[2022-05-17 09:20:18] [INFO ] Deduced a trap composed of 30 places in 447 ms of which 1 ms to minimize.
[2022-05-17 09:20:19] [INFO ] Deduced a trap composed of 13 places in 452 ms of which 1 ms to minimize.
[2022-05-17 09:20:19] [INFO ] Deduced a trap composed of 174 places in 435 ms of which 1 ms to minimize.
[2022-05-17 09:20:20] [INFO ] Deduced a trap composed of 13 places in 416 ms of which 1 ms to minimize.
[2022-05-17 09:20:21] [INFO ] Deduced a trap composed of 29 places in 453 ms of which 1 ms to minimize.
[2022-05-17 09:20:21] [INFO ] Deduced a trap composed of 34 places in 434 ms of which 1 ms to minimize.
[2022-05-17 09:20:22] [INFO ] Deduced a trap composed of 11 places in 413 ms of which 1 ms to minimize.
[2022-05-17 09:20:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 6456 ms
[2022-05-17 09:20:22] [INFO ] Added : 240 causal constraints over 48 iterations in 11304 ms. Result :sat
Minimization took 394 ms.
[2022-05-17 09:20:22] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 09:20:22] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-17 09:20:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:20:23] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2022-05-17 09:20:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:20:23] [INFO ] [Nat]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 09:20:23] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 09:20:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:20:23] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2022-05-17 09:20:24] [INFO ] [Nat]Added 497 Read/Feed constraints in 135 ms returned sat
[2022-05-17 09:20:24] [INFO ] Deduced a trap composed of 154 places in 475 ms of which 1 ms to minimize.
[2022-05-17 09:20:25] [INFO ] Deduced a trap composed of 99 places in 464 ms of which 1 ms to minimize.
[2022-05-17 09:20:25] [INFO ] Deduced a trap composed of 113 places in 431 ms of which 1 ms to minimize.
[2022-05-17 09:20:26] [INFO ] Deduced a trap composed of 139 places in 436 ms of which 1 ms to minimize.
[2022-05-17 09:20:26] [INFO ] Deduced a trap composed of 134 places in 430 ms of which 1 ms to minimize.
[2022-05-17 09:20:27] [INFO ] Deduced a trap composed of 119 places in 453 ms of which 1 ms to minimize.
[2022-05-17 09:20:27] [INFO ] Deduced a trap composed of 125 places in 425 ms of which 1 ms to minimize.
[2022-05-17 09:20:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3608 ms
[2022-05-17 09:20:27] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 89 ms.
[2022-05-17 09:20:32] [INFO ] Deduced a trap composed of 151 places in 434 ms of which 1 ms to minimize.
[2022-05-17 09:20:33] [INFO ] Deduced a trap composed of 139 places in 464 ms of which 1 ms to minimize.
[2022-05-17 09:20:34] [INFO ] Deduced a trap composed of 210 places in 442 ms of which 1 ms to minimize.
[2022-05-17 09:20:34] [INFO ] Deduced a trap composed of 87 places in 443 ms of which 1 ms to minimize.
[2022-05-17 09:20:35] [INFO ] Deduced a trap composed of 135 places in 432 ms of which 1 ms to minimize.
[2022-05-17 09:20:35] [INFO ] Deduced a trap composed of 30 places in 435 ms of which 1 ms to minimize.
[2022-05-17 09:20:36] [INFO ] Deduced a trap composed of 13 places in 437 ms of which 1 ms to minimize.
[2022-05-17 09:20:36] [INFO ] Deduced a trap composed of 174 places in 438 ms of which 1 ms to minimize.
[2022-05-17 09:20:37] [INFO ] Deduced a trap composed of 13 places in 454 ms of which 1 ms to minimize.
[2022-05-17 09:20:37] [INFO ] Deduced a trap composed of 29 places in 471 ms of which 1 ms to minimize.
[2022-05-17 09:20:38] [INFO ] Deduced a trap composed of 34 places in 428 ms of which 1 ms to minimize.
[2022-05-17 09:20:38] [INFO ] Deduced a trap composed of 11 places in 436 ms of which 0 ms to minimize.
[2022-05-17 09:20:38] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 6489 ms
[2022-05-17 09:20:39] [INFO ] Added : 240 causal constraints over 48 iterations in 11394 ms. Result :sat
Minimization took 384 ms.
[2022-05-17 09:20:39] [INFO ] [Real]Absence check using 23 positive place invariants in 24 ms returned sat
[2022-05-17 09:20:39] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 10 ms returned sat
[2022-05-17 09:20:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:20:40] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2022-05-17 09:20:40] [INFO ] [Real]Added 497 Read/Feed constraints in 56 ms returned sat
[2022-05-17 09:20:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:20:40] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 09:20:40] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 09:20:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:20:40] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2022-05-17 09:20:40] [INFO ] [Nat]Added 497 Read/Feed constraints in 127 ms returned sat
[2022-05-17 09:20:41] [INFO ] Deduced a trap composed of 31 places in 355 ms of which 1 ms to minimize.
[2022-05-17 09:20:41] [INFO ] Deduced a trap composed of 39 places in 391 ms of which 1 ms to minimize.
[2022-05-17 09:20:42] [INFO ] Deduced a trap composed of 48 places in 358 ms of which 1 ms to minimize.
[2022-05-17 09:20:42] [INFO ] Deduced a trap composed of 13 places in 352 ms of which 1 ms to minimize.
[2022-05-17 09:20:43] [INFO ] Deduced a trap composed of 52 places in 356 ms of which 0 ms to minimize.
[2022-05-17 09:20:43] [INFO ] Deduced a trap composed of 67 places in 357 ms of which 0 ms to minimize.
[2022-05-17 09:20:43] [INFO ] Deduced a trap composed of 51 places in 389 ms of which 0 ms to minimize.
[2022-05-17 09:20:44] [INFO ] Deduced a trap composed of 28 places in 353 ms of which 1 ms to minimize.
[2022-05-17 09:20:44] [INFO ] Deduced a trap composed of 15 places in 353 ms of which 0 ms to minimize.
[2022-05-17 09:20:45] [INFO ] Deduced a trap composed of 60 places in 371 ms of which 1 ms to minimize.
[2022-05-17 09:20:45] [INFO ] Deduced a trap composed of 17 places in 380 ms of which 0 ms to minimize.
[2022-05-17 09:20:46] [INFO ] Deduced a trap composed of 42 places in 342 ms of which 1 ms to minimize.
[2022-05-17 09:20:46] [INFO ] Deduced a trap composed of 69 places in 347 ms of which 1 ms to minimize.
[2022-05-17 09:20:47] [INFO ] Deduced a trap composed of 61 places in 344 ms of which 1 ms to minimize.
[2022-05-17 09:20:47] [INFO ] Deduced a trap composed of 71 places in 349 ms of which 0 ms to minimize.
[2022-05-17 09:20:47] [INFO ] Deduced a trap composed of 50 places in 362 ms of which 1 ms to minimize.
[2022-05-17 09:20:48] [INFO ] Deduced a trap composed of 31 places in 353 ms of which 1 ms to minimize.
[2022-05-17 09:20:48] [INFO ] Deduced a trap composed of 83 places in 371 ms of which 0 ms to minimize.
[2022-05-17 09:20:49] [INFO ] Deduced a trap composed of 39 places in 351 ms of which 1 ms to minimize.
[2022-05-17 09:20:49] [INFO ] Deduced a trap composed of 50 places in 355 ms of which 0 ms to minimize.
[2022-05-17 09:20:50] [INFO ] Deduced a trap composed of 121 places in 380 ms of which 1 ms to minimize.
[2022-05-17 09:20:50] [INFO ] Deduced a trap composed of 57 places in 344 ms of which 1 ms to minimize.
[2022-05-17 09:20:50] [INFO ] Deduced a trap composed of 49 places in 353 ms of which 1 ms to minimize.
[2022-05-17 09:20:51] [INFO ] Deduced a trap composed of 69 places in 362 ms of which 0 ms to minimize.
[2022-05-17 09:20:51] [INFO ] Deduced a trap composed of 33 places in 359 ms of which 1 ms to minimize.
[2022-05-17 09:20:52] [INFO ] Deduced a trap composed of 49 places in 375 ms of which 0 ms to minimize.
[2022-05-17 09:20:52] [INFO ] Deduced a trap composed of 15 places in 360 ms of which 1 ms to minimize.
[2022-05-17 09:20:53] [INFO ] Deduced a trap composed of 40 places in 368 ms of which 1 ms to minimize.
[2022-05-17 09:20:53] [INFO ] Deduced a trap composed of 36 places in 353 ms of which 1 ms to minimize.
[2022-05-17 09:20:54] [INFO ] Deduced a trap composed of 63 places in 375 ms of which 1 ms to minimize.
[2022-05-17 09:20:54] [INFO ] Deduced a trap composed of 41 places in 374 ms of which 1 ms to minimize.
[2022-05-17 09:20:55] [INFO ] Deduced a trap composed of 15 places in 356 ms of which 1 ms to minimize.
[2022-05-17 09:20:55] [INFO ] Deduced a trap composed of 73 places in 359 ms of which 1 ms to minimize.
[2022-05-17 09:20:55] [INFO ] Deduced a trap composed of 75 places in 378 ms of which 0 ms to minimize.
[2022-05-17 09:20:56] [INFO ] Deduced a trap composed of 21 places in 358 ms of which 1 ms to minimize.
[2022-05-17 09:20:56] [INFO ] Deduced a trap composed of 159 places in 354 ms of which 1 ms to minimize.
[2022-05-17 09:20:57] [INFO ] Deduced a trap composed of 113 places in 350 ms of which 1 ms to minimize.
[2022-05-17 09:20:57] [INFO ] Deduced a trap composed of 91 places in 342 ms of which 0 ms to minimize.
[2022-05-17 09:20:57] [INFO ] Deduced a trap composed of 74 places in 339 ms of which 0 ms to minimize.
[2022-05-17 09:20:58] [INFO ] Deduced a trap composed of 92 places in 376 ms of which 1 ms to minimize.
[2022-05-17 09:20:58] [INFO ] Deduced a trap composed of 71 places in 370 ms of which 1 ms to minimize.
[2022-05-17 09:20:59] [INFO ] Deduced a trap composed of 60 places in 345 ms of which 0 ms to minimize.
[2022-05-17 09:20:59] [INFO ] Deduced a trap composed of 43 places in 348 ms of which 1 ms to minimize.
[2022-05-17 09:21:00] [INFO ] Deduced a trap composed of 60 places in 346 ms of which 1 ms to minimize.
[2022-05-17 09:21:00] [INFO ] Deduced a trap composed of 33 places in 354 ms of which 0 ms to minimize.
[2022-05-17 09:21:00] [INFO ] Deduced a trap composed of 51 places in 351 ms of which 0 ms to minimize.
[2022-05-17 09:21:01] [INFO ] Deduced a trap composed of 82 places in 354 ms of which 1 ms to minimize.
[2022-05-17 09:21:01] [INFO ] Deduced a trap composed of 51 places in 368 ms of which 0 ms to minimize.
[2022-05-17 09:21:02] [INFO ] Deduced a trap composed of 136 places in 350 ms of which 0 ms to minimize.
[2022-05-17 09:21:02] [INFO ] Deduced a trap composed of 57 places in 345 ms of which 1 ms to minimize.
[2022-05-17 09:21:03] [INFO ] Deduced a trap composed of 39 places in 355 ms of which 0 ms to minimize.
[2022-05-17 09:21:03] [INFO ] Deduced a trap composed of 67 places in 353 ms of which 1 ms to minimize.
[2022-05-17 09:21:04] [INFO ] Deduced a trap composed of 31 places in 373 ms of which 0 ms to minimize.
[2022-05-17 09:21:06] [INFO ] Deduced a trap composed of 21 places in 378 ms of which 1 ms to minimize.
[2022-05-17 09:21:06] [INFO ] Deduced a trap composed of 31 places in 358 ms of which 0 ms to minimize.
[2022-05-17 09:21:07] [INFO ] Deduced a trap composed of 27 places in 374 ms of which 1 ms to minimize.
[2022-05-17 09:21:07] [INFO ] Deduced a trap composed of 88 places in 365 ms of which 1 ms to minimize.
[2022-05-17 09:21:08] [INFO ] Deduced a trap composed of 118 places in 366 ms of which 1 ms to minimize.
[2022-05-17 09:21:08] [INFO ] Deduced a trap composed of 131 places in 361 ms of which 0 ms to minimize.
[2022-05-17 09:21:09] [INFO ] Deduced a trap composed of 102 places in 356 ms of which 1 ms to minimize.
[2022-05-17 09:21:09] [INFO ] Deduced a trap composed of 65 places in 388 ms of which 1 ms to minimize.
[2022-05-17 09:21:09] [INFO ] Deduced a trap composed of 11 places in 336 ms of which 1 ms to minimize.
[2022-05-17 09:21:10] [INFO ] Deduced a trap composed of 29 places in 343 ms of which 1 ms to minimize.
[2022-05-17 09:21:11] [INFO ] Deduced a trap composed of 91 places in 351 ms of which 1 ms to minimize.
[2022-05-17 09:21:11] [INFO ] Deduced a trap composed of 59 places in 331 ms of which 1 ms to minimize.
[2022-05-17 09:21:12] [INFO ] Deduced a trap composed of 47 places in 336 ms of which 0 ms to minimize.
[2022-05-17 09:21:12] [INFO ] Deduced a trap composed of 67 places in 333 ms of which 1 ms to minimize.
[2022-05-17 09:21:13] [INFO ] Deduced a trap composed of 53 places in 342 ms of which 1 ms to minimize.
[2022-05-17 09:21:13] [INFO ] Deduced a trap composed of 76 places in 334 ms of which 1 ms to minimize.
[2022-05-17 09:21:13] [INFO ] Deduced a trap composed of 59 places in 374 ms of which 1 ms to minimize.
[2022-05-17 09:21:14] [INFO ] Deduced a trap composed of 77 places in 345 ms of which 1 ms to minimize.
[2022-05-17 09:21:14] [INFO ] Deduced a trap composed of 136 places in 338 ms of which 0 ms to minimize.
[2022-05-17 09:21:15] [INFO ] Deduced a trap composed of 164 places in 338 ms of which 0 ms to minimize.
[2022-05-17 09:21:15] [INFO ] Deduced a trap composed of 47 places in 343 ms of which 1 ms to minimize.
[2022-05-17 09:21:16] [INFO ] Deduced a trap composed of 106 places in 348 ms of which 1 ms to minimize.
[2022-05-17 09:21:16] [INFO ] Deduced a trap composed of 76 places in 338 ms of which 0 ms to minimize.
[2022-05-17 09:21:17] [INFO ] Deduced a trap composed of 101 places in 385 ms of which 1 ms to minimize.
[2022-05-17 09:21:17] [INFO ] Deduced a trap composed of 101 places in 344 ms of which 0 ms to minimize.
[2022-05-17 09:21:17] [INFO ] Deduced a trap composed of 78 places in 356 ms of which 0 ms to minimize.
[2022-05-17 09:21:18] [INFO ] Deduced a trap composed of 144 places in 318 ms of which 1 ms to minimize.
[2022-05-17 09:21:18] [INFO ] Deduced a trap composed of 51 places in 356 ms of which 0 ms to minimize.
[2022-05-17 09:21:19] [INFO ] Deduced a trap composed of 94 places in 327 ms of which 1 ms to minimize.
[2022-05-17 09:21:19] [INFO ] Deduced a trap composed of 156 places in 324 ms of which 1 ms to minimize.
[2022-05-17 09:21:19] [INFO ] Deduced a trap composed of 67 places in 321 ms of which 0 ms to minimize.
[2022-05-17 09:21:20] [INFO ] Deduced a trap composed of 82 places in 333 ms of which 0 ms to minimize.
[2022-05-17 09:21:20] [INFO ] Deduced a trap composed of 57 places in 332 ms of which 1 ms to minimize.
[2022-05-17 09:21:21] [INFO ] Deduced a trap composed of 83 places in 339 ms of which 1 ms to minimize.
[2022-05-17 09:21:21] [INFO ] Deduced a trap composed of 99 places in 328 ms of which 1 ms to minimize.
[2022-05-17 09:21:22] [INFO ] Deduced a trap composed of 31 places in 332 ms of which 0 ms to minimize.
[2022-05-17 09:21:25] [INFO ] Trap strengthening (SAT) tested/added 89/89 trap constraints in 44341 ms
[2022-05-17 09:21:25] [INFO ] [Real]Absence check using 23 positive place invariants in 17 ms returned sat
[2022-05-17 09:21:25] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 09:21:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:21:25] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2022-05-17 09:21:25] [INFO ] [Real]Added 497 Read/Feed constraints in 57 ms returned sat
[2022-05-17 09:21:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:21:26] [INFO ] [Nat]Absence check using 23 positive place invariants in 17 ms returned sat
[2022-05-17 09:21:26] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-17 09:21:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:21:26] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2022-05-17 09:21:26] [INFO ] [Nat]Added 497 Read/Feed constraints in 134 ms returned sat
[2022-05-17 09:21:27] [INFO ] Deduced a trap composed of 31 places in 360 ms of which 1 ms to minimize.
[2022-05-17 09:21:27] [INFO ] Deduced a trap composed of 39 places in 395 ms of which 1 ms to minimize.
[2022-05-17 09:21:28] [INFO ] Deduced a trap composed of 48 places in 364 ms of which 1 ms to minimize.
[2022-05-17 09:21:28] [INFO ] Deduced a trap composed of 13 places in 357 ms of which 1 ms to minimize.
[2022-05-17 09:21:28] [INFO ] Deduced a trap composed of 52 places in 373 ms of which 1 ms to minimize.
[2022-05-17 09:21:29] [INFO ] Deduced a trap composed of 67 places in 360 ms of which 1 ms to minimize.
[2022-05-17 09:21:29] [INFO ] Deduced a trap composed of 51 places in 357 ms of which 1 ms to minimize.
[2022-05-17 09:21:30] [INFO ] Deduced a trap composed of 28 places in 359 ms of which 1 ms to minimize.
[2022-05-17 09:21:30] [INFO ] Deduced a trap composed of 15 places in 371 ms of which 1 ms to minimize.
[2022-05-17 09:21:31] [INFO ] Deduced a trap composed of 60 places in 378 ms of which 1 ms to minimize.
[2022-05-17 09:21:31] [INFO ] Deduced a trap composed of 17 places in 400 ms of which 1 ms to minimize.
[2022-05-17 09:21:32] [INFO ] Deduced a trap composed of 42 places in 335 ms of which 1 ms to minimize.
[2022-05-17 09:21:32] [INFO ] Deduced a trap composed of 69 places in 338 ms of which 1 ms to minimize.
[2022-05-17 09:21:32] [INFO ] Deduced a trap composed of 61 places in 363 ms of which 1 ms to minimize.
[2022-05-17 09:21:33] [INFO ] Deduced a trap composed of 71 places in 338 ms of which 1 ms to minimize.
[2022-05-17 09:21:33] [INFO ] Deduced a trap composed of 50 places in 365 ms of which 1 ms to minimize.
[2022-05-17 09:21:34] [INFO ] Deduced a trap composed of 31 places in 344 ms of which 1 ms to minimize.
[2022-05-17 09:21:34] [INFO ] Deduced a trap composed of 83 places in 338 ms of which 1 ms to minimize.
[2022-05-17 09:21:34] [INFO ] Deduced a trap composed of 39 places in 342 ms of which 0 ms to minimize.
[2022-05-17 09:21:35] [INFO ] Deduced a trap composed of 50 places in 341 ms of which 1 ms to minimize.
[2022-05-17 09:21:35] [INFO ] Deduced a trap composed of 121 places in 343 ms of which 0 ms to minimize.
[2022-05-17 09:21:36] [INFO ] Deduced a trap composed of 57 places in 344 ms of which 1 ms to minimize.
[2022-05-17 09:21:36] [INFO ] Deduced a trap composed of 49 places in 346 ms of which 1 ms to minimize.
[2022-05-17 09:21:37] [INFO ] Deduced a trap composed of 69 places in 348 ms of which 1 ms to minimize.
[2022-05-17 09:21:37] [INFO ] Deduced a trap composed of 33 places in 359 ms of which 0 ms to minimize.
[2022-05-17 09:21:37] [INFO ] Deduced a trap composed of 49 places in 349 ms of which 1 ms to minimize.
[2022-05-17 09:21:38] [INFO ] Deduced a trap composed of 15 places in 362 ms of which 1 ms to minimize.
[2022-05-17 09:21:39] [INFO ] Deduced a trap composed of 40 places in 353 ms of which 1 ms to minimize.
[2022-05-17 09:21:39] [INFO ] Deduced a trap composed of 36 places in 357 ms of which 1 ms to minimize.
[2022-05-17 09:21:39] [INFO ] Deduced a trap composed of 63 places in 358 ms of which 1 ms to minimize.
[2022-05-17 09:21:40] [INFO ] Deduced a trap composed of 41 places in 358 ms of which 1 ms to minimize.
[2022-05-17 09:21:40] [INFO ] Deduced a trap composed of 15 places in 361 ms of which 1 ms to minimize.
[2022-05-17 09:21:41] [INFO ] Deduced a trap composed of 73 places in 357 ms of which 0 ms to minimize.
[2022-05-17 09:21:41] [INFO ] Deduced a trap composed of 75 places in 357 ms of which 1 ms to minimize.
[2022-05-17 09:21:42] [INFO ] Deduced a trap composed of 21 places in 350 ms of which 1 ms to minimize.
[2022-05-17 09:21:42] [INFO ] Deduced a trap composed of 159 places in 354 ms of which 1 ms to minimize.
[2022-05-17 09:21:42] [INFO ] Deduced a trap composed of 113 places in 373 ms of which 0 ms to minimize.
[2022-05-17 09:21:43] [INFO ] Deduced a trap composed of 91 places in 351 ms of which 1 ms to minimize.
[2022-05-17 09:21:43] [INFO ] Deduced a trap composed of 74 places in 347 ms of which 1 ms to minimize.
[2022-05-17 09:21:44] [INFO ] Deduced a trap composed of 92 places in 372 ms of which 1 ms to minimize.
[2022-05-17 09:21:44] [INFO ] Deduced a trap composed of 71 places in 342 ms of which 0 ms to minimize.
[2022-05-17 09:21:44] [INFO ] Deduced a trap composed of 60 places in 347 ms of which 1 ms to minimize.
[2022-05-17 09:21:45] [INFO ] Deduced a trap composed of 43 places in 341 ms of which 1 ms to minimize.
[2022-05-17 09:21:45] [INFO ] Deduced a trap composed of 60 places in 349 ms of which 1 ms to minimize.
[2022-05-17 09:21:46] [INFO ] Deduced a trap composed of 33 places in 341 ms of which 1 ms to minimize.
[2022-05-17 09:21:46] [INFO ] Deduced a trap composed of 51 places in 353 ms of which 1 ms to minimize.
[2022-05-17 09:21:47] [INFO ] Deduced a trap composed of 82 places in 357 ms of which 1 ms to minimize.
[2022-05-17 09:21:47] [INFO ] Deduced a trap composed of 51 places in 359 ms of which 1 ms to minimize.
[2022-05-17 09:21:47] [INFO ] Deduced a trap composed of 136 places in 348 ms of which 1 ms to minimize.
[2022-05-17 09:21:48] [INFO ] Deduced a trap composed of 57 places in 381 ms of which 0 ms to minimize.
[2022-05-17 09:21:48] [INFO ] Deduced a trap composed of 39 places in 381 ms of which 1 ms to minimize.
[2022-05-17 09:21:49] [INFO ] Deduced a trap composed of 67 places in 358 ms of which 1 ms to minimize.
[2022-05-17 09:21:49] [INFO ] Deduced a trap composed of 31 places in 390 ms of which 1 ms to minimize.
[2022-05-17 09:21:51] [INFO ] Deduced a trap composed of 21 places in 367 ms of which 0 ms to minimize.
[2022-05-17 09:21:52] [INFO ] Deduced a trap composed of 31 places in 350 ms of which 1 ms to minimize.
[2022-05-17 09:21:53] [INFO ] Deduced a trap composed of 27 places in 360 ms of which 1 ms to minimize.
[2022-05-17 09:21:53] [INFO ] Deduced a trap composed of 88 places in 359 ms of which 1 ms to minimize.
[2022-05-17 09:21:53] [INFO ] Deduced a trap composed of 118 places in 359 ms of which 1 ms to minimize.
[2022-05-17 09:21:54] [INFO ] Deduced a trap composed of 131 places in 356 ms of which 1 ms to minimize.
[2022-05-17 09:21:54] [INFO ] Deduced a trap composed of 102 places in 363 ms of which 0 ms to minimize.
[2022-05-17 09:21:55] [INFO ] Deduced a trap composed of 65 places in 360 ms of which 1 ms to minimize.
[2022-05-17 09:21:55] [INFO ] Deduced a trap composed of 11 places in 353 ms of which 1 ms to minimize.
[2022-05-17 09:21:56] [INFO ] Deduced a trap composed of 29 places in 341 ms of which 0 ms to minimize.
[2022-05-17 09:21:57] [INFO ] Deduced a trap composed of 91 places in 365 ms of which 1 ms to minimize.
[2022-05-17 09:21:57] [INFO ] Deduced a trap composed of 59 places in 334 ms of which 0 ms to minimize.
[2022-05-17 09:21:58] [INFO ] Deduced a trap composed of 47 places in 344 ms of which 0 ms to minimize.
[2022-05-17 09:21:58] [INFO ] Deduced a trap composed of 67 places in 338 ms of which 1 ms to minimize.
[2022-05-17 09:21:58] [INFO ] Deduced a trap composed of 53 places in 337 ms of which 1 ms to minimize.
[2022-05-17 09:21:59] [INFO ] Deduced a trap composed of 76 places in 347 ms of which 0 ms to minimize.
[2022-05-17 09:21:59] [INFO ] Deduced a trap composed of 59 places in 385 ms of which 1 ms to minimize.
[2022-05-17 09:22:00] [INFO ] Deduced a trap composed of 77 places in 339 ms of which 1 ms to minimize.
[2022-05-17 09:22:00] [INFO ] Deduced a trap composed of 136 places in 364 ms of which 1 ms to minimize.
[2022-05-17 09:22:00] [INFO ] Deduced a trap composed of 164 places in 347 ms of which 1 ms to minimize.
[2022-05-17 09:22:01] [INFO ] Deduced a trap composed of 47 places in 362 ms of which 1 ms to minimize.
[2022-05-17 09:22:02] [INFO ] Deduced a trap composed of 106 places in 352 ms of which 1 ms to minimize.
[2022-05-17 09:22:02] [INFO ] Deduced a trap composed of 76 places in 326 ms of which 1 ms to minimize.
[2022-05-17 09:22:02] [INFO ] Deduced a trap composed of 101 places in 332 ms of which 0 ms to minimize.
[2022-05-17 09:22:03] [INFO ] Deduced a trap composed of 101 places in 331 ms of which 1 ms to minimize.
[2022-05-17 09:22:03] [INFO ] Deduced a trap composed of 78 places in 364 ms of which 0 ms to minimize.
[2022-05-17 09:22:04] [INFO ] Deduced a trap composed of 144 places in 375 ms of which 1 ms to minimize.
[2022-05-17 09:22:04] [INFO ] Deduced a trap composed of 51 places in 326 ms of which 1 ms to minimize.
[2022-05-17 09:22:04] [INFO ] Deduced a trap composed of 94 places in 341 ms of which 0 ms to minimize.
[2022-05-17 09:22:05] [INFO ] Deduced a trap composed of 156 places in 339 ms of which 1 ms to minimize.
[2022-05-17 09:22:05] [INFO ] Deduced a trap composed of 67 places in 348 ms of which 1 ms to minimize.
[2022-05-17 09:22:06] [INFO ] Deduced a trap composed of 82 places in 371 ms of which 1 ms to minimize.
[2022-05-17 09:22:06] [INFO ] Deduced a trap composed of 57 places in 353 ms of which 1 ms to minimize.
[2022-05-17 09:22:07] [INFO ] Deduced a trap composed of 83 places in 324 ms of which 1 ms to minimize.
[2022-05-17 09:22:07] [INFO ] Deduced a trap composed of 99 places in 339 ms of which 1 ms to minimize.
[2022-05-17 09:22:08] [INFO ] Deduced a trap composed of 31 places in 331 ms of which 1 ms to minimize.
[2022-05-17 09:22:11] [INFO ] Trap strengthening (SAT) tested/added 89/89 trap constraints in 44313 ms
[2022-05-17 09:22:11] [INFO ] [Real]Absence check using 23 positive place invariants in 17 ms returned sat
[2022-05-17 09:22:11] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 09:22:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:22:11] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2022-05-17 09:22:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:22:11] [INFO ] [Nat]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 09:22:11] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 09:22:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:22:12] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2022-05-17 09:22:12] [INFO ] [Nat]Added 497 Read/Feed constraints in 135 ms returned sat
[2022-05-17 09:22:12] [INFO ] Deduced a trap composed of 154 places in 453 ms of which 1 ms to minimize.
[2022-05-17 09:22:13] [INFO ] Deduced a trap composed of 99 places in 429 ms of which 1 ms to minimize.
[2022-05-17 09:22:13] [INFO ] Deduced a trap composed of 113 places in 452 ms of which 0 ms to minimize.
[2022-05-17 09:22:14] [INFO ] Deduced a trap composed of 139 places in 431 ms of which 1 ms to minimize.
[2022-05-17 09:22:14] [INFO ] Deduced a trap composed of 134 places in 479 ms of which 0 ms to minimize.
[2022-05-17 09:22:15] [INFO ] Deduced a trap composed of 119 places in 427 ms of which 1 ms to minimize.
[2022-05-17 09:22:15] [INFO ] Deduced a trap composed of 125 places in 462 ms of which 1 ms to minimize.
[2022-05-17 09:22:16] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3629 ms
[2022-05-17 09:22:16] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 107 ms.
[2022-05-17 09:22:21] [INFO ] Deduced a trap composed of 151 places in 440 ms of which 1 ms to minimize.
[2022-05-17 09:22:21] [INFO ] Deduced a trap composed of 139 places in 443 ms of which 3 ms to minimize.
[2022-05-17 09:22:22] [INFO ] Deduced a trap composed of 210 places in 428 ms of which 1 ms to minimize.
[2022-05-17 09:22:22] [INFO ] Deduced a trap composed of 87 places in 431 ms of which 1 ms to minimize.
[2022-05-17 09:22:23] [INFO ] Deduced a trap composed of 135 places in 429 ms of which 0 ms to minimize.
[2022-05-17 09:22:23] [INFO ] Deduced a trap composed of 30 places in 424 ms of which 1 ms to minimize.
[2022-05-17 09:22:24] [INFO ] Deduced a trap composed of 13 places in 431 ms of which 0 ms to minimize.
[2022-05-17 09:22:24] [INFO ] Deduced a trap composed of 174 places in 449 ms of which 1 ms to minimize.
[2022-05-17 09:22:25] [INFO ] Deduced a trap composed of 13 places in 424 ms of which 1 ms to minimize.
[2022-05-17 09:22:25] [INFO ] Deduced a trap composed of 29 places in 453 ms of which 1 ms to minimize.
[2022-05-17 09:22:26] [INFO ] Deduced a trap composed of 34 places in 425 ms of which 1 ms to minimize.
[2022-05-17 09:22:26] [INFO ] Deduced a trap composed of 11 places in 421 ms of which 1 ms to minimize.
[2022-05-17 09:22:27] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 6355 ms
[2022-05-17 09:22:27] [INFO ] Added : 240 causal constraints over 48 iterations in 11233 ms. Result :sat
Minimization took 394 ms.
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 in SAFETY mode, iteration 0 : 1104/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 40 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 in SAFETY mode, iteration 0 : 1104/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 50 ms. Remains 1104 /1104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2022-05-17 09:22:30] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1104 cols
[2022-05-17 09:22:30] [INFO ] Computed 31 place invariants in 6 ms
[2022-05-17 09:22:30] [INFO ] Implicit Places using invariants in 602 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 606 ms to find 8 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1096/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 33 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
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 09:22:30] [INFO ] Computed 23 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 25004 ms. (steps per millisecond=39 ) properties (out of 5) seen :23
Finished Best-First random walk after 543736 steps, including 1 resets, run visited all 5 properties in 5001 ms. (steps per millisecond=108 )
Finished Best-First random walk after 540631 steps, including 1 resets, run visited all 5 properties in 5001 ms. (steps per millisecond=108 )
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3177 ms. (steps per millisecond=314 ) properties (out of 5) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3173 ms. (steps per millisecond=315 ) properties (out of 5) seen :5
Interrupted Best-First random walk after 557488 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=111 ) properties seen 6
[2022-05-17 09:23:17] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 09:23:17] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-17 09:23:17] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 09:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:23:17] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2022-05-17 09:23:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:23:18] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2022-05-17 09:23:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:23:18] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2022-05-17 09:23:18] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:23:18] [INFO ] [Nat]Added 497 Read/Feed constraints in 163 ms returned sat
[2022-05-17 09:23:19] [INFO ] Deduced a trap composed of 177 places in 443 ms of which 1 ms to minimize.
[2022-05-17 09:23:19] [INFO ] Deduced a trap composed of 117 places in 448 ms of which 0 ms to minimize.
[2022-05-17 09:23:20] [INFO ] Deduced a trap composed of 166 places in 463 ms of which 1 ms to minimize.
[2022-05-17 09:23:20] [INFO ] Deduced a trap composed of 96 places in 458 ms of which 0 ms to minimize.
[2022-05-17 09:23:21] [INFO ] Deduced a trap composed of 80 places in 446 ms of which 0 ms to minimize.
[2022-05-17 09:23:21] [INFO ] Deduced a trap composed of 33 places in 434 ms of which 1 ms to minimize.
[2022-05-17 09:23:22] [INFO ] Deduced a trap composed of 33 places in 434 ms of which 0 ms to minimize.
[2022-05-17 09:23:22] [INFO ] Deduced a trap composed of 34 places in 440 ms of which 0 ms to minimize.
[2022-05-17 09:23:23] [INFO ] Deduced a trap composed of 56 places in 456 ms of which 1 ms to minimize.
[2022-05-17 09:23:23] [INFO ] Deduced a trap composed of 13 places in 429 ms of which 1 ms to minimize.
[2022-05-17 09:23:24] [INFO ] Deduced a trap composed of 13 places in 424 ms of which 1 ms to minimize.
[2022-05-17 09:23:24] [INFO ] Deduced a trap composed of 75 places in 405 ms of which 0 ms to minimize.
[2022-05-17 09:23:25] [INFO ] Deduced a trap composed of 113 places in 314 ms of which 0 ms to minimize.
[2022-05-17 09:23:25] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6479 ms
[2022-05-17 09:23:25] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 89 ms.
[2022-05-17 09:23:32] [INFO ] Deduced a trap composed of 77 places in 455 ms of which 1 ms to minimize.
[2022-05-17 09:23:32] [INFO ] Deduced a trap composed of 84 places in 442 ms of which 1 ms to minimize.
[2022-05-17 09:23:33] [INFO ] Deduced a trap composed of 87 places in 428 ms of which 1 ms to minimize.
[2022-05-17 09:23:33] [INFO ] Deduced a trap composed of 81 places in 433 ms of which 1 ms to minimize.
[2022-05-17 09:23:34] [INFO ] Deduced a trap composed of 88 places in 419 ms of which 1 ms to minimize.
[2022-05-17 09:23:34] [INFO ] Deduced a trap composed of 154 places in 428 ms of which 1 ms to minimize.
[2022-05-17 09:23:35] [INFO ] Deduced a trap composed of 13 places in 427 ms of which 1 ms to minimize.
[2022-05-17 09:23:35] [INFO ] Deduced a trap composed of 80 places in 445 ms of which 1 ms to minimize.
[2022-05-17 09:23:36] [INFO ] Deduced a trap composed of 73 places in 432 ms of which 1 ms to minimize.
[2022-05-17 09:23:36] [INFO ] Deduced a trap composed of 171 places in 434 ms of which 1 ms to minimize.
[2022-05-17 09:23:37] [INFO ] Deduced a trap composed of 77 places in 432 ms of which 1 ms to minimize.
[2022-05-17 09:23:38] [INFO ] Deduced a trap composed of 125 places in 438 ms of which 1 ms to minimize.
[2022-05-17 09:23:38] [INFO ] Deduced a trap composed of 46 places in 422 ms of which 1 ms to minimize.
[2022-05-17 09:23:39] [INFO ] Deduced a trap composed of 75 places in 450 ms of which 1 ms to minimize.
[2022-05-17 09:23:39] [INFO ] Deduced a trap composed of 50 places in 430 ms of which 1 ms to minimize.
[2022-05-17 09:23:40] [INFO ] Deduced a trap composed of 41 places in 430 ms of which 1 ms to minimize.
[2022-05-17 09:23:40] [INFO ] Deduced a trap composed of 61 places in 431 ms of which 1 ms to minimize.
[2022-05-17 09:23:41] [INFO ] Deduced a trap composed of 83 places in 431 ms of which 1 ms to minimize.
[2022-05-17 09:23:41] [INFO ] Deduced a trap composed of 21 places in 427 ms of which 1 ms to minimize.
[2022-05-17 09:23:42] [INFO ] Deduced a trap composed of 173 places in 426 ms of which 1 ms to minimize.
[2022-05-17 09:23:42] [INFO ] Deduced a trap composed of 52 places in 445 ms of which 0 ms to minimize.
[2022-05-17 09:23:43] [INFO ] Deduced a trap composed of 49 places in 438 ms of which 1 ms to minimize.
[2022-05-17 09:23:43] [INFO ] Deduced a trap composed of 121 places in 429 ms of which 1 ms to minimize.
[2022-05-17 09:23:44] [INFO ] Deduced a trap composed of 202 places in 427 ms of which 0 ms to minimize.
[2022-05-17 09:23:44] [INFO ] Deduced a trap composed of 137 places in 422 ms of which 1 ms to minimize.
[2022-05-17 09:23:45] [INFO ] Deduced a trap composed of 111 places in 425 ms of which 1 ms to minimize.
[2022-05-17 09:23:46] [INFO ] Deduced a trap composed of 125 places in 426 ms of which 1 ms to minimize.
[2022-05-17 09:23:46] [INFO ] Deduced a trap composed of 46 places in 388 ms of which 0 ms to minimize.
[2022-05-17 09:23:47] [INFO ] Deduced a trap composed of 151 places in 398 ms of which 1 ms to minimize.
[2022-05-17 09:23:47] [INFO ] Deduced a trap composed of 161 places in 396 ms of which 1 ms to minimize.
[2022-05-17 09:23:48] [INFO ] Deduced a trap composed of 35 places in 446 ms of which 1 ms to minimize.
[2022-05-17 09:23:48] [INFO ] Deduced a trap composed of 65 places in 425 ms of which 1 ms to minimize.
[2022-05-17 09:23:49] [INFO ] Deduced a trap composed of 53 places in 437 ms of which 1 ms to minimize.
[2022-05-17 09:23:49] [INFO ] Deduced a trap composed of 20 places in 443 ms of which 1 ms to minimize.
[2022-05-17 09:23:50] [INFO ] Deduced a trap composed of 141 places in 427 ms of which 1 ms to minimize.
[2022-05-17 09:23:50] [INFO ] Deduced a trap composed of 105 places in 415 ms of which 1 ms to minimize.
[2022-05-17 09:23:51] [INFO ] Deduced a trap composed of 47 places in 473 ms of which 1 ms to minimize.
[2022-05-17 09:23:52] [INFO ] Deduced a trap composed of 40 places in 423 ms of which 1 ms to minimize.
[2022-05-17 09:23:52] [INFO ] Deduced a trap composed of 15 places in 432 ms of which 1 ms to minimize.
[2022-05-17 09:23:53] [INFO ] Deduced a trap composed of 86 places in 364 ms of which 0 ms to minimize.
[2022-05-17 09:23:53] [INFO ] Deduced a trap composed of 135 places in 347 ms of which 1 ms to minimize.
[2022-05-17 09:23:54] [INFO ] Deduced a trap composed of 139 places in 346 ms of which 1 ms to minimize.
[2022-05-17 09:23:54] [INFO ] Deduced a trap composed of 27 places in 349 ms of which 1 ms to minimize.
[2022-05-17 09:23:55] [INFO ] Deduced a trap composed of 123 places in 329 ms of which 1 ms to minimize.
[2022-05-17 09:23:55] [INFO ] Deduced a trap composed of 100 places in 342 ms of which 1 ms to minimize.
[2022-05-17 09:23:56] [INFO ] Deduced a trap composed of 79 places in 436 ms of which 0 ms to minimize.
[2022-05-17 09:23:56] [INFO ] Deduced a trap composed of 202 places in 402 ms of which 1 ms to minimize.
[2022-05-17 09:23:57] [INFO ] Deduced a trap composed of 72 places in 432 ms of which 0 ms to minimize.
[2022-05-17 09:23:57] [INFO ] Deduced a trap composed of 42 places in 444 ms of which 1 ms to minimize.
[2022-05-17 09:23:58] [INFO ] Deduced a trap composed of 20 places in 434 ms of which 0 ms to minimize.
[2022-05-17 09:23:58] [INFO ] Deduced a trap composed of 100 places in 427 ms of which 1 ms to minimize.
[2022-05-17 09:23:59] [INFO ] Deduced a trap composed of 63 places in 430 ms of which 1 ms to minimize.
[2022-05-17 09:24:00] [INFO ] Deduced a trap composed of 11 places in 441 ms of which 1 ms to minimize.
[2022-05-17 09:24:00] [INFO ] Deduced a trap composed of 126 places in 432 ms of which 1 ms to minimize.
[2022-05-17 09:24:01] [INFO ] Deduced a trap composed of 81 places in 320 ms of which 1 ms to minimize.
[2022-05-17 09:24:01] [INFO ] Deduced a trap composed of 93 places in 331 ms of which 0 ms to minimize.
[2022-05-17 09:24:01] [INFO ] Deduced a trap composed of 160 places in 293 ms of which 1 ms to minimize.
[2022-05-17 09:24:02] [INFO ] Deduced a trap composed of 17 places in 424 ms of which 1 ms to minimize.
[2022-05-17 09:24:02] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 30945 ms
[2022-05-17 09:24:02] [INFO ] Added : 326 causal constraints over 66 iterations in 37635 ms.(timeout) Result :sat
Minimization took 187 ms.
[2022-05-17 09:24:03] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 09:24:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:24:03] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2022-05-17 09:24:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:24:03] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 09:24:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:24:04] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2022-05-17 09:24:04] [INFO ] [Nat]Added 497 Read/Feed constraints in 153 ms returned sat
[2022-05-17 09:24:04] [INFO ] Deduced a trap composed of 177 places in 459 ms of which 1 ms to minimize.
[2022-05-17 09:24:05] [INFO ] Deduced a trap composed of 117 places in 436 ms of which 0 ms to minimize.
[2022-05-17 09:24:05] [INFO ] Deduced a trap composed of 166 places in 440 ms of which 1 ms to minimize.
[2022-05-17 09:24:06] [INFO ] Deduced a trap composed of 96 places in 457 ms of which 1 ms to minimize.
[2022-05-17 09:24:06] [INFO ] Deduced a trap composed of 80 places in 481 ms of which 0 ms to minimize.
[2022-05-17 09:24:07] [INFO ] Deduced a trap composed of 33 places in 427 ms of which 0 ms to minimize.
[2022-05-17 09:24:07] [INFO ] Deduced a trap composed of 33 places in 444 ms of which 1 ms to minimize.
[2022-05-17 09:24:08] [INFO ] Deduced a trap composed of 34 places in 434 ms of which 1 ms to minimize.
[2022-05-17 09:24:08] [INFO ] Deduced a trap composed of 56 places in 467 ms of which 1 ms to minimize.
[2022-05-17 09:24:09] [INFO ] Deduced a trap composed of 13 places in 485 ms of which 1 ms to minimize.
[2022-05-17 09:24:09] [INFO ] Deduced a trap composed of 13 places in 472 ms of which 0 ms to minimize.
[2022-05-17 09:24:10] [INFO ] Deduced a trap composed of 75 places in 420 ms of which 1 ms to minimize.
[2022-05-17 09:24:10] [INFO ] Deduced a trap composed of 113 places in 307 ms of which 0 ms to minimize.
[2022-05-17 09:24:10] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6568 ms
[2022-05-17 09:24:10] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 92 ms.
[2022-05-17 09:24:17] [INFO ] Deduced a trap composed of 77 places in 515 ms of which 1 ms to minimize.
[2022-05-17 09:24:18] [INFO ] Deduced a trap composed of 84 places in 430 ms of which 1 ms to minimize.
[2022-05-17 09:24:19] [INFO ] Deduced a trap composed of 87 places in 435 ms of which 1 ms to minimize.
[2022-05-17 09:24:19] [INFO ] Deduced a trap composed of 81 places in 420 ms of which 1 ms to minimize.
[2022-05-17 09:24:20] [INFO ] Deduced a trap composed of 88 places in 439 ms of which 1 ms to minimize.
[2022-05-17 09:24:20] [INFO ] Deduced a trap composed of 154 places in 441 ms of which 1 ms to minimize.
[2022-05-17 09:24:21] [INFO ] Deduced a trap composed of 13 places in 452 ms of which 1 ms to minimize.
[2022-05-17 09:24:21] [INFO ] Deduced a trap composed of 80 places in 457 ms of which 1 ms to minimize.
[2022-05-17 09:24:22] [INFO ] Deduced a trap composed of 73 places in 466 ms of which 1 ms to minimize.
[2022-05-17 09:24:22] [INFO ] Deduced a trap composed of 171 places in 466 ms of which 1 ms to minimize.
[2022-05-17 09:24:23] [INFO ] Deduced a trap composed of 77 places in 443 ms of which 1 ms to minimize.
[2022-05-17 09:24:23] [INFO ] Deduced a trap composed of 125 places in 436 ms of which 1 ms to minimize.
[2022-05-17 09:24:24] [INFO ] Deduced a trap composed of 46 places in 425 ms of which 1 ms to minimize.
[2022-05-17 09:24:25] [INFO ] Deduced a trap composed of 75 places in 434 ms of which 1 ms to minimize.
[2022-05-17 09:24:25] [INFO ] Deduced a trap composed of 50 places in 427 ms of which 1 ms to minimize.
[2022-05-17 09:24:26] [INFO ] Deduced a trap composed of 41 places in 433 ms of which 1 ms to minimize.
[2022-05-17 09:24:26] [INFO ] Deduced a trap composed of 61 places in 426 ms of which 1 ms to minimize.
[2022-05-17 09:24:27] [INFO ] Deduced a trap composed of 83 places in 432 ms of which 1 ms to minimize.
[2022-05-17 09:24:27] [INFO ] Deduced a trap composed of 21 places in 433 ms of which 1 ms to minimize.
[2022-05-17 09:24:28] [INFO ] Deduced a trap composed of 173 places in 437 ms of which 1 ms to minimize.
[2022-05-17 09:24:28] [INFO ] Deduced a trap composed of 52 places in 422 ms of which 1 ms to minimize.
[2022-05-17 09:24:29] [INFO ] Deduced a trap composed of 49 places in 427 ms of which 0 ms to minimize.
[2022-05-17 09:24:29] [INFO ] Deduced a trap composed of 121 places in 436 ms of which 1 ms to minimize.
[2022-05-17 09:24:30] [INFO ] Deduced a trap composed of 202 places in 453 ms of which 1 ms to minimize.
[2022-05-17 09:24:30] [INFO ] Deduced a trap composed of 137 places in 424 ms of which 1 ms to minimize.
[2022-05-17 09:24:31] [INFO ] Deduced a trap composed of 111 places in 426 ms of which 1 ms to minimize.
[2022-05-17 09:24:31] [INFO ] Deduced a trap composed of 125 places in 442 ms of which 1 ms to minimize.
[2022-05-17 09:24:32] [INFO ] Deduced a trap composed of 46 places in 382 ms of which 1 ms to minimize.
[2022-05-17 09:24:32] [INFO ] Deduced a trap composed of 151 places in 399 ms of which 1 ms to minimize.
[2022-05-17 09:24:33] [INFO ] Deduced a trap composed of 161 places in 387 ms of which 1 ms to minimize.
[2022-05-17 09:24:34] [INFO ] Deduced a trap composed of 35 places in 431 ms of which 1 ms to minimize.
[2022-05-17 09:24:34] [INFO ] Deduced a trap composed of 65 places in 446 ms of which 1 ms to minimize.
[2022-05-17 09:24:35] [INFO ] Deduced a trap composed of 53 places in 445 ms of which 0 ms to minimize.
[2022-05-17 09:24:35] [INFO ] Deduced a trap composed of 20 places in 427 ms of which 0 ms to minimize.
[2022-05-17 09:24:36] [INFO ] Deduced a trap composed of 141 places in 429 ms of which 1 ms to minimize.
[2022-05-17 09:24:36] [INFO ] Deduced a trap composed of 105 places in 420 ms of which 1 ms to minimize.
[2022-05-17 09:24:37] [INFO ] Deduced a trap composed of 47 places in 425 ms of which 1 ms to minimize.
[2022-05-17 09:24:38] [INFO ] Deduced a trap composed of 40 places in 432 ms of which 1 ms to minimize.
[2022-05-17 09:24:38] [INFO ] Deduced a trap composed of 15 places in 450 ms of which 1 ms to minimize.
[2022-05-17 09:24:39] [INFO ] Deduced a trap composed of 86 places in 369 ms of which 0 ms to minimize.
[2022-05-17 09:24:39] [INFO ] Deduced a trap composed of 135 places in 350 ms of which 0 ms to minimize.
[2022-05-17 09:24:40] [INFO ] Deduced a trap composed of 139 places in 343 ms of which 1 ms to minimize.
[2022-05-17 09:24:40] [INFO ] Deduced a trap composed of 27 places in 347 ms of which 1 ms to minimize.
[2022-05-17 09:24:40] [INFO ] Deduced a trap composed of 123 places in 308 ms of which 1 ms to minimize.
[2022-05-17 09:24:41] [INFO ] Deduced a trap composed of 100 places in 337 ms of which 1 ms to minimize.
[2022-05-17 09:24:41] [INFO ] Deduced a trap composed of 79 places in 406 ms of which 1 ms to minimize.
[2022-05-17 09:24:42] [INFO ] Deduced a trap composed of 202 places in 396 ms of which 0 ms to minimize.
[2022-05-17 09:24:43] [INFO ] Deduced a trap composed of 72 places in 456 ms of which 1 ms to minimize.
[2022-05-17 09:24:43] [INFO ] Deduced a trap composed of 42 places in 425 ms of which 1 ms to minimize.
[2022-05-17 09:24:44] [INFO ] Deduced a trap composed of 20 places in 438 ms of which 1 ms to minimize.
[2022-05-17 09:24:44] [INFO ] Deduced a trap composed of 100 places in 423 ms of which 1 ms to minimize.
[2022-05-17 09:24:45] [INFO ] Deduced a trap composed of 63 places in 419 ms of which 1 ms to minimize.
[2022-05-17 09:24:45] [INFO ] Deduced a trap composed of 11 places in 402 ms of which 1 ms to minimize.
[2022-05-17 09:24:46] [INFO ] Deduced a trap composed of 126 places in 421 ms of which 1 ms to minimize.
[2022-05-17 09:24:46] [INFO ] Deduced a trap composed of 81 places in 306 ms of which 1 ms to minimize.
[2022-05-17 09:24:47] [INFO ] Deduced a trap composed of 93 places in 303 ms of which 1 ms to minimize.
[2022-05-17 09:24:47] [INFO ] Deduced a trap composed of 160 places in 315 ms of which 0 ms to minimize.
[2022-05-17 09:24:48] [INFO ] Deduced a trap composed of 17 places in 452 ms of which 1 ms to minimize.
[2022-05-17 09:24:48] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 31109 ms
[2022-05-17 09:24:48] [INFO ] Added : 326 causal constraints over 66 iterations in 37761 ms.(timeout) Result :unknown
[2022-05-17 09:24:48] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2022-05-17 09:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:24:49] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2022-05-17 09:24:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:24:49] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2022-05-17 09:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:24:49] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2022-05-17 09:24:49] [INFO ] [Nat]Added 497 Read/Feed constraints in 140 ms returned sat
[2022-05-17 09:24:50] [INFO ] Deduced a trap composed of 33 places in 348 ms of which 1 ms to minimize.
[2022-05-17 09:24:50] [INFO ] Deduced a trap composed of 49 places in 349 ms of which 1 ms to minimize.
[2022-05-17 09:24:51] [INFO ] Deduced a trap composed of 94 places in 352 ms of which 1 ms to minimize.
[2022-05-17 09:24:51] [INFO ] Deduced a trap composed of 74 places in 353 ms of which 1 ms to minimize.
[2022-05-17 09:24:51] [INFO ] Deduced a trap composed of 81 places in 362 ms of which 1 ms to minimize.
[2022-05-17 09:24:52] [INFO ] Deduced a trap composed of 29 places in 385 ms of which 1 ms to minimize.
[2022-05-17 09:24:52] [INFO ] Deduced a trap composed of 15 places in 351 ms of which 1 ms to minimize.
[2022-05-17 09:24:53] [INFO ] Deduced a trap composed of 28 places in 352 ms of which 0 ms to minimize.
[2022-05-17 09:24:53] [INFO ] Deduced a trap composed of 83 places in 362 ms of which 1 ms to minimize.
[2022-05-17 09:24:54] [INFO ] Deduced a trap composed of 24 places in 360 ms of which 1 ms to minimize.
[2022-05-17 09:24:54] [INFO ] Deduced a trap composed of 42 places in 350 ms of which 0 ms to minimize.
[2022-05-17 09:24:54] [INFO ] Deduced a trap composed of 24 places in 400 ms of which 1 ms to minimize.
[2022-05-17 09:24:55] [INFO ] Deduced a trap composed of 24 places in 363 ms of which 0 ms to minimize.
[2022-05-17 09:24:55] [INFO ] Deduced a trap composed of 44 places in 360 ms of which 1 ms to minimize.
[2022-05-17 09:24:56] [INFO ] Deduced a trap composed of 74 places in 366 ms of which 1 ms to minimize.
[2022-05-17 09:24:56] [INFO ] Deduced a trap composed of 42 places in 388 ms of which 1 ms to minimize.
[2022-05-17 09:24:57] [INFO ] Deduced a trap composed of 119 places in 372 ms of which 1 ms to minimize.
[2022-05-17 09:24:57] [INFO ] Deduced a trap composed of 15 places in 351 ms of which 1 ms to minimize.
[2022-05-17 09:24:58] [INFO ] Deduced a trap composed of 15 places in 363 ms of which 1 ms to minimize.
[2022-05-17 09:24:58] [INFO ] Deduced a trap composed of 42 places in 363 ms of which 1 ms to minimize.
[2022-05-17 09:24:59] [INFO ] Deduced a trap composed of 15 places in 375 ms of which 1 ms to minimize.
[2022-05-17 09:24:59] [INFO ] Deduced a trap composed of 71 places in 368 ms of which 1 ms to minimize.
[2022-05-17 09:24:59] [INFO ] Deduced a trap composed of 94 places in 343 ms of which 1 ms to minimize.
[2022-05-17 09:25:00] [INFO ] Deduced a trap composed of 109 places in 349 ms of which 1 ms to minimize.
[2022-05-17 09:25:00] [INFO ] Deduced a trap composed of 119 places in 346 ms of which 1 ms to minimize.
[2022-05-17 09:25:01] [INFO ] Deduced a trap composed of 79 places in 364 ms of which 1 ms to minimize.
[2022-05-17 09:25:01] [INFO ] Deduced a trap composed of 130 places in 345 ms of which 1 ms to minimize.
[2022-05-17 09:25:02] [INFO ] Deduced a trap composed of 106 places in 350 ms of which 1 ms to minimize.
[2022-05-17 09:25:02] [INFO ] Deduced a trap composed of 31 places in 344 ms of which 1 ms to minimize.
[2022-05-17 09:25:03] [INFO ] Deduced a trap composed of 93 places in 377 ms of which 1 ms to minimize.
[2022-05-17 09:25:03] [INFO ] Deduced a trap composed of 94 places in 363 ms of which 0 ms to minimize.
[2022-05-17 09:25:03] [INFO ] Deduced a trap composed of 123 places in 376 ms of which 1 ms to minimize.
[2022-05-17 09:25:04] [INFO ] Deduced a trap composed of 130 places in 372 ms of which 1 ms to minimize.
[2022-05-17 09:25:04] [INFO ] Deduced a trap composed of 111 places in 371 ms of which 1 ms to minimize.
[2022-05-17 09:25:05] [INFO ] Deduced a trap composed of 67 places in 355 ms of which 1 ms to minimize.
[2022-05-17 09:25:05] [INFO ] Deduced a trap composed of 94 places in 384 ms of which 1 ms to minimize.
[2022-05-17 09:25:06] [INFO ] Deduced a trap composed of 137 places in 357 ms of which 1 ms to minimize.
[2022-05-17 09:25:06] [INFO ] Deduced a trap composed of 59 places in 382 ms of which 0 ms to minimize.
[2022-05-17 09:25:06] [INFO ] Deduced a trap composed of 24 places in 370 ms of which 0 ms to minimize.
[2022-05-17 09:25:07] [INFO ] Deduced a trap composed of 24 places in 372 ms of which 0 ms to minimize.
[2022-05-17 09:25:07] [INFO ] Deduced a trap composed of 116 places in 368 ms of which 0 ms to minimize.
[2022-05-17 09:25:08] [INFO ] Deduced a trap composed of 49 places in 392 ms of which 1 ms to minimize.
[2022-05-17 09:25:08] [INFO ] Deduced a trap composed of 13 places in 383 ms of which 1 ms to minimize.
[2022-05-17 09:25:09] [INFO ] Deduced a trap composed of 57 places in 346 ms of which 1 ms to minimize.
[2022-05-17 09:25:09] [INFO ] Deduced a trap composed of 61 places in 370 ms of which 1 ms to minimize.
[2022-05-17 09:25:10] [INFO ] Deduced a trap composed of 24 places in 354 ms of which 1 ms to minimize.
[2022-05-17 09:25:10] [INFO ] Deduced a trap composed of 84 places in 358 ms of which 1 ms to minimize.
[2022-05-17 09:25:10] [INFO ] Deduced a trap composed of 42 places in 396 ms of which 1 ms to minimize.
[2022-05-17 09:25:11] [INFO ] Deduced a trap composed of 42 places in 376 ms of which 1 ms to minimize.
[2022-05-17 09:25:11] [INFO ] Deduced a trap composed of 41 places in 367 ms of which 1 ms to minimize.
[2022-05-17 09:25:12] [INFO ] Deduced a trap composed of 15 places in 366 ms of which 1 ms to minimize.
[2022-05-17 09:25:12] [INFO ] Deduced a trap composed of 42 places in 366 ms of which 1 ms to minimize.
[2022-05-17 09:25:13] [INFO ] Deduced a trap composed of 42 places in 356 ms of which 0 ms to minimize.
[2022-05-17 09:25:13] [INFO ] Deduced a trap composed of 47 places in 351 ms of which 1 ms to minimize.
[2022-05-17 09:25:14] [INFO ] Deduced a trap composed of 39 places in 339 ms of which 1 ms to minimize.
[2022-05-17 09:25:15] [INFO ] Deduced a trap composed of 86 places in 381 ms of which 1 ms to minimize.
[2022-05-17 09:25:15] [INFO ] Deduced a trap composed of 39 places in 336 ms of which 0 ms to minimize.
[2022-05-17 09:25:16] [INFO ] Deduced a trap composed of 33 places in 341 ms of which 1 ms to minimize.
[2022-05-17 09:25:18] [INFO ] Deduced a trap composed of 44 places in 345 ms of which 1 ms to minimize.
[2022-05-17 09:25:18] [INFO ] Deduced a trap composed of 74 places in 362 ms of which 0 ms to minimize.
[2022-05-17 09:25:19] [INFO ] Deduced a trap composed of 49 places in 346 ms of which 1 ms to minimize.
[2022-05-17 09:25:19] [INFO ] Deduced a trap composed of 109 places in 350 ms of which 1 ms to minimize.
[2022-05-17 09:25:19] [INFO ] Deduced a trap composed of 37 places in 356 ms of which 1 ms to minimize.
[2022-05-17 09:25:20] [INFO ] Deduced a trap composed of 62 places in 343 ms of which 1 ms to minimize.
[2022-05-17 09:25:20] [INFO ] Deduced a trap composed of 69 places in 344 ms of which 1 ms to minimize.
[2022-05-17 09:25:21] [INFO ] Deduced a trap composed of 99 places in 364 ms of which 1 ms to minimize.
[2022-05-17 09:25:21] [INFO ] Deduced a trap composed of 110 places in 354 ms of which 1 ms to minimize.
[2022-05-17 09:25:22] [INFO ] Deduced a trap composed of 59 places in 382 ms of which 1 ms to minimize.
[2022-05-17 09:25:22] [INFO ] Deduced a trap composed of 59 places in 341 ms of which 1 ms to minimize.
[2022-05-17 09:25:22] [INFO ] Deduced a trap composed of 24 places in 344 ms of which 1 ms to minimize.
[2022-05-17 09:25:23] [INFO ] Deduced a trap composed of 97 places in 346 ms of which 1 ms to minimize.
[2022-05-17 09:25:23] [INFO ] Deduced a trap composed of 24 places in 343 ms of which 0 ms to minimize.
[2022-05-17 09:25:24] [INFO ] Deduced a trap composed of 49 places in 362 ms of which 1 ms to minimize.
[2022-05-17 09:25:24] [INFO ] Deduced a trap composed of 73 places in 338 ms of which 0 ms to minimize.
[2022-05-17 09:25:25] [INFO ] Deduced a trap composed of 70 places in 346 ms of which 0 ms to minimize.
[2022-05-17 09:25:25] [INFO ] Deduced a trap composed of 51 places in 344 ms of which 1 ms to minimize.
[2022-05-17 09:25:25] [INFO ] Deduced a trap composed of 55 places in 340 ms of which 1 ms to minimize.
[2022-05-17 09:25:26] [INFO ] Deduced a trap composed of 56 places in 333 ms of which 1 ms to minimize.
[2022-05-17 09:25:26] [INFO ] Deduced a trap composed of 55 places in 336 ms of which 1 ms to minimize.
[2022-05-17 09:25:27] [INFO ] Deduced a trap composed of 91 places in 350 ms of which 0 ms to minimize.
[2022-05-17 09:25:27] [INFO ] Deduced a trap composed of 15 places in 358 ms of which 1 ms to minimize.
[2022-05-17 09:25:28] [INFO ] Deduced a trap composed of 34 places in 375 ms of which 1 ms to minimize.
[2022-05-17 09:25:28] [INFO ] Deduced a trap composed of 88 places in 360 ms of which 1 ms to minimize.
[2022-05-17 09:25:29] [INFO ] Deduced a trap composed of 152 places in 353 ms of which 1 ms to minimize.
[2022-05-17 09:25:29] [INFO ] Deduced a trap composed of 170 places in 371 ms of which 1 ms to minimize.
[2022-05-17 09:25:30] [INFO ] Deduced a trap composed of 170 places in 360 ms of which 0 ms to minimize.
[2022-05-17 09:25:30] [INFO ] Deduced a trap composed of 39 places in 367 ms of which 1 ms to minimize.
[2022-05-17 09:25:30] [INFO ] Deduced a trap composed of 105 places in 342 ms of which 1 ms to minimize.
[2022-05-17 09:25:31] [INFO ] Deduced a trap composed of 87 places in 322 ms of which 1 ms to minimize.
[2022-05-17 09:25:31] [INFO ] Deduced a trap composed of 57 places in 337 ms of which 1 ms to minimize.
[2022-05-17 09:25:32] [INFO ] Deduced a trap composed of 75 places in 330 ms of which 1 ms to minimize.
[2022-05-17 09:25:32] [INFO ] Deduced a trap composed of 123 places in 344 ms of which 0 ms to minimize.
[2022-05-17 09:25:32] [INFO ] Deduced a trap composed of 21 places in 333 ms of which 0 ms to minimize.
[2022-05-17 09:25:33] [INFO ] Deduced a trap composed of 111 places in 343 ms of which 1 ms to minimize.
[2022-05-17 09:25:33] [INFO ] Deduced a trap composed of 136 places in 327 ms of which 0 ms to minimize.
[2022-05-17 09:25:34] [INFO ] Deduced a trap composed of 77 places in 324 ms of which 1 ms to minimize.
[2022-05-17 09:25:34] [INFO ] Deduced a trap composed of 87 places in 364 ms of which 0 ms to minimize.
[2022-05-17 09:25:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 09:25:34] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2022-05-17 09:25:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:25:34] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2022-05-17 09:25:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:25:35] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2022-05-17 09:25:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:25:35] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2022-05-17 09:25:35] [INFO ] [Nat]Added 497 Read/Feed constraints in 141 ms returned sat
[2022-05-17 09:25:36] [INFO ] Deduced a trap composed of 33 places in 344 ms of which 0 ms to minimize.
[2022-05-17 09:25:36] [INFO ] Deduced a trap composed of 49 places in 364 ms of which 0 ms to minimize.
[2022-05-17 09:25:36] [INFO ] Deduced a trap composed of 94 places in 360 ms of which 0 ms to minimize.
[2022-05-17 09:25:37] [INFO ] Deduced a trap composed of 74 places in 352 ms of which 1 ms to minimize.
[2022-05-17 09:25:37] [INFO ] Deduced a trap composed of 81 places in 354 ms of which 1 ms to minimize.
[2022-05-17 09:25:38] [INFO ] Deduced a trap composed of 29 places in 353 ms of which 1 ms to minimize.
[2022-05-17 09:25:38] [INFO ] Deduced a trap composed of 15 places in 367 ms of which 1 ms to minimize.
[2022-05-17 09:25:39] [INFO ] Deduced a trap composed of 28 places in 358 ms of which 1 ms to minimize.
[2022-05-17 09:25:39] [INFO ] Deduced a trap composed of 83 places in 361 ms of which 1 ms to minimize.
[2022-05-17 09:25:39] [INFO ] Deduced a trap composed of 24 places in 378 ms of which 1 ms to minimize.
[2022-05-17 09:25:40] [INFO ] Deduced a trap composed of 42 places in 356 ms of which 1 ms to minimize.
[2022-05-17 09:25:40] [INFO ] Deduced a trap composed of 24 places in 357 ms of which 1 ms to minimize.
[2022-05-17 09:25:41] [INFO ] Deduced a trap composed of 24 places in 356 ms of which 1 ms to minimize.
[2022-05-17 09:25:41] [INFO ] Deduced a trap composed of 44 places in 363 ms of which 1 ms to minimize.
[2022-05-17 09:25:42] [INFO ] Deduced a trap composed of 74 places in 363 ms of which 1 ms to minimize.
[2022-05-17 09:25:42] [INFO ] Deduced a trap composed of 42 places in 407 ms of which 1 ms to minimize.
[2022-05-17 09:25:42] [INFO ] Deduced a trap composed of 119 places in 375 ms of which 1 ms to minimize.
[2022-05-17 09:25:43] [INFO ] Deduced a trap composed of 15 places in 349 ms of which 1 ms to minimize.
[2022-05-17 09:25:43] [INFO ] Deduced a trap composed of 15 places in 391 ms of which 1 ms to minimize.
[2022-05-17 09:25:44] [INFO ] Deduced a trap composed of 42 places in 368 ms of which 1 ms to minimize.
[2022-05-17 09:25:44] [INFO ] Deduced a trap composed of 15 places in 391 ms of which 1 ms to minimize.
[2022-05-17 09:25:45] [INFO ] Deduced a trap composed of 71 places in 342 ms of which 1 ms to minimize.
[2022-05-17 09:25:45] [INFO ] Deduced a trap composed of 94 places in 351 ms of which 1 ms to minimize.
[2022-05-17 09:25:46] [INFO ] Deduced a trap composed of 109 places in 350 ms of which 0 ms to minimize.
[2022-05-17 09:25:46] [INFO ] Deduced a trap composed of 119 places in 352 ms of which 1 ms to minimize.
[2022-05-17 09:25:46] [INFO ] Deduced a trap composed of 79 places in 346 ms of which 1 ms to minimize.
[2022-05-17 09:25:47] [INFO ] Deduced a trap composed of 130 places in 375 ms of which 1 ms to minimize.
[2022-05-17 09:25:47] [INFO ] Deduced a trap composed of 106 places in 353 ms of which 1 ms to minimize.
[2022-05-17 09:25:48] [INFO ] Deduced a trap composed of 31 places in 349 ms of which 1 ms to minimize.
[2022-05-17 09:25:48] [INFO ] Deduced a trap composed of 93 places in 355 ms of which 1 ms to minimize.
[2022-05-17 09:25:49] [INFO ] Deduced a trap composed of 94 places in 360 ms of which 1 ms to minimize.
[2022-05-17 09:25:49] [INFO ] Deduced a trap composed of 123 places in 373 ms of which 1 ms to minimize.
[2022-05-17 09:25:50] [INFO ] Deduced a trap composed of 130 places in 360 ms of which 0 ms to minimize.
[2022-05-17 09:25:50] [INFO ] Deduced a trap composed of 111 places in 359 ms of which 0 ms to minimize.
[2022-05-17 09:25:50] [INFO ] Deduced a trap composed of 67 places in 360 ms of which 1 ms to minimize.
[2022-05-17 09:25:51] [INFO ] Deduced a trap composed of 94 places in 353 ms of which 0 ms to minimize.
[2022-05-17 09:25:51] [INFO ] Deduced a trap composed of 137 places in 383 ms of which 1 ms to minimize.
[2022-05-17 09:25:52] [INFO ] Deduced a trap composed of 59 places in 356 ms of which 1 ms to minimize.
[2022-05-17 09:25:52] [INFO ] Deduced a trap composed of 24 places in 360 ms of which 1 ms to minimize.
[2022-05-17 09:25:53] [INFO ] Deduced a trap composed of 24 places in 357 ms of which 1 ms to minimize.
[2022-05-17 09:25:53] [INFO ] Deduced a trap composed of 116 places in 362 ms of which 1 ms to minimize.
[2022-05-17 09:25:53] [INFO ] Deduced a trap composed of 49 places in 356 ms of which 1 ms to minimize.
[2022-05-17 09:25:54] [INFO ] Deduced a trap composed of 13 places in 381 ms of which 1 ms to minimize.
[2022-05-17 09:25:54] [INFO ] Deduced a trap composed of 57 places in 355 ms of which 1 ms to minimize.
[2022-05-17 09:25:55] [INFO ] Deduced a trap composed of 61 places in 339 ms of which 1 ms to minimize.
[2022-05-17 09:25:55] [INFO ] Deduced a trap composed of 24 places in 363 ms of which 0 ms to minimize.
[2022-05-17 09:25:56] [INFO ] Deduced a trap composed of 84 places in 364 ms of which 1 ms to minimize.
[2022-05-17 09:25:56] [INFO ] Deduced a trap composed of 42 places in 360 ms of which 1 ms to minimize.
[2022-05-17 09:25:57] [INFO ] Deduced a trap composed of 42 places in 355 ms of which 1 ms to minimize.
[2022-05-17 09:25:57] [INFO ] Deduced a trap composed of 41 places in 367 ms of which 0 ms to minimize.
[2022-05-17 09:25:57] [INFO ] Deduced a trap composed of 15 places in 390 ms of which 1 ms to minimize.
[2022-05-17 09:25:58] [INFO ] Deduced a trap composed of 42 places in 358 ms of which 1 ms to minimize.
[2022-05-17 09:25:58] [INFO ] Deduced a trap composed of 42 places in 358 ms of which 1 ms to minimize.
[2022-05-17 09:25:59] [INFO ] Deduced a trap composed of 47 places in 342 ms of which 0 ms to minimize.
[2022-05-17 09:25:59] [INFO ] Deduced a trap composed of 39 places in 358 ms of which 0 ms to minimize.
[2022-05-17 09:26:00] [INFO ] Deduced a trap composed of 86 places in 383 ms of which 1 ms to minimize.
[2022-05-17 09:26:01] [INFO ] Deduced a trap composed of 39 places in 378 ms of which 1 ms to minimize.
[2022-05-17 09:26:01] [INFO ] Deduced a trap composed of 33 places in 376 ms of which 0 ms to minimize.
[2022-05-17 09:26:03] [INFO ] Deduced a trap composed of 44 places in 391 ms of which 1 ms to minimize.
[2022-05-17 09:26:04] [INFO ] Deduced a trap composed of 74 places in 369 ms of which 0 ms to minimize.
[2022-05-17 09:26:04] [INFO ] Deduced a trap composed of 49 places in 414 ms of which 1 ms to minimize.
[2022-05-17 09:26:05] [INFO ] Deduced a trap composed of 109 places in 371 ms of which 1 ms to minimize.
[2022-05-17 09:26:05] [INFO ] Deduced a trap composed of 37 places in 358 ms of which 1 ms to minimize.
[2022-05-17 09:26:06] [INFO ] Deduced a trap composed of 62 places in 360 ms of which 0 ms to minimize.
[2022-05-17 09:26:06] [INFO ] Deduced a trap composed of 69 places in 366 ms of which 1 ms to minimize.
[2022-05-17 09:26:07] [INFO ] Deduced a trap composed of 99 places in 347 ms of which 1 ms to minimize.
[2022-05-17 09:26:07] [INFO ] Deduced a trap composed of 110 places in 392 ms of which 1 ms to minimize.
[2022-05-17 09:26:07] [INFO ] Deduced a trap composed of 59 places in 380 ms of which 0 ms to minimize.
[2022-05-17 09:26:08] [INFO ] Deduced a trap composed of 59 places in 355 ms of which 1 ms to minimize.
[2022-05-17 09:26:08] [INFO ] Deduced a trap composed of 24 places in 359 ms of which 1 ms to minimize.
[2022-05-17 09:26:09] [INFO ] Deduced a trap composed of 97 places in 356 ms of which 1 ms to minimize.
[2022-05-17 09:26:09] [INFO ] Deduced a trap composed of 24 places in 346 ms of which 1 ms to minimize.
[2022-05-17 09:26:10] [INFO ] Deduced a trap composed of 49 places in 350 ms of which 1 ms to minimize.
[2022-05-17 09:26:10] [INFO ] Deduced a trap composed of 73 places in 332 ms of which 0 ms to minimize.
[2022-05-17 09:26:10] [INFO ] Deduced a trap composed of 70 places in 333 ms of which 1 ms to minimize.
[2022-05-17 09:26:11] [INFO ] Deduced a trap composed of 51 places in 325 ms of which 1 ms to minimize.
[2022-05-17 09:26:11] [INFO ] Deduced a trap composed of 55 places in 354 ms of which 1 ms to minimize.
[2022-05-17 09:26:12] [INFO ] Deduced a trap composed of 56 places in 336 ms of which 1 ms to minimize.
[2022-05-17 09:26:12] [INFO ] Deduced a trap composed of 55 places in 326 ms of which 1 ms to minimize.
[2022-05-17 09:26:13] [INFO ] Deduced a trap composed of 91 places in 344 ms of which 1 ms to minimize.
[2022-05-17 09:26:13] [INFO ] Deduced a trap composed of 15 places in 351 ms of which 0 ms to minimize.
[2022-05-17 09:26:14] [INFO ] Deduced a trap composed of 34 places in 372 ms of which 1 ms to minimize.
[2022-05-17 09:26:14] [INFO ] Deduced a trap composed of 88 places in 340 ms of which 1 ms to minimize.
[2022-05-17 09:26:14] [INFO ] Deduced a trap composed of 152 places in 352 ms of which 1 ms to minimize.
[2022-05-17 09:26:15] [INFO ] Deduced a trap composed of 170 places in 344 ms of which 1 ms to minimize.
[2022-05-17 09:26:15] [INFO ] Deduced a trap composed of 170 places in 396 ms of which 1 ms to minimize.
[2022-05-17 09:26:16] [INFO ] Deduced a trap composed of 39 places in 346 ms of which 1 ms to minimize.
[2022-05-17 09:26:16] [INFO ] Deduced a trap composed of 105 places in 333 ms of which 1 ms to minimize.
[2022-05-17 09:26:16] [INFO ] Deduced a trap composed of 87 places in 354 ms of which 1 ms to minimize.
[2022-05-17 09:26:17] [INFO ] Deduced a trap composed of 57 places in 329 ms of which 1 ms to minimize.
[2022-05-17 09:26:17] [INFO ] Deduced a trap composed of 75 places in 336 ms of which 1 ms to minimize.
[2022-05-17 09:26:18] [INFO ] Deduced a trap composed of 123 places in 346 ms of which 1 ms to minimize.
[2022-05-17 09:26:18] [INFO ] Deduced a trap composed of 21 places in 345 ms of which 1 ms to minimize.
[2022-05-17 09:26:18] [INFO ] Deduced a trap composed of 111 places in 327 ms of which 1 ms to minimize.
[2022-05-17 09:26:19] [INFO ] Deduced a trap composed of 136 places in 332 ms of which 0 ms to minimize.
[2022-05-17 09:26:19] [INFO ] Deduced a trap composed of 77 places in 331 ms of which 1 ms to minimize.
[2022-05-17 09:26:20] [INFO ] Deduced a trap composed of 87 places in 334 ms of which 1 ms to minimize.
[2022-05-17 09:26:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 09:26:20] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 09:26:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:26:20] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2022-05-17 09:26:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:26:20] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 09:26:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:26:21] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2022-05-17 09:26:21] [INFO ] [Nat]Added 497 Read/Feed constraints in 153 ms returned sat
[2022-05-17 09:26:21] [INFO ] Deduced a trap composed of 177 places in 441 ms of which 1 ms to minimize.
[2022-05-17 09:26:22] [INFO ] Deduced a trap composed of 117 places in 433 ms of which 1 ms to minimize.
[2022-05-17 09:26:22] [INFO ] Deduced a trap composed of 166 places in 434 ms of which 1 ms to minimize.
[2022-05-17 09:26:23] [INFO ] Deduced a trap composed of 96 places in 436 ms of which 1 ms to minimize.
[2022-05-17 09:26:23] [INFO ] Deduced a trap composed of 80 places in 448 ms of which 1 ms to minimize.
[2022-05-17 09:26:24] [INFO ] Deduced a trap composed of 33 places in 423 ms of which 1 ms to minimize.
[2022-05-17 09:26:24] [INFO ] Deduced a trap composed of 33 places in 425 ms of which 1 ms to minimize.
[2022-05-17 09:26:25] [INFO ] Deduced a trap composed of 34 places in 435 ms of which 1 ms to minimize.
[2022-05-17 09:26:25] [INFO ] Deduced a trap composed of 56 places in 439 ms of which 1 ms to minimize.
[2022-05-17 09:26:26] [INFO ] Deduced a trap composed of 13 places in 430 ms of which 1 ms to minimize.
[2022-05-17 09:26:26] [INFO ] Deduced a trap composed of 13 places in 419 ms of which 0 ms to minimize.
[2022-05-17 09:26:27] [INFO ] Deduced a trap composed of 75 places in 408 ms of which 1 ms to minimize.
[2022-05-17 09:26:27] [INFO ] Deduced a trap composed of 113 places in 332 ms of which 1 ms to minimize.
[2022-05-17 09:26:27] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6338 ms
[2022-05-17 09:26:27] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 96 ms.
[2022-05-17 09:26:34] [INFO ] Deduced a trap composed of 77 places in 440 ms of which 1 ms to minimize.
[2022-05-17 09:26:35] [INFO ] Deduced a trap composed of 84 places in 446 ms of which 1 ms to minimize.
[2022-05-17 09:26:35] [INFO ] Deduced a trap composed of 87 places in 429 ms of which 1 ms to minimize.
[2022-05-17 09:26:36] [INFO ] Deduced a trap composed of 81 places in 418 ms of which 1 ms to minimize.
[2022-05-17 09:26:36] [INFO ] Deduced a trap composed of 88 places in 427 ms of which 1 ms to minimize.
[2022-05-17 09:26:37] [INFO ] Deduced a trap composed of 154 places in 433 ms of which 0 ms to minimize.
[2022-05-17 09:26:37] [INFO ] Deduced a trap composed of 13 places in 426 ms of which 1 ms to minimize.
[2022-05-17 09:26:38] [INFO ] Deduced a trap composed of 80 places in 449 ms of which 0 ms to minimize.
[2022-05-17 09:26:38] [INFO ] Deduced a trap composed of 73 places in 436 ms of which 1 ms to minimize.
[2022-05-17 09:26:39] [INFO ] Deduced a trap composed of 171 places in 432 ms of which 1 ms to minimize.
[2022-05-17 09:26:40] [INFO ] Deduced a trap composed of 77 places in 432 ms of which 1 ms to minimize.
[2022-05-17 09:26:40] [INFO ] Deduced a trap composed of 125 places in 419 ms of which 0 ms to minimize.
[2022-05-17 09:26:41] [INFO ] Deduced a trap composed of 46 places in 434 ms of which 0 ms to minimize.
[2022-05-17 09:26:41] [INFO ] Deduced a trap composed of 75 places in 438 ms of which 1 ms to minimize.
[2022-05-17 09:26:42] [INFO ] Deduced a trap composed of 50 places in 425 ms of which 1 ms to minimize.
[2022-05-17 09:26:42] [INFO ] Deduced a trap composed of 41 places in 433 ms of which 1 ms to minimize.
[2022-05-17 09:26:43] [INFO ] Deduced a trap composed of 61 places in 426 ms of which 1 ms to minimize.
[2022-05-17 09:26:43] [INFO ] Deduced a trap composed of 83 places in 499 ms of which 11 ms to minimize.
[2022-05-17 09:26:44] [INFO ] Deduced a trap composed of 21 places in 426 ms of which 1 ms to minimize.
[2022-05-17 09:26:44] [INFO ] Deduced a trap composed of 173 places in 430 ms of which 1 ms to minimize.
[2022-05-17 09:26:45] [INFO ] Deduced a trap composed of 52 places in 423 ms of which 1 ms to minimize.
[2022-05-17 09:26:46] [INFO ] Deduced a trap composed of 49 places in 457 ms of which 1 ms to minimize.
[2022-05-17 09:26:46] [INFO ] Deduced a trap composed of 121 places in 429 ms of which 1 ms to minimize.
[2022-05-17 09:26:47] [INFO ] Deduced a trap composed of 202 places in 424 ms of which 1 ms to minimize.
[2022-05-17 09:26:47] [INFO ] Deduced a trap composed of 137 places in 435 ms of which 1 ms to minimize.
[2022-05-17 09:26:48] [INFO ] Deduced a trap composed of 111 places in 428 ms of which 1 ms to minimize.
[2022-05-17 09:26:48] [INFO ] Deduced a trap composed of 125 places in 433 ms of which 1 ms to minimize.
[2022-05-17 09:26:49] [INFO ] Deduced a trap composed of 46 places in 386 ms of which 1 ms to minimize.
[2022-05-17 09:26:49] [INFO ] Deduced a trap composed of 151 places in 386 ms of which 0 ms to minimize.
[2022-05-17 09:26:50] [INFO ] Deduced a trap composed of 161 places in 385 ms of which 1 ms to minimize.
[2022-05-17 09:26:50] [INFO ] Deduced a trap composed of 35 places in 433 ms of which 1 ms to minimize.
[2022-05-17 09:26:51] [INFO ] Deduced a trap composed of 65 places in 451 ms of which 1 ms to minimize.
[2022-05-17 09:26:51] [INFO ] Deduced a trap composed of 53 places in 480 ms of which 1 ms to minimize.
[2022-05-17 09:26:52] [INFO ] Deduced a trap composed of 20 places in 428 ms of which 1 ms to minimize.
[2022-05-17 09:26:52] [INFO ] Deduced a trap composed of 141 places in 463 ms of which 0 ms to minimize.
[2022-05-17 09:26:53] [INFO ] Deduced a trap composed of 105 places in 427 ms of which 1 ms to minimize.
[2022-05-17 09:26:54] [INFO ] Deduced a trap composed of 47 places in 425 ms of which 1 ms to minimize.
[2022-05-17 09:26:54] [INFO ] Deduced a trap composed of 40 places in 427 ms of which 1 ms to minimize.
[2022-05-17 09:26:55] [INFO ] Deduced a trap composed of 15 places in 430 ms of which 1 ms to minimize.
[2022-05-17 09:26:55] [INFO ] Deduced a trap composed of 86 places in 371 ms of which 1 ms to minimize.
[2022-05-17 09:26:56] [INFO ] Deduced a trap composed of 135 places in 382 ms of which 0 ms to minimize.
[2022-05-17 09:26:56] [INFO ] Deduced a trap composed of 139 places in 367 ms of which 1 ms to minimize.
[2022-05-17 09:26:57] [INFO ] Deduced a trap composed of 27 places in 351 ms of which 1 ms to minimize.
[2022-05-17 09:26:57] [INFO ] Deduced a trap composed of 123 places in 330 ms of which 1 ms to minimize.
[2022-05-17 09:26:58] [INFO ] Deduced a trap composed of 100 places in 315 ms of which 1 ms to minimize.
[2022-05-17 09:26:58] [INFO ] Deduced a trap composed of 79 places in 414 ms of which 1 ms to minimize.
[2022-05-17 09:26:59] [INFO ] Deduced a trap composed of 202 places in 404 ms of which 0 ms to minimize.
[2022-05-17 09:26:59] [INFO ] Deduced a trap composed of 72 places in 437 ms of which 1 ms to minimize.
[2022-05-17 09:27:00] [INFO ] Deduced a trap composed of 42 places in 443 ms of which 1 ms to minimize.
[2022-05-17 09:27:01] [INFO ] Deduced a trap composed of 20 places in 437 ms of which 1 ms to minimize.
[2022-05-17 09:27:01] [INFO ] Deduced a trap composed of 100 places in 415 ms of which 1 ms to minimize.
[2022-05-17 09:27:02] [INFO ] Deduced a trap composed of 63 places in 412 ms of which 1 ms to minimize.
[2022-05-17 09:27:02] [INFO ] Deduced a trap composed of 11 places in 406 ms of which 0 ms to minimize.
[2022-05-17 09:27:03] [INFO ] Deduced a trap composed of 126 places in 460 ms of which 1 ms to minimize.
[2022-05-17 09:27:03] [INFO ] Deduced a trap composed of 81 places in 292 ms of which 0 ms to minimize.
[2022-05-17 09:27:04] [INFO ] Deduced a trap composed of 93 places in 314 ms of which 1 ms to minimize.
[2022-05-17 09:27:04] [INFO ] Deduced a trap composed of 160 places in 295 ms of which 1 ms to minimize.
[2022-05-17 09:27:05] [INFO ] Deduced a trap composed of 17 places in 424 ms of which 1 ms to minimize.
[2022-05-17 09:27:05] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 31015 ms
[2022-05-17 09:27:05] [INFO ] Added : 326 causal constraints over 66 iterations in 37712 ms.(timeout) Result :sat
Minimization took 280 ms.
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 in SAFETY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 30 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 in SAFETY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 29 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2022-05-17 09:27:08] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 09:27:08] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 09:27:09] [INFO ] Implicit Places using invariants in 448 ms returned []
[2022-05-17 09:27:09] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 09:27:09] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 09:27:09] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:27:15] [INFO ] Implicit Places using invariants and state equation in 5907 ms returned []
Implicit Place search using SMT with State Equation took 6384 ms to find 0 implicit places.
[2022-05-17 09:27:15] [INFO ] Redundant transitions in 177 ms returned []
[2022-05-17 09:27:15] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 09:27:15] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 09:27:16] [INFO ] Dead Transitions using invariants and state equation in 862 ms found 0 transitions.
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 09:27:16] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 1) seen :2
[2022-05-17 09:27:16] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 09:27:16] [INFO ] Computed 23 place invariants in 20 ms
[2022-05-17 09:27:16] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2022-05-17 09:27:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:27:17] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2022-05-17 09:27:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:27:17] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 09:27:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:27:17] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2022-05-17 09:27:17] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:27:17] [INFO ] [Nat]Added 497 Read/Feed constraints in 116 ms returned sat
[2022-05-17 09:27:18] [INFO ] Deduced a trap composed of 15 places in 388 ms of which 0 ms to minimize.
[2022-05-17 09:27:18] [INFO ] Deduced a trap composed of 105 places in 401 ms of which 0 ms to minimize.
[2022-05-17 09:27:19] [INFO ] Deduced a trap composed of 99 places in 450 ms of which 0 ms to minimize.
[2022-05-17 09:27:19] [INFO ] Deduced a trap composed of 17 places in 396 ms of which 0 ms to minimize.
[2022-05-17 09:27:20] [INFO ] Deduced a trap composed of 17 places in 363 ms of which 1 ms to minimize.
[2022-05-17 09:27:20] [INFO ] Deduced a trap composed of 24 places in 392 ms of which 1 ms to minimize.
[2022-05-17 09:27:21] [INFO ] Deduced a trap composed of 15 places in 391 ms of which 1 ms to minimize.
[2022-05-17 09:27:21] [INFO ] Deduced a trap composed of 15 places in 392 ms of which 1 ms to minimize.
[2022-05-17 09:27:21] [INFO ] Deduced a trap composed of 63 places in 370 ms of which 1 ms to minimize.
[2022-05-17 09:27:22] [INFO ] Deduced a trap composed of 73 places in 382 ms of which 1 ms to minimize.
[2022-05-17 09:27:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [448] Max seen :[3]
Support contains 448 out of 1096 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 81 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 09:27:22] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9691 ms. (steps per millisecond=103 ) properties (out of 1) seen :7
Finished Best-First random walk after 711866 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=142 )
[2022-05-17 09:27:37] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:27:37] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-17 09:27:37] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 09:27:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:27:37] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2022-05-17 09:27:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:27:37] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 09:27:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:27:38] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2022-05-17 09:27:38] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:27:38] [INFO ] [Nat]Added 497 Read/Feed constraints in 108 ms returned sat
[2022-05-17 09:27:38] [INFO ] Deduced a trap composed of 59 places in 428 ms of which 0 ms to minimize.
[2022-05-17 09:27:39] [INFO ] Deduced a trap composed of 117 places in 357 ms of which 1 ms to minimize.
[2022-05-17 09:27:39] [INFO ] Deduced a trap composed of 84 places in 364 ms of which 1 ms to minimize.
[2022-05-17 09:27:40] [INFO ] Deduced a trap composed of 151 places in 354 ms of which 1 ms to minimize.
[2022-05-17 09:27:40] [INFO ] Deduced a trap composed of 105 places in 356 ms of which 1 ms to minimize.
[2022-05-17 09:27:40] [INFO ] Deduced a trap composed of 63 places in 348 ms of which 0 ms to minimize.
[2022-05-17 09:27:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2623 ms
[2022-05-17 09:27:41] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 95 ms.
[2022-05-17 09:27:46] [INFO ] Deduced a trap composed of 124 places in 418 ms of which 1 ms to minimize.
[2022-05-17 09:27:47] [INFO ] Deduced a trap composed of 60 places in 425 ms of which 0 ms to minimize.
[2022-05-17 09:27:47] [INFO ] Deduced a trap composed of 71 places in 429 ms of which 1 ms to minimize.
[2022-05-17 09:27:48] [INFO ] Deduced a trap composed of 13 places in 419 ms of which 1 ms to minimize.
[2022-05-17 09:27:48] [INFO ] Deduced a trap composed of 51 places in 454 ms of which 1 ms to minimize.
[2022-05-17 09:27:49] [INFO ] Deduced a trap composed of 41 places in 411 ms of which 1 ms to minimize.
[2022-05-17 09:27:49] [INFO ] Deduced a trap composed of 48 places in 420 ms of which 1 ms to minimize.
[2022-05-17 09:27:50] [INFO ] Deduced a trap composed of 15 places in 443 ms of which 1 ms to minimize.
[2022-05-17 09:27:50] [INFO ] Deduced a trap composed of 34 places in 389 ms of which 1 ms to minimize.
[2022-05-17 09:27:51] [INFO ] Deduced a trap composed of 100 places in 368 ms of which 0 ms to minimize.
[2022-05-17 09:27:51] [INFO ] Deduced a trap composed of 78 places in 371 ms of which 1 ms to minimize.
[2022-05-17 09:27:52] [INFO ] Deduced a trap composed of 91 places in 386 ms of which 1 ms to minimize.
[2022-05-17 09:27:52] [INFO ] Deduced a trap composed of 128 places in 390 ms of which 1 ms to minimize.
[2022-05-17 09:27:53] [INFO ] Deduced a trap composed of 147 places in 364 ms of which 1 ms to minimize.
[2022-05-17 09:27:53] [INFO ] Deduced a trap composed of 89 places in 332 ms of which 0 ms to minimize.
[2022-05-17 09:27:54] [INFO ] Deduced a trap composed of 84 places in 348 ms of which 1 ms to minimize.
[2022-05-17 09:27:54] [INFO ] Deduced a trap composed of 134 places in 342 ms of which 0 ms to minimize.
[2022-05-17 09:27:55] [INFO ] Deduced a trap composed of 107 places in 334 ms of which 1 ms to minimize.
[2022-05-17 09:27:55] [INFO ] Deduced a trap composed of 87 places in 324 ms of which 0 ms to minimize.
[2022-05-17 09:27:56] [INFO ] Deduced a trap composed of 130 places in 331 ms of which 0 ms to minimize.
[2022-05-17 09:27:56] [INFO ] Deduced a trap composed of 158 places in 314 ms of which 0 ms to minimize.
[2022-05-17 09:27:56] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 10702 ms
[2022-05-17 09:27:57] [INFO ] Added : 275 causal constraints over 55 iterations in 16147 ms. Result :sat
Minimization took 505 ms.
Current structural bounds on expressions (after SMT) : [448] Max seen :[7]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 46 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 in SAFETY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 41 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2022-05-17 09:27:58] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:27:58] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 09:27:58] [INFO ] Implicit Places using invariants in 482 ms returned []
[2022-05-17 09:27:58] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:27:58] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-17 09:27:59] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:28:04] [INFO ] Implicit Places using invariants and state equation in 5615 ms returned []
Implicit Place search using SMT with State Equation took 6097 ms to find 0 implicit places.
[2022-05-17 09:28:04] [INFO ] Redundant transitions in 161 ms returned []
[2022-05-17 09:28:04] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:28:04] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-17 09:28:05] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 0 transitions.
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 09:28:05] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9472 ms. (steps per millisecond=105 ) properties (out of 1) seen :7
Finished Best-First random walk after 673013 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=134 )
[2022-05-17 09:28:19] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:28:19] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-17 09:28:20] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2022-05-17 09:28:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:28:20] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2022-05-17 09:28:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:28:20] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2022-05-17 09:28:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:28:21] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2022-05-17 09:28:21] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:28:21] [INFO ] [Nat]Added 497 Read/Feed constraints in 116 ms returned sat
[2022-05-17 09:28:21] [INFO ] Deduced a trap composed of 59 places in 464 ms of which 1 ms to minimize.
[2022-05-17 09:28:22] [INFO ] Deduced a trap composed of 117 places in 380 ms of which 0 ms to minimize.
[2022-05-17 09:28:22] [INFO ] Deduced a trap composed of 84 places in 376 ms of which 1 ms to minimize.
[2022-05-17 09:28:23] [INFO ] Deduced a trap composed of 151 places in 399 ms of which 1 ms to minimize.
[2022-05-17 09:28:23] [INFO ] Deduced a trap composed of 105 places in 394 ms of which 1 ms to minimize.
[2022-05-17 09:28:23] [INFO ] Deduced a trap composed of 63 places in 370 ms of which 0 ms to minimize.
[2022-05-17 09:28:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2813 ms
[2022-05-17 09:28:24] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 91 ms.
[2022-05-17 09:28:29] [INFO ] Deduced a trap composed of 124 places in 424 ms of which 1 ms to minimize.
[2022-05-17 09:28:30] [INFO ] Deduced a trap composed of 60 places in 481 ms of which 1 ms to minimize.
[2022-05-17 09:28:30] [INFO ] Deduced a trap composed of 71 places in 480 ms of which 1 ms to minimize.
[2022-05-17 09:28:31] [INFO ] Deduced a trap composed of 13 places in 482 ms of which 1 ms to minimize.
[2022-05-17 09:28:31] [INFO ] Deduced a trap composed of 51 places in 482 ms of which 1 ms to minimize.
[2022-05-17 09:28:32] [INFO ] Deduced a trap composed of 41 places in 479 ms of which 1 ms to minimize.
[2022-05-17 09:28:33] [INFO ] Deduced a trap composed of 48 places in 480 ms of which 1 ms to minimize.
[2022-05-17 09:28:33] [INFO ] Deduced a trap composed of 15 places in 477 ms of which 1 ms to minimize.
[2022-05-17 09:28:34] [INFO ] Deduced a trap composed of 34 places in 399 ms of which 1 ms to minimize.
[2022-05-17 09:28:34] [INFO ] Deduced a trap composed of 100 places in 361 ms of which 1 ms to minimize.
[2022-05-17 09:28:35] [INFO ] Deduced a trap composed of 78 places in 355 ms of which 0 ms to minimize.
[2022-05-17 09:28:35] [INFO ] Deduced a trap composed of 91 places in 355 ms of which 0 ms to minimize.
[2022-05-17 09:28:36] [INFO ] Deduced a trap composed of 128 places in 372 ms of which 1 ms to minimize.
[2022-05-17 09:28:36] [INFO ] Deduced a trap composed of 147 places in 367 ms of which 1 ms to minimize.
[2022-05-17 09:28:37] [INFO ] Deduced a trap composed of 89 places in 362 ms of which 1 ms to minimize.
[2022-05-17 09:28:37] [INFO ] Deduced a trap composed of 84 places in 344 ms of which 0 ms to minimize.
[2022-05-17 09:28:38] [INFO ] Deduced a trap composed of 134 places in 355 ms of which 1 ms to minimize.
[2022-05-17 09:28:38] [INFO ] Deduced a trap composed of 107 places in 334 ms of which 1 ms to minimize.
[2022-05-17 09:28:39] [INFO ] Deduced a trap composed of 87 places in 338 ms of which 1 ms to minimize.
[2022-05-17 09:28:39] [INFO ] Deduced a trap composed of 130 places in 330 ms of which 1 ms to minimize.
[2022-05-17 09:28:40] [INFO ] Deduced a trap composed of 158 places in 321 ms of which 1 ms to minimize.
[2022-05-17 09:28:40] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 11088 ms
[2022-05-17 09:28:40] [INFO ] Added : 275 causal constraints over 55 iterations in 16470 ms. Result :sat
Minimization took 512 ms.
Current structural bounds on expressions (after SMT) : [448] Max seen :[7]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 28 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 in SAFETY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 27 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2022-05-17 09:28:41] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:28:41] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-17 09:28:42] [INFO ] Implicit Places using invariants in 420 ms returned []
[2022-05-17 09:28:42] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:28:42] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-17 09:28:42] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:28:47] [INFO ] Implicit Places using invariants and state equation in 5718 ms returned []
Implicit Place search using SMT with State Equation took 6141 ms to find 0 implicit places.
[2022-05-17 09:28:47] [INFO ] Redundant transitions in 50 ms returned []
[2022-05-17 09:28:47] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:28:47] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 09:28:48] [INFO ] Dead Transitions using invariants and state equation in 813 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Ending property specific reduction for Peterson-COL-7-UpperBounds-01 in 92276 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 09:28:48] [INFO ] Computed 23 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :3
[2022-05-17 09:28:48] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 09:28:48] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-17 09:28:49] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 09:28:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:28:49] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2022-05-17 09:28:49] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:28:49] [INFO ] [Real]Added 497 Read/Feed constraints in 71 ms returned sat
[2022-05-17 09:28:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:28:49] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2022-05-17 09:28:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:28:50] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2022-05-17 09:28:50] [INFO ] [Nat]Added 497 Read/Feed constraints in 115 ms returned sat
[2022-05-17 09:28:50] [INFO ] Deduced a trap composed of 19 places in 431 ms of which 1 ms to minimize.
[2022-05-17 09:28:51] [INFO ] Deduced a trap composed of 54 places in 454 ms of which 1 ms to minimize.
[2022-05-17 09:28:51] [INFO ] Deduced a trap composed of 13 places in 401 ms of which 1 ms to minimize.
[2022-05-17 09:28:52] [INFO ] Deduced a trap composed of 63 places in 419 ms of which 1 ms to minimize.
[2022-05-17 09:28:52] [INFO ] Deduced a trap composed of 75 places in 408 ms of which 1 ms to minimize.
[2022-05-17 09:28:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2485 ms
[2022-05-17 09:28:52] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 118 ms.
[2022-05-17 09:28: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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [448] Max seen :[4]
Support contains 448 out of 1096 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 46 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 09:28:54] [INFO ] Computed 23 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9833 ms. (steps per millisecond=101 ) properties (out of 1) seen :6
Finished Best-First random walk after 693542 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=138 )
[2022-05-17 09:29:09] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:29:09] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-17 09:29:09] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 09:29:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:29:10] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2022-05-17 09:29:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:29:10] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 09:29:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:29:10] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2022-05-17 09:29:10] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:29:10] [INFO ] [Nat]Added 497 Read/Feed constraints in 136 ms returned sat
[2022-05-17 09:29:11] [INFO ] Deduced a trap composed of 30 places in 425 ms of which 0 ms to minimize.
[2022-05-17 09:29:11] [INFO ] Deduced a trap composed of 51 places in 429 ms of which 1 ms to minimize.
[2022-05-17 09:29:12] [INFO ] Deduced a trap composed of 35 places in 498 ms of which 1 ms to minimize.
[2022-05-17 09:29:12] [INFO ] Deduced a trap composed of 31 places in 376 ms of which 0 ms to minimize.
[2022-05-17 09:29:13] [INFO ] Deduced a trap composed of 34 places in 382 ms of which 0 ms to minimize.
[2022-05-17 09:29:13] [INFO ] Deduced a trap composed of 51 places in 470 ms of which 1 ms to minimize.
[2022-05-17 09:29:14] [INFO ] Deduced a trap composed of 51 places in 356 ms of which 0 ms to minimize.
[2022-05-17 09:29:14] [INFO ] Deduced a trap composed of 47 places in 343 ms of which 1 ms to minimize.
[2022-05-17 09:29:14] [INFO ] Deduced a trap composed of 46 places in 360 ms of which 1 ms to minimize.
[2022-05-17 09:29:15] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4236 ms
[2022-05-17 09:29:15] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 90 ms.
[2022-05-17 09:29:19] [INFO ] Deduced a trap composed of 68 places in 427 ms of which 1 ms to minimize.
[2022-05-17 09:29:20] [INFO ] Deduced a trap composed of 168 places in 445 ms of which 1 ms to minimize.
[2022-05-17 09:29:20] [INFO ] Deduced a trap composed of 47 places in 411 ms of which 1 ms to minimize.
[2022-05-17 09:29:21] [INFO ] Deduced a trap composed of 37 places in 429 ms of which 1 ms to minimize.
[2022-05-17 09:29:21] [INFO ] Deduced a trap composed of 51 places in 423 ms of which 1 ms to minimize.
[2022-05-17 09:29:22] [INFO ] Deduced a trap composed of 77 places in 420 ms of which 1 ms to minimize.
[2022-05-17 09:29:22] [INFO ] Deduced a trap composed of 60 places in 433 ms of which 1 ms to minimize.
[2022-05-17 09:29:23] [INFO ] Deduced a trap composed of 47 places in 419 ms of which 1 ms to minimize.
[2022-05-17 09:29:23] [INFO ] Deduced a trap composed of 151 places in 358 ms of which 1 ms to minimize.
[2022-05-17 09:29:24] [INFO ] Deduced a trap composed of 118 places in 349 ms of which 1 ms to minimize.
[2022-05-17 09:29:24] [INFO ] Deduced a trap composed of 167 places in 356 ms of which 0 ms to minimize.
[2022-05-17 09:29:25] [INFO ] Deduced a trap composed of 196 places in 346 ms of which 1 ms to minimize.
[2022-05-17 09:29:25] [INFO ] Deduced a trap composed of 143 places in 341 ms of which 1 ms to minimize.
[2022-05-17 09:29:26] [INFO ] Deduced a trap composed of 163 places in 340 ms of which 1 ms to minimize.
[2022-05-17 09:29:26] [INFO ] Deduced a trap composed of 129 places in 356 ms of which 1 ms to minimize.
[2022-05-17 09:29:26] [INFO ] Deduced a trap composed of 48 places in 355 ms of which 0 ms to minimize.
[2022-05-17 09:29:27] [INFO ] Deduced a trap composed of 65 places in 427 ms of which 1 ms to minimize.
[2022-05-17 09:29:27] [INFO ] Deduced a trap composed of 73 places in 361 ms of which 1 ms to minimize.
[2022-05-17 09:29:28] [INFO ] Deduced a trap composed of 63 places in 412 ms of which 1 ms to minimize.
[2022-05-17 09:29:28] [INFO ] Deduced a trap composed of 149 places in 373 ms of which 1 ms to minimize.
[2022-05-17 09:29:29] [INFO ] Deduced a trap composed of 46 places in 357 ms of which 1 ms to minimize.
[2022-05-17 09:29:30] [INFO ] Deduced a trap composed of 74 places in 383 ms of which 1 ms to minimize.
[2022-05-17 09:29:30] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 10879 ms
[2022-05-17 09:29:30] [INFO ] Added : 202 causal constraints over 42 iterations in 15351 ms. Result :sat
Minimization took 578 ms.
Current structural bounds on expressions (after SMT) : [448] Max seen :[6]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 25 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 in SAFETY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 42 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2022-05-17 09:29:31] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:29:31] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 09:29:32] [INFO ] Implicit Places using invariants in 414 ms returned []
[2022-05-17 09:29:32] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:29:32] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 09:29:32] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:29:38] [INFO ] Implicit Places using invariants and state equation in 6321 ms returned []
Implicit Place search using SMT with State Equation took 6752 ms to find 0 implicit places.
[2022-05-17 09:29:38] [INFO ] Redundant transitions in 30 ms returned []
[2022-05-17 09:29:38] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:29:38] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 09:29:39] [INFO ] Dead Transitions using invariants and state equation in 838 ms found 0 transitions.
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 09:29:39] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9598 ms. (steps per millisecond=104 ) properties (out of 1) seen :7
Finished Best-First random walk after 668297 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=133 )
[2022-05-17 09:29:53] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:29:53] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-17 09:29:54] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 09:29:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:29:54] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2022-05-17 09:29:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:29:54] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 09:29:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:29:55] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2022-05-17 09:29:55] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:29:55] [INFO ] [Nat]Added 497 Read/Feed constraints in 118 ms returned sat
[2022-05-17 09:29:55] [INFO ] Deduced a trap composed of 59 places in 428 ms of which 1 ms to minimize.
[2022-05-17 09:29:56] [INFO ] Deduced a trap composed of 117 places in 378 ms of which 0 ms to minimize.
[2022-05-17 09:29:56] [INFO ] Deduced a trap composed of 84 places in 363 ms of which 1 ms to minimize.
[2022-05-17 09:29:57] [INFO ] Deduced a trap composed of 151 places in 419 ms of which 1 ms to minimize.
[2022-05-17 09:29:57] [INFO ] Deduced a trap composed of 105 places in 357 ms of which 1 ms to minimize.
[2022-05-17 09:29:57] [INFO ] Deduced a trap composed of 63 places in 360 ms of which 0 ms to minimize.
[2022-05-17 09:29:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2739 ms
[2022-05-17 09:29:58] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 91 ms.
[2022-05-17 09:30:03] [INFO ] Deduced a trap composed of 124 places in 432 ms of which 1 ms to minimize.
[2022-05-17 09:30:04] [INFO ] Deduced a trap composed of 60 places in 432 ms of which 1 ms to minimize.
[2022-05-17 09:30:04] [INFO ] Deduced a trap composed of 71 places in 426 ms of which 1 ms to minimize.
[2022-05-17 09:30:05] [INFO ] Deduced a trap composed of 13 places in 460 ms of which 1 ms to minimize.
[2022-05-17 09:30:05] [INFO ] Deduced a trap composed of 51 places in 436 ms of which 1 ms to minimize.
[2022-05-17 09:30:06] [INFO ] Deduced a trap composed of 41 places in 428 ms of which 1 ms to minimize.
[2022-05-17 09:30:06] [INFO ] Deduced a trap composed of 48 places in 465 ms of which 1 ms to minimize.
[2022-05-17 09:30:07] [INFO ] Deduced a trap composed of 15 places in 438 ms of which 1 ms to minimize.
[2022-05-17 09:30:07] [INFO ] Deduced a trap composed of 34 places in 413 ms of which 1 ms to minimize.
[2022-05-17 09:30:08] [INFO ] Deduced a trap composed of 100 places in 367 ms of which 1 ms to minimize.
[2022-05-17 09:30:08] [INFO ] Deduced a trap composed of 78 places in 369 ms of which 1 ms to minimize.
[2022-05-17 09:30:09] [INFO ] Deduced a trap composed of 91 places in 357 ms of which 1 ms to minimize.
[2022-05-17 09:30:09] [INFO ] Deduced a trap composed of 128 places in 338 ms of which 1 ms to minimize.
[2022-05-17 09:30:10] [INFO ] Deduced a trap composed of 147 places in 376 ms of which 0 ms to minimize.
[2022-05-17 09:30:10] [INFO ] Deduced a trap composed of 89 places in 360 ms of which 1 ms to minimize.
[2022-05-17 09:30:11] [INFO ] Deduced a trap composed of 84 places in 338 ms of which 0 ms to minimize.
[2022-05-17 09:30:11] [INFO ] Deduced a trap composed of 134 places in 359 ms of which 1 ms to minimize.
[2022-05-17 09:30:12] [INFO ] Deduced a trap composed of 107 places in 322 ms of which 1 ms to minimize.
[2022-05-17 09:30:12] [INFO ] Deduced a trap composed of 87 places in 338 ms of which 1 ms to minimize.
[2022-05-17 09:30:13] [INFO ] Deduced a trap composed of 130 places in 317 ms of which 0 ms to minimize.
[2022-05-17 09:30:13] [INFO ] Deduced a trap composed of 158 places in 319 ms of which 1 ms to minimize.
[2022-05-17 09:30:13] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 10810 ms
[2022-05-17 09:30:14] [INFO ] Added : 275 causal constraints over 55 iterations in 16241 ms. Result :sat
Minimization took 531 ms.
Current structural bounds on expressions (after SMT) : [448] Max seen :[7]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 42 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 in SAFETY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 32 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2022-05-17 09:30:15] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:30:15] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 09:30:15] [INFO ] Implicit Places using invariants in 400 ms returned []
[2022-05-17 09:30:15] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:30:15] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 09:30:16] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:30:21] [INFO ] Implicit Places using invariants and state equation in 6081 ms returned []
Implicit Place search using SMT with State Equation took 6523 ms to find 0 implicit places.
[2022-05-17 09:30:22] [INFO ] Redundant transitions in 782 ms returned []
[2022-05-17 09:30:22] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:30:22] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 09:30:23] [INFO ] Dead Transitions using invariants and state equation in 847 ms found 0 transitions.
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 09:30:23] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9557 ms. (steps per millisecond=104 ) properties (out of 1) seen :7
Finished Best-First random walk after 672932 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=134 )
[2022-05-17 09:30:38] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:30:38] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 09:30:38] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2022-05-17 09:30:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:30:38] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2022-05-17 09:30:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:30:38] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 09:30:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:30:39] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2022-05-17 09:30:39] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:30:39] [INFO ] [Nat]Added 497 Read/Feed constraints in 117 ms returned sat
[2022-05-17 09:30:39] [INFO ] Deduced a trap composed of 59 places in 422 ms of which 0 ms to minimize.
[2022-05-17 09:30:40] [INFO ] Deduced a trap composed of 117 places in 363 ms of which 1 ms to minimize.
[2022-05-17 09:30:40] [INFO ] Deduced a trap composed of 84 places in 376 ms of which 1 ms to minimize.
[2022-05-17 09:30:41] [INFO ] Deduced a trap composed of 151 places in 369 ms of which 0 ms to minimize.
[2022-05-17 09:30:41] [INFO ] Deduced a trap composed of 105 places in 359 ms of which 0 ms to minimize.
[2022-05-17 09:30:41] [INFO ] Deduced a trap composed of 63 places in 348 ms of which 1 ms to minimize.
[2022-05-17 09:30:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2659 ms
[2022-05-17 09:30:42] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 86 ms.
[2022-05-17 09:30:47] [INFO ] Deduced a trap composed of 124 places in 433 ms of which 1 ms to minimize.
[2022-05-17 09:30:48] [INFO ] Deduced a trap composed of 60 places in 420 ms of which 1 ms to minimize.
[2022-05-17 09:30:48] [INFO ] Deduced a trap composed of 71 places in 418 ms of which 1 ms to minimize.
[2022-05-17 09:30:49] [INFO ] Deduced a trap composed of 13 places in 430 ms of which 1 ms to minimize.
[2022-05-17 09:30:49] [INFO ] Deduced a trap composed of 51 places in 465 ms of which 1 ms to minimize.
[2022-05-17 09:30:50] [INFO ] Deduced a trap composed of 41 places in 487 ms of which 0 ms to minimize.
[2022-05-17 09:30:50] [INFO ] Deduced a trap composed of 48 places in 446 ms of which 1 ms to minimize.
[2022-05-17 09:30:51] [INFO ] Deduced a trap composed of 15 places in 430 ms of which 1 ms to minimize.
[2022-05-17 09:30:51] [INFO ] Deduced a trap composed of 34 places in 391 ms of which 1 ms to minimize.
[2022-05-17 09:30:52] [INFO ] Deduced a trap composed of 100 places in 391 ms of which 1 ms to minimize.
[2022-05-17 09:30:52] [INFO ] Deduced a trap composed of 78 places in 356 ms of which 1 ms to minimize.
[2022-05-17 09:30:53] [INFO ] Deduced a trap composed of 91 places in 391 ms of which 1 ms to minimize.
[2022-05-17 09:30:53] [INFO ] Deduced a trap composed of 128 places in 362 ms of which 1 ms to minimize.
[2022-05-17 09:30:54] [INFO ] Deduced a trap composed of 147 places in 359 ms of which 0 ms to minimize.
[2022-05-17 09:30:54] [INFO ] Deduced a trap composed of 89 places in 348 ms of which 0 ms to minimize.
[2022-05-17 09:30:55] [INFO ] Deduced a trap composed of 84 places in 346 ms of which 1 ms to minimize.
[2022-05-17 09:30:55] [INFO ] Deduced a trap composed of 134 places in 363 ms of which 1 ms to minimize.
[2022-05-17 09:30:56] [INFO ] Deduced a trap composed of 107 places in 335 ms of which 1 ms to minimize.
[2022-05-17 09:30:56] [INFO ] Deduced a trap composed of 87 places in 345 ms of which 1 ms to minimize.
[2022-05-17 09:30:57] [INFO ] Deduced a trap composed of 130 places in 319 ms of which 1 ms to minimize.
[2022-05-17 09:30:57] [INFO ] Deduced a trap composed of 158 places in 300 ms of which 1 ms to minimize.
[2022-05-17 09:30:57] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 10799 ms
[2022-05-17 09:30:58] [INFO ] Added : 275 causal constraints over 55 iterations in 16183 ms. Result :sat
Minimization took 518 ms.
Current structural bounds on expressions (after SMT) : [448] Max seen :[7]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 in SAFETY mode, 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.
[2022-05-17 09:30:59] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:30:59] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 09:30:59] [INFO ] Implicit Places using invariants in 403 ms returned []
[2022-05-17 09:30:59] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:30:59] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 09:31:00] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:31:05] [INFO ] Implicit Places using invariants and state equation in 5791 ms returned []
Implicit Place search using SMT with State Equation took 6235 ms to find 0 implicit places.
[2022-05-17 09:31:05] [INFO ] Redundant transitions in 46 ms returned []
[2022-05-17 09:31:05] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:31:05] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 09:31:06] [INFO ] Dead Transitions using invariants and state equation in 978 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Ending property specific reduction for Peterson-COL-7-UpperBounds-03 in 138011 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 09:31:06] [INFO ] Computed 23 place invariants in 4 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :1
[2022-05-17 09:31:06] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 09:31:06] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-17 09:31:06] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2022-05-17 09:31:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:31:07] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2022-05-17 09:31:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:31:07] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2022-05-17 09:31:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:31:07] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2022-05-17 09:31:07] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:31:07] [INFO ] [Nat]Added 497 Read/Feed constraints in 140 ms returned sat
[2022-05-17 09:31:08] [INFO ] Deduced a trap composed of 33 places in 356 ms of which 1 ms to minimize.
[2022-05-17 09:31:08] [INFO ] Deduced a trap composed of 49 places in 355 ms of which 1 ms to minimize.
[2022-05-17 09:31:09] [INFO ] Deduced a trap composed of 94 places in 366 ms of which 1 ms to minimize.
[2022-05-17 09:31:09] [INFO ] Deduced a trap composed of 74 places in 382 ms of which 1 ms to minimize.
[2022-05-17 09:31:10] [INFO ] Deduced a trap composed of 81 places in 379 ms of which 1 ms to minimize.
[2022-05-17 09:31:10] [INFO ] Deduced a trap composed of 29 places in 373 ms of which 1 ms to minimize.
[2022-05-17 09:31:10] [INFO ] Deduced a trap composed of 15 places in 362 ms of which 1 ms to minimize.
[2022-05-17 09:31:11] [INFO ] Deduced a trap composed of 28 places in 365 ms of which 1 ms to minimize.
[2022-05-17 09:31:11] [INFO ] Deduced a trap composed of 83 places in 366 ms of which 1 ms to minimize.
[2022-05-17 09:31:12] [INFO ] Deduced a trap composed of 24 places in 357 ms of which 1 ms to minimize.
[2022-05-17 09:31:12] [INFO ] Deduced a trap composed of 42 places in 348 ms of which 1 ms to minimize.
[2022-05-17 09:31: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 8 out of 1096 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 88 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 09:31:12] [INFO ] Computed 23 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2012 ms. (steps per millisecond=497 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 675 ms. (steps per millisecond=1481 ) properties (out of 1) seen :1
[2022-05-17 09:31:15] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 09:31:15] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-17 09:31:15] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2022-05-17 09:31:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:31:15] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2022-05-17 09:31:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:31:15] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2022-05-17 09:31:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:31:16] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2022-05-17 09:31:16] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:31:16] [INFO ] [Nat]Added 497 Read/Feed constraints in 56 ms returned sat
[2022-05-17 09:31:16] [INFO ] Deduced a trap composed of 29 places in 204 ms of which 1 ms to minimize.
[2022-05-17 09:31:16] [INFO ] Deduced a trap composed of 78 places in 222 ms of which 1 ms to minimize.
[2022-05-17 09:31:16] [INFO ] Deduced a trap composed of 62 places in 217 ms of which 1 ms to minimize.
[2022-05-17 09:31:17] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 0 ms to minimize.
[2022-05-17 09:31:17] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 0 ms to minimize.
[2022-05-17 09:31:17] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 0 ms to minimize.
[2022-05-17 09:31:17] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 1 ms to minimize.
[2022-05-17 09:31:18] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 1 ms to minimize.
[2022-05-17 09:31:18] [INFO ] Deduced a trap composed of 89 places in 218 ms of which 1 ms to minimize.
[2022-05-17 09:31:18] [INFO ] Deduced a trap composed of 55 places in 215 ms of which 0 ms to minimize.
[2022-05-17 09:31:18] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 1 ms to minimize.
[2022-05-17 09:31:19] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 1 ms to minimize.
[2022-05-17 09:31:19] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 1 ms to minimize.
[2022-05-17 09:31:19] [INFO ] Deduced a trap composed of 65 places in 212 ms of which 0 ms to minimize.
[2022-05-17 09:31:19] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 1 ms to minimize.
[2022-05-17 09:31:20] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 1 ms to minimize.
[2022-05-17 09:31:20] [INFO ] Deduced a trap composed of 45 places in 214 ms of which 0 ms to minimize.
[2022-05-17 09:31:20] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 1 ms to minimize.
[2022-05-17 09:31:21] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 1 ms to minimize.
[2022-05-17 09:31:21] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 0 ms to minimize.
[2022-05-17 09:31:21] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 0 ms to minimize.
[2022-05-17 09:31:21] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 1 ms to minimize.
[2022-05-17 09:31:22] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 1 ms to minimize.
[2022-05-17 09:31:22] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 1 ms to minimize.
[2022-05-17 09:31:22] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 1 ms to minimize.
[2022-05-17 09:31:23] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 0 ms to minimize.
[2022-05-17 09:31:23] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 0 ms to minimize.
[2022-05-17 09:31:23] [INFO ] Deduced a trap composed of 29 places in 206 ms of which 1 ms to minimize.
[2022-05-17 09:31:23] [INFO ] Deduced a trap composed of 43 places in 202 ms of which 1 ms to minimize.
[2022-05-17 09:31:24] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 1 ms to minimize.
[2022-05-17 09:31:24] [INFO ] Deduced a trap composed of 38 places in 219 ms of which 1 ms to minimize.
[2022-05-17 09:31:24] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 1 ms to minimize.
[2022-05-17 09:31:24] [INFO ] Deduced a trap composed of 56 places in 217 ms of which 0 ms to minimize.
[2022-05-17 09:31:25] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 0 ms to minimize.
[2022-05-17 09:31:25] [INFO ] Deduced a trap composed of 52 places in 206 ms of which 1 ms to minimize.
[2022-05-17 09:31:25] [INFO ] Deduced a trap composed of 59 places in 204 ms of which 1 ms to minimize.
[2022-05-17 09:31:25] [INFO ] Deduced a trap composed of 55 places in 212 ms of which 0 ms to minimize.
[2022-05-17 09:31:26] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 0 ms to minimize.
[2022-05-17 09:31:26] [INFO ] Deduced a trap composed of 69 places in 206 ms of which 1 ms to minimize.
[2022-05-17 09:31:26] [INFO ] Deduced a trap composed of 50 places in 219 ms of which 0 ms to minimize.
[2022-05-17 09:31:26] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 0 ms to minimize.
[2022-05-17 09:31:27] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 1 ms to minimize.
[2022-05-17 09:31:27] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 1 ms to minimize.
[2022-05-17 09:31:27] [INFO ] Deduced a trap composed of 75 places in 228 ms of which 0 ms to minimize.
[2022-05-17 09:31:27] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 0 ms to minimize.
[2022-05-17 09:31:28] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 1 ms to minimize.
[2022-05-17 09:31:28] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 0 ms to minimize.
[2022-05-17 09:31:29] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 1 ms to minimize.
[2022-05-17 09:31:29] [INFO ] Deduced a trap composed of 60 places in 199 ms of which 0 ms to minimize.
[2022-05-17 09:31:29] [INFO ] Deduced a trap composed of 38 places in 205 ms of which 1 ms to minimize.
[2022-05-17 09:31:29] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 1 ms to minimize.
[2022-05-17 09:31:30] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 0 ms to minimize.
[2022-05-17 09:31:30] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 0 ms to minimize.
[2022-05-17 09:31:30] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 1 ms to minimize.
[2022-05-17 09:31:31] [INFO ] Deduced a trap composed of 75 places in 189 ms of which 1 ms to minimize.
[2022-05-17 09:31:31] [INFO ] Deduced a trap composed of 83 places in 199 ms of which 1 ms to minimize.
[2022-05-17 09:31:31] [INFO ] Deduced a trap composed of 64 places in 199 ms of which 0 ms to minimize.
[2022-05-17 09:31:32] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 1 ms to minimize.
[2022-05-17 09:31:32] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 0 ms to minimize.
[2022-05-17 09:31:32] [INFO ] Deduced a trap composed of 60 places in 230 ms of which 1 ms to minimize.
[2022-05-17 09:31:33] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 1 ms to minimize.
[2022-05-17 09:31:33] [INFO ] Deduced a trap composed of 47 places in 222 ms of which 0 ms to minimize.
[2022-05-17 09:31:33] [INFO ] Deduced a trap composed of 106 places in 203 ms of which 0 ms to minimize.
[2022-05-17 09:31:33] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 1 ms to minimize.
[2022-05-17 09:31:34] [INFO ] Deduced a trap composed of 93 places in 198 ms of which 1 ms to minimize.
[2022-05-17 09:31:34] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 1 ms to minimize.
[2022-05-17 09:31:34] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 1 ms to minimize.
[2022-05-17 09:31:34] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 0 ms to minimize.
[2022-05-17 09:31:35] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 0 ms to minimize.
[2022-05-17 09:31:35] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 1 ms to minimize.
[2022-05-17 09:31:35] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 1 ms to minimize.
[2022-05-17 09:31:35] [INFO ] Deduced a trap composed of 56 places in 216 ms of which 0 ms to minimize.
[2022-05-17 09:31:38] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 0 ms to minimize.
[2022-05-17 09:31:38] [INFO ] Deduced a trap composed of 54 places in 196 ms of which 0 ms to minimize.
[2022-05-17 09:31:39] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 1 ms to minimize.
[2022-05-17 09:31:40] [INFO ] Deduced a trap composed of 29 places in 215 ms of which 1 ms to minimize.
[2022-05-17 09:31:43] [INFO ] Deduced a trap composed of 49 places in 179 ms of which 0 ms to minimize.
[2022-05-17 09:31:43] [INFO ] Deduced a trap composed of 83 places in 199 ms of which 1 ms to minimize.
[2022-05-17 09:31:43] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 0 ms to minimize.
[2022-05-17 09:31:43] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 1 ms to minimize.
[2022-05-17 09:31:45] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 0 ms to minimize.
[2022-05-17 09:31:45] [INFO ] Deduced a trap composed of 55 places in 198 ms of which 1 ms to minimize.
[2022-05-17 09:31:45] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 1 ms to minimize.
[2022-05-17 09:31:46] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 1 ms to minimize.
[2022-05-17 09:31:46] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 0 ms to minimize.
[2022-05-17 09:31:48] [INFO ] Deduced a trap composed of 55 places in 201 ms of which 0 ms to minimize.
[2022-05-17 09:31:48] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 0 ms to minimize.
[2022-05-17 09:31:49] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 1 ms to minimize.
[2022-05-17 09:31:49] [INFO ] Deduced a trap composed of 83 places in 204 ms of which 0 ms to minimize.
[2022-05-17 09:31:49] [INFO ] Deduced a trap composed of 37 places in 201 ms of which 1 ms to minimize.
[2022-05-17 09:31:49] [INFO ] Deduced a trap composed of 77 places in 208 ms of which 1 ms to minimize.
[2022-05-17 09:31:50] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 1 ms to minimize.
[2022-05-17 09:31:50] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 1 ms to minimize.
[2022-05-17 09:31:51] [INFO ] Deduced a trap composed of 53 places in 188 ms of which 1 ms to minimize.
[2022-05-17 09:31:51] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 0 ms to minimize.
[2022-05-17 09:31:52] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 0 ms to minimize.
[2022-05-17 09:31:52] [INFO ] Deduced a trap composed of 67 places in 211 ms of which 1 ms to minimize.
[2022-05-17 09:31:53] [INFO ] Deduced a trap composed of 83 places in 214 ms of which 0 ms to minimize.
[2022-05-17 09:31:53] [INFO ] Deduced a trap composed of 51 places in 192 ms of which 1 ms to minimize.
[2022-05-17 09:31:53] [INFO ] Deduced a trap composed of 83 places in 238 ms of which 0 ms to minimize.
[2022-05-17 09:31:53] [INFO ] Deduced a trap composed of 96 places in 206 ms of which 1 ms to minimize.
[2022-05-17 09:31:54] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 0 ms to minimize.
[2022-05-17 09:31:54] [INFO ] Deduced a trap composed of 84 places in 193 ms of which 1 ms to minimize.
[2022-05-17 09:31:54] [INFO ] Deduced a trap composed of 58 places in 189 ms of which 0 ms to minimize.
[2022-05-17 09:31:55] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 0 ms to minimize.
[2022-05-17 09:31:56] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 0 ms to minimize.
[2022-05-17 09:31:57] [INFO ] Deduced a trap composed of 46 places in 181 ms of which 0 ms to minimize.
[2022-05-17 09:31:57] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 0 ms to minimize.
[2022-05-17 09:32:00] [INFO ] Trap strengthening (SAT) tested/added 108/108 trap constraints in 44237 ms
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 22 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 in SAFETY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 28 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2022-05-17 09:32:00] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 09:32:00] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 09:32:00] [INFO ] Implicit Places using invariants in 313 ms returned []
[2022-05-17 09:32:00] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 09:32:00] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 09:32:01] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:32:03] [INFO ] Implicit Places using invariants and state equation in 2849 ms returned []
Implicit Place search using SMT with State Equation took 3199 ms to find 0 implicit places.
[2022-05-17 09:32:03] [INFO ] Redundant transitions in 23 ms returned []
[2022-05-17 09:32:03] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 09:32:03] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 09:32:04] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 592/592 places, 1704/1704 transitions.
Ending property specific reduction for Peterson-COL-7-UpperBounds-07 in 57771 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 09:32:04] [INFO ] Computed 23 place invariants in 6 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :1
[2022-05-17 09:32:04] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 09:32:04] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 09:32:04] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2022-05-17 09:32:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:32:05] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2022-05-17 09:32:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:32:05] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2022-05-17 09:32:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:32:05] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2022-05-17 09:32:05] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:32:05] [INFO ] [Nat]Added 497 Read/Feed constraints in 138 ms returned sat
[2022-05-17 09:32:06] [INFO ] Deduced a trap composed of 33 places in 362 ms of which 0 ms to minimize.
[2022-05-17 09:32:06] [INFO ] Deduced a trap composed of 49 places in 374 ms of which 1 ms to minimize.
[2022-05-17 09:32:07] [INFO ] Deduced a trap composed of 94 places in 362 ms of which 1 ms to minimize.
[2022-05-17 09:32:07] [INFO ] Deduced a trap composed of 74 places in 376 ms of which 0 ms to minimize.
[2022-05-17 09:32:07] [INFO ] Deduced a trap composed of 81 places in 393 ms of which 1 ms to minimize.
[2022-05-17 09:32:08] [INFO ] Deduced a trap composed of 29 places in 386 ms of which 1 ms to minimize.
[2022-05-17 09:32:08] [INFO ] Deduced a trap composed of 15 places in 359 ms of which 1 ms to minimize.
[2022-05-17 09:32:09] [INFO ] Deduced a trap composed of 28 places in 356 ms of which 0 ms to minimize.
[2022-05-17 09:32:09] [INFO ] Deduced a trap composed of 83 places in 368 ms of which 1 ms to minimize.
[2022-05-17 09:32:10] [INFO ] Deduced a trap composed of 24 places in 366 ms of which 1 ms to minimize.
[2022-05-17 09:32:10] [INFO ] Deduced a trap composed of 2 places in 486 ms of which 1 ms to minimize.
[2022-05-17 09:32:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 8 out of 1096 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 68 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 09:32:10] [INFO ] Computed 23 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2108 ms. (steps per millisecond=474 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 637 ms. (steps per millisecond=1569 ) properties (out of 1) seen :1
[2022-05-17 09:32:13] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 09:32:13] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 09:32:13] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned sat
[2022-05-17 09:32:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:32:13] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2022-05-17 09:32:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:32:13] [INFO ] [Nat]Absence check using 23 positive place invariants in 9 ms returned sat
[2022-05-17 09:32:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:32:14] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2022-05-17 09:32:14] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:32:14] [INFO ] [Nat]Added 497 Read/Feed constraints in 56 ms returned sat
[2022-05-17 09:32:14] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 0 ms to minimize.
[2022-05-17 09:32:14] [INFO ] Deduced a trap composed of 78 places in 198 ms of which 1 ms to minimize.
[2022-05-17 09:32:14] [INFO ] Deduced a trap composed of 62 places in 203 ms of which 1 ms to minimize.
[2022-05-17 09:32:15] [INFO ] Deduced a trap composed of 39 places in 218 ms of which 1 ms to minimize.
[2022-05-17 09:32:15] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 1 ms to minimize.
[2022-05-17 09:32:15] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 0 ms to minimize.
[2022-05-17 09:32:15] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 1 ms to minimize.
[2022-05-17 09:32:16] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 0 ms to minimize.
[2022-05-17 09:32:16] [INFO ] Deduced a trap composed of 89 places in 214 ms of which 0 ms to minimize.
[2022-05-17 09:32:16] [INFO ] Deduced a trap composed of 55 places in 219 ms of which 1 ms to minimize.
[2022-05-17 09:32:16] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 1 ms to minimize.
[2022-05-17 09:32:17] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 1 ms to minimize.
[2022-05-17 09:32:17] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 1 ms to minimize.
[2022-05-17 09:32:17] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 1 ms to minimize.
[2022-05-17 09:32:18] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 1 ms to minimize.
[2022-05-17 09:32:18] [INFO ] Deduced a trap composed of 28 places in 189 ms of which 1 ms to minimize.
[2022-05-17 09:32:18] [INFO ] Deduced a trap composed of 45 places in 203 ms of which 0 ms to minimize.
[2022-05-17 09:32:19] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 0 ms to minimize.
[2022-05-17 09:32:19] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 1 ms to minimize.
[2022-05-17 09:32:19] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 0 ms to minimize.
[2022-05-17 09:32:19] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 0 ms to minimize.
[2022-05-17 09:32:20] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 0 ms to minimize.
[2022-05-17 09:32:20] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 0 ms to minimize.
[2022-05-17 09:32:20] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 0 ms to minimize.
[2022-05-17 09:32:20] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 0 ms to minimize.
[2022-05-17 09:32:21] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 1 ms to minimize.
[2022-05-17 09:32:21] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 0 ms to minimize.
[2022-05-17 09:32:21] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 1 ms to minimize.
[2022-05-17 09:32:21] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 0 ms to minimize.
[2022-05-17 09:32:22] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 1 ms to minimize.
[2022-05-17 09:32:22] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 0 ms to minimize.
[2022-05-17 09:32:22] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 0 ms to minimize.
[2022-05-17 09:32:22] [INFO ] Deduced a trap composed of 56 places in 199 ms of which 0 ms to minimize.
[2022-05-17 09:32:23] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 1 ms to minimize.
[2022-05-17 09:32:23] [INFO ] Deduced a trap composed of 52 places in 220 ms of which 0 ms to minimize.
[2022-05-17 09:32:23] [INFO ] Deduced a trap composed of 59 places in 204 ms of which 1 ms to minimize.
[2022-05-17 09:32:23] [INFO ] Deduced a trap composed of 55 places in 210 ms of which 0 ms to minimize.
[2022-05-17 09:32:24] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 0 ms to minimize.
[2022-05-17 09:32:24] [INFO ] Deduced a trap composed of 69 places in 207 ms of which 1 ms to minimize.
[2022-05-17 09:32:24] [INFO ] Deduced a trap composed of 50 places in 212 ms of which 0 ms to minimize.
[2022-05-17 09:32:24] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 0 ms to minimize.
[2022-05-17 09:32:25] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 0 ms to minimize.
[2022-05-17 09:32:25] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 0 ms to minimize.
[2022-05-17 09:32:25] [INFO ] Deduced a trap composed of 75 places in 205 ms of which 1 ms to minimize.
[2022-05-17 09:32:26] [INFO ] Deduced a trap composed of 38 places in 242 ms of which 0 ms to minimize.
[2022-05-17 09:32:26] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 0 ms to minimize.
[2022-05-17 09:32:26] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 1 ms to minimize.
[2022-05-17 09:32:27] [INFO ] Deduced a trap composed of 37 places in 220 ms of which 1 ms to minimize.
[2022-05-17 09:32:27] [INFO ] Deduced a trap composed of 60 places in 199 ms of which 1 ms to minimize.
[2022-05-17 09:32:27] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 1 ms to minimize.
[2022-05-17 09:32:28] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 0 ms to minimize.
[2022-05-17 09:32:28] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 0 ms to minimize.
[2022-05-17 09:32:28] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 0 ms to minimize.
[2022-05-17 09:32:28] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 0 ms to minimize.
[2022-05-17 09:32:29] [INFO ] Deduced a trap composed of 75 places in 191 ms of which 1 ms to minimize.
[2022-05-17 09:32:29] [INFO ] Deduced a trap composed of 83 places in 198 ms of which 1 ms to minimize.
[2022-05-17 09:32:29] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 1 ms to minimize.
[2022-05-17 09:32:30] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 0 ms to minimize.
[2022-05-17 09:32:30] [INFO ] Deduced a trap composed of 42 places in 232 ms of which 1 ms to minimize.
[2022-05-17 09:32:30] [INFO ] Deduced a trap composed of 60 places in 200 ms of which 1 ms to minimize.
[2022-05-17 09:32:31] [INFO ] Deduced a trap composed of 33 places in 241 ms of which 0 ms to minimize.
[2022-05-17 09:32:31] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 0 ms to minimize.
[2022-05-17 09:32:31] [INFO ] Deduced a trap composed of 106 places in 201 ms of which 1 ms to minimize.
[2022-05-17 09:32:31] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 0 ms to minimize.
[2022-05-17 09:32:32] [INFO ] Deduced a trap composed of 93 places in 244 ms of which 1 ms to minimize.
[2022-05-17 09:32:32] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 1 ms to minimize.
[2022-05-17 09:32:32] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 0 ms to minimize.
[2022-05-17 09:32:33] [INFO ] Deduced a trap composed of 50 places in 210 ms of which 0 ms to minimize.
[2022-05-17 09:32:33] [INFO ] Deduced a trap composed of 33 places in 214 ms of which 1 ms to minimize.
[2022-05-17 09:32:33] [INFO ] Deduced a trap composed of 30 places in 260 ms of which 0 ms to minimize.
[2022-05-17 09:32:34] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 1 ms to minimize.
[2022-05-17 09:32:34] [INFO ] Deduced a trap composed of 56 places in 206 ms of which 0 ms to minimize.
[2022-05-17 09:32:36] [INFO ] Deduced a trap composed of 54 places in 184 ms of which 0 ms to minimize.
[2022-05-17 09:32:36] [INFO ] Deduced a trap composed of 54 places in 182 ms of which 1 ms to minimize.
[2022-05-17 09:32:37] [INFO ] Deduced a trap composed of 54 places in 172 ms of which 0 ms to minimize.
[2022-05-17 09:32:38] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 0 ms to minimize.
[2022-05-17 09:32:41] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 0 ms to minimize.
[2022-05-17 09:32:41] [INFO ] Deduced a trap composed of 83 places in 225 ms of which 0 ms to minimize.
[2022-05-17 09:32:41] [INFO ] Deduced a trap composed of 38 places in 195 ms of which 1 ms to minimize.
[2022-05-17 09:32:42] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 1 ms to minimize.
[2022-05-17 09:32:43] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 0 ms to minimize.
[2022-05-17 09:32:43] [INFO ] Deduced a trap composed of 55 places in 186 ms of which 0 ms to minimize.
[2022-05-17 09:32:43] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 1 ms to minimize.
[2022-05-17 09:32:44] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 0 ms to minimize.
[2022-05-17 09:32:45] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 0 ms to minimize.
[2022-05-17 09:32:47] [INFO ] Deduced a trap composed of 55 places in 205 ms of which 1 ms to minimize.
[2022-05-17 09:32:47] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 0 ms to minimize.
[2022-05-17 09:32:47] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 0 ms to minimize.
[2022-05-17 09:32:47] [INFO ] Deduced a trap composed of 83 places in 207 ms of which 0 ms to minimize.
[2022-05-17 09:32:48] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 0 ms to minimize.
[2022-05-17 09:32:48] [INFO ] Deduced a trap composed of 77 places in 205 ms of which 1 ms to minimize.
[2022-05-17 09:32:48] [INFO ] Deduced a trap composed of 37 places in 217 ms of which 0 ms to minimize.
[2022-05-17 09:32:48] [INFO ] Deduced a trap composed of 43 places in 190 ms of which 1 ms to minimize.
[2022-05-17 09:32:50] [INFO ] Deduced a trap composed of 53 places in 195 ms of which 1 ms to minimize.
[2022-05-17 09:32:50] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 0 ms to minimize.
[2022-05-17 09:32:51] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 0 ms to minimize.
[2022-05-17 09:32:51] [INFO ] Deduced a trap composed of 67 places in 203 ms of which 1 ms to minimize.
[2022-05-17 09:32:51] [INFO ] Deduced a trap composed of 83 places in 197 ms of which 0 ms to minimize.
[2022-05-17 09:32:51] [INFO ] Deduced a trap composed of 51 places in 198 ms of which 1 ms to minimize.
[2022-05-17 09:32:52] [INFO ] Deduced a trap composed of 83 places in 200 ms of which 1 ms to minimize.
[2022-05-17 09:32:52] [INFO ] Deduced a trap composed of 96 places in 194 ms of which 0 ms to minimize.
[2022-05-17 09:32:52] [INFO ] Deduced a trap composed of 40 places in 205 ms of which 1 ms to minimize.
[2022-05-17 09:32:52] [INFO ] Deduced a trap composed of 84 places in 193 ms of which 0 ms to minimize.
[2022-05-17 09:32:53] [INFO ] Deduced a trap composed of 58 places in 199 ms of which 1 ms to minimize.
[2022-05-17 09:32:54] [INFO ] Deduced a trap composed of 40 places in 195 ms of which 1 ms to minimize.
[2022-05-17 09:32:55] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 0 ms to minimize.
[2022-05-17 09:32:55] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 1 ms to minimize.
[2022-05-17 09:32:55] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 0 ms to minimize.
[2022-05-17 09:32:58] [INFO ] Trap strengthening (SAT) tested/added 108/108 trap constraints in 44628 ms
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 21 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 in SAFETY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 23 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2022-05-17 09:32:58] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 09:32:58] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-17 09:32:59] [INFO ] Implicit Places using invariants in 326 ms returned []
[2022-05-17 09:32:59] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 09:32:59] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 09:32:59] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:33:02] [INFO ] Implicit Places using invariants and state equation in 2715 ms returned []
Implicit Place search using SMT with State Equation took 3042 ms to find 0 implicit places.
[2022-05-17 09:33:02] [INFO ] Redundant transitions in 23 ms returned []
[2022-05-17 09:33:02] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 09:33:02] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 09:33:02] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 592/592 places, 1704/1704 transitions.
Ending property specific reduction for Peterson-COL-7-UpperBounds-08 in 58127 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 09:33:02] [INFO ] Computed 23 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :5
[2022-05-17 09:33:02] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2022-05-17 09:33:02] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-17 09:33:02] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 09:33:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:33:03] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2022-05-17 09:33:03] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:33:03] [INFO ] [Real]Added 497 Read/Feed constraints in 63 ms returned sat
[2022-05-17 09:33:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:33:03] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2022-05-17 09:33:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:33:04] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2022-05-17 09:33:04] [INFO ] [Nat]Added 497 Read/Feed constraints in 108 ms returned sat
[2022-05-17 09:33:04] [INFO ] Deduced a trap composed of 102 places in 434 ms of which 1 ms to minimize.
[2022-05-17 09:33:05] [INFO ] Deduced a trap composed of 116 places in 446 ms of which 1 ms to minimize.
[2022-05-17 09:33:05] [INFO ] Deduced a trap composed of 86 places in 441 ms of which 1 ms to minimize.
[2022-05-17 09:33:06] [INFO ] Deduced a trap composed of 105 places in 439 ms of which 1 ms to minimize.
[2022-05-17 09:33:06] [INFO ] Deduced a trap composed of 112 places in 443 ms of which 1 ms to minimize.
[2022-05-17 09:33:07] [INFO ] Deduced a trap composed of 89 places in 441 ms of which 1 ms to minimize.
[2022-05-17 09:33:07] [INFO ] Deduced a trap composed of 71 places in 437 ms of which 1 ms to minimize.
[2022-05-17 09:33:08] [INFO ] Deduced a trap composed of 91 places in 400 ms of which 1 ms to minimize.
[2022-05-17 09:33:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4076 ms
[2022-05-17 09:33:08] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 91 ms.
[2022-05-17 09:33:08] [INFO ] Added : 5 causal constraints over 1 iterations in 284 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [448] Max seen :[5]
Support contains 448 out of 1096 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 34 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 09:33:08] [INFO ] Computed 23 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10095 ms. (steps per millisecond=99 ) properties (out of 1) seen :7
Finished Best-First random walk after 692084 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=138 )
[2022-05-17 09:33:23] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:33:23] [INFO ] Computed 23 place invariants in 26 ms
[2022-05-17 09:33:23] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2022-05-17 09:33:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:33:24] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2022-05-17 09:33:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:33:24] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2022-05-17 09:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:33:25] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2022-05-17 09:33:25] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:33:25] [INFO ] [Nat]Added 497 Read/Feed constraints in 117 ms returned sat
[2022-05-17 09:33:25] [INFO ] Deduced a trap composed of 59 places in 469 ms of which 1 ms to minimize.
[2022-05-17 09:33:26] [INFO ] Deduced a trap composed of 117 places in 400 ms of which 0 ms to minimize.
[2022-05-17 09:33:26] [INFO ] Deduced a trap composed of 84 places in 393 ms of which 1 ms to minimize.
[2022-05-17 09:33:27] [INFO ] Deduced a trap composed of 151 places in 395 ms of which 1 ms to minimize.
[2022-05-17 09:33:27] [INFO ] Deduced a trap composed of 105 places in 387 ms of which 1 ms to minimize.
[2022-05-17 09:33:27] [INFO ] Deduced a trap composed of 63 places in 355 ms of which 1 ms to minimize.
[2022-05-17 09:33:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2860 ms
[2022-05-17 09:33:28] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 108 ms.
[2022-05-17 09:33:33] [INFO ] Deduced a trap composed of 124 places in 475 ms of which 1 ms to minimize.
[2022-05-17 09:33:34] [INFO ] Deduced a trap composed of 60 places in 436 ms of which 1 ms to minimize.
[2022-05-17 09:33:34] [INFO ] Deduced a trap composed of 71 places in 424 ms of which 1 ms to minimize.
[2022-05-17 09:33:35] [INFO ] Deduced a trap composed of 13 places in 427 ms of which 1 ms to minimize.
[2022-05-17 09:33:36] [INFO ] Deduced a trap composed of 51 places in 447 ms of which 1 ms to minimize.
[2022-05-17 09:33:36] [INFO ] Deduced a trap composed of 41 places in 451 ms of which 1 ms to minimize.
[2022-05-17 09:33:37] [INFO ] Deduced a trap composed of 48 places in 454 ms of which 1 ms to minimize.
[2022-05-17 09:33:37] [INFO ] Deduced a trap composed of 15 places in 451 ms of which 1 ms to minimize.
[2022-05-17 09:33:38] [INFO ] Deduced a trap composed of 34 places in 413 ms of which 0 ms to minimize.
[2022-05-17 09:33:38] [INFO ] Deduced a trap composed of 100 places in 370 ms of which 1 ms to minimize.
[2022-05-17 09:33:39] [INFO ] Deduced a trap composed of 78 places in 355 ms of which 0 ms to minimize.
[2022-05-17 09:33:39] [INFO ] Deduced a trap composed of 91 places in 348 ms of which 1 ms to minimize.
[2022-05-17 09:33:40] [INFO ] Deduced a trap composed of 128 places in 353 ms of which 1 ms to minimize.
[2022-05-17 09:33:40] [INFO ] Deduced a trap composed of 147 places in 356 ms of which 1 ms to minimize.
[2022-05-17 09:33:41] [INFO ] Deduced a trap composed of 89 places in 360 ms of which 1 ms to minimize.
[2022-05-17 09:33:41] [INFO ] Deduced a trap composed of 84 places in 346 ms of which 1 ms to minimize.
[2022-05-17 09:33:42] [INFO ] Deduced a trap composed of 134 places in 355 ms of which 1 ms to minimize.
[2022-05-17 09:33:42] [INFO ] Deduced a trap composed of 107 places in 332 ms of which 1 ms to minimize.
[2022-05-17 09:33:43] [INFO ] Deduced a trap composed of 87 places in 331 ms of which 1 ms to minimize.
[2022-05-17 09:33:43] [INFO ] Deduced a trap composed of 130 places in 333 ms of which 0 ms to minimize.
[2022-05-17 09:33:44] [INFO ] Deduced a trap composed of 158 places in 319 ms of which 0 ms to minimize.
[2022-05-17 09:33:44] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 10889 ms
[2022-05-17 09:33:44] [INFO ] Added : 275 causal constraints over 55 iterations in 16534 ms. Result :sat
Minimization took 525 ms.
Current structural bounds on expressions (after SMT) : [448] Max seen :[7]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 29 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 in SAFETY mode, 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 09:33:45] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:33:45] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 09:33:46] [INFO ] Implicit Places using invariants in 409 ms returned []
[2022-05-17 09:33:46] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:33:46] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 09:33:46] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:33:52] [INFO ] Implicit Places using invariants and state equation in 5942 ms returned []
Implicit Place search using SMT with State Equation took 6356 ms to find 0 implicit places.
[2022-05-17 09:33:52] [INFO ] Redundant transitions in 38 ms returned []
[2022-05-17 09:33:52] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:33:52] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-17 09:33:53] [INFO ] Dead Transitions using invariants and state equation in 865 ms found 0 transitions.
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 09:33:53] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10018 ms. (steps per millisecond=99 ) properties (out of 1) seen :6
Finished Best-First random walk after 684533 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=136 )
[2022-05-17 09:34:08] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:34:08] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 09:34:08] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2022-05-17 09:34:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:34:08] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2022-05-17 09:34:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:34:08] [INFO ] [Nat]Absence check using 23 positive place invariants in 16 ms returned sat
[2022-05-17 09:34:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:34:09] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2022-05-17 09:34:09] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:34:09] [INFO ] [Nat]Added 497 Read/Feed constraints in 124 ms returned sat
[2022-05-17 09:34:09] [INFO ] Deduced a trap composed of 59 places in 486 ms of which 1 ms to minimize.
[2022-05-17 09:34:10] [INFO ] Deduced a trap composed of 117 places in 390 ms of which 1 ms to minimize.
[2022-05-17 09:34:10] [INFO ] Deduced a trap composed of 84 places in 407 ms of which 1 ms to minimize.
[2022-05-17 09:34:11] [INFO ] Deduced a trap composed of 151 places in 410 ms of which 1 ms to minimize.
[2022-05-17 09:34:11] [INFO ] Deduced a trap composed of 105 places in 409 ms of which 0 ms to minimize.
[2022-05-17 09:34:12] [INFO ] Deduced a trap composed of 63 places in 371 ms of which 1 ms to minimize.
[2022-05-17 09:34:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2917 ms
[2022-05-17 09:34:12] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 97 ms.
[2022-05-17 09:34:18] [INFO ] Deduced a trap composed of 124 places in 434 ms of which 1 ms to minimize.
[2022-05-17 09:34:18] [INFO ] Deduced a trap composed of 60 places in 429 ms of which 1 ms to minimize.
[2022-05-17 09:34:19] [INFO ] Deduced a trap composed of 71 places in 441 ms of which 1 ms to minimize.
[2022-05-17 09:34:19] [INFO ] Deduced a trap composed of 13 places in 443 ms of which 1 ms to minimize.
[2022-05-17 09:34:20] [INFO ] Deduced a trap composed of 51 places in 451 ms of which 1 ms to minimize.
[2022-05-17 09:34:20] [INFO ] Deduced a trap composed of 41 places in 437 ms of which 1 ms to minimize.
[2022-05-17 09:34:21] [INFO ] Deduced a trap composed of 48 places in 440 ms of which 1 ms to minimize.
[2022-05-17 09:34:21] [INFO ] Deduced a trap composed of 15 places in 442 ms of which 0 ms to minimize.
[2022-05-17 09:34:22] [INFO ] Deduced a trap composed of 34 places in 417 ms of which 1 ms to minimize.
[2022-05-17 09:34:22] [INFO ] Deduced a trap composed of 100 places in 381 ms of which 0 ms to minimize.
[2022-05-17 09:34:23] [INFO ] Deduced a trap composed of 78 places in 351 ms of which 1 ms to minimize.
[2022-05-17 09:34:23] [INFO ] Deduced a trap composed of 91 places in 351 ms of which 1 ms to minimize.
[2022-05-17 09:34:24] [INFO ] Deduced a trap composed of 128 places in 347 ms of which 1 ms to minimize.
[2022-05-17 09:34:24] [INFO ] Deduced a trap composed of 147 places in 350 ms of which 0 ms to minimize.
[2022-05-17 09:34:25] [INFO ] Deduced a trap composed of 89 places in 347 ms of which 0 ms to minimize.
[2022-05-17 09:34:25] [INFO ] Deduced a trap composed of 84 places in 352 ms of which 1 ms to minimize.
[2022-05-17 09:34:26] [INFO ] Deduced a trap composed of 134 places in 346 ms of which 1 ms to minimize.
[2022-05-17 09:34:26] [INFO ] Deduced a trap composed of 107 places in 338 ms of which 1 ms to minimize.
[2022-05-17 09:34:27] [INFO ] Deduced a trap composed of 87 places in 334 ms of which 1 ms to minimize.
[2022-05-17 09:34:27] [INFO ] Deduced a trap composed of 130 places in 331 ms of which 1 ms to minimize.
[2022-05-17 09:34:28] [INFO ] Deduced a trap composed of 158 places in 315 ms of which 1 ms to minimize.
[2022-05-17 09:34:28] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 10803 ms
[2022-05-17 09:34:28] [INFO ] Added : 275 causal constraints over 55 iterations in 16345 ms. Result :sat
Minimization took 526 ms.
Current structural bounds on expressions (after SMT) : [448] Max seen :[7]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 in SAFETY mode, 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.
[2022-05-17 09:34:29] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:34:29] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-17 09:34:30] [INFO ] Implicit Places using invariants in 399 ms returned []
[2022-05-17 09:34:30] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:34:30] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 09:34:30] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 09:34:35] [INFO ] Implicit Places using invariants and state equation in 5654 ms returned []
Implicit Place search using SMT with State Equation took 6057 ms to find 0 implicit places.
[2022-05-17 09:34:35] [INFO ] Redundant transitions in 38 ms returned []
[2022-05-17 09:34:35] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 09:34:35] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-17 09:34:36] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Ending property specific reduction for Peterson-COL-7-UpperBounds-12 in 94072 ms.
[2022-05-17 09:34:36] [INFO ] Flatten gal took : 263 ms
[2022-05-17 09:34:37] [INFO ] Applying decomposition
[2022-05-17 09:34:37] [INFO ] Flatten gal took : 132 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5857867691895781333.txt' '-o' '/tmp/graph5857867691895781333.bin' '-w' '/tmp/graph5857867691895781333.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5857867691895781333.bin' '-l' '-1' '-v' '-w' '/tmp/graph5857867691895781333.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:34:37] [INFO ] Decomposing Gal with order
[2022-05-17 09:34:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:34:37] [INFO ] Removed a total of 3174 redundant transitions.
[2022-05-17 09:34:37] [INFO ] Flatten gal took : 203 ms
[2022-05-17 09:34:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 68 ms.
[2022-05-17 09:34:38] [INFO ] Time to serialize gal into /tmp/UpperBounds10413213923439974428.gal : 29 ms
[2022-05-17 09:34:38] [INFO ] Time to serialize properties into /tmp/UpperBounds18348599301228567813.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10413213923439974428.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18348599301228567813.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...297
Loading property file /tmp/UpperBounds18348599301228567813.prop.
Detected timeout of ITS tools.
[2022-05-17 10:01:27] [INFO ] Applying decomposition
[2022-05-17 10:01:28] [INFO ] Flatten gal took : 470 ms
[2022-05-17 10:01:28] [INFO ] Decomposing Gal with order
[2022-05-17 10:01:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:01:29] [INFO ] Removed a total of 3336 redundant transitions.
[2022-05-17 10:01:29] [INFO ] Flatten gal took : 568 ms
[2022-05-17 10:01:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 86 ms.
[2022-05-17 10:01:59] [INFO ] Time to serialize gal into /tmp/UpperBounds660839121460920322.gal : 65 ms
[2022-05-17 10:01:59] [INFO ] Time to serialize properties into /tmp/UpperBounds16437495117945590981.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds660839121460920322.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16437495117945590981.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds16437495117945590981.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-COL-7"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is 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 r168-tall-165277016100045"
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 ;