Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089267700011.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-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 PhilosophersDyn-COL-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089267700011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 134K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 11:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 11:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 32K May 5 16:51 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 PhilosophersDyn-COL-10-UpperBounds-00
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-01
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-02
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-03
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-04
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-05
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-06
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-07
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-08
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-09
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-10
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-11
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-12
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-13
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-14
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621176436500

Running Version 0
[2021-05-16 14:47:19] [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]
[2021-05-16 14:47:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 14:47:19] [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.
[2021-05-16 14:47:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-16 14:47:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 471 ms
[2021-05-16 14:47:20] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 170 PT places and 2320.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2021-05-16 14:47:20] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions in 3 ms.
[2021-05-16 14:47:20] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_17311813485132820459.dot
// Phase 1: matrix 7 rows 8 cols
[2021-05-16 14:47:20] [INFO ] Computed 3 place invariants in 4 ms
FORMULA PhilosophersDyn-COL-10-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PhilosophersDyn-COL-10-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-16 14:47:20] [INFO ] Unfolded HLPN to a Petri net with 170 places and 2310 transitions in 38 ms.
[2021-05-16 14:47:20] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 7 rows 8 cols
[2021-05-16 14:47:20] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 14:47:20] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-16 14:47:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:20] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-16 14:47:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-16 14:47:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-16 14:47:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-16 14:47:21] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-16 14:47:21] [INFO ] Added : 5 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 13 ms.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-16 14:47:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-16 14:47:21] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Added 3 Read/Feed constraints in 7 ms returned sat
[2021-05-16 14:47:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-16 14:47:21] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-16 14:47:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-16 14:47:21] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 8 ms.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-16 14:47:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-16 14:47:21] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-16 14:47:21] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 8 ms.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-16 14:47:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-16 14:47:21] [INFO ] Added : 5 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 4 ms.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Added 3 Read/Feed constraints in 26 ms returned sat
[2021-05-16 14:47:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-16 14:47:21] [INFO ] Added : 5 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Added 3 Read/Feed constraints in 17 ms returned sat
[2021-05-16 14:47:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 7 ms returned sat
[2021-05-16 14:47:21] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-16 14:47:21] [INFO ] Added : 5 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 12 ms.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-16 14:47:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-16 14:47:21] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-16 14:47:21] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 8 ms.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-16 14:47:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-16 14:47:22] [INFO ] Added : 5 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 3 ms.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-16 14:47:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-16 14:47:22] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-16 14:47:22] [INFO ] Added : 5 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 4 ms.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-16 14:47:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-16 14:47:22] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-16 14:47:22] [INFO ] Added : 5 causal constraints over 1 iterations in 58 ms. Result :sat
Minimization took 4 ms.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-16 14:47:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-16 14:47:22] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-16 14:47:22] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-16 14:47:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-16 14:47:22] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-16 14:47:22] [INFO ] Added : 5 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [-1, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
[2021-05-16 14:47:22] [INFO ] Unfolded HLPN to a Petri net with 170 places and 2310 transitions in 28 ms.
[2021-05-16 14:47:22] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_7137480565739145964.dot
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Incomplete random walk after 10000 steps, including 1187 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :36
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :36
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :41
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :36
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :41
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :36
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :36
[2021-05-16 14:47:22] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2021-05-16 14:47:22] [INFO ] Computed 39 place invariants in 66 ms
[2021-05-16 14:47:23] [INFO ] [Real]Absence check using 30 positive place invariants in 87 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:23] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2021-05-16 14:47:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:23] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:24] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2021-05-16 14:47:24] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2021-05-16 14:47:25] [INFO ] [Nat]Added 1030 Read/Feed constraints in 826 ms returned sat
[2021-05-16 14:47:25] [INFO ] Deduced a trap composed of 77 places in 299 ms of which 6 ms to minimize.
[2021-05-16 14:47:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 391 ms
[2021-05-16 14:47:25] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 432 ms.
[2021-05-16 14:47:26] [INFO ] Added : 0 causal constraints over 0 iterations in 555 ms. Result :sat
Minimization took 1745 ms.
[2021-05-16 14:47:27] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2021-05-16 14:47:27] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-16 14:47:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:28] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2021-05-16 14:47:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:28] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2021-05-16 14:47:28] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-16 14:47:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:28] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Nat]Added 1030 Read/Feed constraints in 1077 ms returned sat
[2021-05-16 14:47:29] [INFO ] Deduced a trap composed of 40 places in 232 ms of which 1 ms to minimize.
[2021-05-16 14:47:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 684 ms
[2021-05-16 14:47:30] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 301 ms.
[2021-05-16 14:47:30] [INFO ] Added : 0 causal constraints over 0 iterations in 424 ms. Result :sat
Minimization took 952 ms.
[2021-05-16 14:47:31] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2021-05-16 14:47:31] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-16 14:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:32] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2021-05-16 14:47:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:32] [INFO ] [Nat]Absence check using 30 positive place invariants in 6 ms returned sat
[2021-05-16 14:47:32] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-16 14:47:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:32] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2021-05-16 14:47:33] [INFO ] [Nat]Added 1030 Read/Feed constraints in 782 ms returned sat
[2021-05-16 14:47:33] [INFO ] Deduced a trap composed of 57 places in 439 ms of which 1 ms to minimize.
[2021-05-16 14:47:34] [INFO ] Deduced a trap composed of 48 places in 381 ms of which 1 ms to minimize.
[2021-05-16 14:47:34] [INFO ] Deduced a trap composed of 60 places in 224 ms of which 1 ms to minimize.
[2021-05-16 14:47:34] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 0 ms to minimize.
[2021-05-16 14:47:34] [INFO ] Deduced a trap composed of 71 places in 279 ms of which 0 ms to minimize.
[2021-05-16 14:47:35] [INFO ] Deduced a trap composed of 60 places in 220 ms of which 1 ms to minimize.
[2021-05-16 14:47:35] [INFO ] Deduced a trap composed of 53 places in 211 ms of which 0 ms to minimize.
[2021-05-16 14:47:35] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 1 ms to minimize.
[2021-05-16 14:47:36] [INFO ] Deduced a trap composed of 60 places in 273 ms of which 0 ms to minimize.
[2021-05-16 14:47:36] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 0 ms to minimize.
[2021-05-16 14:47:37] [INFO ] Deduced a trap composed of 62 places in 206 ms of which 1 ms to minimize.
[2021-05-16 14:47:37] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 0 ms to minimize.
[2021-05-16 14:47: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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-16 14:47:37] [INFO ] [Real]Absence check using 30 positive place invariants in 3 ms returned sat
[2021-05-16 14:47:37] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-16 14:47:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:37] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2021-05-16 14:47:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:37] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2021-05-16 14:47:37] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-16 14:47:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:37] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2021-05-16 14:47:38] [INFO ] [Nat]Added 1030 Read/Feed constraints in 790 ms returned sat
[2021-05-16 14:47:38] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 168 ms.
[2021-05-16 14:47:39] [INFO ] Added : 0 causal constraints over 0 iterations in 324 ms. Result :sat
Minimization took 1680 ms.
[2021-05-16 14:47:40] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2021-05-16 14:47:40] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-16 14:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:41] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2021-05-16 14:47:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:41] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2021-05-16 14:47:41] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-16 14:47:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:41] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2021-05-16 14:47:42] [INFO ] [Nat]Added 1030 Read/Feed constraints in 783 ms returned sat
[2021-05-16 14:47:42] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 181 ms.
[2021-05-16 14:47:42] [INFO ] Added : 0 causal constraints over 0 iterations in 286 ms. Result :sat
Minimization took 1668 ms.
[2021-05-16 14:47:44] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2021-05-16 14:47:44] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-16 14:47:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:44] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2021-05-16 14:47:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:44] [INFO ] [Nat]Absence check using 30 positive place invariants in 7 ms returned sat
[2021-05-16 14:47:44] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2021-05-16 14:47:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:44] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2021-05-16 14:47:45] [INFO ] [Nat]Added 1030 Read/Feed constraints in 923 ms returned sat
[2021-05-16 14:47:46] [INFO ] Deduced a trap composed of 40 places in 236 ms of which 0 ms to minimize.
[2021-05-16 14:47:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 717 ms
[2021-05-16 14:47:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 244 ms.
[2021-05-16 14:47:46] [INFO ] Added : 0 causal constraints over 0 iterations in 356 ms. Result :sat
Minimization took 981 ms.
[2021-05-16 14:47:47] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2021-05-16 14:47:48] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-16 14:47:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:48] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2021-05-16 14:47:48] [INFO ] [Real]Added 1030 Read/Feed constraints in 209 ms returned sat
[2021-05-16 14:47:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:48] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2021-05-16 14:47:48] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2021-05-16 14:47:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:48] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2021-05-16 14:47:49] [INFO ] [Nat]Added 1030 Read/Feed constraints in 801 ms returned sat
[2021-05-16 14:47:50] [INFO ] Deduced a trap composed of 40 places in 455 ms of which 1 ms to minimize.
[2021-05-16 14:47:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1038 ms
[2021-05-16 14:47:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 323 ms.
[2021-05-16 14:47:51] [INFO ] Added : 0 causal constraints over 0 iterations in 439 ms. Result :sat
Minimization took 1130 ms.
[2021-05-16 14:47:52] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2021-05-16 14:47:52] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2021-05-16 14:47:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:52] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2021-05-16 14:47:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:52] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2021-05-16 14:47:52] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-16 14:47:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:52] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2021-05-16 14:47:53] [INFO ] [Nat]Added 1030 Read/Feed constraints in 730 ms returned sat
[2021-05-16 14:47:53] [INFO ] Deduced a trap composed of 57 places in 261 ms of which 0 ms to minimize.
[2021-05-16 14:47:54] [INFO ] Deduced a trap composed of 48 places in 211 ms of which 1 ms to minimize.
[2021-05-16 14:47:54] [INFO ] Deduced a trap composed of 60 places in 257 ms of which 0 ms to minimize.
[2021-05-16 14:47:54] [INFO ] Deduced a trap composed of 64 places in 221 ms of which 0 ms to minimize.
[2021-05-16 14:47:55] [INFO ] Deduced a trap composed of 71 places in 215 ms of which 0 ms to minimize.
[2021-05-16 14:47:55] [INFO ] Deduced a trap composed of 60 places in 218 ms of which 1 ms to minimize.
[2021-05-16 14:47:55] [INFO ] Deduced a trap composed of 53 places in 246 ms of which 0 ms to minimize.
[2021-05-16 14:47:55] [INFO ] Deduced a trap composed of 40 places in 226 ms of which 1 ms to minimize.
[2021-05-16 14:47:56] [INFO ] Deduced a trap composed of 60 places in 211 ms of which 0 ms to minimize.
[2021-05-16 14:47:56] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 0 ms to minimize.
[2021-05-16 14:47:57] [INFO ] Deduced a trap composed of 62 places in 220 ms of which 1 ms to minimize.
[2021-05-16 14:47:57] [INFO ] Deduced a trap composed of 51 places in 207 ms of which 1 ms to minimize.
[2021-05-16 14:47:57] [INFO ] Deduced a trap composed of 58 places in 238 ms of which 1 ms to minimize.
[2021-05-16 14:47: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 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-16 14:47:57] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2021-05-16 14:47:57] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-16 14:47:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:57] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2021-05-16 14:47:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:58] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2021-05-16 14:47:58] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-16 14:47:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:58] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2021-05-16 14:47:59] [INFO ] [Nat]Added 1030 Read/Feed constraints in 883 ms returned sat
[2021-05-16 14:47:59] [INFO ] Deduced a trap composed of 40 places in 242 ms of which 0 ms to minimize.
[2021-05-16 14:47:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 691 ms
[2021-05-16 14:48:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 226 ms.
[2021-05-16 14:48:00] [INFO ] Added : 0 causal constraints over 0 iterations in 336 ms. Result :sat
Minimization took 952 ms.
[2021-05-16 14:48:01] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2021-05-16 14:48:01] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-16 14:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:48:01] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2021-05-16 14:48:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:48:01] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2021-05-16 14:48:01] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 6 ms returned sat
[2021-05-16 14:48:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:48:02] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2021-05-16 14:48:02] [INFO ] [Nat]Added 1030 Read/Feed constraints in 743 ms returned sat
[2021-05-16 14:48:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 184 ms.
[2021-05-16 14:48:03] [INFO ] Added : 0 causal constraints over 0 iterations in 300 ms. Result :sat
Minimization took 1802 ms.
[2021-05-16 14:48:05] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2021-05-16 14:48:05] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-16 14:48:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:48:05] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2021-05-16 14:48:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:48:05] [INFO ] [Nat]Absence check using 30 positive place invariants in 32 ms returned sat
[2021-05-16 14:48:05] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2021-05-16 14:48:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:48:05] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2021-05-16 14:48:06] [INFO ] [Nat]Added 1030 Read/Feed constraints in 785 ms returned sat
[2021-05-16 14:48:07] [INFO ] Deduced a trap composed of 57 places in 312 ms of which 0 ms to minimize.
[2021-05-16 14:48:07] [INFO ] Deduced a trap composed of 48 places in 855 ms of which 1 ms to minimize.
[2021-05-16 14:48:08] [INFO ] Deduced a trap composed of 60 places in 289 ms of which 1 ms to minimize.
[2021-05-16 14:48:08] [INFO ] Deduced a trap composed of 64 places in 274 ms of which 1 ms to minimize.
[2021-05-16 14:48:08] [INFO ] Deduced a trap composed of 71 places in 215 ms of which 0 ms to minimize.
[2021-05-16 14:48:09] [INFO ] Deduced a trap composed of 60 places in 400 ms of which 1 ms to minimize.
[2021-05-16 14:48:09] [INFO ] Deduced a trap composed of 53 places in 323 ms of which 0 ms to minimize.
[2021-05-16 14:48:10] [INFO ] Deduced a trap composed of 40 places in 449 ms of which 1 ms to minimize.
[2021-05-16 14:48:10] [INFO ] Deduced a trap composed of 4 places in 632 ms of which 0 ms to minimize.
[2021-05-16 14:48: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 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-16 14:48:11] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2021-05-16 14:48:11] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-16 14:48:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:48:11] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2021-05-16 14:48:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:48:11] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2021-05-16 14:48:11] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-16 14:48:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:48:11] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2021-05-16 14:48:12] [INFO ] [Nat]Added 1030 Read/Feed constraints in 760 ms returned sat
[2021-05-16 14:48:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 354 ms.
[2021-05-16 14:48:13] [INFO ] Added : 0 causal constraints over 0 iterations in 542 ms. Result :sat
Minimization took 1747 ms.
[2021-05-16 14:48:14] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2021-05-16 14:48:14] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-16 14:48:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:48:15] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2021-05-16 14:48:15] [INFO ] [Real]Added 1030 Read/Feed constraints in 198 ms returned sat
[2021-05-16 14:48:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:48:15] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2021-05-16 14:48:15] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-16 14:48:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:48:15] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2021-05-16 14:48:16] [INFO ] [Nat]Added 1030 Read/Feed constraints in 819 ms returned sat
[2021-05-16 14:48:17] [INFO ] Deduced a trap composed of 48 places in 275 ms of which 0 ms to minimize.
[2021-05-16 14:48:17] [INFO ] Deduced a trap composed of 50 places in 223 ms of which 0 ms to minimize.
[2021-05-16 14:48:17] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 0 ms to minimize.
[2021-05-16 14:48:17] [INFO ] Deduced a trap composed of 48 places in 235 ms of which 1 ms to minimize.
[2021-05-16 14:48:18] [INFO ] Deduced a trap composed of 48 places in 241 ms of which 0 ms to minimize.
[2021-05-16 14:48:18] [INFO ] Deduced a trap composed of 58 places in 240 ms of which 1 ms to minimize.
[2021-05-16 14:48:18] [INFO ] Deduced a trap composed of 54 places in 230 ms of which 0 ms to minimize.
[2021-05-16 14:48:18] [INFO ] Deduced a trap composed of 77 places in 221 ms of which 1 ms to minimize.
[2021-05-16 14:48:19] [INFO ] Deduced a trap composed of 62 places in 214 ms of which 0 ms to minimize.
[2021-05-16 14:48:19] [INFO ] Deduced a trap composed of 48 places in 349 ms of which 0 ms to minimize.
[2021-05-16 14:48:20] [INFO ] Deduced a trap composed of 48 places in 223 ms of which 0 ms to minimize.
[2021-05-16 14:48:20] [INFO ] Deduced a trap composed of 40 places in 223 ms of which 1 ms to minimize.
[2021-05-16 14:48:20] [INFO ] Deduced a trap composed of 4 places in 324 ms of which 0 ms to minimize.
[2021-05-16 14:48: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 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-16 14:48:20] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2021-05-16 14:48:20] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-16 14:48:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:48:21] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2021-05-16 14:48:21] [INFO ] [Real]Added 1030 Read/Feed constraints in 191 ms returned sat
[2021-05-16 14:48:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:48:21] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2021-05-16 14:48:21] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-16 14:48:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:48:21] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2021-05-16 14:48:22] [INFO ] [Nat]Added 1030 Read/Feed constraints in 778 ms returned sat
[2021-05-16 14:48:22] [INFO ] Deduced a trap composed of 48 places in 251 ms of which 0 ms to minimize.
[2021-05-16 14:48:23] [INFO ] Deduced a trap composed of 50 places in 242 ms of which 1 ms to minimize.
[2021-05-16 14:48:23] [INFO ] Deduced a trap composed of 66 places in 246 ms of which 0 ms to minimize.
[2021-05-16 14:48:23] [INFO ] Deduced a trap composed of 48 places in 241 ms of which 1 ms to minimize.
[2021-05-16 14:48:24] [INFO ] Deduced a trap composed of 48 places in 246 ms of which 12 ms to minimize.
[2021-05-16 14:48:24] [INFO ] Deduced a trap composed of 58 places in 252 ms of which 0 ms to minimize.
[2021-05-16 14:48:24] [INFO ] Deduced a trap composed of 54 places in 245 ms of which 0 ms to minimize.
[2021-05-16 14:48:24] [INFO ] Deduced a trap composed of 77 places in 253 ms of which 0 ms to minimize.
[2021-05-16 14:48:25] [INFO ] Deduced a trap composed of 62 places in 229 ms of which 0 ms to minimize.
[2021-05-16 14:48:25] [INFO ] Deduced a trap composed of 48 places in 242 ms of which 1 ms to minimize.
[2021-05-16 14:48:25] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 0 ms to minimize.
[2021-05-16 14:48:26] [INFO ] Deduced a trap composed of 40 places in 385 ms of which 0 ms to minimize.
[2021-05-16 14:48:27] [INFO ] Deduced a trap composed of 4 places in 545 ms of which 1 ms to minimize.
[2021-05-16 14:48:27] [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 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [2147483647, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10] Max seen :[2, 4, 4, 2, 2, 4, 4, 4, 4, 2, 4, 2, 4, 4]
Incomplete Parikh walk after 533800 steps, including 65264 resets, run finished after 4790 ms. (steps per millisecond=111 ) properties (out of 14) seen :46 could not realise parikh vector
Incomplete Parikh walk after 533800 steps, including 65283 resets, run finished after 4601 ms. (steps per millisecond=116 ) properties (out of 14) seen :46 could not realise parikh vector
Incomplete Parikh walk after 808700 steps, including 98772 resets, run finished after 6772 ms. (steps per millisecond=119 ) properties (out of 14) seen :46 could not realise parikh vector
Incomplete Parikh walk after 501100 steps, including 61367 resets, run finished after 4283 ms. (steps per millisecond=116 ) properties (out of 14) seen :46 could not realise parikh vector
Incomplete Parikh walk after 808700 steps, including 98942 resets, run finished after 6716 ms. (steps per millisecond=120 ) properties (out of 14) seen :46 could not realise parikh vector
Incomplete Parikh walk after 662600 steps, including 81025 resets, run finished after 5499 ms. (steps per millisecond=120 ) properties (out of 14) seen :46 could not realise parikh vector
Incomplete Parikh walk after 662600 steps, including 80922 resets, run finished after 5485 ms. (steps per millisecond=120 ) properties (out of 14) seen :46 could not realise parikh vector
Incomplete Parikh walk after 808700 steps, including 98844 resets, run finished after 6922 ms. (steps per millisecond=116 ) properties (out of 14) seen :46 could not realise parikh vector
Incomplete Parikh walk after 430600 steps, including 52688 resets, run finished after 3678 ms. (steps per millisecond=117 ) properties (out of 14) seen :46 could not realise parikh vector
Support contains 160 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 226 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
[2021-05-16 14:49:16] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2021-05-16 14:49:16] [INFO ] Computed 39 place invariants in 58 ms
[2021-05-16 14:49:16] [INFO ] Dead Transitions using invariants and state equation in 859 ms returned [45, 55, 56, 65, 67, 75, 78, 85, 89, 95, 100, 105, 111, 115, 122, 125, 133, 135, 144, 145, 146, 156, 166, 167, 176, 178, 186, 189, 196, 200, 206, 211, 216, 222, 226, 233, 236, 244, 245, 247, 256, 257, 267, 277, 278, 287, 289, 297, 300, 307, 311, 317, 322, 327, 333, 337, 344, 345, 348, 356, 358, 367, 368, 378, 388, 389, 398, 400, 408, 411, 418, 422, 428, 433, 438, 444, 445, 449, 456, 459, 467, 469, 478, 479, 489, 499, 500, 509, 511, 519, 522, 529, 533, 539, 544, 545, 550, 556, 560, 567, 570, 578, 580, 589, 590, 600, 610, 611, 620, 622, 630, 633, 640, 644, 645, 651, 656, 661, 667, 671, 678, 681, 689, 691, 700, 701, 711, 721, 722, 731, 733, 741, 744, 745, 752, 756, 762, 767, 772, 778, 782, 789, 792, 800, 802, 811, 812, 822, 832, 833, 842, 844, 845, 853, 856, 863, 867, 873, 878, 883, 889, 893, 900, 903, 911, 913, 922, 923, 933, 943, 944, 945, 954, 956, 964, 967, 974, 978, 984, 989, 994, 1000, 1004, 1011, 1014, 1022, 1024, 1033, 1034, 1044, 1045, 1055, 1056, 1065, 1067, 1075, 1078, 1085, 1089, 1095, 1100, 1105, 1111, 1115, 1122, 1125, 1133, 1135, 1144, 1145, 1146, 1156, 1166, 1167, 1176, 1178, 1186, 1189, 1196, 1200, 1206, 1211, 1216, 1222, 1226, 1233, 1236, 1244, 1245, 1247, 1256, 1257, 1267, 1277, 1278, 1287, 1289, 1297, 1300, 1307, 1311, 1317, 1322, 1327, 1333, 1337, 1344, 1345, 1348, 1356, 1358, 1367, 1368, 1378, 1388, 1389, 1398, 1400, 1408, 1411, 1418, 1422, 1428, 1433, 1438, 1444, 1445, 1449, 1456, 1459, 1467, 1469, 1478, 1479, 1489, 1499, 1500, 1509, 1511, 1519, 1522, 1529, 1533, 1539, 1544, 1545, 1550, 1556, 1560, 1567, 1570, 1578, 1580, 1589, 1590, 1600, 1610, 1611, 1620, 1622, 1630, 1633, 1640, 1644, 1645, 1651, 1656, 1661, 1667, 1671, 1678, 1681, 1689, 1691, 1700, 1701, 1711, 1721, 1722, 1731, 1733, 1741, 1744, 1745, 1752, 1756, 1762, 1767, 1772, 1778, 1782, 1789, 1792, 1800, 1802, 1811, 1812, 1822, 1832, 1833, 1842, 1844, 1845, 1853, 1856, 1863, 1867, 1873, 1878, 1883, 1889, 1893, 1900, 1903, 1911, 1913, 1922, 1923, 1933, 1943, 1944, 1945, 1954, 1956, 1964, 1967, 1974, 1978, 1984, 1989, 1994, 2000, 2004, 2011, 2014, 2022, 2024, 2033, 2034, 2044]
Found 380 dead transitions using SMT.
Drop transitions removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions :[2044, 2034, 2033, 2024, 2022, 2014, 2011, 2004, 2000, 1994, 1989, 1984, 1978, 1974, 1967, 1964, 1956, 1954, 1945, 1944, 1943, 1933, 1923, 1922, 1913, 1911, 1903, 1900, 1893, 1889, 1883, 1878, 1873, 1867, 1863, 1856, 1853, 1845, 1844, 1842, 1833, 1832, 1822, 1812, 1811, 1802, 1800, 1792, 1789, 1782, 1778, 1772, 1767, 1762, 1756, 1752, 1745, 1744, 1741, 1733, 1731, 1722, 1721, 1711, 1701, 1700, 1691, 1689, 1681, 1678, 1671, 1667, 1661, 1656, 1651, 1645, 1644, 1640, 1633, 1630, 1622, 1620, 1611, 1610, 1600, 1590, 1589, 1580, 1578, 1570, 1567, 1560, 1556, 1550, 1545, 1544, 1539, 1533, 1529, 1522, 1519, 1511, 1509, 1500, 1499, 1489, 1479, 1478, 1469, 1467, 1459, 1456, 1449, 1445, 1444, 1438, 1433, 1428, 1422, 1418, 1411, 1408, 1400, 1398, 1389, 1388, 1378, 1368, 1367, 1358, 1356, 1348, 1345, 1344, 1337, 1333, 1327, 1322, 1317, 1311, 1307, 1300, 1297, 1289, 1287, 1278, 1277, 1267, 1257, 1256, 1247, 1245, 1244, 1236, 1233, 1226, 1222, 1216, 1211, 1206, 1200, 1196, 1189, 1186, 1178, 1176, 1167, 1166, 1156, 1146, 1145, 1144, 1135, 1133, 1125, 1122, 1115, 1111, 1105, 1100, 1095, 1089, 1085, 1078, 1075, 1067, 1065, 1056, 1055, 1045, 1044, 1034, 1033, 1024, 1022, 1014, 1011, 1004, 1000, 994, 989, 984, 978, 974, 967, 964, 956, 954, 945, 944, 943, 933, 923, 922, 913, 911, 903, 900, 893, 889, 883, 878, 873, 867, 863, 856, 853, 845, 844, 842, 833, 832, 822, 812, 811, 802, 800, 792, 789, 782, 778, 772, 767, 762, 756, 752, 745, 744, 741, 733, 731, 722, 721, 711, 701, 700, 691, 689, 681, 678, 671, 667, 661, 656, 651, 645, 644, 640, 633, 630, 622, 620, 611, 610, 600, 590, 589, 580, 578, 570, 567, 560, 556, 550, 545, 544, 539, 533, 529, 522, 519, 511, 509, 500, 499, 489, 479, 478, 469, 467, 459, 456, 449, 445, 444, 438, 433, 428, 422, 418, 411, 408, 400, 398, 389, 388, 378, 368, 367, 358, 356, 348, 345, 344, 337, 333, 327, 322, 317, 311, 307, 300, 297, 289, 287, 278, 277, 267, 257, 256, 247, 245, 244, 236, 233, 226, 222, 216, 211, 206, 200, 196, 189, 186, 178, 176, 167, 166, 156, 146, 145, 144, 135, 133, 125, 122, 115, 111, 105, 100, 95, 89, 85, 78, 75, 67, 65, 56, 55, 45]
Starting structural reductions, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 97 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 170/170 places, 1885/2265 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:49:17] [INFO ] Computed 39 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 119430 resets, run finished after 7033 ms. (steps per millisecond=142 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 1000001 steps, including 8519 resets, run finished after 954 ms. (steps per millisecond=1048 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 1000001 steps, including 9577 resets, run finished after 991 ms. (steps per millisecond=1009 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 1000001 steps, including 7083 resets, run finished after 819 ms. (steps per millisecond=1221 ) properties (out of 14) seen :36
Incomplete Best-First random walk after 1000001 steps, including 9810 resets, run finished after 930 ms. (steps per millisecond=1075 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 1000000 steps, including 9836 resets, run finished after 922 ms. (steps per millisecond=1084 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 1000001 steps, including 9579 resets, run finished after 981 ms. (steps per millisecond=1019 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 1000001 steps, including 9045 resets, run finished after 1631 ms. (steps per millisecond=613 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 1000001 steps, including 7074 resets, run finished after 805 ms. (steps per millisecond=1242 ) properties (out of 14) seen :36
Incomplete Best-First random walk after 1000000 steps, including 9577 resets, run finished after 971 ms. (steps per millisecond=1029 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 1000001 steps, including 10000 resets, run finished after 912 ms. (steps per millisecond=1096 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 1000001 steps, including 7074 resets, run finished after 810 ms. (steps per millisecond=1234 ) properties (out of 14) seen :36
Incomplete Best-First random walk after 1000001 steps, including 9998 resets, run finished after 914 ms. (steps per millisecond=1094 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 1000001 steps, including 7080 resets, run finished after 808 ms. (steps per millisecond=1237 ) properties (out of 14) seen :36
Incomplete Best-First random walk after 1000001 steps, including 7077 resets, run finished after 808 ms. (steps per millisecond=1237 ) properties (out of 14) seen :36
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:49:37] [INFO ] Computed 39 place invariants in 24 ms
[2021-05-16 14:49:37] [INFO ] [Real]Absence check using 9 positive place invariants in 40 ms returned sat
[2021-05-16 14:49:37] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 11 ms returned sat
[2021-05-16 14:49:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:49:37] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2021-05-16 14:49:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:49:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:49:37] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2021-05-16 14:49:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:49:38] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2021-05-16 14:49:38] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:49:39] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1235 ms returned sat
[2021-05-16 14:49:39] [INFO ] Deduced a trap composed of 76 places in 210 ms of which 8 ms to minimize.
[2021-05-16 14:49:39] [INFO ] Deduced a trap composed of 63 places in 208 ms of which 2 ms to minimize.
[2021-05-16 14:49:40] [INFO ] Deduced a trap composed of 76 places in 209 ms of which 6 ms to minimize.
[2021-05-16 14:49:40] [INFO ] Deduced a trap composed of 77 places in 196 ms of which 11 ms to minimize.
[2021-05-16 14:49:40] [INFO ] Deduced a trap composed of 75 places in 183 ms of which 0 ms to minimize.
[2021-05-16 14:49:40] [INFO ] Deduced a trap composed of 74 places in 189 ms of which 1 ms to minimize.
[2021-05-16 14:49:41] [INFO ] Deduced a trap composed of 69 places in 202 ms of which 0 ms to minimize.
[2021-05-16 14:49:41] [INFO ] Deduced a trap composed of 79 places in 194 ms of which 0 ms to minimize.
[2021-05-16 14:49:42] [INFO ] Deduced a trap composed of 81 places in 171 ms of which 0 ms to minimize.
[2021-05-16 14:49:42] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2699 ms
[2021-05-16 14:49:42] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 132 ms.
[2021-05-16 14:49:42] [INFO ] Added : 0 causal constraints over 0 iterations in 251 ms. Result :sat
Minimization took 3040 ms.
[2021-05-16 14:49:45] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:49:45] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 14:49:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:49:45] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2021-05-16 14:49:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:49:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:49:45] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-16 14:49:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:49:45] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2021-05-16 14:49:46] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1041 ms returned sat
[2021-05-16 14:49:47] [INFO ] Deduced a trap composed of 82 places in 222 ms of which 1 ms to minimize.
[2021-05-16 14:49:47] [INFO ] Deduced a trap composed of 52 places in 184 ms of which 0 ms to minimize.
[2021-05-16 14:49:47] [INFO ] Deduced a trap composed of 54 places in 182 ms of which 1 ms to minimize.
[2021-05-16 14:49:48] [INFO ] Deduced a trap composed of 92 places in 214 ms of which 0 ms to minimize.
[2021-05-16 14:49:48] [INFO ] Deduced a trap composed of 62 places in 221 ms of which 0 ms to minimize.
[2021-05-16 14:49:48] [INFO ] Deduced a trap composed of 64 places in 206 ms of which 0 ms to minimize.
[2021-05-16 14:49:48] [INFO ] Deduced a trap composed of 74 places in 205 ms of which 0 ms to minimize.
[2021-05-16 14:49:49] [INFO ] Deduced a trap composed of 77 places in 216 ms of which 1 ms to minimize.
[2021-05-16 14:49:49] [INFO ] Deduced a trap composed of 58 places in 214 ms of which 0 ms to minimize.
[2021-05-16 14:49:49] [INFO ] Deduced a trap composed of 73 places in 175 ms of which 0 ms to minimize.
[2021-05-16 14:49:49] [INFO ] Deduced a trap composed of 59 places in 212 ms of which 0 ms to minimize.
[2021-05-16 14:49:50] [INFO ] Deduced a trap composed of 62 places in 169 ms of which 0 ms to minimize.
[2021-05-16 14:49:50] [INFO ] Deduced a trap composed of 74 places in 217 ms of which 0 ms to minimize.
[2021-05-16 14:49:50] [INFO ] Deduced a trap composed of 71 places in 203 ms of which 0 ms to minimize.
[2021-05-16 14:49:51] [INFO ] Deduced a trap composed of 62 places in 205 ms of which 1 ms to minimize.
[2021-05-16 14:49:51] [INFO ] Deduced a trap composed of 48 places in 206 ms of which 0 ms to minimize.
[2021-05-16 14:49:51] [INFO ] Deduced a trap composed of 45 places in 207 ms of which 0 ms to minimize.
[2021-05-16 14:49:52] [INFO ] Deduced a trap composed of 83 places in 303 ms of which 0 ms to minimize.
[2021-05-16 14:49:54] [INFO ] Deduced a trap composed of 80 places in 1945 ms of which 1 ms to minimize.
[2021-05-16 14:49:54] [INFO ] Deduced a trap composed of 49 places in 266 ms of which 1 ms to minimize.
[2021-05-16 14:49:55] [INFO ] Deduced a trap composed of 54 places in 251 ms of which 0 ms to minimize.
[2021-05-16 14:49:55] [INFO ] Deduced a trap composed of 55 places in 428 ms of which 0 ms to minimize.
[2021-05-16 14:49:56] [INFO ] Deduced a trap composed of 48 places in 438 ms of which 1 ms to minimize.
[2021-05-16 14:49:56] [INFO ] Deduced a trap composed of 48 places in 219 ms of which 0 ms to minimize.
[2021-05-16 14:49:57] [INFO ] Deduced a trap composed of 64 places in 325 ms of which 0 ms to minimize.
[2021-05-16 14:49:57] [INFO ] Deduced a trap composed of 60 places in 387 ms of which 1 ms to minimize.
[2021-05-16 14:49:58] [INFO ] Deduced a trap composed of 74 places in 469 ms of which 1 ms to minimize.
[2021-05-16 14:49:58] [INFO ] Deduced a trap composed of 45 places in 488 ms of which 0 ms to minimize.
[2021-05-16 14:49:59] [INFO ] Deduced a trap composed of 75 places in 408 ms of which 0 ms to minimize.
[2021-05-16 14:49:59] [INFO ] Deduced a trap composed of 61 places in 249 ms of which 1 ms to minimize.
[2021-05-16 14:49:59] [INFO ] Deduced a trap composed of 69 places in 208 ms of which 0 ms to minimize.
[2021-05-16 14:49:59] [INFO ] Deduced a trap composed of 63 places in 206 ms of which 1 ms to minimize.
[2021-05-16 14:50:00] [INFO ] Deduced a trap composed of 68 places in 210 ms of which 0 ms to minimize.
[2021-05-16 14:50:00] [INFO ] Deduced a trap composed of 69 places in 175 ms of which 0 ms to minimize.
[2021-05-16 14:50:00] [INFO ] Deduced a trap composed of 61 places in 174 ms of which 1 ms to minimize.
[2021-05-16 14:50:01] [INFO ] Deduced a trap composed of 73 places in 178 ms of which 0 ms to minimize.
[2021-05-16 14:50:01] [INFO ] Deduced a trap composed of 80 places in 216 ms of which 0 ms to minimize.
[2021-05-16 14:50:01] [INFO ] Deduced a trap composed of 48 places in 356 ms of which 1 ms to minimize.
[2021-05-16 14:50:02] [INFO ] Deduced a trap composed of 59 places in 213 ms of which 0 ms to minimize.
[2021-05-16 14:50:03] [INFO ] Deduced a trap composed of 64 places in 219 ms of which 0 ms to minimize.
[2021-05-16 14:50:03] [INFO ] Deduced a trap composed of 62 places in 229 ms of which 0 ms to minimize.
[2021-05-16 14:50:03] [INFO ] Deduced a trap composed of 60 places in 241 ms of which 0 ms to minimize.
[2021-05-16 14:50:04] [INFO ] Deduced a trap composed of 65 places in 227 ms of which 1 ms to minimize.
[2021-05-16 14:50:04] [INFO ] Deduced a trap composed of 48 places in 225 ms of which 1 ms to minimize.
[2021-05-16 14:50:04] [INFO ] Deduced a trap composed of 58 places in 217 ms of which 1 ms to minimize.
[2021-05-16 14:50:05] [INFO ] Deduced a trap composed of 59 places in 217 ms of which 0 ms to minimize.
[2021-05-16 14:50:05] [INFO ] Deduced a trap composed of 49 places in 238 ms of which 1 ms to minimize.
[2021-05-16 14:50:05] [INFO ] Deduced a trap composed of 59 places in 216 ms of which 0 ms to minimize.
[2021-05-16 14:50:06] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 1 ms to minimize.
[2021-05-16 14:50:07] [INFO ] Deduced a trap composed of 40 places in 212 ms of which 0 ms to minimize.
[2021-05-16 14:50:07] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 20231 ms
[2021-05-16 14:50:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 204 ms.
[2021-05-16 14:50:07] [INFO ] Added : 0 causal constraints over 0 iterations in 322 ms. Result :sat
Minimization took 2597 ms.
[2021-05-16 14:50:10] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:50:10] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 14:50:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:50:10] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2021-05-16 14:50:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:50:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:50:10] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 14:50:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:50:10] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2021-05-16 14:50:11] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1152 ms returned sat
[2021-05-16 14:50:12] [INFO ] Deduced a trap composed of 82 places in 207 ms of which 1 ms to minimize.
[2021-05-16 14:50:12] [INFO ] Deduced a trap composed of 85 places in 212 ms of which 0 ms to minimize.
[2021-05-16 14:50:13] [INFO ] Deduced a trap composed of 85 places in 235 ms of which 1 ms to minimize.
[2021-05-16 14:50:13] [INFO ] Deduced a trap composed of 86 places in 414 ms of which 0 ms to minimize.
[2021-05-16 14:50:14] [INFO ] Deduced a trap composed of 60 places in 374 ms of which 1 ms to minimize.
[2021-05-16 14:50:14] [INFO ] Deduced a trap composed of 94 places in 317 ms of which 1 ms to minimize.
[2021-05-16 14:50:15] [INFO ] Deduced a trap composed of 86 places in 244 ms of which 0 ms to minimize.
[2021-05-16 14:50:15] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 0 ms to minimize.
[2021-05-16 14:50:15] [INFO ] Deduced a trap composed of 84 places in 306 ms of which 0 ms to minimize.
[2021-05-16 14:50:16] [INFO ] Deduced a trap composed of 85 places in 186 ms of which 0 ms to minimize.
[2021-05-16 14:50:16] [INFO ] Deduced a trap composed of 99 places in 174 ms of which 0 ms to minimize.
[2021-05-16 14:50:17] [INFO ] Deduced a trap composed of 93 places in 274 ms of which 0 ms to minimize.
[2021-05-16 14:50:17] [INFO ] Deduced a trap composed of 84 places in 241 ms of which 1 ms to minimize.
[2021-05-16 14:50:18] [INFO ] Deduced a trap composed of 87 places in 452 ms of which 1 ms to minimize.
[2021-05-16 14:50:18] [INFO ] Deduced a trap composed of 85 places in 217 ms of which 0 ms to minimize.
[2021-05-16 14:50:18] [INFO ] Deduced a trap composed of 79 places in 220 ms of which 0 ms to minimize.
[2021-05-16 14:50:19] [INFO ] Deduced a trap composed of 86 places in 212 ms of which 0 ms to minimize.
[2021-05-16 14:50:19] [INFO ] Deduced a trap composed of 62 places in 202 ms of which 0 ms to minimize.
[2021-05-16 14:50:19] [INFO ] Deduced a trap composed of 86 places in 214 ms of which 0 ms to minimize.
[2021-05-16 14:50:20] [INFO ] Deduced a trap composed of 55 places in 218 ms of which 0 ms to minimize.
[2021-05-16 14:50:20] [INFO ] Deduced a trap composed of 84 places in 262 ms of which 0 ms to minimize.
[2021-05-16 14:50:20] [INFO ] Deduced a trap composed of 64 places in 398 ms of which 1 ms to minimize.
[2021-05-16 14:50:21] [INFO ] Deduced a trap composed of 65 places in 398 ms of which 0 ms to minimize.
[2021-05-16 14:50:21] [INFO ] Deduced a trap composed of 51 places in 300 ms of which 1 ms to minimize.
[2021-05-16 14:50:21] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 9911 ms
[2021-05-16 14:50:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 170 ms.
[2021-05-16 14:50:22] [INFO ] Added : 0 causal constraints over 0 iterations in 311 ms. Result :sat
Minimization took 2526 ms.
[2021-05-16 14:50:24] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:50:24] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 12 ms returned sat
[2021-05-16 14:50:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:50:25] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2021-05-16 14:50:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:50:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:50:25] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2021-05-16 14:50:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:50:25] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2021-05-16 14:50:26] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1201 ms returned sat
[2021-05-16 14:50:26] [INFO ] Deduced a trap composed of 75 places in 234 ms of which 0 ms to minimize.
[2021-05-16 14:50:27] [INFO ] Deduced a trap composed of 76 places in 226 ms of which 1 ms to minimize.
[2021-05-16 14:50:27] [INFO ] Deduced a trap composed of 77 places in 249 ms of which 0 ms to minimize.
[2021-05-16 14:50:27] [INFO ] Deduced a trap composed of 84 places in 229 ms of which 0 ms to minimize.
[2021-05-16 14:50:28] [INFO ] Deduced a trap composed of 75 places in 349 ms of which 0 ms to minimize.
[2021-05-16 14:50:28] [INFO ] Deduced a trap composed of 76 places in 231 ms of which 0 ms to minimize.
[2021-05-16 14:50:28] [INFO ] Deduced a trap composed of 72 places in 228 ms of which 1 ms to minimize.
[2021-05-16 14:50:29] [INFO ] Deduced a trap composed of 69 places in 212 ms of which 0 ms to minimize.
[2021-05-16 14:50:29] [INFO ] Deduced a trap composed of 72 places in 178 ms of which 1 ms to minimize.
[2021-05-16 14:50:30] [INFO ] Deduced a trap composed of 79 places in 251 ms of which 0 ms to minimize.
[2021-05-16 14:50:30] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3643 ms
[2021-05-16 14:50:30] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 167 ms.
[2021-05-16 14:50:30] [INFO ] Added : 0 causal constraints over 0 iterations in 315 ms. Result :sat
Minimization took 3008 ms.
[2021-05-16 14:50:33] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:50:33] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-16 14:50:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:50:33] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2021-05-16 14:50:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:50:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:50:34] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 12 ms returned sat
[2021-05-16 14:50:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:50:34] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2021-05-16 14:50:35] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1165 ms returned sat
[2021-05-16 14:50:35] [INFO ] Deduced a trap composed of 75 places in 166 ms of which 0 ms to minimize.
[2021-05-16 14:50:35] [INFO ] Deduced a trap composed of 76 places in 167 ms of which 0 ms to minimize.
[2021-05-16 14:50:36] [INFO ] Deduced a trap composed of 77 places in 222 ms of which 0 ms to minimize.
[2021-05-16 14:50:36] [INFO ] Deduced a trap composed of 84 places in 343 ms of which 1 ms to minimize.
[2021-05-16 14:50:36] [INFO ] Deduced a trap composed of 75 places in 329 ms of which 1 ms to minimize.
[2021-05-16 14:50:37] [INFO ] Deduced a trap composed of 76 places in 207 ms of which 0 ms to minimize.
[2021-05-16 14:50:37] [INFO ] Deduced a trap composed of 72 places in 197 ms of which 0 ms to minimize.
[2021-05-16 14:50:37] [INFO ] Deduced a trap composed of 69 places in 187 ms of which 0 ms to minimize.
[2021-05-16 14:50:37] [INFO ] Deduced a trap composed of 72 places in 184 ms of which 0 ms to minimize.
[2021-05-16 14:50:38] [INFO ] Deduced a trap composed of 79 places in 213 ms of which 1 ms to minimize.
[2021-05-16 14:50:38] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3360 ms
[2021-05-16 14:50:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 155 ms.
[2021-05-16 14:50:39] [INFO ] Added : 0 causal constraints over 0 iterations in 263 ms. Result :sat
Minimization took 3007 ms.
[2021-05-16 14:50:42] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2021-05-16 14:50:42] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 10 ms returned sat
[2021-05-16 14:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:50:42] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2021-05-16 14:50:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:50:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2021-05-16 14:50:42] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 9 ms returned sat
[2021-05-16 14:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:50:43] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2021-05-16 14:50:44] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1183 ms returned sat
[2021-05-16 14:50:44] [INFO ] Deduced a trap composed of 82 places in 431 ms of which 1 ms to minimize.
[2021-05-16 14:50:45] [INFO ] Deduced a trap composed of 52 places in 393 ms of which 0 ms to minimize.
[2021-05-16 14:50:45] [INFO ] Deduced a trap composed of 54 places in 302 ms of which 1 ms to minimize.
[2021-05-16 14:50:46] [INFO ] Deduced a trap composed of 92 places in 275 ms of which 0 ms to minimize.
[2021-05-16 14:50:46] [INFO ] Deduced a trap composed of 62 places in 423 ms of which 0 ms to minimize.
[2021-05-16 14:50:47] [INFO ] Deduced a trap composed of 64 places in 341 ms of which 0 ms to minimize.
[2021-05-16 14:50:47] [INFO ] Deduced a trap composed of 74 places in 282 ms of which 0 ms to minimize.
[2021-05-16 14:50:47] [INFO ] Deduced a trap composed of 77 places in 242 ms of which 1 ms to minimize.
[2021-05-16 14:50:48] [INFO ] Deduced a trap composed of 58 places in 253 ms of which 0 ms to minimize.
[2021-05-16 14:50:48] [INFO ] Deduced a trap composed of 73 places in 231 ms of which 0 ms to minimize.
[2021-05-16 14:50:48] [INFO ] Deduced a trap composed of 59 places in 242 ms of which 1 ms to minimize.
[2021-05-16 14:50:48] [INFO ] Deduced a trap composed of 62 places in 254 ms of which 0 ms to minimize.
[2021-05-16 14:50:49] [INFO ] Deduced a trap composed of 74 places in 261 ms of which 0 ms to minimize.
[2021-05-16 14:50:49] [INFO ] Deduced a trap composed of 71 places in 257 ms of which 1 ms to minimize.
[2021-05-16 14:50:50] [INFO ] Deduced a trap composed of 62 places in 261 ms of which 0 ms to minimize.
[2021-05-16 14:50:50] [INFO ] Deduced a trap composed of 48 places in 378 ms of which 1 ms to minimize.
[2021-05-16 14:50:51] [INFO ] Deduced a trap composed of 45 places in 362 ms of which 0 ms to minimize.
[2021-05-16 14:50:51] [INFO ] Deduced a trap composed of 83 places in 400 ms of which 0 ms to minimize.
[2021-05-16 14:50:51] [INFO ] Deduced a trap composed of 80 places in 284 ms of which 0 ms to minimize.
[2021-05-16 14:50:52] [INFO ] Deduced a trap composed of 49 places in 559 ms of which 1 ms to minimize.
[2021-05-16 14:50:52] [INFO ] Deduced a trap composed of 54 places in 217 ms of which 0 ms to minimize.
[2021-05-16 14:50:53] [INFO ] Deduced a trap composed of 55 places in 264 ms of which 0 ms to minimize.
[2021-05-16 14:50:53] [INFO ] Deduced a trap composed of 48 places in 368 ms of which 0 ms to minimize.
[2021-05-16 14:50:54] [INFO ] Deduced a trap composed of 48 places in 191 ms of which 0 ms to minimize.
[2021-05-16 14:50:54] [INFO ] Deduced a trap composed of 64 places in 206 ms of which 0 ms to minimize.
[2021-05-16 14:50:55] [INFO ] Deduced a trap composed of 60 places in 275 ms of which 1 ms to minimize.
[2021-05-16 14:50:55] [INFO ] Deduced a trap composed of 74 places in 248 ms of which 0 ms to minimize.
[2021-05-16 14:50:55] [INFO ] Deduced a trap composed of 45 places in 260 ms of which 0 ms to minimize.
[2021-05-16 14:50:56] [INFO ] Deduced a trap composed of 75 places in 275 ms of which 0 ms to minimize.
[2021-05-16 14:50:56] [INFO ] Deduced a trap composed of 61 places in 206 ms of which 0 ms to minimize.
[2021-05-16 14:50:56] [INFO ] Deduced a trap composed of 69 places in 355 ms of which 1 ms to minimize.
[2021-05-16 14:50:57] [INFO ] Deduced a trap composed of 63 places in 338 ms of which 0 ms to minimize.
[2021-05-16 14:50:57] [INFO ] Deduced a trap composed of 68 places in 239 ms of which 1 ms to minimize.
[2021-05-16 14:50:57] [INFO ] Deduced a trap composed of 69 places in 244 ms of which 0 ms to minimize.
[2021-05-16 14:50:58] [INFO ] Deduced a trap composed of 61 places in 209 ms of which 0 ms to minimize.
[2021-05-16 14:50:58] [INFO ] Deduced a trap composed of 73 places in 188 ms of which 1 ms to minimize.
[2021-05-16 14:50:58] [INFO ] Deduced a trap composed of 80 places in 189 ms of which 0 ms to minimize.
[2021-05-16 14:50:59] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 1 ms to minimize.
[2021-05-16 14:51:00] [INFO ] Deduced a trap composed of 59 places in 352 ms of which 0 ms to minimize.
[2021-05-16 14:51:01] [INFO ] Deduced a trap composed of 64 places in 1562 ms of which 0 ms to minimize.
[2021-05-16 14:51:02] [INFO ] Deduced a trap composed of 62 places in 220 ms of which 0 ms to minimize.
[2021-05-16 14:51:02] [INFO ] Deduced a trap composed of 60 places in 206 ms of which 0 ms to minimize.
[2021-05-16 14:51:02] [INFO ] Deduced a trap composed of 65 places in 214 ms of which 0 ms to minimize.
[2021-05-16 14:51:03] [INFO ] Deduced a trap composed of 48 places in 197 ms of which 1 ms to minimize.
[2021-05-16 14:51:03] [INFO ] Deduced a trap composed of 58 places in 205 ms of which 0 ms to minimize.
[2021-05-16 14:51:03] [INFO ] Deduced a trap composed of 59 places in 207 ms of which 0 ms to minimize.
[2021-05-16 14:51:03] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 1 ms to minimize.
[2021-05-16 14:51:04] [INFO ] Deduced a trap composed of 59 places in 207 ms of which 1 ms to minimize.
[2021-05-16 14:51:05] [INFO ] Deduced a trap composed of 46 places in 206 ms of which 1 ms to minimize.
[2021-05-16 14:51:05] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 1 ms to minimize.
[2021-05-16 14:51:05] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 21383 ms
[2021-05-16 14:51:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 188 ms.
[2021-05-16 14:51:06] [INFO ] Added : 0 causal constraints over 0 iterations in 324 ms. Result :sat
Minimization took 2609 ms.
[2021-05-16 14:51:08] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:51:08] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 9 ms returned sat
[2021-05-16 14:51:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:51:09] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2021-05-16 14:51:09] [INFO ] [Real]Added 1010 Read/Feed constraints in 156 ms returned sat
[2021-05-16 14:51:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:51:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:51:09] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2021-05-16 14:51:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:51:09] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2021-05-16 14:51:10] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1191 ms returned sat
[2021-05-16 14:51:11] [INFO ] Deduced a trap composed of 82 places in 205 ms of which 0 ms to minimize.
[2021-05-16 14:51:11] [INFO ] Deduced a trap composed of 92 places in 186 ms of which 1 ms to minimize.
[2021-05-16 14:51:11] [INFO ] Deduced a trap composed of 88 places in 313 ms of which 1 ms to minimize.
[2021-05-16 14:51:12] [INFO ] Deduced a trap composed of 56 places in 205 ms of which 0 ms to minimize.
[2021-05-16 14:51:12] [INFO ] Deduced a trap composed of 91 places in 230 ms of which 0 ms to minimize.
[2021-05-16 14:51:12] [INFO ] Deduced a trap composed of 92 places in 223 ms of which 0 ms to minimize.
[2021-05-16 14:51:13] [INFO ] Deduced a trap composed of 88 places in 196 ms of which 0 ms to minimize.
[2021-05-16 14:51:13] [INFO ] Deduced a trap composed of 92 places in 195 ms of which 0 ms to minimize.
[2021-05-16 14:51:13] [INFO ] Deduced a trap composed of 89 places in 225 ms of which 0 ms to minimize.
[2021-05-16 14:51:14] [INFO ] Deduced a trap composed of 93 places in 206 ms of which 0 ms to minimize.
[2021-05-16 14:51:14] [INFO ] Deduced a trap composed of 94 places in 212 ms of which 0 ms to minimize.
[2021-05-16 14:51:14] [INFO ] Deduced a trap composed of 93 places in 201 ms of which 0 ms to minimize.
[2021-05-16 14:51:14] [INFO ] Deduced a trap composed of 82 places in 204 ms of which 0 ms to minimize.
[2021-05-16 14:51:15] [INFO ] Deduced a trap composed of 90 places in 197 ms of which 11 ms to minimize.
[2021-05-16 14:51:15] [INFO ] Deduced a trap composed of 52 places in 198 ms of which 1 ms to minimize.
[2021-05-16 14:51:15] [INFO ] Deduced a trap composed of 88 places in 193 ms of which 0 ms to minimize.
[2021-05-16 14:51:16] [INFO ] Deduced a trap composed of 94 places in 208 ms of which 0 ms to minimize.
[2021-05-16 14:51:16] [INFO ] Deduced a trap composed of 90 places in 219 ms of which 1 ms to minimize.
[2021-05-16 14:51:16] [INFO ] Deduced a trap composed of 89 places in 220 ms of which 0 ms to minimize.
[2021-05-16 14:51:17] [INFO ] Deduced a trap composed of 93 places in 204 ms of which 1 ms to minimize.
[2021-05-16 14:51:17] [INFO ] Deduced a trap composed of 97 places in 182 ms of which 0 ms to minimize.
[2021-05-16 14:51:17] [INFO ] Deduced a trap composed of 95 places in 197 ms of which 0 ms to minimize.
[2021-05-16 14:51:17] [INFO ] Deduced a trap composed of 89 places in 198 ms of which 0 ms to minimize.
[2021-05-16 14:51:18] [INFO ] Deduced a trap composed of 86 places in 229 ms of which 1 ms to minimize.
[2021-05-16 14:51:19] [INFO ] Deduced a trap composed of 79 places in 396 ms of which 0 ms to minimize.
[2021-05-16 14:51:20] [INFO ] Deduced a trap composed of 87 places in 1093 ms of which 1 ms to minimize.
[2021-05-16 14:51:20] [INFO ] Deduced a trap composed of 92 places in 206 ms of which 0 ms to minimize.
[2021-05-16 14:51:20] [INFO ] Deduced a trap composed of 87 places in 227 ms of which 0 ms to minimize.
[2021-05-16 14:51:21] [INFO ] Deduced a trap composed of 85 places in 201 ms of which 0 ms to minimize.
[2021-05-16 14:51:21] [INFO ] Deduced a trap composed of 82 places in 210 ms of which 1 ms to minimize.
[2021-05-16 14:51:22] [INFO ] Deduced a trap composed of 95 places in 367 ms of which 1 ms to minimize.
[2021-05-16 14:51:22] [INFO ] Deduced a trap composed of 93 places in 203 ms of which 1 ms to minimize.
[2021-05-16 14:51:23] [INFO ] Deduced a trap composed of 89 places in 215 ms of which 0 ms to minimize.
[2021-05-16 14:51:23] [INFO ] Deduced a trap composed of 94 places in 190 ms of which 0 ms to minimize.
[2021-05-16 14:51:23] [INFO ] Deduced a trap composed of 85 places in 223 ms of which 1 ms to minimize.
[2021-05-16 14:51:24] [INFO ] Deduced a trap composed of 86 places in 217 ms of which 0 ms to minimize.
[2021-05-16 14:51:24] [INFO ] Deduced a trap composed of 93 places in 192 ms of which 1 ms to minimize.
[2021-05-16 14:51:24] [INFO ] Deduced a trap composed of 85 places in 189 ms of which 2 ms to minimize.
[2021-05-16 14:51:25] [INFO ] Deduced a trap composed of 89 places in 185 ms of which 0 ms to minimize.
[2021-05-16 14:51:25] [INFO ] Deduced a trap composed of 77 places in 201 ms of which 0 ms to minimize.
[2021-05-16 14:51:26] [INFO ] Deduced a trap composed of 88 places in 189 ms of which 0 ms to minimize.
[2021-05-16 14:51:26] [INFO ] Deduced a trap composed of 90 places in 202 ms of which 0 ms to minimize.
[2021-05-16 14:51:26] [INFO ] Deduced a trap composed of 81 places in 186 ms of which 1 ms to minimize.
[2021-05-16 14:51:26] [INFO ] Deduced a trap composed of 82 places in 190 ms of which 1 ms to minimize.
[2021-05-16 14:51:27] [INFO ] Deduced a trap composed of 84 places in 201 ms of which 0 ms to minimize.
[2021-05-16 14:51:27] [INFO ] Deduced a trap composed of 87 places in 193 ms of which 0 ms to minimize.
[2021-05-16 14:51:28] [INFO ] Deduced a trap composed of 84 places in 204 ms of which 8 ms to minimize.
[2021-05-16 14:51:29] [INFO ] Deduced a trap composed of 55 places in 194 ms of which 1 ms to minimize.
[2021-05-16 14:51:30] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 0 ms to minimize.
[2021-05-16 14:51:30] [INFO ] Deduced a trap composed of 80 places in 196 ms of which 0 ms to minimize.
[2021-05-16 14:51:30] [INFO ] Deduced a trap composed of 77 places in 212 ms of which 0 ms to minimize.
[2021-05-16 14:51:31] [INFO ] Deduced a trap composed of 58 places in 205 ms of which 1 ms to minimize.
[2021-05-16 14:51:31] [INFO ] Deduced a trap composed of 59 places in 201 ms of which 1 ms to minimize.
[2021-05-16 14:51:32] [INFO ] Deduced a trap composed of 69 places in 218 ms of which 0 ms to minimize.
[2021-05-16 14:51:32] [INFO ] Deduced a trap composed of 47 places in 221 ms of which 1 ms to minimize.
[2021-05-16 14:51:33] [INFO ] Deduced a trap composed of 71 places in 221 ms of which 0 ms to minimize.
[2021-05-16 14:51:33] [INFO ] Deduced a trap composed of 59 places in 219 ms of which 0 ms to minimize.
[2021-05-16 14:51:33] [INFO ] Deduced a trap composed of 82 places in 197 ms of which 1 ms to minimize.
[2021-05-16 14:51:34] [INFO ] Deduced a trap composed of 74 places in 205 ms of which 0 ms to minimize.
[2021-05-16 14:51:35] [INFO ] Deduced a trap composed of 66 places in 204 ms of which 0 ms to minimize.
[2021-05-16 14:51:35] [INFO ] Deduced a trap composed of 76 places in 228 ms of which 0 ms to minimize.
[2021-05-16 14:51:36] [INFO ] Deduced a trap composed of 69 places in 190 ms of which 0 ms to minimize.
[2021-05-16 14:51:37] [INFO ] Deduced a trap composed of 78 places in 188 ms of which 0 ms to minimize.
[2021-05-16 14:51:37] [INFO ] Deduced a trap composed of 61 places in 200 ms of which 0 ms to minimize.
[2021-05-16 14:51:37] [INFO ] Deduced a trap composed of 78 places in 186 ms of which 1 ms to minimize.
[2021-05-16 14:51:38] [INFO ] Deduced a trap composed of 56 places in 213 ms of which 1 ms to minimize.
[2021-05-16 14:51:38] [INFO ] Deduced a trap composed of 73 places in 192 ms of which 0 ms to minimize.
[2021-05-16 14:51:39] [INFO ] Deduced a trap composed of 82 places in 197 ms of which 0 ms to minimize.
[2021-05-16 14:51:39] [INFO ] Deduced a trap composed of 58 places in 202 ms of which 0 ms to minimize.
[2021-05-16 14:51:39] [INFO ] Deduced a trap composed of 79 places in 204 ms of which 0 ms to minimize.
[2021-05-16 14:51:40] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 0 ms to minimize.
[2021-05-16 14:51:41] [INFO ] Deduced a trap composed of 62 places in 242 ms of which 1 ms to minimize.
[2021-05-16 14:51:42] [INFO ] Deduced a trap composed of 48 places in 203 ms of which 0 ms to minimize.
[2021-05-16 14:51:42] [INFO ] Deduced a trap composed of 58 places in 195 ms of which 1 ms to minimize.
[2021-05-16 14:51:42] [INFO ] Trap strengthening (SAT) tested/added 75/74 trap constraints in 31756 ms
[2021-05-16 14:51:42] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 153 ms.
[2021-05-16 14:51:42] [INFO ] Added : 0 causal constraints over 0 iterations in 281 ms. Result :sat
Minimization took 3000 ms.
[2021-05-16 14:51:45] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:51:45] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 13 ms returned sat
[2021-05-16 14:51:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:51:46] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2021-05-16 14:51:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:51:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:51:46] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-16 14:51:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:51:46] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2021-05-16 14:51:47] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1138 ms returned sat
[2021-05-16 14:51:48] [INFO ] Deduced a trap composed of 82 places in 552 ms of which 0 ms to minimize.
[2021-05-16 14:51:48] [INFO ] Deduced a trap composed of 85 places in 268 ms of which 0 ms to minimize.
[2021-05-16 14:51:49] [INFO ] Deduced a trap composed of 85 places in 190 ms of which 0 ms to minimize.
[2021-05-16 14:51:49] [INFO ] Deduced a trap composed of 86 places in 196 ms of which 1 ms to minimize.
[2021-05-16 14:51:50] [INFO ] Deduced a trap composed of 60 places in 212 ms of which 0 ms to minimize.
[2021-05-16 14:51:50] [INFO ] Deduced a trap composed of 94 places in 191 ms of which 1 ms to minimize.
[2021-05-16 14:51:50] [INFO ] Deduced a trap composed of 86 places in 207 ms of which 0 ms to minimize.
[2021-05-16 14:51:51] [INFO ] Deduced a trap composed of 67 places in 198 ms of which 1 ms to minimize.
[2021-05-16 14:51:51] [INFO ] Deduced a trap composed of 84 places in 269 ms of which 0 ms to minimize.
[2021-05-16 14:51:51] [INFO ] Deduced a trap composed of 85 places in 239 ms of which 0 ms to minimize.
[2021-05-16 14:51:51] [INFO ] Deduced a trap composed of 99 places in 188 ms of which 0 ms to minimize.
[2021-05-16 14:51:52] [INFO ] Deduced a trap composed of 93 places in 218 ms of which 0 ms to minimize.
[2021-05-16 14:51:52] [INFO ] Deduced a trap composed of 84 places in 234 ms of which 1 ms to minimize.
[2021-05-16 14:51:53] [INFO ] Deduced a trap composed of 87 places in 219 ms of which 0 ms to minimize.
[2021-05-16 14:51:53] [INFO ] Deduced a trap composed of 85 places in 212 ms of which 1 ms to minimize.
[2021-05-16 14:51:53] [INFO ] Deduced a trap composed of 79 places in 191 ms of which 0 ms to minimize.
[2021-05-16 14:51:54] [INFO ] Deduced a trap composed of 86 places in 206 ms of which 0 ms to minimize.
[2021-05-16 14:51:54] [INFO ] Deduced a trap composed of 62 places in 192 ms of which 0 ms to minimize.
[2021-05-16 14:51:54] [INFO ] Deduced a trap composed of 86 places in 284 ms of which 0 ms to minimize.
[2021-05-16 14:51:55] [INFO ] Deduced a trap composed of 55 places in 328 ms of which 1 ms to minimize.
[2021-05-16 14:51:55] [INFO ] Deduced a trap composed of 84 places in 186 ms of which 0 ms to minimize.
[2021-05-16 14:51:55] [INFO ] Deduced a trap composed of 64 places in 186 ms of which 1 ms to minimize.
[2021-05-16 14:51:56] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 0 ms to minimize.
[2021-05-16 14:51:56] [INFO ] Deduced a trap composed of 51 places in 204 ms of which 0 ms to minimize.
[2021-05-16 14:51:56] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 8862 ms
[2021-05-16 14:51:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 133 ms.
[2021-05-16 14:51:56] [INFO ] Added : 0 causal constraints over 0 iterations in 254 ms. Result :sat
Minimization took 2571 ms.
[2021-05-16 14:51:59] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:51:59] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 14:51:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:51:59] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2021-05-16 14:51:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:51:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:51:59] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-16 14:51:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:52:00] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2021-05-16 14:52:01] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1067 ms returned sat
[2021-05-16 14:52:01] [INFO ] Deduced a trap composed of 82 places in 204 ms of which 1 ms to minimize.
[2021-05-16 14:52:01] [INFO ] Deduced a trap composed of 52 places in 214 ms of which 0 ms to minimize.
[2021-05-16 14:52:02] [INFO ] Deduced a trap composed of 54 places in 219 ms of which 0 ms to minimize.
[2021-05-16 14:52:02] [INFO ] Deduced a trap composed of 92 places in 252 ms of which 0 ms to minimize.
[2021-05-16 14:52:02] [INFO ] Deduced a trap composed of 62 places in 223 ms of which 1 ms to minimize.
[2021-05-16 14:52:02] [INFO ] Deduced a trap composed of 64 places in 212 ms of which 0 ms to minimize.
[2021-05-16 14:52:03] [INFO ] Deduced a trap composed of 74 places in 214 ms of which 0 ms to minimize.
[2021-05-16 14:52:03] [INFO ] Deduced a trap composed of 77 places in 207 ms of which 0 ms to minimize.
[2021-05-16 14:52:03] [INFO ] Deduced a trap composed of 58 places in 177 ms of which 0 ms to minimize.
[2021-05-16 14:52:04] [INFO ] Deduced a trap composed of 73 places in 216 ms of which 1 ms to minimize.
[2021-05-16 14:52:04] [INFO ] Deduced a trap composed of 59 places in 211 ms of which 0 ms to minimize.
[2021-05-16 14:52:04] [INFO ] Deduced a trap composed of 62 places in 212 ms of which 0 ms to minimize.
[2021-05-16 14:52:04] [INFO ] Deduced a trap composed of 74 places in 175 ms of which 0 ms to minimize.
[2021-05-16 14:52:05] [INFO ] Deduced a trap composed of 71 places in 300 ms of which 0 ms to minimize.
[2021-05-16 14:52:05] [INFO ] Deduced a trap composed of 62 places in 210 ms of which 0 ms to minimize.
[2021-05-16 14:52:05] [INFO ] Deduced a trap composed of 48 places in 175 ms of which 1 ms to minimize.
[2021-05-16 14:52:06] [INFO ] Deduced a trap composed of 45 places in 214 ms of which 0 ms to minimize.
[2021-05-16 14:52:06] [INFO ] Deduced a trap composed of 83 places in 225 ms of which 0 ms to minimize.
[2021-05-16 14:52:06] [INFO ] Deduced a trap composed of 80 places in 189 ms of which 1 ms to minimize.
[2021-05-16 14:52:07] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 0 ms to minimize.
[2021-05-16 14:52:07] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 0 ms to minimize.
[2021-05-16 14:52:07] [INFO ] Deduced a trap composed of 55 places in 190 ms of which 0 ms to minimize.
[2021-05-16 14:52:07] [INFO ] Deduced a trap composed of 48 places in 190 ms of which 0 ms to minimize.
[2021-05-16 14:52:08] [INFO ] Deduced a trap composed of 48 places in 207 ms of which 1 ms to minimize.
[2021-05-16 14:52:08] [INFO ] Deduced a trap composed of 64 places in 210 ms of which 0 ms to minimize.
[2021-05-16 14:52:09] [INFO ] Deduced a trap composed of 60 places in 209 ms of which 1 ms to minimize.
[2021-05-16 14:52:09] [INFO ] Deduced a trap composed of 74 places in 244 ms of which 0 ms to minimize.
[2021-05-16 14:52:09] [INFO ] Deduced a trap composed of 45 places in 228 ms of which 0 ms to minimize.
[2021-05-16 14:52:10] [INFO ] Deduced a trap composed of 75 places in 227 ms of which 0 ms to minimize.
[2021-05-16 14:52:10] [INFO ] Deduced a trap composed of 61 places in 248 ms of which 0 ms to minimize.
[2021-05-16 14:52:10] [INFO ] Deduced a trap composed of 69 places in 232 ms of which 0 ms to minimize.
[2021-05-16 14:52:10] [INFO ] Deduced a trap composed of 63 places in 218 ms of which 0 ms to minimize.
[2021-05-16 14:52:11] [INFO ] Deduced a trap composed of 68 places in 185 ms of which 0 ms to minimize.
[2021-05-16 14:52:11] [INFO ] Deduced a trap composed of 69 places in 352 ms of which 1 ms to minimize.
[2021-05-16 14:52:12] [INFO ] Deduced a trap composed of 61 places in 264 ms of which 0 ms to minimize.
[2021-05-16 14:52:12] [INFO ] Deduced a trap composed of 73 places in 518 ms of which 0 ms to minimize.
[2021-05-16 14:52:13] [INFO ] Deduced a trap composed of 80 places in 239 ms of which 1 ms to minimize.
[2021-05-16 14:52:13] [INFO ] Deduced a trap composed of 48 places in 226 ms of which 0 ms to minimize.
[2021-05-16 14:52:14] [INFO ] Deduced a trap composed of 59 places in 215 ms of which 0 ms to minimize.
[2021-05-16 14:52:15] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 1 ms to minimize.
[2021-05-16 14:52:17] [INFO ] Deduced a trap composed of 62 places in 2847 ms of which 0 ms to minimize.
[2021-05-16 14:52:18] [INFO ] Deduced a trap composed of 60 places in 226 ms of which 0 ms to minimize.
[2021-05-16 14:52:18] [INFO ] Deduced a trap composed of 65 places in 297 ms of which 1 ms to minimize.
[2021-05-16 14:52:19] [INFO ] Deduced a trap composed of 48 places in 243 ms of which 0 ms to minimize.
[2021-05-16 14:52:19] [INFO ] Deduced a trap composed of 58 places in 281 ms of which 0 ms to minimize.
[2021-05-16 14:52:19] [INFO ] Deduced a trap composed of 59 places in 250 ms of which 1 ms to minimize.
[2021-05-16 14:52:20] [INFO ] Deduced a trap composed of 49 places in 233 ms of which 0 ms to minimize.
[2021-05-16 14:52:20] [INFO ] Deduced a trap composed of 59 places in 248 ms of which 0 ms to minimize.
[2021-05-16 14:52:21] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 1 ms to minimize.
[2021-05-16 14:52:22] [INFO ] Deduced a trap composed of 40 places in 478 ms of which 1 ms to minimize.
[2021-05-16 14:52:22] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 21072 ms
[2021-05-16 14:52:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 148 ms.
[2021-05-16 14:52:22] [INFO ] Added : 0 causal constraints over 0 iterations in 271 ms. Result :sat
Minimization took 2716 ms.
[2021-05-16 14:52:25] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:52:25] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 12 ms returned sat
[2021-05-16 14:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:52:25] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2021-05-16 14:52:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:52:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:52:25] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 9 ms returned sat
[2021-05-16 14:52:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:52:25] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2021-05-16 14:52:27] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1286 ms returned sat
[2021-05-16 14:52:27] [INFO ] Deduced a trap composed of 72 places in 409 ms of which 1 ms to minimize.
[2021-05-16 14:52:28] [INFO ] Deduced a trap composed of 80 places in 386 ms of which 0 ms to minimize.
[2021-05-16 14:52:28] [INFO ] Deduced a trap composed of 70 places in 222 ms of which 1 ms to minimize.
[2021-05-16 14:52:28] [INFO ] Deduced a trap composed of 84 places in 221 ms of which 0 ms to minimize.
[2021-05-16 14:52:29] [INFO ] Deduced a trap composed of 77 places in 351 ms of which 0 ms to minimize.
[2021-05-16 14:52:29] [INFO ] Deduced a trap composed of 73 places in 205 ms of which 0 ms to minimize.
[2021-05-16 14:52:29] [INFO ] Deduced a trap composed of 73 places in 262 ms of which 0 ms to minimize.
[2021-05-16 14:52:30] [INFO ] Deduced a trap composed of 69 places in 291 ms of which 0 ms to minimize.
[2021-05-16 14:52:31] [INFO ] Deduced a trap composed of 71 places in 363 ms of which 0 ms to minimize.
[2021-05-16 14:52:31] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3891 ms
[2021-05-16 14:52:31] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 171 ms.
[2021-05-16 14:52:31] [INFO ] Added : 0 causal constraints over 0 iterations in 290 ms. Result :sat
Minimization took 3000 ms.
[2021-05-16 14:52:34] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:52:34] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 16 ms returned sat
[2021-05-16 14:52:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:52:34] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2021-05-16 14:52:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:52:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:52:34] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 14:52:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:52:35] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2021-05-16 14:52:36] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1245 ms returned sat
[2021-05-16 14:52:36] [INFO ] Deduced a trap composed of 82 places in 242 ms of which 1 ms to minimize.
[2021-05-16 14:52:37] [INFO ] Deduced a trap composed of 85 places in 275 ms of which 0 ms to minimize.
[2021-05-16 14:52:37] [INFO ] Deduced a trap composed of 85 places in 329 ms of which 0 ms to minimize.
[2021-05-16 14:52:38] [INFO ] Deduced a trap composed of 86 places in 272 ms of which 0 ms to minimize.
[2021-05-16 14:52:39] [INFO ] Deduced a trap composed of 60 places in 337 ms of which 0 ms to minimize.
[2021-05-16 14:52:39] [INFO ] Deduced a trap composed of 94 places in 233 ms of which 0 ms to minimize.
[2021-05-16 14:52:39] [INFO ] Deduced a trap composed of 86 places in 305 ms of which 0 ms to minimize.
[2021-05-16 14:52:40] [INFO ] Deduced a trap composed of 67 places in 266 ms of which 1 ms to minimize.
[2021-05-16 14:52:40] [INFO ] Deduced a trap composed of 84 places in 230 ms of which 1 ms to minimize.
[2021-05-16 14:52:40] [INFO ] Deduced a trap composed of 85 places in 207 ms of which 0 ms to minimize.
[2021-05-16 14:52:41] [INFO ] Deduced a trap composed of 99 places in 224 ms of which 0 ms to minimize.
[2021-05-16 14:52:41] [INFO ] Deduced a trap composed of 93 places in 364 ms of which 1 ms to minimize.
[2021-05-16 14:52:42] [INFO ] Deduced a trap composed of 84 places in 243 ms of which 0 ms to minimize.
[2021-05-16 14:52:42] [INFO ] Deduced a trap composed of 87 places in 412 ms of which 1 ms to minimize.
[2021-05-16 14:52:43] [INFO ] Deduced a trap composed of 85 places in 408 ms of which 1 ms to minimize.
[2021-05-16 14:52:43] [INFO ] Deduced a trap composed of 79 places in 213 ms of which 0 ms to minimize.
[2021-05-16 14:52:44] [INFO ] Deduced a trap composed of 86 places in 273 ms of which 0 ms to minimize.
[2021-05-16 14:52:44] [INFO ] Deduced a trap composed of 62 places in 199 ms of which 1 ms to minimize.
[2021-05-16 14:52:44] [INFO ] Deduced a trap composed of 86 places in 204 ms of which 0 ms to minimize.
[2021-05-16 14:52:45] [INFO ] Deduced a trap composed of 55 places in 207 ms of which 0 ms to minimize.
[2021-05-16 14:52:45] [INFO ] Deduced a trap composed of 84 places in 201 ms of which 1 ms to minimize.
[2021-05-16 14:52:45] [INFO ] Deduced a trap composed of 64 places in 435 ms of which 0 ms to minimize.
[2021-05-16 14:52:46] [INFO ] Deduced a trap composed of 65 places in 279 ms of which 0 ms to minimize.
[2021-05-16 14:52:46] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 0 ms to minimize.
[2021-05-16 14:52:46] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 10185 ms
[2021-05-16 14:52:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 172 ms.
[2021-05-16 14:52:46] [INFO ] Added : 0 causal constraints over 0 iterations in 287 ms. Result :sat
Minimization took 2768 ms.
[2021-05-16 14:52:49] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:52:49] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-16 14:52:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:52:50] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2021-05-16 14:52:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:52:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:52:50] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-16 14:52:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:52:50] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2021-05-16 14:52:51] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1347 ms returned sat
[2021-05-16 14:52:51] [INFO ] Deduced a trap composed of 72 places in 188 ms of which 1 ms to minimize.
[2021-05-16 14:52:52] [INFO ] Deduced a trap composed of 80 places in 195 ms of which 0 ms to minimize.
[2021-05-16 14:52:52] [INFO ] Deduced a trap composed of 70 places in 199 ms of which 1 ms to minimize.
[2021-05-16 14:52:52] [INFO ] Deduced a trap composed of 84 places in 190 ms of which 0 ms to minimize.
[2021-05-16 14:52:52] [INFO ] Deduced a trap composed of 77 places in 209 ms of which 0 ms to minimize.
[2021-05-16 14:52:53] [INFO ] Deduced a trap composed of 73 places in 210 ms of which 1 ms to minimize.
[2021-05-16 14:52:53] [INFO ] Deduced a trap composed of 73 places in 333 ms of which 0 ms to minimize.
[2021-05-16 14:52:54] [INFO ] Deduced a trap composed of 69 places in 1180 ms of which 0 ms to minimize.
[2021-05-16 14:52:55] [INFO ] Deduced a trap composed of 71 places in 211 ms of which 0 ms to minimize.
[2021-05-16 14:52:55] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3968 ms
[2021-05-16 14:52:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 191 ms.
[2021-05-16 14:52:55] [INFO ] Added : 0 causal constraints over 0 iterations in 336 ms. Result :sat
Minimization took 3001 ms.
[2021-05-16 14:52:59] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:52:59] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 14:52:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:52:59] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2021-05-16 14:52:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:52:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:52:59] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 21 ms returned sat
[2021-05-16 14:52:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:52:59] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2021-05-16 14:53:01] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1411 ms returned sat
[2021-05-16 14:53:02] [INFO ] Deduced a trap composed of 82 places in 1346 ms of which 0 ms to minimize.
[2021-05-16 14:53:03] [INFO ] Deduced a trap composed of 88 places in 1149 ms of which 0 ms to minimize.
[2021-05-16 14:53:04] [INFO ] Deduced a trap composed of 84 places in 257 ms of which 0 ms to minimize.
[2021-05-16 14:53:04] [INFO ] Deduced a trap composed of 85 places in 216 ms of which 0 ms to minimize.
[2021-05-16 14:53:04] [INFO ] Deduced a trap composed of 83 places in 218 ms of which 0 ms to minimize.
[2021-05-16 14:53:05] [INFO ] Deduced a trap composed of 85 places in 180 ms of which 0 ms to minimize.
[2021-05-16 14:53:05] [INFO ] Deduced a trap composed of 91 places in 215 ms of which 0 ms to minimize.
[2021-05-16 14:53:05] [INFO ] Deduced a trap composed of 95 places in 223 ms of which 0 ms to minimize.
[2021-05-16 14:53:06] [INFO ] Deduced a trap composed of 90 places in 179 ms of which 0 ms to minimize.
[2021-05-16 14:53:06] [INFO ] Deduced a trap composed of 89 places in 214 ms of which 1 ms to minimize.
[2021-05-16 14:53:06] [INFO ] Deduced a trap composed of 84 places in 215 ms of which 0 ms to minimize.
[2021-05-16 14:53:07] [INFO ] Deduced a trap composed of 75 places in 211 ms of which 0 ms to minimize.
[2021-05-16 14:53:07] [INFO ] Deduced a trap composed of 70 places in 217 ms of which 1 ms to minimize.
[2021-05-16 14:53:08] [INFO ] Deduced a trap composed of 85 places in 278 ms of which 0 ms to minimize.
[2021-05-16 14:53:08] [INFO ] Deduced a trap composed of 89 places in 212 ms of which 0 ms to minimize.
[2021-05-16 14:53:09] [INFO ] Deduced a trap composed of 76 places in 179 ms of which 0 ms to minimize.
[2021-05-16 14:53:09] [INFO ] Deduced a trap composed of 58 places in 246 ms of which 0 ms to minimize.
[2021-05-16 14:53:10] [INFO ] Deduced a trap composed of 85 places in 209 ms of which 0 ms to minimize.
[2021-05-16 14:53:10] [INFO ] Deduced a trap composed of 90 places in 216 ms of which 0 ms to minimize.
[2021-05-16 14:53:11] [INFO ] Deduced a trap composed of 90 places in 177 ms of which 1 ms to minimize.
[2021-05-16 14:53:11] [INFO ] Deduced a trap composed of 57 places in 218 ms of which 1 ms to minimize.
[2021-05-16 14:53:12] [INFO ] Deduced a trap composed of 90 places in 238 ms of which 0 ms to minimize.
[2021-05-16 14:53:12] [INFO ] Deduced a trap composed of 96 places in 222 ms of which 1 ms to minimize.
[2021-05-16 14:53:12] [INFO ] Deduced a trap composed of 93 places in 226 ms of which 0 ms to minimize.
[2021-05-16 14:53:13] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 1 ms to minimize.
[2021-05-16 14:53:14] [INFO ] Deduced a trap composed of 60 places in 223 ms of which 0 ms to minimize.
[2021-05-16 14:53:15] [INFO ] Deduced a trap composed of 48 places in 771 ms of which 0 ms to minimize.
[2021-05-16 14:53:16] [INFO ] Deduced a trap composed of 45 places in 213 ms of which 0 ms to minimize.
[2021-05-16 14:53:16] [INFO ] Deduced a trap composed of 61 places in 215 ms of which 0 ms to minimize.
[2021-05-16 14:53:16] [INFO ] Deduced a trap composed of 65 places in 208 ms of which 0 ms to minimize.
[2021-05-16 14:53:17] [INFO ] Deduced a trap composed of 63 places in 214 ms of which 1 ms to minimize.
[2021-05-16 14:53:17] [INFO ] Deduced a trap composed of 48 places in 207 ms of which 0 ms to minimize.
[2021-05-16 14:53:18] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 17707 ms
[2021-05-16 14:53:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 132 ms.
[2021-05-16 14:53:18] [INFO ] Added : 0 causal constraints over 0 iterations in 240 ms. Result :sat
Minimization took 2822 ms.
[2021-05-16 14:53:21] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:53:21] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-16 14:53:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:53:22] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2021-05-16 14:53:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:53:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:53:22] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 10 ms returned sat
[2021-05-16 14:53:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:53:22] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2021-05-16 14:53:24] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1483 ms returned sat
[2021-05-16 14:53:24] [INFO ] Deduced a trap composed of 82 places in 194 ms of which 0 ms to minimize.
[2021-05-16 14:53:24] [INFO ] Deduced a trap composed of 88 places in 199 ms of which 0 ms to minimize.
[2021-05-16 14:53:25] [INFO ] Deduced a trap composed of 84 places in 226 ms of which 0 ms to minimize.
[2021-05-16 14:53:25] [INFO ] Deduced a trap composed of 85 places in 206 ms of which 0 ms to minimize.
[2021-05-16 14:53:25] [INFO ] Deduced a trap composed of 83 places in 227 ms of which 1 ms to minimize.
[2021-05-16 14:53:26] [INFO ] Deduced a trap composed of 85 places in 189 ms of which 0 ms to minimize.
[2021-05-16 14:53:26] [INFO ] Deduced a trap composed of 91 places in 187 ms of which 0 ms to minimize.
[2021-05-16 14:53:26] [INFO ] Deduced a trap composed of 95 places in 185 ms of which 0 ms to minimize.
[2021-05-16 14:53:27] [INFO ] Deduced a trap composed of 90 places in 196 ms of which 0 ms to minimize.
[2021-05-16 14:53:27] [INFO ] Deduced a trap composed of 89 places in 198 ms of which 0 ms to minimize.
[2021-05-16 14:53:27] [INFO ] Deduced a trap composed of 84 places in 201 ms of which 0 ms to minimize.
[2021-05-16 14:53:28] [INFO ] Deduced a trap composed of 75 places in 293 ms of which 1 ms to minimize.
[2021-05-16 14:53:29] [INFO ] Deduced a trap composed of 70 places in 334 ms of which 0 ms to minimize.
[2021-05-16 14:53:29] [INFO ] Deduced a trap composed of 85 places in 387 ms of which 0 ms to minimize.
[2021-05-16 14:53:30] [INFO ] Deduced a trap composed of 89 places in 236 ms of which 0 ms to minimize.
[2021-05-16 14:53:30] [INFO ] Deduced a trap composed of 76 places in 414 ms of which 2 ms to minimize.
[2021-05-16 14:53:31] [INFO ] Deduced a trap composed of 58 places in 189 ms of which 0 ms to minimize.
[2021-05-16 14:53:31] [INFO ] Deduced a trap composed of 85 places in 205 ms of which 0 ms to minimize.
[2021-05-16 14:53:32] [INFO ] Deduced a trap composed of 90 places in 210 ms of which 0 ms to minimize.
[2021-05-16 14:53:32] [INFO ] Deduced a trap composed of 90 places in 204 ms of which 1 ms to minimize.
[2021-05-16 14:53:33] [INFO ] Deduced a trap composed of 57 places in 342 ms of which 1 ms to minimize.
[2021-05-16 14:53:33] [INFO ] Deduced a trap composed of 90 places in 188 ms of which 0 ms to minimize.
[2021-05-16 14:53:34] [INFO ] Deduced a trap composed of 96 places in 190 ms of which 0 ms to minimize.
[2021-05-16 14:53:34] [INFO ] Deduced a trap composed of 93 places in 192 ms of which 1 ms to minimize.
[2021-05-16 14:53:35] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 0 ms to minimize.
[2021-05-16 14:53:35] [INFO ] Deduced a trap composed of 60 places in 185 ms of which 1 ms to minimize.
[2021-05-16 14:53:35] [INFO ] Deduced a trap composed of 48 places in 207 ms of which 0 ms to minimize.
[2021-05-16 14:53:37] [INFO ] Deduced a trap composed of 45 places in 220 ms of which 0 ms to minimize.
[2021-05-16 14:53:37] [INFO ] Deduced a trap composed of 61 places in 200 ms of which 0 ms to minimize.
[2021-05-16 14:53:37] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 0 ms to minimize.
[2021-05-16 14:53:38] [INFO ] Deduced a trap composed of 63 places in 209 ms of which 0 ms to minimize.
[2021-05-16 14:53:38] [INFO ] Deduced a trap composed of 48 places in 220 ms of which 0 ms to minimize.
[2021-05-16 14:53:39] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 15680 ms
[2021-05-16 14:53:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 136 ms.
[2021-05-16 14:53:40] [INFO ] Added : 0 causal constraints over 0 iterations in 254 ms. Result :sat
Minimization took 2866 ms.
Current structural bounds on expressions (after SMT) : [2147483647, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10] Max seen :[2, 4, 4, 2, 2, 4, 4, 4, 4, 2, 4, 2, 4, 4]
Incomplete Parikh walk after 506800 steps, including 61909 resets, run finished after 4090 ms. (steps per millisecond=123 ) properties (out of 14) seen :46 could not realise parikh vector
Incomplete Parikh walk after 506800 steps, including 61883 resets, run finished after 4138 ms. (steps per millisecond=122 ) properties (out of 14) seen :46 could not realise parikh vector
Incomplete Parikh walk after 384100 steps, including 46902 resets, run finished after 3212 ms. (steps per millisecond=119 ) properties (out of 14) seen :46 could not realise parikh vector
Incomplete Parikh walk after 391100 steps, including 47711 resets, run finished after 3308 ms. (steps per millisecond=118 ) properties (out of 14) seen :46 could not realise parikh vector
Incomplete Parikh walk after 384100 steps, including 46904 resets, run finished after 3104 ms. (steps per millisecond=123 ) properties (out of 14) seen :46 could not realise parikh vector
Incomplete Parikh walk after 391100 steps, including 47753 resets, run finished after 3228 ms. (steps per millisecond=121 ) properties (out of 14) seen :46 could not realise parikh vector
Incomplete Parikh walk after 384100 steps, including 46878 resets, run finished after 3038 ms. (steps per millisecond=126 ) properties (out of 14) seen :46 could not realise parikh vector
Incomplete Parikh walk after 391100 steps, including 47686 resets, run finished after 3256 ms. (steps per millisecond=120 ) properties (out of 14) seen :46 could not realise parikh vector
Support contains 160 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 168 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 105 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:54:10] [INFO ] Computed 39 place invariants in 36 ms
[2021-05-16 14:54:10] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:54:10] [INFO ] Computed 39 place invariants in 22 ms
[2021-05-16 14:54:11] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:54:12] [INFO ] Implicit Places using invariants and state equation in 1403 ms returned []
Implicit Place search using SMT with State Equation took 1585 ms to find 0 implicit places.
[2021-05-16 14:54:12] [INFO ] Redundant transitions in 241 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:54:12] [INFO ] Computed 39 place invariants in 24 ms
[2021-05-16 14:54:15] [INFO ] Dead Transitions using invariants and state equation in 3222 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-00
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:54:15] [INFO ] Computed 39 place invariants in 35 ms
Incomplete random walk after 10000 steps, including 1194 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:54:15] [INFO ] Computed 39 place invariants in 30 ms
[2021-05-16 14:54:15] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2021-05-16 14:54:15] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 21 ms returned sat
[2021-05-16 14:54:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:54:16] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2021-05-16 14:54:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:54:16] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:54:16] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 10 ms returned sat
[2021-05-16 14:54:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:54:17] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2021-05-16 14:54:17] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:54:18] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1431 ms returned sat
[2021-05-16 14:54:19] [INFO ] Deduced a trap composed of 76 places in 443 ms of which 0 ms to minimize.
[2021-05-16 14:54:19] [INFO ] Deduced a trap composed of 63 places in 395 ms of which 1 ms to minimize.
[2021-05-16 14:54:20] [INFO ] Deduced a trap composed of 76 places in 357 ms of which 1 ms to minimize.
[2021-05-16 14:54:20] [INFO ] Deduced a trap composed of 77 places in 258 ms of which 0 ms to minimize.
[2021-05-16 14:54:20] [INFO ] Deduced a trap composed of 75 places in 236 ms of which 0 ms to minimize.
[2021-05-16 14:54:21] [INFO ] Deduced a trap composed of 74 places in 388 ms of which 0 ms to minimize.
[2021-05-16 14:54:21] [INFO ] Deduced a trap composed of 69 places in 209 ms of which 0 ms to minimize.
[2021-05-16 14:54:21] [INFO ] Deduced a trap composed of 79 places in 290 ms of which 0 ms to minimize.
[2021-05-16 14:54: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 173 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:54:22] [INFO ] Computed 39 place invariants in 32 ms
[2021-05-16 14:54:23] [INFO ] Dead Transitions using invariants and state equation in 1057 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:54:23] [INFO ] Computed 39 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 119238 resets, run finished after 5523 ms. (steps per millisecond=181 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 8516 resets, run finished after 799 ms. (steps per millisecond=1251 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:54:29] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 14:54:29] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:54:29] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 212 ms returned sat
[2021-05-16 14:54:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:54:31] [INFO ] [Real]Absence check using state equation in 1901 ms returned sat
[2021-05-16 14:54:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:54:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:54:31] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2021-05-16 14:54:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:54:31] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2021-05-16 14:54:31] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:54:33] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1255 ms returned sat
[2021-05-16 14:54:33] [INFO ] Deduced a trap composed of 76 places in 449 ms of which 1 ms to minimize.
[2021-05-16 14:54:34] [INFO ] Deduced a trap composed of 63 places in 229 ms of which 0 ms to minimize.
[2021-05-16 14:54:34] [INFO ] Deduced a trap composed of 76 places in 217 ms of which 0 ms to minimize.
[2021-05-16 14:54:34] [INFO ] Deduced a trap composed of 77 places in 223 ms of which 0 ms to minimize.
[2021-05-16 14:54:35] [INFO ] Deduced a trap composed of 75 places in 403 ms of which 0 ms to minimize.
[2021-05-16 14:54:35] [INFO ] Deduced a trap composed of 74 places in 225 ms of which 0 ms to minimize.
[2021-05-16 14:54:35] [INFO ] Deduced a trap composed of 69 places in 293 ms of which 1 ms to minimize.
[2021-05-16 14:54:36] [INFO ] Deduced a trap composed of 79 places in 349 ms of which 0 ms to minimize.
[2021-05-16 14:54:37] [INFO ] Deduced a trap composed of 81 places in 387 ms of which 0 ms to minimize.
[2021-05-16 14:54:37] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3885 ms
[2021-05-16 14:54:37] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 162 ms.
[2021-05-16 14:54:37] [INFO ] Added : 0 causal constraints over 0 iterations in 277 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 69 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 67 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:54:40] [INFO ] Computed 39 place invariants in 36 ms
[2021-05-16 14:54:40] [INFO ] Implicit Places using invariants in 317 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:54:40] [INFO ] Computed 39 place invariants in 18 ms
[2021-05-16 14:54:41] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:54:46] [INFO ] Implicit Places using invariants and state equation in 5186 ms returned []
Implicit Place search using SMT with State Equation took 5514 ms to find 0 implicit places.
[2021-05-16 14:54:46] [INFO ] Redundant transitions in 87 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:54:46] [INFO ] Computed 39 place invariants in 29 ms
[2021-05-16 14:54:47] [INFO ] Dead Transitions using invariants and state equation in 1063 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-00 in 31565 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-01
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:54:47] [INFO ] Computed 39 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 1199 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:54:47] [INFO ] Computed 39 place invariants in 29 ms
[2021-05-16 14:54:47] [INFO ] [Real]Absence check using 9 positive place invariants in 76 ms returned sat
[2021-05-16 14:54:47] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 178 ms returned sat
[2021-05-16 14:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:54:49] [INFO ] [Real]Absence check using state equation in 1764 ms returned sat
[2021-05-16 14:54:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:54:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:54:49] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2021-05-16 14:54:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:54:49] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2021-05-16 14:54:49] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:54:51] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1112 ms returned sat
[2021-05-16 14:54:51] [INFO ] Deduced a trap composed of 82 places in 289 ms of which 0 ms to minimize.
[2021-05-16 14:54:52] [INFO ] Deduced a trap composed of 52 places in 777 ms of which 0 ms to minimize.
[2021-05-16 14:54:52] [INFO ] Deduced a trap composed of 54 places in 328 ms of which 0 ms to minimize.
[2021-05-16 14:54:53] [INFO ] Deduced a trap composed of 92 places in 256 ms of which 1 ms to minimize.
[2021-05-16 14:54:53] [INFO ] Deduced a trap composed of 62 places in 244 ms of which 0 ms to minimize.
[2021-05-16 14:54:53] [INFO ] Deduced a trap composed of 64 places in 242 ms of which 0 ms to minimize.
[2021-05-16 14:54:54] [INFO ] Deduced a trap composed of 74 places in 228 ms of which 0 ms to minimize.
[2021-05-16 14:54:54] [INFO ] Deduced a trap composed of 77 places in 240 ms of which 0 ms to minimize.
[2021-05-16 14:54:54] [INFO ] Deduced a trap composed of 58 places in 220 ms of which 0 ms to minimize.
[2021-05-16 14:54:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 172 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 14:54:54] [INFO ] Computed 39 place invariants in 21 ms
[2021-05-16 14:54:55] [INFO ] Dead Transitions using invariants and state equation in 538 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 14:54:55] [INFO ] Computed 39 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 119383 resets, run finished after 5275 ms. (steps per millisecond=189 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9741 resets, run finished after 840 ms. (steps per millisecond=1190 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 14:55:01] [INFO ] Computed 39 place invariants in 26 ms
[2021-05-16 14:55:01] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2021-05-16 14:55:01] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 14:55:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:55:01] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2021-05-16 14:55:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:55:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:55:02] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2021-05-16 14:55:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:55:02] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2021-05-16 14:55:02] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:55:02] [INFO ] [Nat]Added 1010 Read/Feed constraints in 363 ms returned sat
[2021-05-16 14:55:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 162 ms.
[2021-05-16 14:55:03] [INFO ] Added : 0 causal constraints over 0 iterations in 285 ms. Result :sat
Minimization took 1171 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Incomplete Parikh walk after 88000 steps, including 11060 resets, run finished after 456 ms. (steps per millisecond=192 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 67 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 66 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 14:55:04] [INFO ] Computed 39 place invariants in 24 ms
[2021-05-16 14:55:05] [INFO ] Implicit Places using invariants in 405 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 422 ms to find 10 implicit places.
[2021-05-16 14:55:05] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 14:55:05] [INFO ] Computed 29 place invariants in 15 ms
[2021-05-16 14:55:05] [INFO ] Dead Transitions using invariants and state equation in 518 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 81 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2021-05-16 14:55:05] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 14:55:05] [INFO ] Computed 29 place invariants in 15 ms
[2021-05-16 14:55:06] [INFO ] Dead Transitions using invariants and state equation in 526 ms returned []
Finished structural reductions, in 2 iterations. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 14:55:06] [INFO ] Computed 29 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 119288 resets, run finished after 4999 ms. (steps per millisecond=200 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9742 resets, run finished after 794 ms. (steps per millisecond=1259 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 14:55:12] [INFO ] Computed 29 place invariants in 21 ms
[2021-05-16 14:55:12] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:55:12] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 4 ms returned sat
[2021-05-16 14:55:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:55:12] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2021-05-16 14:55:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:55:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:55:12] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 4 ms returned sat
[2021-05-16 14:55:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:55:12] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2021-05-16 14:55:12] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:55:13] [INFO ] [Nat]Added 1010 Read/Feed constraints in 399 ms returned sat
[2021-05-16 14:55:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 129 ms.
[2021-05-16 14:55:13] [INFO ] Added : 0 causal constraints over 0 iterations in 250 ms. Result :sat
Minimization took 1855 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Incomplete Parikh walk after 303700 steps, including 38376 resets, run finished after 1659 ms. (steps per millisecond=183 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 68 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 73 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 14:55:17] [INFO ] Computed 29 place invariants in 15 ms
[2021-05-16 14:55:17] [INFO ] Implicit Places using invariants in 536 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 14:55:17] [INFO ] Computed 29 place invariants in 38 ms
[2021-05-16 14:55:18] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:55:22] [INFO ] Implicit Places using invariants and state equation in 4500 ms returned []
Implicit Place search using SMT with State Equation took 5056 ms to find 0 implicit places.
[2021-05-16 14:55:22] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 14:55:22] [INFO ] Computed 29 place invariants in 16 ms
[2021-05-16 14:55:22] [INFO ] Dead Transitions using invariants and state equation in 457 ms returned []
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-01 in 35516 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-02
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:55:22] [INFO ] Computed 39 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 1201 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:55:22] [INFO ] Computed 39 place invariants in 18 ms
[2021-05-16 14:55:22] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:55:22] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-16 14:55:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:55:23] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2021-05-16 14:55:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:55:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:55:23] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-16 14:55:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:55:23] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2021-05-16 14:55:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:55:24] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1211 ms returned sat
[2021-05-16 14:55:25] [INFO ] Deduced a trap composed of 82 places in 253 ms of which 0 ms to minimize.
[2021-05-16 14:55:25] [INFO ] Deduced a trap composed of 85 places in 203 ms of which 1 ms to minimize.
[2021-05-16 14:55:26] [INFO ] Deduced a trap composed of 85 places in 230 ms of which 0 ms to minimize.
[2021-05-16 14:55:26] [INFO ] Deduced a trap composed of 86 places in 206 ms of which 0 ms to minimize.
[2021-05-16 14:55:26] [INFO ] Deduced a trap composed of 60 places in 223 ms of which 2 ms to minimize.
[2021-05-16 14:55:27] [INFO ] Deduced a trap composed of 94 places in 195 ms of which 0 ms to minimize.
[2021-05-16 14:55:27] [INFO ] Deduced a trap composed of 86 places in 209 ms of which 0 ms to minimize.
[2021-05-16 14:55:27] [INFO ] Deduced a trap composed of 67 places in 206 ms of which 1 ms to minimize.
[2021-05-16 14:55:28] [INFO ] Deduced a trap composed of 84 places in 204 ms of which 0 ms to minimize.
[2021-05-16 14:55:28] [INFO ] Deduced a trap composed of 85 places in 216 ms of which 0 ms to minimize.
[2021-05-16 14:55:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [198] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 64 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:55:28] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 14:55:28] [INFO ] Dead Transitions using invariants and state equation in 474 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:55:28] [INFO ] Computed 39 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 119393 resets, run finished after 5131 ms. (steps per millisecond=194 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7081 resets, run finished after 675 ms. (steps per millisecond=1481 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:55:34] [INFO ] Computed 39 place invariants in 24 ms
[2021-05-16 14:55:34] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2021-05-16 14:55:34] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 14:55:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:55:35] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2021-05-16 14:55:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:55:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:55:35] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 9 ms returned sat
[2021-05-16 14:55:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:55:35] [INFO ] [Nat]Absence check using state equation in 568 ms returned sat
[2021-05-16 14:55:35] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:55:37] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1326 ms returned sat
[2021-05-16 14:55:37] [INFO ] Deduced a trap composed of 82 places in 439 ms of which 1 ms to minimize.
[2021-05-16 14:55:38] [INFO ] Deduced a trap composed of 85 places in 438 ms of which 0 ms to minimize.
[2021-05-16 14:55:38] [INFO ] Deduced a trap composed of 85 places in 262 ms of which 0 ms to minimize.
[2021-05-16 14:55:39] [INFO ] Deduced a trap composed of 86 places in 244 ms of which 19 ms to minimize.
[2021-05-16 14:55:39] [INFO ] Deduced a trap composed of 60 places in 258 ms of which 0 ms to minimize.
[2021-05-16 14:55:40] [INFO ] Deduced a trap composed of 94 places in 210 ms of which 0 ms to minimize.
[2021-05-16 14:55:40] [INFO ] Deduced a trap composed of 86 places in 219 ms of which 0 ms to minimize.
[2021-05-16 14:55:40] [INFO ] Deduced a trap composed of 67 places in 233 ms of which 1 ms to minimize.
[2021-05-16 14:55:41] [INFO ] Deduced a trap composed of 84 places in 231 ms of which 0 ms to minimize.
[2021-05-16 14:55:41] [INFO ] Deduced a trap composed of 85 places in 225 ms of which 1 ms to minimize.
[2021-05-16 14:55:41] [INFO ] Deduced a trap composed of 99 places in 223 ms of which 1 ms to minimize.
[2021-05-16 14:55:42] [INFO ] Deduced a trap composed of 93 places in 186 ms of which 0 ms to minimize.
[2021-05-16 14:55:42] [INFO ] Deduced a trap composed of 84 places in 307 ms of which 0 ms to minimize.
[2021-05-16 14:55:43] [INFO ] Deduced a trap composed of 87 places in 223 ms of which 0 ms to minimize.
[2021-05-16 14:55:43] [INFO ] Deduced a trap composed of 85 places in 227 ms of which 0 ms to minimize.
[2021-05-16 14:55:43] [INFO ] Deduced a trap composed of 79 places in 245 ms of which 0 ms to minimize.
[2021-05-16 14:55:44] [INFO ] Deduced a trap composed of 86 places in 208 ms of which 0 ms to minimize.
[2021-05-16 14:55:44] [INFO ] Deduced a trap composed of 62 places in 224 ms of which 0 ms to minimize.
[2021-05-16 14:55:44] [INFO ] Deduced a trap composed of 86 places in 204 ms of which 0 ms to minimize.
[2021-05-16 14:55:45] [INFO ] Deduced a trap composed of 55 places in 202 ms of which 0 ms to minimize.
[2021-05-16 14:55:45] [INFO ] Deduced a trap composed of 84 places in 223 ms of which 0 ms to minimize.
[2021-05-16 14:55:45] [INFO ] Deduced a trap composed of 64 places in 220 ms of which 0 ms to minimize.
[2021-05-16 14:55:45] [INFO ] Deduced a trap composed of 65 places in 218 ms of which 0 ms to minimize.
[2021-05-16 14:55:46] [INFO ] Deduced a trap composed of 51 places in 219 ms of which 0 ms to minimize.
[2021-05-16 14:55:46] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 9365 ms
[2021-05-16 14:55:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 145 ms.
[2021-05-16 14:55:46] [INFO ] Added : 0 causal constraints over 0 iterations in 270 ms. Result :sat
Minimization took 2805 ms.
Current structural bounds on expressions (after SMT) : [198] Max seen :[4]
Incomplete Parikh walk after 384100 steps, including 46837 resets, run finished after 2121 ms. (steps per millisecond=181 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 98 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 63 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:55:51] [INFO ] Computed 39 place invariants in 27 ms
[2021-05-16 14:55:52] [INFO ] Implicit Places using invariants in 299 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:55:52] [INFO ] Computed 39 place invariants in 17 ms
[2021-05-16 14:55:52] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:55:57] [INFO ] Implicit Places using invariants and state equation in 5174 ms returned []
Implicit Place search using SMT with State Equation took 5486 ms to find 0 implicit places.
[2021-05-16 14:55:57] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:55:57] [INFO ] Computed 39 place invariants in 21 ms
[2021-05-16 14:55:58] [INFO ] Dead Transitions using invariants and state equation in 670 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-02 in 35298 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-03
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:55:58] [INFO ] Computed 39 place invariants in 17 ms
Incomplete random walk after 10000 steps, including 1197 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 98 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:55:58] [INFO ] Computed 39 place invariants in 27 ms
[2021-05-16 14:55:58] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:55:58] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-16 14:55:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:55:58] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2021-05-16 14:55:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:55:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:55:58] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-16 14:55:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:55:58] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2021-05-16 14:55:58] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:55:59] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1133 ms returned sat
[2021-05-16 14:56:00] [INFO ] Deduced a trap composed of 75 places in 180 ms of which 0 ms to minimize.
[2021-05-16 14:56:00] [INFO ] Deduced a trap composed of 76 places in 194 ms of which 0 ms to minimize.
[2021-05-16 14:56:00] [INFO ] Deduced a trap composed of 77 places in 222 ms of which 0 ms to minimize.
[2021-05-16 14:56:00] [INFO ] Deduced a trap composed of 84 places in 195 ms of which 0 ms to minimize.
[2021-05-16 14:56:01] [INFO ] Deduced a trap composed of 75 places in 192 ms of which 0 ms to minimize.
[2021-05-16 14:56:01] [INFO ] Deduced a trap composed of 76 places in 185 ms of which 0 ms to minimize.
[2021-05-16 14:56:01] [INFO ] Deduced a trap composed of 72 places in 211 ms of which 0 ms to minimize.
[2021-05-16 14:56:01] [INFO ] Deduced a trap composed of 69 places in 175 ms of which 0 ms to minimize.
[2021-05-16 14:56:02] [INFO ] Deduced a trap composed of 72 places in 222 ms of which 0 ms to minimize.
[2021-05-16 14:56:03] [INFO ] Deduced a trap composed of 79 places in 214 ms of which 0 ms to minimize.
[2021-05-16 14:56:03] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3165 ms
[2021-05-16 14:56:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 137 ms.
[2021-05-16 14:56:03] [INFO ] Added : 0 causal constraints over 0 iterations in 241 ms. Result :sat
Minimization took 161 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 134 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 14:56:03] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 14:56:04] [INFO ] Dead Transitions using invariants and state equation in 714 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 14:56:04] [INFO ] Computed 39 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 119232 resets, run finished after 4926 ms. (steps per millisecond=203 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 10349 resets, run finished after 767 ms. (steps per millisecond=1303 ) properties (out of 1) seen :2
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 14:56:10] [INFO ] Computed 39 place invariants in 20 ms
[2021-05-16 14:56:10] [INFO ] [Real]Absence check using 9 positive place invariants in 91 ms returned sat
[2021-05-16 14:56:10] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-16 14:56:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:56:10] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2021-05-16 14:56:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:56:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:56:10] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 14:56:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:56:10] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2021-05-16 14:56:10] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:56:11] [INFO ] [Nat]Added 1010 Read/Feed constraints in 435 ms returned sat
[2021-05-16 14:56:11] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 128 ms.
[2021-05-16 14:56:11] [INFO ] Added : 0 causal constraints over 0 iterations in 251 ms. Result :sat
Minimization took 1407 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[2]
Incomplete Parikh walk after 185500 steps, including 23458 resets, run finished after 931 ms. (steps per millisecond=199 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 63 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 62 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 14:56:14] [INFO ] Computed 39 place invariants in 23 ms
[2021-05-16 14:56:14] [INFO ] Implicit Places using invariants in 300 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 316 ms to find 10 implicit places.
[2021-05-16 14:56:14] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 14:56:14] [INFO ] Computed 29 place invariants in 15 ms
[2021-05-16 14:56:15] [INFO ] Dead Transitions using invariants and state equation in 685 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 141 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 14:56:15] [INFO ] Computed 29 place invariants in 20 ms
[2021-05-16 14:56:15] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 14:56:15] [INFO ] Computed 29 place invariants in 14 ms
[2021-05-16 14:56:15] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:56:20] [INFO ] Implicit Places using invariants and state equation in 4514 ms returned []
Implicit Place search using SMT with State Equation took 4825 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 140/160 places, 1865/1875 transitions.
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 14:56:20] [INFO ] Computed 29 place invariants in 36 ms
Incomplete random walk after 1000000 steps, including 179065 resets, run finished after 6698 ms. (steps per millisecond=149 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 14084 resets, run finished after 714 ms. (steps per millisecond=1400 ) properties (out of 1) seen :2
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 14:56:27] [INFO ] Computed 29 place invariants in 15 ms
[2021-05-16 14:56:27] [INFO ] [Real]Absence check using 9 positive place invariants in 80 ms returned sat
[2021-05-16 14:56:27] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 32 ms returned sat
[2021-05-16 14:56:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:56:28] [INFO ] [Real]Absence check using state equation in 652 ms returned sat
[2021-05-16 14:56:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:56:28] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:56:28] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 8 ms returned sat
[2021-05-16 14:56:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:56:28] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2021-05-16 14:56:28] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:56:29] [INFO ] [Nat]Added 1010 Read/Feed constraints in 873 ms returned sat
[2021-05-16 14:56:30] [INFO ] Deduced a trap composed of 81 places in 368 ms of which 1 ms to minimize.
[2021-05-16 14:56:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 484 ms
[2021-05-16 14:56:30] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 219 ms.
[2021-05-16 14:56:30] [INFO ] Added : 0 causal constraints over 0 iterations in 398 ms. Result :sat
Minimization took 1731 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[2]
Incomplete Parikh walk after 436900 steps, including 75412 resets, run finished after 3213 ms. (steps per millisecond=135 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 10 out of 140 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 65 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 133 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 14:56:35] [INFO ] Computed 29 place invariants in 16 ms
[2021-05-16 14:56:38] [INFO ] Implicit Places using invariants in 2703 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 14:56:38] [INFO ] Computed 29 place invariants in 15 ms
[2021-05-16 14:56:39] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:56:43] [INFO ] Implicit Places using invariants and state equation in 5168 ms returned []
Implicit Place search using SMT with State Equation took 7897 ms to find 0 implicit places.
[2021-05-16 14:56:43] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 14:56:43] [INFO ] Computed 29 place invariants in 23 ms
[2021-05-16 14:56:45] [INFO ] Dead Transitions using invariants and state equation in 1453 ms returned []
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-03 in 47263 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-04
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:56:45] [INFO ] Computed 39 place invariants in 17 ms
Incomplete random walk after 10000 steps, including 1180 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:56:45] [INFO ] Computed 39 place invariants in 19 ms
[2021-05-16 14:56:45] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2021-05-16 14:56:45] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2021-05-16 14:56:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:56:45] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2021-05-16 14:56:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:56:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:56:45] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2021-05-16 14:56:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:56:46] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2021-05-16 14:56:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:56:47] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1359 ms returned sat
[2021-05-16 14:56:48] [INFO ] Deduced a trap composed of 75 places in 221 ms of which 1 ms to minimize.
[2021-05-16 14:56:48] [INFO ] Deduced a trap composed of 76 places in 241 ms of which 0 ms to minimize.
[2021-05-16 14:56:48] [INFO ] Deduced a trap composed of 77 places in 216 ms of which 1 ms to minimize.
[2021-05-16 14:56:49] [INFO ] Deduced a trap composed of 84 places in 241 ms of which 1 ms to minimize.
[2021-05-16 14:56:49] [INFO ] Deduced a trap composed of 75 places in 402 ms of which 1 ms to minimize.
[2021-05-16 14:56:49] [INFO ] Deduced a trap composed of 76 places in 363 ms of which 0 ms to minimize.
[2021-05-16 14:56:50] [INFO ] Deduced a trap composed of 72 places in 251 ms of which 0 ms to minimize.
[2021-05-16 14:56:50] [INFO ] Deduced a trap composed of 69 places in 411 ms of which 0 ms to minimize.
[2021-05-16 14:56:51] [INFO ] Deduced a trap composed of 72 places in 396 ms of which 1 ms to minimize.
[2021-05-16 14:56:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [189] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 186 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 14:56:51] [INFO ] Computed 39 place invariants in 24 ms
[2021-05-16 14:56:52] [INFO ] Dead Transitions using invariants and state equation in 627 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 14:56:52] [INFO ] Computed 39 place invariants in 33 ms
Incomplete random walk after 1000000 steps, including 119346 resets, run finished after 5605 ms. (steps per millisecond=178 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 10359 resets, run finished after 819 ms. (steps per millisecond=1221 ) properties (out of 1) seen :2
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 14:56:58] [INFO ] Computed 39 place invariants in 37 ms
[2021-05-16 14:56:58] [INFO ] [Real]Absence check using 9 positive place invariants in 81 ms returned sat
[2021-05-16 14:56:58] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 24 ms returned sat
[2021-05-16 14:56:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:56:58] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2021-05-16 14:56:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:56:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:56:59] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 10 ms returned sat
[2021-05-16 14:56:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:56:59] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2021-05-16 14:56:59] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:57:00] [INFO ] [Nat]Added 1010 Read/Feed constraints in 607 ms returned sat
[2021-05-16 14:57:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 288 ms.
[2021-05-16 14:57:00] [INFO ] Added : 0 causal constraints over 0 iterations in 497 ms. Result :sat
Minimization took 1731 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[2]
Incomplete Parikh walk after 185500 steps, including 23443 resets, run finished after 1140 ms. (steps per millisecond=162 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 78 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 79 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 14:57:03] [INFO ] Computed 39 place invariants in 21 ms
[2021-05-16 14:57:04] [INFO ] Implicit Places using invariants in 356 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 363 ms to find 10 implicit places.
[2021-05-16 14:57:04] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 14:57:04] [INFO ] Computed 29 place invariants in 17 ms
[2021-05-16 14:57:04] [INFO ] Dead Transitions using invariants and state equation in 590 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 200 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 14:57:05] [INFO ] Computed 29 place invariants in 31 ms
[2021-05-16 14:57:05] [INFO ] Implicit Places using invariants in 468 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 14:57:05] [INFO ] Computed 29 place invariants in 25 ms
[2021-05-16 14:57:05] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:57:10] [INFO ] Implicit Places using invariants and state equation in 4852 ms returned []
Implicit Place search using SMT with State Equation took 5339 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 140/160 places, 1865/1875 transitions.
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 14:57:10] [INFO ] Computed 29 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 178931 resets, run finished after 6546 ms. (steps per millisecond=152 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 14084 resets, run finished after 637 ms. (steps per millisecond=1569 ) properties (out of 1) seen :2
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 14:57:17] [INFO ] Computed 29 place invariants in 21 ms
[2021-05-16 14:57:17] [INFO ] [Real]Absence check using 9 positive place invariants in 22 ms returned sat
[2021-05-16 14:57:17] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 17 ms returned sat
[2021-05-16 14:57:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:57:18] [INFO ] [Real]Absence check using state equation in 1213 ms returned sat
[2021-05-16 14:57:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:57:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:57:19] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 7 ms returned sat
[2021-05-16 14:57:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:57:19] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2021-05-16 14:57:19] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:57:20] [INFO ] [Nat]Added 1010 Read/Feed constraints in 798 ms returned sat
[2021-05-16 14:57:20] [INFO ] Deduced a trap composed of 81 places in 232 ms of which 1 ms to minimize.
[2021-05-16 14:57:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 355 ms
[2021-05-16 14:57:21] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 278 ms.
[2021-05-16 14:57:21] [INFO ] Added : 0 causal constraints over 0 iterations in 484 ms. Result :sat
Minimization took 1791 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[2]
Incomplete Parikh walk after 436900 steps, including 75469 resets, run finished after 3393 ms. (steps per millisecond=128 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 10 out of 140 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 78 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 78 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 14:57:26] [INFO ] Computed 29 place invariants in 14 ms
[2021-05-16 14:57:27] [INFO ] Implicit Places using invariants in 578 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 14:57:27] [INFO ] Computed 29 place invariants in 39 ms
[2021-05-16 14:57:27] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:57:31] [INFO ] Implicit Places using invariants and state equation in 4475 ms returned []
Implicit Place search using SMT with State Equation took 5055 ms to find 0 implicit places.
[2021-05-16 14:57:31] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 14:57:31] [INFO ] Computed 29 place invariants in 14 ms
[2021-05-16 14:57:32] [INFO ] Dead Transitions using invariants and state equation in 506 ms returned []
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-04 in 46852 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-05
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:57:32] [INFO ] Computed 39 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 1180 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:57:32] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 14:57:32] [INFO ] [Real]Absence check using 9 positive place invariants in 78 ms returned sat
[2021-05-16 14:57:32] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 114 ms returned sat
[2021-05-16 14:57:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:57:33] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2021-05-16 14:57:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:57:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:57:33] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 10 ms returned sat
[2021-05-16 14:57:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:57:33] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2021-05-16 14:57:33] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:57:34] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1165 ms returned sat
[2021-05-16 14:57:35] [INFO ] Deduced a trap composed of 82 places in 307 ms of which 1 ms to minimize.
[2021-05-16 14:57:35] [INFO ] Deduced a trap composed of 52 places in 478 ms of which 0 ms to minimize.
[2021-05-16 14:57:36] [INFO ] Deduced a trap composed of 54 places in 240 ms of which 0 ms to minimize.
[2021-05-16 14:57:36] [INFO ] Deduced a trap composed of 92 places in 239 ms of which 0 ms to minimize.
[2021-05-16 14:57:37] [INFO ] Deduced a trap composed of 62 places in 456 ms of which 1 ms to minimize.
[2021-05-16 14:57:37] [INFO ] Deduced a trap composed of 64 places in 405 ms of which 1 ms to minimize.
[2021-05-16 14:57:38] [INFO ] Deduced a trap composed of 74 places in 369 ms of which 0 ms to minimize.
[2021-05-16 14:57:42] [INFO ] Deduced a trap composed of 4 places in 4833 ms of which 28 ms to minimize.
[2021-05-16 14:57:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 286 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 14:57:43] [INFO ] Computed 39 place invariants in 24 ms
[2021-05-16 14:57:47] [INFO ] Dead Transitions using invariants and state equation in 4594 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 14:57:47] [INFO ] Computed 39 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 119398 resets, run finished after 5609 ms. (steps per millisecond=178 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9737 resets, run finished after 894 ms. (steps per millisecond=1118 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 14:57:54] [INFO ] Computed 39 place invariants in 19 ms
[2021-05-16 14:57:54] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:57:54] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 14:57:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:57:54] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2021-05-16 14:57:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:57:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2021-05-16 14:57:54] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 10 ms returned sat
[2021-05-16 14:57:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:57:55] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2021-05-16 14:57:55] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:57:55] [INFO ] [Nat]Added 1010 Read/Feed constraints in 468 ms returned sat
[2021-05-16 14:57:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 223 ms.
[2021-05-16 14:57:56] [INFO ] Added : 0 causal constraints over 0 iterations in 436 ms. Result :sat
Minimization took 1126 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Incomplete Parikh walk after 88000 steps, including 11030 resets, run finished after 520 ms. (steps per millisecond=169 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 70 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 70 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 14:57:58] [INFO ] Computed 39 place invariants in 24 ms
[2021-05-16 14:57:58] [INFO ] Implicit Places using invariants in 323 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 338 ms to find 10 implicit places.
[2021-05-16 14:57:58] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 14:57:58] [INFO ] Computed 29 place invariants in 16 ms
[2021-05-16 14:57:59] [INFO ] Dead Transitions using invariants and state equation in 1090 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 78 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2021-05-16 14:57:59] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 14:57:59] [INFO ] Computed 29 place invariants in 19 ms
[2021-05-16 14:58:00] [INFO ] Dead Transitions using invariants and state equation in 517 ms returned []
Finished structural reductions, in 2 iterations. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 14:58:00] [INFO ] Computed 29 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 119199 resets, run finished after 5392 ms. (steps per millisecond=185 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9739 resets, run finished after 858 ms. (steps per millisecond=1165 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 14:58:06] [INFO ] Computed 29 place invariants in 15 ms
[2021-05-16 14:58:06] [INFO ] [Real]Absence check using 9 positive place invariants in 55 ms returned sat
[2021-05-16 14:58:06] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 86 ms returned sat
[2021-05-16 14:58:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:58:07] [INFO ] [Real]Absence check using state equation in 1041 ms returned sat
[2021-05-16 14:58:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:58:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:58:07] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 4 ms returned sat
[2021-05-16 14:58:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:58:08] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2021-05-16 14:58:08] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:58:08] [INFO ] [Nat]Added 1010 Read/Feed constraints in 436 ms returned sat
[2021-05-16 14:58:08] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 183 ms.
[2021-05-16 14:58:08] [INFO ] Added : 0 causal constraints over 0 iterations in 342 ms. Result :sat
Minimization took 1790 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Incomplete Parikh walk after 303700 steps, including 38352 resets, run finished after 1816 ms. (steps per millisecond=167 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 64 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 63 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 14:58:12] [INFO ] Computed 29 place invariants in 21 ms
[2021-05-16 14:58:13] [INFO ] Implicit Places using invariants in 367 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 14:58:13] [INFO ] Computed 29 place invariants in 28 ms
[2021-05-16 14:58:13] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:58:17] [INFO ] Implicit Places using invariants and state equation in 4360 ms returned []
Implicit Place search using SMT with State Equation took 4753 ms to find 0 implicit places.
[2021-05-16 14:58:17] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 14:58:17] [INFO ] Computed 29 place invariants in 21 ms
[2021-05-16 14:58:18] [INFO ] Dead Transitions using invariants and state equation in 752 ms returned []
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-05 in 46135 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-06
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:58:18] [INFO ] Computed 39 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 1190 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:58:18] [INFO ] Computed 39 place invariants in 23 ms
[2021-05-16 14:58:18] [INFO ] [Real]Absence check using 9 positive place invariants in 108 ms returned sat
[2021-05-16 14:58:18] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 51 ms returned sat
[2021-05-16 14:58:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:58:19] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2021-05-16 14:58:19] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:58:19] [INFO ] [Real]Added 1010 Read/Feed constraints in 161 ms returned sat
[2021-05-16 14:58:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:58:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:58:19] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 14:58:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:58:19] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2021-05-16 14:58:20] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1241 ms returned sat
[2021-05-16 14:58:22] [INFO ] Deduced a trap composed of 82 places in 1075 ms of which 0 ms to minimize.
[2021-05-16 14:58:22] [INFO ] Deduced a trap composed of 92 places in 315 ms of which 1 ms to minimize.
[2021-05-16 14:58:23] [INFO ] Deduced a trap composed of 88 places in 248 ms of which 0 ms to minimize.
[2021-05-16 14:58:23] [INFO ] Deduced a trap composed of 56 places in 230 ms of which 1 ms to minimize.
[2021-05-16 14:58:23] [INFO ] Deduced a trap composed of 91 places in 324 ms of which 0 ms to minimize.
[2021-05-16 14:58:24] [INFO ] Deduced a trap composed of 92 places in 446 ms of which 0 ms to minimize.
[2021-05-16 14:58:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 134 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 14:58:24] [INFO ] Computed 39 place invariants in 18 ms
[2021-05-16 14:58:25] [INFO ] Dead Transitions using invariants and state equation in 534 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 14:58:25] [INFO ] Computed 39 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 119377 resets, run finished after 6420 ms. (steps per millisecond=155 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9405 resets, run finished after 1710 ms. (steps per millisecond=584 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 14:58:33] [INFO ] Computed 39 place invariants in 19 ms
[2021-05-16 14:58:33] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:58:33] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2021-05-16 14:58:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:58:33] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2021-05-16 14:58:33] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:58:34] [INFO ] [Real]Added 1010 Read/Feed constraints in 413 ms returned sat
[2021-05-16 14:58:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:58:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 14:58:34] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 14:58:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:58:35] [INFO ] [Nat]Absence check using state equation in 1357 ms returned sat
[2021-05-16 14:58:36] [INFO ] [Nat]Added 1010 Read/Feed constraints in 418 ms returned sat
[2021-05-16 14:58:36] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 275 ms.
[2021-05-16 14:58:36] [INFO ] Added : 0 causal constraints over 0 iterations in 499 ms. Result :sat
Minimization took 1037 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 124500 steps, including 15856 resets, run finished after 840 ms. (steps per millisecond=148 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 100 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 94 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 63 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 14:58:38] [INFO ] Computed 39 place invariants in 18 ms
[2021-05-16 14:58:39] [INFO ] Implicit Places using invariants in 390 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 406 ms to find 10 implicit places.
[2021-05-16 14:58:39] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 14:58:39] [INFO ] Computed 29 place invariants in 23 ms
[2021-05-16 14:58:43] [INFO ] Dead Transitions using invariants and state equation in 4399 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 146 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 14:58:43] [INFO ] Computed 29 place invariants in 21 ms
[2021-05-16 14:58:44] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 14:58:44] [INFO ] Computed 29 place invariants in 15 ms
[2021-05-16 14:58:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:58:45] [INFO ] Implicit Places using invariants and state equation in 1454 ms returned []
Implicit Place search using SMT with State Equation took 1660 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 140/160 places, 1865/1875 transitions.
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 14:58:45] [INFO ] Computed 29 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 178958 resets, run finished after 7503 ms. (steps per millisecond=133 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 11363 resets, run finished after 1539 ms. (steps per millisecond=649 ) properties (out of 1) seen :4
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 14:58:54] [INFO ] Computed 29 place invariants in 20 ms
[2021-05-16 14:58:54] [INFO ] [Real]Absence check using 9 positive place invariants in 78 ms returned sat
[2021-05-16 14:58:54] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 131 ms returned sat
[2021-05-16 14:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:58:55] [INFO ] [Real]Absence check using state equation in 806 ms returned sat
[2021-05-16 14:58:55] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:58:55] [INFO ] [Real]Added 1010 Read/Feed constraints in 189 ms returned sat
[2021-05-16 14:58:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:58:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:58:56] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 5 ms returned sat
[2021-05-16 14:58:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:58:56] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2021-05-16 14:58:57] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1276 ms returned sat
[2021-05-16 14:59:00] [INFO ] Deduced a trap composed of 79 places in 2035 ms of which 22 ms to minimize.
[2021-05-16 14:59:00] [INFO ] Deduced a trap composed of 87 places in 621 ms of which 0 ms to minimize.
[2021-05-16 14:59:01] [INFO ] Deduced a trap composed of 60 places in 401 ms of which 1 ms to minimize.
[2021-05-16 14:59:01] [INFO ] Deduced a trap composed of 47 places in 384 ms of which 0 ms to minimize.
[2021-05-16 14:59:02] [INFO ] Deduced a trap composed of 62 places in 417 ms of which 1 ms to minimize.
[2021-05-16 14:59:02] [INFO ] Deduced a trap composed of 59 places in 209 ms of which 0 ms to minimize.
[2021-05-16 14:59:02] [INFO ] Deduced a trap composed of 84 places in 224 ms of which 1 ms to minimize.
[2021-05-16 14:59:03] [INFO ] Deduced a trap composed of 84 places in 212 ms of which 1 ms to minimize.
[2021-05-16 14:59:05] [INFO ] Deduced a trap composed of 45 places in 2054 ms of which 0 ms to minimize.
[2021-05-16 14:59:05] [INFO ] Deduced a trap composed of 76 places in 224 ms of which 0 ms to minimize.
[2021-05-16 14:59:06] [INFO ] Deduced a trap composed of 52 places in 230 ms of which 0 ms to minimize.
[2021-05-16 14:59:06] [INFO ] Deduced a trap composed of 52 places in 342 ms of which 0 ms to minimize.
[2021-05-16 14:59:07] [INFO ] Deduced a trap composed of 48 places in 362 ms of which 0 ms to minimize.
[2021-05-16 14:59:07] [INFO ] Deduced a trap composed of 53 places in 394 ms of which 1 ms to minimize.
[2021-05-16 14:59:07] [INFO ] Deduced a trap composed of 54 places in 425 ms of which 0 ms to minimize.
[2021-05-16 14:59:08] [INFO ] Deduced a trap composed of 42 places in 398 ms of which 0 ms to minimize.
[2021-05-16 14:59:09] [INFO ] Deduced a trap composed of 62 places in 1419 ms of which 0 ms to minimize.
[2021-05-16 14:59:10] [INFO ] Deduced a trap composed of 51 places in 407 ms of which 0 ms to minimize.
[2021-05-16 14:59:10] [INFO ] Deduced a trap composed of 59 places in 242 ms of which 1 ms to minimize.
[2021-05-16 14:59:11] [INFO ] Deduced a trap composed of 69 places in 460 ms of which 0 ms to minimize.
[2021-05-16 14:59:11] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 0 ms to minimize.
[2021-05-16 14:59:12] [INFO ] Deduced a trap composed of 38 places in 423 ms of which 0 ms to minimize.
[2021-05-16 14:59:12] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 1 ms to minimize.
[2021-05-16 14:59:14] [INFO ] Deduced a trap composed of 84 places in 1947 ms of which 1 ms to minimize.
[2021-05-16 14:59:14] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 16898 ms
[2021-05-16 14:59:14] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 159 ms.
[2021-05-16 14:59:15] [INFO ] Added : 0 causal constraints over 0 iterations in 298 ms. Result :sat
Minimization took 1072 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 327500 steps, including 56604 resets, run finished after 2656 ms. (steps per millisecond=123 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 100 out of 140 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 76 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 76 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 14:59:19] [INFO ] Computed 29 place invariants in 28 ms
[2021-05-16 14:59:19] [INFO ] Implicit Places using invariants in 866 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 14:59:19] [INFO ] Computed 29 place invariants in 15 ms
[2021-05-16 14:59:20] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:59:21] [INFO ] Implicit Places using invariants and state equation in 1520 ms returned []
Implicit Place search using SMT with State Equation took 2406 ms to find 0 implicit places.
[2021-05-16 14:59:21] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2021-05-16 14:59:21] [INFO ] Computed 29 place invariants in 16 ms
[2021-05-16 14:59:22] [INFO ] Dead Transitions using invariants and state equation in 544 ms returned []
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-06 in 63727 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-07
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:59:22] [INFO ] Computed 39 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 1209 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:59:22] [INFO ] Computed 39 place invariants in 29 ms
[2021-05-16 14:59:22] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:59:22] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 14:59:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:59:22] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2021-05-16 14:59:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:59:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:59:22] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2021-05-16 14:59:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:59:23] [INFO ] [Nat]Absence check using state equation in 951 ms returned sat
[2021-05-16 14:59:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:59:24] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1317 ms returned sat
[2021-05-16 14:59:25] [INFO ] Deduced a trap composed of 82 places in 265 ms of which 0 ms to minimize.
[2021-05-16 14:59:27] [INFO ] Deduced a trap composed of 85 places in 2183 ms of which 26 ms to minimize.
[2021-05-16 14:59:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [198] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 93 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:59:27] [INFO ] Computed 39 place invariants in 19 ms
[2021-05-16 14:59:28] [INFO ] Dead Transitions using invariants and state equation in 520 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:59:28] [INFO ] Computed 39 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 119448 resets, run finished after 5415 ms. (steps per millisecond=184 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7088 resets, run finished after 725 ms. (steps per millisecond=1379 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 14:59:34] [INFO ] Computed 39 place invariants in 27 ms
[2021-05-16 14:59:34] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2021-05-16 14:59:34] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 14:59:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:59:34] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2021-05-16 14:59:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:59:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 14:59:34] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 14:59:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:59:35] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2021-05-16 14:59:35] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 14:59:36] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1294 ms returned sat
[2021-05-16 14:59:36] [INFO ] Deduced a trap composed of 82 places in 233 ms of which 0 ms to minimize.
[2021-05-16 14:59:37] [INFO ] Deduced a trap composed of 85 places in 299 ms of which 0 ms to minimize.
[2021-05-16 14:59:38] [INFO ] Deduced a trap composed of 85 places in 388 ms of which 1 ms to minimize.
[2021-05-16 14:59:39] [INFO ] Deduced a trap composed of 86 places in 725 ms of which 1 ms to minimize.
[2021-05-16 14:59:39] [INFO ] Deduced a trap composed of 60 places in 296 ms of which 0 ms to minimize.
[2021-05-16 14:59:43] [INFO ] Deduced a trap composed of 94 places in 3985 ms of which 26 ms to minimize.
[2021-05-16 14:59:44] [INFO ] Deduced a trap composed of 86 places in 359 ms of which 0 ms to minimize.
[2021-05-16 14:59:44] [INFO ] Deduced a trap composed of 67 places in 367 ms of which 0 ms to minimize.
[2021-05-16 14:59:45] [INFO ] Deduced a trap composed of 84 places in 359 ms of which 0 ms to minimize.
[2021-05-16 14:59:45] [INFO ] Deduced a trap composed of 85 places in 358 ms of which 0 ms to minimize.
[2021-05-16 14:59:46] [INFO ] Deduced a trap composed of 99 places in 385 ms of which 0 ms to minimize.
[2021-05-16 14:59:46] [INFO ] Deduced a trap composed of 93 places in 359 ms of which 0 ms to minimize.
[2021-05-16 14:59:47] [INFO ] Deduced a trap composed of 84 places in 422 ms of which 1 ms to minimize.
[2021-05-16 14:59:51] [INFO ] Deduced a trap composed of 87 places in 4033 ms of which 26 ms to minimize.
[2021-05-16 14:59:52] [INFO ] Deduced a trap composed of 85 places in 384 ms of which 0 ms to minimize.
[2021-05-16 14:59:52] [INFO ] Deduced a trap composed of 79 places in 399 ms of which 0 ms to minimize.
[2021-05-16 14:59:53] [INFO ] Deduced a trap composed of 86 places in 385 ms of which 0 ms to minimize.
[2021-05-16 14:59:53] [INFO ] Deduced a trap composed of 62 places in 406 ms of which 0 ms to minimize.
[2021-05-16 14:59:54] [INFO ] Deduced a trap composed of 86 places in 376 ms of which 0 ms to minimize.
[2021-05-16 14:59:54] [INFO ] Deduced a trap composed of 55 places in 409 ms of which 1 ms to minimize.
[2021-05-16 14:59:55] [INFO ] Deduced a trap composed of 84 places in 382 ms of which 0 ms to minimize.
[2021-05-16 14:59:55] [INFO ] Deduced a trap composed of 64 places in 413 ms of which 0 ms to minimize.
[2021-05-16 14:59:56] [INFO ] Deduced a trap composed of 65 places in 382 ms of which 0 ms to minimize.
[2021-05-16 14:59:56] [INFO ] Deduced a trap composed of 51 places in 398 ms of which 0 ms to minimize.
[2021-05-16 14:59:57] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 20491 ms
[2021-05-16 14:59:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 181 ms.
[2021-05-16 14:59:57] [INFO ] Added : 0 causal constraints over 0 iterations in 350 ms. Result :sat
Minimization took 2745 ms.
Current structural bounds on expressions (after SMT) : [198] Max seen :[4]
Incomplete Parikh walk after 384100 steps, including 46957 resets, run finished after 2200 ms. (steps per millisecond=174 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 70 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 76 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:00:02] [INFO ] Computed 39 place invariants in 24 ms
[2021-05-16 15:00:02] [INFO ] Implicit Places using invariants in 306 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:00:02] [INFO ] Computed 39 place invariants in 21 ms
[2021-05-16 15:00:03] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:00:08] [INFO ] Implicit Places using invariants and state equation in 5687 ms returned []
Implicit Place search using SMT with State Equation took 6007 ms to find 0 implicit places.
[2021-05-16 15:00:08] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:00:08] [INFO ] Computed 39 place invariants in 19 ms
[2021-05-16 15:00:09] [INFO ] Dead Transitions using invariants and state equation in 546 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-07 in 47155 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-08
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:00:09] [INFO ] Computed 39 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 1185 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:00:09] [INFO ] Computed 39 place invariants in 26 ms
[2021-05-16 15:00:09] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 15:00:09] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-16 15:00:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:00:09] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2021-05-16 15:00:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:00:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 15:00:09] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 15:00:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:00:10] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2021-05-16 15:00:10] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:00:11] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1122 ms returned sat
[2021-05-16 15:00:15] [INFO ] Deduced a trap composed of 82 places in 3959 ms of which 26 ms to minimize.
[2021-05-16 15:00:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 198 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:00:15] [INFO ] Computed 39 place invariants in 22 ms
[2021-05-16 15:00:16] [INFO ] Dead Transitions using invariants and state equation in 792 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:00:16] [INFO ] Computed 39 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 119291 resets, run finished after 5234 ms. (steps per millisecond=191 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9740 resets, run finished after 819 ms. (steps per millisecond=1221 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:00:22] [INFO ] Computed 39 place invariants in 27 ms
[2021-05-16 15:00:22] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2021-05-16 15:00:22] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 15:00:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:00:22] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2021-05-16 15:00:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:00:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2021-05-16 15:00:22] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 11 ms returned sat
[2021-05-16 15:00:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:00:23] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2021-05-16 15:00:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:00:23] [INFO ] [Nat]Added 1010 Read/Feed constraints in 381 ms returned sat
[2021-05-16 15:00:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 163 ms.
[2021-05-16 15:00:23] [INFO ] Added : 0 causal constraints over 0 iterations in 311 ms. Result :sat
Minimization took 1225 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Incomplete Parikh walk after 88000 steps, including 11086 resets, run finished after 485 ms. (steps per millisecond=181 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 87 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 83 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:00:25] [INFO ] Computed 39 place invariants in 19 ms
[2021-05-16 15:00:26] [INFO ] Implicit Places using invariants in 345 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 359 ms to find 10 implicit places.
[2021-05-16 15:00:26] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:00:26] [INFO ] Computed 29 place invariants in 18 ms
[2021-05-16 15:00:26] [INFO ] Dead Transitions using invariants and state equation in 819 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 81 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2021-05-16 15:00:27] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:00:27] [INFO ] Computed 29 place invariants in 16 ms
[2021-05-16 15:00:27] [INFO ] Dead Transitions using invariants and state equation in 533 ms returned []
Finished structural reductions, in 2 iterations. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:00:27] [INFO ] Computed 29 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 119200 resets, run finished after 5380 ms. (steps per millisecond=185 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 9743 resets, run finished after 853 ms. (steps per millisecond=1172 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:00:33] [INFO ] Computed 29 place invariants in 16 ms
[2021-05-16 15:00:33] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 15:00:34] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 4 ms returned sat
[2021-05-16 15:00:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:00:34] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2021-05-16 15:00:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:00:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 15:00:34] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 6 ms returned sat
[2021-05-16 15:00:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:00:34] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2021-05-16 15:00:34] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:00:35] [INFO ] [Nat]Added 1010 Read/Feed constraints in 524 ms returned sat
[2021-05-16 15:00:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 273 ms.
[2021-05-16 15:00:35] [INFO ] Added : 0 causal constraints over 0 iterations in 436 ms. Result :sat
Minimization took 1761 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Incomplete Parikh walk after 303700 steps, including 38362 resets, run finished after 1634 ms. (steps per millisecond=185 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 62 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 73 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:00:39] [INFO ] Computed 29 place invariants in 22 ms
[2021-05-16 15:00:39] [INFO ] Implicit Places using invariants in 339 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:00:39] [INFO ] Computed 29 place invariants in 14 ms
[2021-05-16 15:00:40] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:00:45] [INFO ] Implicit Places using invariants and state equation in 5214 ms returned []
Implicit Place search using SMT with State Equation took 5576 ms to find 0 implicit places.
[2021-05-16 15:00:45] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:00:45] [INFO ] Computed 29 place invariants in 15 ms
[2021-05-16 15:00:46] [INFO ] Dead Transitions using invariants and state equation in 1303 ms returned []
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-08 in 37156 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-10
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:00:46] [INFO ] Computed 39 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 1201 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:00:46] [INFO ] Computed 39 place invariants in 18 ms
[2021-05-16 15:00:46] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 15:00:46] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 15:00:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:00:46] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2021-05-16 15:00:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:00:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 15:00:46] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-16 15:00:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:00:47] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2021-05-16 15:00:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:00:48] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1303 ms returned sat
[2021-05-16 15:00:48] [INFO ] Deduced a trap composed of 72 places in 403 ms of which 0 ms to minimize.
[2021-05-16 15:00:49] [INFO ] Deduced a trap composed of 80 places in 238 ms of which 0 ms to minimize.
[2021-05-16 15:00:49] [INFO ] Deduced a trap composed of 70 places in 391 ms of which 0 ms to minimize.
[2021-05-16 15:00:50] [INFO ] Deduced a trap composed of 84 places in 240 ms of which 1 ms to minimize.
[2021-05-16 15:00:50] [INFO ] Deduced a trap composed of 77 places in 335 ms of which 1 ms to minimize.
[2021-05-16 15:00:50] [INFO ] Deduced a trap composed of 73 places in 236 ms of which 0 ms to minimize.
[2021-05-16 15:00:51] [INFO ] Deduced a trap composed of 73 places in 273 ms of which 1 ms to minimize.
[2021-05-16 15:00:51] [INFO ] Deduced a trap composed of 69 places in 405 ms of which 1 ms to minimize.
[2021-05-16 15:00:52] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 0 ms to minimize.
[2021-05-16 15:00:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [198] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 80 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:00:52] [INFO ] Computed 39 place invariants in 24 ms
[2021-05-16 15:00:52] [INFO ] Dead Transitions using invariants and state equation in 560 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:00:52] [INFO ] Computed 39 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 119192 resets, run finished after 5096 ms. (steps per millisecond=196 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 10014 resets, run finished after 778 ms. (steps per millisecond=1285 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:00:58] [INFO ] Computed 39 place invariants in 28 ms
[2021-05-16 15:00:58] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 15:00:58] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2021-05-16 15:00:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:00:59] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2021-05-16 15:00:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:00:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 15:00:59] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2021-05-16 15:00:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:00:59] [INFO ] [Nat]Absence check using state equation in 537 ms returned sat
[2021-05-16 15:00:59] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:01:01] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1502 ms returned sat
[2021-05-16 15:01:01] [INFO ] Deduced a trap composed of 72 places in 223 ms of which 0 ms to minimize.
[2021-05-16 15:01:01] [INFO ] Deduced a trap composed of 80 places in 231 ms of which 0 ms to minimize.
[2021-05-16 15:01:02] [INFO ] Deduced a trap composed of 70 places in 445 ms of which 1 ms to minimize.
[2021-05-16 15:01:02] [INFO ] Deduced a trap composed of 84 places in 431 ms of which 1 ms to minimize.
[2021-05-16 15:01:03] [INFO ] Deduced a trap composed of 77 places in 439 ms of which 0 ms to minimize.
[2021-05-16 15:01:03] [INFO ] Deduced a trap composed of 73 places in 246 ms of which 1 ms to minimize.
[2021-05-16 15:01:04] [INFO ] Deduced a trap composed of 73 places in 336 ms of which 1 ms to minimize.
[2021-05-16 15:01:04] [INFO ] Deduced a trap composed of 69 places in 357 ms of which 0 ms to minimize.
[2021-05-16 15:01:06] [INFO ] Deduced a trap composed of 71 places in 1857 ms of which 0 ms to minimize.
[2021-05-16 15:01:07] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 5746 ms
[2021-05-16 15:01:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 159 ms.
[2021-05-16 15:01:07] [INFO ] Added : 0 causal constraints over 0 iterations in 271 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [198] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 95 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 100 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:01:10] [INFO ] Computed 39 place invariants in 21 ms
[2021-05-16 15:01:10] [INFO ] Implicit Places using invariants in 402 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:01:10] [INFO ] Computed 39 place invariants in 18 ms
[2021-05-16 15:01:13] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:01:24] [INFO ] Implicit Places using invariants and state equation in 13709 ms returned []
Implicit Place search using SMT with State Equation took 14119 ms to find 0 implicit places.
[2021-05-16 15:01:24] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:01:24] [INFO ] Computed 39 place invariants in 19 ms
[2021-05-16 15:01:25] [INFO ] Dead Transitions using invariants and state equation in 620 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-10 in 38886 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-12
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:01:25] [INFO ] Computed 39 place invariants in 20 ms
Incomplete random walk after 10000 steps, including 1182 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:01:25] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 15:01:25] [INFO ] [Real]Absence check using 9 positive place invariants in 68 ms returned sat
[2021-05-16 15:01:25] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 209 ms returned sat
[2021-05-16 15:01:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:01:26] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2021-05-16 15:01:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:01:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 15:01:26] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2021-05-16 15:01:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:01:26] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2021-05-16 15:01:26] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:01:28] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1278 ms returned sat
[2021-05-16 15:01:28] [INFO ] Deduced a trap composed of 82 places in 284 ms of which 1 ms to minimize.
[2021-05-16 15:01:29] [INFO ] Deduced a trap composed of 85 places in 246 ms of which 0 ms to minimize.
[2021-05-16 15:01:29] [INFO ] Deduced a trap composed of 85 places in 245 ms of which 0 ms to minimize.
[2021-05-16 15:01:30] [INFO ] Deduced a trap composed of 86 places in 240 ms of which 1 ms to minimize.
[2021-05-16 15:01:30] [INFO ] Deduced a trap composed of 60 places in 227 ms of which 1 ms to minimize.
[2021-05-16 15:01:31] [INFO ] Deduced a trap composed of 94 places in 230 ms of which 0 ms to minimize.
[2021-05-16 15:01:31] [INFO ] Deduced a trap composed of 86 places in 240 ms of which 0 ms to minimize.
[2021-05-16 15:01:31] [INFO ] Deduced a trap composed of 4 places in 391 ms of which 0 ms to minimize.
[2021-05-16 15:01:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [198] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 74 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:01:31] [INFO ] Computed 39 place invariants in 20 ms
[2021-05-16 15:01:32] [INFO ] Dead Transitions using invariants and state equation in 574 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:01:32] [INFO ] Computed 39 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 119430 resets, run finished after 5119 ms. (steps per millisecond=195 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7089 resets, run finished after 666 ms. (steps per millisecond=1501 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:01:38] [INFO ] Computed 39 place invariants in 33 ms
[2021-05-16 15:01:38] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 15:01:38] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 15:01:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:01:38] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2021-05-16 15:01:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:01:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 15:01:38] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 11 ms returned sat
[2021-05-16 15:01:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:01:39] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2021-05-16 15:01:39] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:01:40] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1402 ms returned sat
[2021-05-16 15:01:42] [INFO ] Deduced a trap composed of 82 places in 1415 ms of which 0 ms to minimize.
[2021-05-16 15:01:42] [INFO ] Deduced a trap composed of 85 places in 260 ms of which 0 ms to minimize.
[2021-05-16 15:01:43] [INFO ] Deduced a trap composed of 85 places in 394 ms of which 0 ms to minimize.
[2021-05-16 15:01:44] [INFO ] Deduced a trap composed of 86 places in 298 ms of which 0 ms to minimize.
[2021-05-16 15:01:44] [INFO ] Deduced a trap composed of 60 places in 414 ms of which 1 ms to minimize.
[2021-05-16 15:01:45] [INFO ] Deduced a trap composed of 94 places in 274 ms of which 0 ms to minimize.
[2021-05-16 15:01:49] [INFO ] Deduced a trap composed of 86 places in 3937 ms of which 26 ms to minimize.
[2021-05-16 15:01:49] [INFO ] Deduced a trap composed of 67 places in 227 ms of which 0 ms to minimize.
[2021-05-16 15:01:49] [INFO ] Deduced a trap composed of 84 places in 265 ms of which 0 ms to minimize.
[2021-05-16 15:01:50] [INFO ] Deduced a trap composed of 85 places in 227 ms of which 1 ms to minimize.
[2021-05-16 15:01:50] [INFO ] Deduced a trap composed of 99 places in 274 ms of which 0 ms to minimize.
[2021-05-16 15:01:51] [INFO ] Deduced a trap composed of 93 places in 471 ms of which 0 ms to minimize.
[2021-05-16 15:01:52] [INFO ] Deduced a trap composed of 84 places in 265 ms of which 1 ms to minimize.
[2021-05-16 15:01:53] [INFO ] Deduced a trap composed of 87 places in 926 ms of which 0 ms to minimize.
[2021-05-16 15:01:54] [INFO ] Deduced a trap composed of 85 places in 1457 ms of which 1 ms to minimize.
[2021-05-16 15:01:55] [INFO ] Deduced a trap composed of 79 places in 450 ms of which 0 ms to minimize.
[2021-05-16 15:01:55] [INFO ] Deduced a trap composed of 86 places in 266 ms of which 0 ms to minimize.
[2021-05-16 15:01:56] [INFO ] Deduced a trap composed of 62 places in 279 ms of which 0 ms to minimize.
[2021-05-16 15:01:56] [INFO ] Deduced a trap composed of 86 places in 249 ms of which 0 ms to minimize.
[2021-05-16 15:01:57] [INFO ] Deduced a trap composed of 55 places in 377 ms of which 0 ms to minimize.
[2021-05-16 15:01:57] [INFO ] Deduced a trap composed of 84 places in 375 ms of which 0 ms to minimize.
[2021-05-16 15:01:57] [INFO ] Deduced a trap composed of 64 places in 386 ms of which 0 ms to minimize.
[2021-05-16 15:01:58] [INFO ] Deduced a trap composed of 65 places in 412 ms of which 1 ms to minimize.
[2021-05-16 15:01:59] [INFO ] Deduced a trap composed of 51 places in 428 ms of which 0 ms to minimize.
[2021-05-16 15:01:59] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 18400 ms
[2021-05-16 15:01:59] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 233 ms.
[2021-05-16 15:01:59] [INFO ] Added : 0 causal constraints over 0 iterations in 436 ms. Result :sat
Minimization took 2898 ms.
Current structural bounds on expressions (after SMT) : [198] Max seen :[4]
Incomplete Parikh walk after 384100 steps, including 46839 resets, run finished after 2219 ms. (steps per millisecond=173 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 75 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 103 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:02:05] [INFO ] Computed 39 place invariants in 17 ms
[2021-05-16 15:02:05] [INFO ] Implicit Places using invariants in 465 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:02:05] [INFO ] Computed 39 place invariants in 17 ms
[2021-05-16 15:02:06] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:02:11] [INFO ] Implicit Places using invariants and state equation in 6183 ms returned []
Implicit Place search using SMT with State Equation took 6670 ms to find 0 implicit places.
[2021-05-16 15:02:11] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:02:11] [INFO ] Computed 39 place invariants in 26 ms
[2021-05-16 15:02:12] [INFO ] Dead Transitions using invariants and state equation in 1110 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-12 in 47686 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-13
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:02:12] [INFO ] Computed 39 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 1199 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:02:13] [INFO ] Computed 39 place invariants in 17 ms
[2021-05-16 15:02:13] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 15:02:13] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-16 15:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:02:13] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2021-05-16 15:02:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:02:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 15:02:13] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2021-05-16 15:02:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:02:13] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2021-05-16 15:02:13] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:02:15] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1356 ms returned sat
[2021-05-16 15:02:16] [INFO ] Deduced a trap composed of 72 places in 1624 ms of which 0 ms to minimize.
[2021-05-16 15:02:17] [INFO ] Deduced a trap composed of 80 places in 352 ms of which 0 ms to minimize.
[2021-05-16 15:02:17] [INFO ] Deduced a trap composed of 70 places in 369 ms of which 1 ms to minimize.
[2021-05-16 15:02:18] [INFO ] Deduced a trap composed of 84 places in 236 ms of which 0 ms to minimize.
[2021-05-16 15:02:18] [INFO ] Deduced a trap composed of 77 places in 334 ms of which 1 ms to minimize.
[2021-05-16 15:02:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [198] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 75 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:02:18] [INFO ] Computed 39 place invariants in 39 ms
[2021-05-16 15:02:21] [INFO ] Dead Transitions using invariants and state equation in 2646 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:02:21] [INFO ] Computed 39 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 119486 resets, run finished after 4966 ms. (steps per millisecond=201 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 10015 resets, run finished after 777 ms. (steps per millisecond=1287 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:02:27] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 15:02:27] [INFO ] [Real]Absence check using 9 positive place invariants in 78 ms returned sat
[2021-05-16 15:02:27] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 155 ms returned sat
[2021-05-16 15:02:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:02:27] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2021-05-16 15:02:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:02:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 15:02:27] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 15:02:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:02:28] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2021-05-16 15:02:28] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:02:29] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1422 ms returned sat
[2021-05-16 15:02:29] [INFO ] Deduced a trap composed of 72 places in 229 ms of which 0 ms to minimize.
[2021-05-16 15:02:30] [INFO ] Deduced a trap composed of 80 places in 201 ms of which 0 ms to minimize.
[2021-05-16 15:02:30] [INFO ] Deduced a trap composed of 70 places in 203 ms of which 1 ms to minimize.
[2021-05-16 15:02:30] [INFO ] Deduced a trap composed of 84 places in 223 ms of which 1 ms to minimize.
[2021-05-16 15:02:30] [INFO ] Deduced a trap composed of 77 places in 221 ms of which 0 ms to minimize.
[2021-05-16 15:02:31] [INFO ] Deduced a trap composed of 73 places in 241 ms of which 0 ms to minimize.
[2021-05-16 15:02:31] [INFO ] Deduced a trap composed of 73 places in 262 ms of which 0 ms to minimize.
[2021-05-16 15:02:31] [INFO ] Deduced a trap composed of 69 places in 418 ms of which 0 ms to minimize.
[2021-05-16 15:02:33] [INFO ] Deduced a trap composed of 71 places in 495 ms of which 0 ms to minimize.
[2021-05-16 15:02:33] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3680 ms
[2021-05-16 15:02:33] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 159 ms.
[2021-05-16 15:02:33] [INFO ] Added : 0 causal constraints over 0 iterations in 271 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [198] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 86 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 62 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:02:36] [INFO ] Computed 39 place invariants in 21 ms
[2021-05-16 15:02:37] [INFO ] Implicit Places using invariants in 644 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:02:37] [INFO ] Computed 39 place invariants in 20 ms
[2021-05-16 15:02:39] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:02:47] [INFO ] Implicit Places using invariants and state equation in 10583 ms returned []
Implicit Place search using SMT with State Equation took 11241 ms to find 0 implicit places.
[2021-05-16 15:02:47] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:02:47] [INFO ] Computed 39 place invariants in 33 ms
[2021-05-16 15:02:49] [INFO ] Dead Transitions using invariants and state equation in 1122 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-13 in 36105 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-14
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:02:49] [INFO ] Computed 39 place invariants in 17 ms
Incomplete random walk after 10000 steps, including 1202 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:02:49] [INFO ] Computed 39 place invariants in 19 ms
[2021-05-16 15:02:49] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2021-05-16 15:02:49] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2021-05-16 15:02:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:02:49] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2021-05-16 15:02:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:02:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 15:02:49] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2021-05-16 15:02:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:02:50] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2021-05-16 15:02:50] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:02:51] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1471 ms returned sat
[2021-05-16 15:02:51] [INFO ] Deduced a trap composed of 82 places in 189 ms of which 0 ms to minimize.
[2021-05-16 15:02:52] [INFO ] Deduced a trap composed of 88 places in 239 ms of which 1 ms to minimize.
[2021-05-16 15:02:52] [INFO ] Deduced a trap composed of 84 places in 339 ms of which 0 ms to minimize.
[2021-05-16 15:02:53] [INFO ] Deduced a trap composed of 85 places in 214 ms of which 0 ms to minimize.
[2021-05-16 15:02:53] [INFO ] Deduced a trap composed of 83 places in 275 ms of which 0 ms to minimize.
[2021-05-16 15:02:53] [INFO ] Deduced a trap composed of 85 places in 279 ms of which 0 ms to minimize.
[2021-05-16 15:02:54] [INFO ] Deduced a trap composed of 91 places in 210 ms of which 0 ms to minimize.
[2021-05-16 15:02:54] [INFO ] Deduced a trap composed of 95 places in 259 ms of which 0 ms to minimize.
[2021-05-16 15:02:55] [INFO ] Deduced a trap composed of 90 places in 325 ms of which 0 ms to minimize.
[2021-05-16 15:02:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 178 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:02:55] [INFO ] Computed 39 place invariants in 20 ms
[2021-05-16 15:03:05] [INFO ] Dead Transitions using invariants and state equation in 10259 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:03:05] [INFO ] Computed 39 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 119333 resets, run finished after 5474 ms. (steps per millisecond=182 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7462 resets, run finished after 691 ms. (steps per millisecond=1447 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:03:11] [INFO ] Computed 39 place invariants in 27 ms
[2021-05-16 15:03:11] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 15:03:11] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 15:03:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:03:12] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2021-05-16 15:03:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:03:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 15:03:12] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-16 15:03:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:03:12] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2021-05-16 15:03:12] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:03:12] [INFO ] [Nat]Added 1010 Read/Feed constraints in 516 ms returned sat
[2021-05-16 15:03:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 176 ms.
[2021-05-16 15:03:13] [INFO ] Added : 0 causal constraints over 0 iterations in 306 ms. Result :sat
Minimization took 1506 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Incomplete Parikh walk after 141800 steps, including 17890 resets, run finished after 731 ms. (steps per millisecond=193 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 63 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 65 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:03:15] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 15:03:16] [INFO ] Implicit Places using invariants in 474 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 478 ms to find 10 implicit places.
[2021-05-16 15:03:16] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:03:16] [INFO ] Computed 29 place invariants in 14 ms
[2021-05-16 15:03:16] [INFO ] Dead Transitions using invariants and state equation in 541 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 70 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2021-05-16 15:03:16] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:03:16] [INFO ] Computed 29 place invariants in 22 ms
[2021-05-16 15:03:17] [INFO ] Dead Transitions using invariants and state equation in 521 ms returned []
Finished structural reductions, in 2 iterations. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:03:17] [INFO ] Computed 29 place invariants in 29 ms
Incomplete random walk after 1000000 steps, including 119346 resets, run finished after 5416 ms. (steps per millisecond=184 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7462 resets, run finished after 742 ms. (steps per millisecond=1347 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:03:23] [INFO ] Computed 29 place invariants in 14 ms
[2021-05-16 15:03:23] [INFO ] [Real]Absence check using 9 positive place invariants in 62 ms returned sat
[2021-05-16 15:03:23] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 131 ms returned sat
[2021-05-16 15:03:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:03:25] [INFO ] [Real]Absence check using state equation in 1489 ms returned sat
[2021-05-16 15:03:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:03:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 15:03:25] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 8 ms returned sat
[2021-05-16 15:03:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:03:25] [INFO ] [Nat]Absence check using state equation in 500 ms returned sat
[2021-05-16 15:03:26] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:03:26] [INFO ] [Nat]Added 1010 Read/Feed constraints in 525 ms returned sat
[2021-05-16 15:03:26] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 225 ms.
[2021-05-16 15:03:26] [INFO ] Added : 0 causal constraints over 0 iterations in 412 ms. Result :sat
Minimization took 1782 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Incomplete Parikh walk after 208100 steps, including 26232 resets, run finished after 1252 ms. (steps per millisecond=166 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 80 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 78 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:03:30] [INFO ] Computed 29 place invariants in 21 ms
[2021-05-16 15:03:30] [INFO ] Implicit Places using invariants in 365 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:03:30] [INFO ] Computed 29 place invariants in 14 ms
[2021-05-16 15:03:30] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:03:33] [INFO ] Implicit Places using invariants and state equation in 3332 ms returned []
Implicit Place search using SMT with State Equation took 3721 ms to find 0 implicit places.
[2021-05-16 15:03:34] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:03:34] [INFO ] Computed 29 place invariants in 19 ms
[2021-05-16 15:03:34] [INFO ] Dead Transitions using invariants and state equation in 521 ms returned []
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-14 in 45497 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-15
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:03:34] [INFO ] Computed 39 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 1193 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:03:34] [INFO ] Computed 39 place invariants in 23 ms
[2021-05-16 15:03:34] [INFO ] [Real]Absence check using 9 positive place invariants in 65 ms returned sat
[2021-05-16 15:03:35] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 193 ms returned sat
[2021-05-16 15:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:03:35] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2021-05-16 15:03:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:03:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2021-05-16 15:03:35] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2021-05-16 15:03:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:03:35] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2021-05-16 15:03:35] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:03:37] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1459 ms returned sat
[2021-05-16 15:03:37] [INFO ] Deduced a trap composed of 82 places in 263 ms of which 1 ms to minimize.
[2021-05-16 15:03:38] [INFO ] Deduced a trap composed of 88 places in 283 ms of which 0 ms to minimize.
[2021-05-16 15:03:38] [INFO ] Deduced a trap composed of 84 places in 249 ms of which 0 ms to minimize.
[2021-05-16 15:03:38] [INFO ] Deduced a trap composed of 85 places in 257 ms of which 0 ms to minimize.
[2021-05-16 15:03:39] [INFO ] Deduced a trap composed of 83 places in 271 ms of which 0 ms to minimize.
[2021-05-16 15:03:39] [INFO ] Deduced a trap composed of 85 places in 207 ms of which 1 ms to minimize.
[2021-05-16 15:03:39] [INFO ] Deduced a trap composed of 91 places in 199 ms of which 1 ms to minimize.
[2021-05-16 15:03:40] [INFO ] Deduced a trap composed of 95 places in 198 ms of which 0 ms to minimize.
[2021-05-16 15:03:40] [INFO ] Deduced a trap composed of 90 places in 208 ms of which 0 ms to minimize.
[2021-05-16 15:03:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 188 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:03:40] [INFO ] Computed 39 place invariants in 24 ms
[2021-05-16 15:03:41] [INFO ] Dead Transitions using invariants and state equation in 533 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:03:41] [INFO ] Computed 39 place invariants in 30 ms
Incomplete random walk after 1000000 steps, including 119247 resets, run finished after 5324 ms. (steps per millisecond=187 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7462 resets, run finished after 781 ms. (steps per millisecond=1280 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:03:47] [INFO ] Computed 39 place invariants in 23 ms
[2021-05-16 15:03:47] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 15:03:47] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 21 ms returned sat
[2021-05-16 15:03:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:03:48] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2021-05-16 15:03:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:03:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2021-05-16 15:03:48] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 10 ms returned sat
[2021-05-16 15:03:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:03:48] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2021-05-16 15:03:48] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:03:49] [INFO ] [Nat]Added 1010 Read/Feed constraints in 457 ms returned sat
[2021-05-16 15:03:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 186 ms.
[2021-05-16 15:03:49] [INFO ] Added : 0 causal constraints over 0 iterations in 328 ms. Result :sat
Minimization took 1207 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Incomplete Parikh walk after 141800 steps, including 17948 resets, run finished after 763 ms. (steps per millisecond=185 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 63 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 62 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2021-05-16 15:03:52] [INFO ] Computed 39 place invariants in 23 ms
[2021-05-16 15:03:52] [INFO ] Implicit Places using invariants in 429 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 447 ms to find 10 implicit places.
[2021-05-16 15:03:52] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:03:52] [INFO ] Computed 29 place invariants in 16 ms
[2021-05-16 15:03:53] [INFO ] Dead Transitions using invariants and state equation in 555 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 65 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2021-05-16 15:03:53] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:03:53] [INFO ] Computed 29 place invariants in 26 ms
[2021-05-16 15:03:54] [INFO ] Dead Transitions using invariants and state equation in 628 ms returned []
Finished structural reductions, in 2 iterations. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:03:54] [INFO ] Computed 29 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 119369 resets, run finished after 4873 ms. (steps per millisecond=205 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7462 resets, run finished after 694 ms. (steps per millisecond=1440 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:03:59] [INFO ] Computed 29 place invariants in 14 ms
[2021-05-16 15:03:59] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-16 15:03:59] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 5 ms returned sat
[2021-05-16 15:03:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:00] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2021-05-16 15:04:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:04:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2021-05-16 15:04:00] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 7 ms returned sat
[2021-05-16 15:04:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:00] [INFO ] [Nat]Absence check using state equation in 519 ms returned sat
[2021-05-16 15:04:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:04:01] [INFO ] [Nat]Added 1010 Read/Feed constraints in 499 ms returned sat
[2021-05-16 15:04:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 186 ms.
[2021-05-16 15:04:01] [INFO ] Added : 0 causal constraints over 0 iterations in 318 ms. Result :sat
Minimization took 1626 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Incomplete Parikh walk after 208100 steps, including 26269 resets, run finished after 1225 ms. (steps per millisecond=169 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 87 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 79 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:04:04] [INFO ] Computed 29 place invariants in 16 ms
[2021-05-16 15:04:04] [INFO ] Implicit Places using invariants in 297 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:04:04] [INFO ] Computed 29 place invariants in 18 ms
[2021-05-16 15:04:05] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:04:09] [INFO ] Implicit Places using invariants and state equation in 4126 ms returned []
Implicit Place search using SMT with State Equation took 4455 ms to find 0 implicit places.
[2021-05-16 15:04:09] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2021-05-16 15:04:09] [INFO ] Computed 29 place invariants in 28 ms
[2021-05-16 15:04:09] [INFO ] Dead Transitions using invariants and state equation in 512 ms returned []
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-15 in 35047 ms.
[2021-05-16 15:04:10] [INFO ] Flatten gal took : 386 ms
[2021-05-16 15:04:10] [INFO ] Applying decomposition
[2021-05-16 15:04:10] [INFO ] Flatten gal took : 256 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1698097902584116067.txt, -o, /tmp/graph1698097902584116067.bin, -w, /tmp/graph1698097902584116067.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1698097902584116067.bin, -l, -1, -v, -w, /tmp/graph1698097902584116067.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 15:04:11] [INFO ] Decomposing Gal with order
[2021-05-16 15:04:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:04:12] [INFO ] Removed a total of 2660 redundant transitions.
[2021-05-16 15:04:12] [INFO ] Flatten gal took : 1193 ms
[2021-05-16 15:04:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 34 ms.
[2021-05-16 15:04:12] [INFO ] Time to serialize gal into /tmp/UpperBounds15520701724139981169.gal : 35 ms
[2021-05-16 15:04:12] [INFO ] Time to serialize properties into /tmp/UpperBounds9184300173045489740.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds15520701724139981169.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds9184300173045489740.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds15520701724139981169.gal -t CGAL -reachable-file /tmp/UpperBounds9184300173045489740.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds9184300173045489740.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,199051,245.418,2405300,2,232017,5,3.06769e+06,6,0,2588,921672,0
Total reachable state count : 199051

Verifying 14 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-10-UpperBounds-00 :0 <= gu4.Forks_0+gu0.Forks_1+gu1.Forks_2+gu5.Forks_3+gu6.Forks_4+gu7.Forks_5+gu8.Forks_6+gu2.Forks_7+gu9.Forks_8+gu3.Forks_9 <= 2
FORMULA PhilosophersDyn-COL-10-UpperBounds-00 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-COL-10-UpperBounds-00,0,245.751,2405300,1,0,7,3.06769e+06,9,1,3050,921672,4
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-COL-10-UpperBounds-01 :0 <= gu4.Think_0+gu0.Think_1+gu1.Think_2+gu5.Think_3+gu6.Think_4+gu7.Think_5+gu8.Think_6+gu2.Think_7+gu9.Think_8+gu3.Think_9 <= 4
FORMULA PhilosophersDyn-COL-10-UpperBounds-01 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-COL-10-UpperBounds-01,0,246.031,2405300,1,0,8,3.06769e+06,10,1,3348,921672,5
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-COL-10-UpperBounds-02 :0 <= gu4.WaitLeft_0+gu0.WaitLeft_1+gu1.WaitLeft_2+gu5.WaitLeft_3+gu6.WaitLeft_4+gu7.WaitLeft_5+gu8.WaitLeft_6+gu2.WaitLeft_7+gu9.WaitLeft_8+gu3.WaitLeft_9 <= 4
FORMULA PhilosophersDyn-COL-10-UpperBounds-02 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-COL-10-UpperBounds-02,0,246.407,2405300,1,0,9,3.06769e+06,11,1,3699,921672,6
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-10-UpperBounds-03 :0 <= gu4.HasRight_0+gu0.HasRight_1+gu1.HasRight_2+gu5.HasRight_3+gu6.HasRight_4+gu7.HasRight_5+gu8.HasRight_6+gu2.HasRight_7+gu9.HasRight_8+gu3.HasRight_9 <= 2
FORMULA PhilosophersDyn-COL-10-UpperBounds-03 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-COL-10-UpperBounds-03,0,246.802,2405300,1,0,10,3.06769e+06,12,1,4045,921672,7
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-10-UpperBounds-04 :0 <= gu4.HasRight_0+gu0.HasRight_1+gu1.HasRight_2+gu5.HasRight_3+gu6.HasRight_4+gu7.HasRight_5+gu8.HasRight_6+gu2.HasRight_7+gu9.HasRight_8+gu3.HasRight_9 <= 2
FORMULA PhilosophersDyn-COL-10-UpperBounds-04 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-COL-10-UpperBounds-04,0,246.803,2405300,1,0,10,3.06769e+06,12,1,4045,921672,7
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-COL-10-UpperBounds-05 :0 <= gu4.Think_0+gu0.Think_1+gu1.Think_2+gu5.Think_3+gu6.Think_4+gu7.Think_5+gu8.Think_6+gu2.Think_7+gu9.Think_8+gu3.Think_9 <= 4
FORMULA PhilosophersDyn-COL-10-UpperBounds-05 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-COL-10-UpperBounds-05,0,246.803,2405300,1,0,10,3.06769e+06,12,1,4045,921672,7
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-COL-10-UpperBounds-06 :0 <= gu4.Neighbourhood_0+gu4.Neighbourhood_1+gu4.Neighbourhood_2+gu4.Neighbourhood_3+gu4.Neighbourhood_4+gu4.Neighbourhood_5+gu4.Neighbourhood_6+gu4.Neighbourhood_7+gu4.Neighbourhood_8+gu4.Neighbourhood_9+gu0.Neighbourhood_10+gu0.Neighbourhood_11+gu0.Neighbourhood_12+gu0.Neighbourhood_13+gu0.Neighbourhood_14+gu0.Neighbourhood_15+gu0.Neighbourhood_16+gu0.Neighbourhood_17+gu0.Neighbourhood_18+gu0.Neighbourhood_19+gu1.Neighbourhood_20+gu1.Neighbourhood_21+gu1.Neighbourhood_22+gu1.Neighbourhood_23+gu1.Neighbourhood_24+gu1.Neighbourhood_25+gu1.Neighbourhood_26+gu1.Neighbourhood_27+gu1.Neighbourhood_28+gu1.Neighbourhood_29+gu5.Neighbourhood_30+gu5.Neighbourhood_31+gu5.Neighbourhood_32+gu5.Neighbourhood_33+gu5.Neighbourhood_34+gu5.Neighbourhood_35+gu5.Neighbourhood_36+gu5.Neighbourhood_37+gu5.Neighbourhood_38+gu5.Neighbourhood_39+gu6.Neighbourhood_40+gu6.Neighbourhood_41+gu6.Neighbourhood_42+gu6.Neighbourhood_43+gu6.Neighbourhood_44+gu6.Neighbourhood_45+gu6.Neighbourhood_46+gu6.Neighbourhood_47+gu6.Neighbourhood_48+gu6.Neighbourhood_49+gu7.Neighbourhood_50+gu7.Neighbourhood_51+gu7.Neighbourhood_52+gu7.Neighbourhood_53+gu7.Neighbourhood_54+gu7.Neighbourhood_55+gu7.Neighbourhood_56+gu7.Neighbourhood_57+gu7.Neighbourhood_58+gu7.Neighbourhood_59+gu8.Neighbourhood_60+gu8.Neighbourhood_61+gu8.Neighbourhood_62+gu8.Neighbourhood_63+gu8.Neighbourhood_64+gu8.Neighbourhood_65+gu8.Neighbourhood_66+gu8.Neighbourhood_67+gu8.Neighbourhood_68+gu8.Neighbourhood_69+gu2.Neighbourhood_70+gu2.Neighbourhood_71+gu2.Neighbourhood_72+gu2.Neighbourhood_73+gu2.Neighbourhood_74+gu2.Neighbourhood_75+gu2.Neighbourhood_76+gu2.Neighbourhood_77+gu2.Neighbourhood_78+gu2.Neighbourhood_79+gu9.Neighbourhood_80+gu9.Neighbourhood_81+gu9.Neighbourhood_82+gu9.Neighbourhood_83+gu9.Neighbourhood_84+gu9.Neighbourhood_85+gu9.Neighbourhood_86+gu9.Neighbourhood_87+gu9.Neighbourhood_88+gu9.Neighbourhood_89+gu3.Neighbourhood_90+gu3.Neighbourhood_91+gu3.Neighbourhood_92+gu3.Neighbourhood_93+gu3.Neighbourhood_94+gu3.Neighbourhood_95+gu3.Neighbourhood_96+gu3.Neighbourhood_97+gu3.Neighbourhood_98+gu3.Neighbourhood_99 <= 4
FORMULA PhilosophersDyn-COL-10-UpperBounds-06 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-COL-10-UpperBounds-06,0,247.255,2405300,1,0,11,3.06769e+06,13,1,4463,921672,8
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-COL-10-UpperBounds-07 :0 <= gu4.WaitLeft_0+gu0.WaitLeft_1+gu1.WaitLeft_2+gu5.WaitLeft_3+gu6.WaitLeft_4+gu7.WaitLeft_5+gu8.WaitLeft_6+gu2.WaitLeft_7+gu9.WaitLeft_8+gu3.WaitLeft_9 <= 4
FORMULA PhilosophersDyn-COL-10-UpperBounds-07 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-COL-10-UpperBounds-07,0,247.265,2405300,1,0,11,3.06769e+06,13,1,4463,921672,8
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-COL-10-UpperBounds-08 :0 <= gu4.Think_0+gu0.Think_1+gu1.Think_2+gu5.Think_3+gu6.Think_4+gu7.Think_5+gu8.Think_6+gu2.Think_7+gu9.Think_8+gu3.Think_9 <= 4
FORMULA PhilosophersDyn-COL-10-UpperBounds-08 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-COL-10-UpperBounds-08,0,247.266,2405300,1,0,11,3.06769e+06,13,1,4463,921672,8
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-10-UpperBounds-10 :0 <= gu4.HasLeft_0+gu0.HasLeft_1+gu1.HasLeft_2+gu5.HasLeft_3+gu6.HasLeft_4+gu7.HasLeft_5+gu8.HasLeft_6+gu2.HasLeft_7+gu9.HasLeft_8+gu3.HasLeft_9 <= 2
FORMULA PhilosophersDyn-COL-10-UpperBounds-10 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-COL-10-UpperBounds-10,0,247.602,2405300,1,0,12,3.06769e+06,14,1,4807,921672,9
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-COL-10-UpperBounds-12 :0 <= gu4.WaitLeft_0+gu0.WaitLeft_1+gu1.WaitLeft_2+gu5.WaitLeft_3+gu6.WaitLeft_4+gu7.WaitLeft_5+gu8.WaitLeft_6+gu2.WaitLeft_7+gu9.WaitLeft_8+gu3.WaitLeft_9 <= 4
FORMULA PhilosophersDyn-COL-10-UpperBounds-12 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-COL-10-UpperBounds-12,0,247.602,2405300,1,0,12,3.06769e+06,14,1,4807,921672,9
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-10-UpperBounds-13 :0 <= gu4.HasLeft_0+gu0.HasLeft_1+gu1.HasLeft_2+gu5.HasLeft_3+gu6.HasLeft_4+gu7.HasLeft_5+gu8.HasLeft_6+gu2.HasLeft_7+gu9.HasLeft_8+gu3.HasLeft_9 <= 2
FORMULA PhilosophersDyn-COL-10-UpperBounds-13 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-COL-10-UpperBounds-13,0,247.603,2405300,1,0,12,3.06769e+06,14,1,4807,921672,9
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-COL-10-UpperBounds-14 :0 <= gu4.WaitRight_0+gu0.WaitRight_1+gu1.WaitRight_2+gu5.WaitRight_3+gu6.WaitRight_4+gu7.WaitRight_5+gu8.WaitRight_6+gu2.WaitRight_7+gu9.WaitRight_8+gu3.WaitRight_9 <= 4
FORMULA PhilosophersDyn-COL-10-UpperBounds-14 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-COL-10-UpperBounds-14,0,248.03,2405300,1,0,13,3.06769e+06,15,1,5155,921672,10
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-COL-10-UpperBounds-15 :0 <= gu4.WaitRight_0+gu0.WaitRight_1+gu1.WaitRight_2+gu5.WaitRight_3+gu6.WaitRight_4+gu7.WaitRight_5+gu8.WaitRight_6+gu2.WaitRight_7+gu9.WaitRight_8+gu3.WaitRight_9 <= 4
FORMULA PhilosophersDyn-COL-10-UpperBounds-15 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-COL-10-UpperBounds-15,0,248.031,2405300,1,0,13,3.06769e+06,15,1,5155,921672,10

BK_STOP 1621177702930

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-COL-10"
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 PhilosophersDyn-COL-10, 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 r159-oct2-162089267700011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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