About the Execution of 2021-gold for PhilosophersDyn-COL-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3783.739 | 1247569.00 | 1316265.00 | 2759.90 | 2 4 4 4 4 2 4 2 4 2 2 2 2 4 2 10 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r179-tall-165277026900142.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is PhilosophersDyn-COL-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277026900142
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 6.8K Apr 30 07:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 07:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 07:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 30 07:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 32K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1652830493894
Running Version 0
[2022-05-17 23:34:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 23:34:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 23:34:55] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-05-17 23:34:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 23:34:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 516 ms
[2022-05-17 23:34:56] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 170 PT places and 2320.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2022-05-17 23:34:56] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions in 4 ms.
[2022-05-17 23:34:56] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_18208479183324583164.dot
// Phase 1: matrix 7 rows 8 cols
[2022-05-17 23:34:56] [INFO ] Computed 3 place invariants in 7 ms
FORMULA PhilosophersDyn-COL-10-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-17 23:34:56] [INFO ] Unfolded HLPN to a Petri net with 170 places and 2310 transitions in 41 ms.
[2022-05-17 23:34:56] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 7 rows 8 cols
[2022-05-17 23:34:56] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 23:34:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:56] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 23:34:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-17 23:34:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2022-05-17 23:34:56] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 23:34:56] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 23:34:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:56] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:56] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 23:34:56] [INFO ] Added : 5 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 23:34:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:56] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:56] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 23:34:56] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2022-05-17 23:34:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:56] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-17 23:34:56] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 23:34:56] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:56] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:56] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 23:34:56] [INFO ] Added : 5 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 23:34:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:56] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:56] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 23:34:56] [INFO ] Added : 5 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 23:34:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:56] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:56] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 23:34:56] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 23:34:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:56] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-17 23:34:56] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 23:34:56] [INFO ] Added : 5 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 23:34:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:56] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:56] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 23:34:56] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Real]Added 3 Read/Feed constraints in 5 ms returned sat
[2022-05-17 23:34:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:56] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:56] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 23:34:56] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 11 ms.
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:56] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 23:34:56] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-17 23:34:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-17 23:34:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:57] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 23:34:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-17 23:34:57] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 23:34:57] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 10 ms.
[2022-05-17 23:34:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:57] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 23:34:57] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-17 23:34:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:57] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 23:34:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-17 23:34:57] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 23:34:57] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 9 ms.
[2022-05-17 23:34:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:57] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 23:34:57] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:57] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 23:34:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:57] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 23:34:57] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 11 ms.
[2022-05-17 23:34:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:57] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 23:34:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:57] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 23:34:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-17 23:34:57] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 23:34:57] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 23:34:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 23:34:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:57] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 23:34:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 23:34:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:57] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 23:34:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-17 23:34:57] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 23:34:57] [INFO ] Added : 5 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [10, 10, 10, 10, 10, -1, 10, 10, 10, 10, 10, 10, 10, 10, 10]
[2022-05-17 23:34:57] [INFO ] Unfolded HLPN to a Petri net with 170 places and 2310 transitions in 21 ms.
[2022-05-17 23:34:57] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_851786516919379143.dot
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Incomplete random walk after 10000 steps, including 1196 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 10000 steps, including 69 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :28
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 15) seen :41
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 15) seen :40
[2022-05-17 23:34:57] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2022-05-17 23:34:57] [INFO ] Computed 39 place invariants in 59 ms
[2022-05-17 23:34:57] [INFO ] [Real]Absence check using 30 positive place invariants in 6 ms returned sat
[2022-05-17 23:34:57] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2022-05-17 23:34:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:58] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2022-05-17 23:34:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:34:58] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2022-05-17 23:34:58] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2022-05-17 23:34:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:34:58] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2022-05-17 23:34:58] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2022-05-17 23:34:59] [INFO ] [Nat]Added 1030 Read/Feed constraints in 935 ms returned sat
[2022-05-17 23:35:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 335 ms.
[2022-05-17 23:35:00] [INFO ] Added : 0 causal constraints over 0 iterations in 478 ms. Result :sat
Minimization took 2020 ms.
[2022-05-17 23:35:02] [INFO ] [Real]Absence check using 30 positive place invariants in 7 ms returned sat
[2022-05-17 23:35:02] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-17 23:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:02] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2022-05-17 23:35:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:35:02] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2022-05-17 23:35:02] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2022-05-17 23:35:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:03] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2022-05-17 23:35:04] [INFO ] [Nat]Added 1030 Read/Feed constraints in 1119 ms returned sat
[2022-05-17 23:35:04] [INFO ] Deduced a trap composed of 40 places in 288 ms of which 3 ms to minimize.
[2022-05-17 23:35:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 839 ms
[2022-05-17 23:35:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 189 ms.
[2022-05-17 23:35:05] [INFO ] Added : 0 causal constraints over 0 iterations in 338 ms. Result :sat
Minimization took 1159 ms.
[2022-05-17 23:35:06] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2022-05-17 23:35:06] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-17 23:35:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:07] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2022-05-17 23:35:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:35:07] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2022-05-17 23:35:07] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-17 23:35:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:07] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2022-05-17 23:35:08] [INFO ] [Nat]Added 1030 Read/Feed constraints in 1026 ms returned sat
[2022-05-17 23:35:08] [INFO ] Deduced a trap composed of 40 places in 248 ms of which 2 ms to minimize.
[2022-05-17 23:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 772 ms
[2022-05-17 23:35:09] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 186 ms.
[2022-05-17 23:35:09] [INFO ] Added : 0 causal constraints over 0 iterations in 299 ms. Result :sat
Minimization took 1115 ms.
[2022-05-17 23:35:10] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2022-05-17 23:35:10] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-17 23:35:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:10] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2022-05-17 23:35:11] [INFO ] [Real]Added 1030 Read/Feed constraints in 238 ms returned sat
[2022-05-17 23:35:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:35:11] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2022-05-17 23:35:11] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2022-05-17 23:35:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:11] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2022-05-17 23:35:12] [INFO ] [Nat]Added 1030 Read/Feed constraints in 909 ms returned sat
[2022-05-17 23:35:12] [INFO ] Deduced a trap composed of 40 places in 249 ms of which 1 ms to minimize.
[2022-05-17 23:35:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 866 ms
[2022-05-17 23:35:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 198 ms.
[2022-05-17 23:35:13] [INFO ] Added : 0 causal constraints over 0 iterations in 320 ms. Result :sat
Minimization took 1298 ms.
[2022-05-17 23:35:15] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2022-05-17 23:35:15] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-17 23:35:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:15] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2022-05-17 23:35:15] [INFO ] [Real]Added 1030 Read/Feed constraints in 265 ms returned sat
[2022-05-17 23:35:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:35:15] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2022-05-17 23:35:15] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-17 23:35:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:16] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2022-05-17 23:35:17] [INFO ] [Nat]Added 1030 Read/Feed constraints in 910 ms returned sat
[2022-05-17 23:35:17] [INFO ] Deduced a trap composed of 40 places in 238 ms of which 2 ms to minimize.
[2022-05-17 23:35:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 862 ms
[2022-05-17 23:35:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 181 ms.
[2022-05-17 23:35:18] [INFO ] Added : 0 causal constraints over 0 iterations in 304 ms. Result :sat
Minimization took 1292 ms.
[2022-05-17 23:35:19] [INFO ] [Real]Absence check using 30 positive place invariants in 6 ms returned sat
[2022-05-17 23:35:19] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 12 ms returned sat
[2022-05-17 23:35:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:19] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2022-05-17 23:35:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:35:19] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2022-05-17 23:35:19] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2022-05-17 23:35:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:20] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2022-05-17 23:35:21] [INFO ] [Nat]Added 1030 Read/Feed constraints in 982 ms returned sat
[2022-05-17 23:35:21] [INFO ] Deduced a trap composed of 77 places in 237 ms of which 1 ms to minimize.
[2022-05-17 23:35:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2022-05-17 23:35:21] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 214 ms.
[2022-05-17 23:35:21] [INFO ] Added : 0 causal constraints over 0 iterations in 347 ms. Result :sat
Minimization took 2088 ms.
[2022-05-17 23:35:24] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2022-05-17 23:35:24] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-17 23:35:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:24] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2022-05-17 23:35:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:35:24] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2022-05-17 23:35:24] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-17 23:35:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:24] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2022-05-17 23:35:25] [INFO ] [Nat]Added 1030 Read/Feed constraints in 1034 ms returned sat
[2022-05-17 23:35:26] [INFO ] Deduced a trap composed of 40 places in 232 ms of which 0 ms to minimize.
[2022-05-17 23:35:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 757 ms
[2022-05-17 23:35:26] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 179 ms.
[2022-05-17 23:35:26] [INFO ] Added : 0 causal constraints over 0 iterations in 304 ms. Result :sat
Minimization took 1129 ms.
[2022-05-17 23:35:28] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2022-05-17 23:35:28] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2022-05-17 23:35:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:28] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2022-05-17 23:35:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:35:28] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2022-05-17 23:35:28] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-17 23:35:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:28] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2022-05-17 23:35:29] [INFO ] [Nat]Added 1030 Read/Feed constraints in 843 ms returned sat
[2022-05-17 23:35:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 176 ms.
[2022-05-17 23:35:29] [INFO ] Added : 0 causal constraints over 0 iterations in 312 ms. Result :sat
Minimization took 1972 ms.
[2022-05-17 23:35:31] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2022-05-17 23:35:31] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2022-05-17 23:35:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:32] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2022-05-17 23:35:32] [INFO ] [Real]Added 1030 Read/Feed constraints in 216 ms returned sat
[2022-05-17 23:35:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:35:32] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2022-05-17 23:35:32] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-17 23:35:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:32] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2022-05-17 23:35:33] [INFO ] [Nat]Added 1030 Read/Feed constraints in 914 ms returned sat
[2022-05-17 23:35:34] [INFO ] Deduced a trap composed of 48 places in 247 ms of which 0 ms to minimize.
[2022-05-17 23:35:34] [INFO ] Deduced a trap composed of 50 places in 241 ms of which 2 ms to minimize.
[2022-05-17 23:35:34] [INFO ] Deduced a trap composed of 66 places in 262 ms of which 0 ms to minimize.
[2022-05-17 23:35:35] [INFO ] Deduced a trap composed of 48 places in 245 ms of which 1 ms to minimize.
[2022-05-17 23:35:35] [INFO ] Deduced a trap composed of 48 places in 237 ms of which 0 ms to minimize.
[2022-05-17 23:35:35] [INFO ] Deduced a trap composed of 58 places in 234 ms of which 0 ms to minimize.
[2022-05-17 23:35:35] [INFO ] Deduced a trap composed of 54 places in 238 ms of which 0 ms to minimize.
[2022-05-17 23:35:36] [INFO ] Deduced a trap composed of 77 places in 253 ms of which 1 ms to minimize.
[2022-05-17 23:35:36] [INFO ] Deduced a trap composed of 62 places in 249 ms of which 1 ms to minimize.
[2022-05-17 23:35:36] [INFO ] Deduced a trap composed of 48 places in 255 ms of which 0 ms to minimize.
[2022-05-17 23:35:37] [INFO ] Deduced a trap composed of 48 places in 236 ms of which 0 ms to minimize.
[2022-05-17 23:35:37] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 1 ms to minimize.
[2022-05-17 23:35:37] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 0 ms to minimize.
[2022-05-17 23:35: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 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 23:35:37] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2022-05-17 23:35:37] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-17 23:35:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:38] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2022-05-17 23:35:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:35:38] [INFO ] [Nat]Absence check using 30 positive place invariants in 6 ms returned sat
[2022-05-17 23:35:38] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-17 23:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:38] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2022-05-17 23:35:39] [INFO ] [Nat]Added 1030 Read/Feed constraints in 965 ms returned sat
[2022-05-17 23:35:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 186 ms.
[2022-05-17 23:35:39] [INFO ] Added : 0 causal constraints over 0 iterations in 318 ms. Result :sat
Minimization took 1948 ms.
[2022-05-17 23:35:41] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2022-05-17 23:35:41] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-17 23:35:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:42] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2022-05-17 23:35:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:35:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2022-05-17 23:35:42] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 6 ms returned sat
[2022-05-17 23:35:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:42] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2022-05-17 23:35:43] [INFO ] [Nat]Added 1030 Read/Feed constraints in 944 ms returned sat
[2022-05-17 23:35:43] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 181 ms.
[2022-05-17 23:35:43] [INFO ] Added : 0 causal constraints over 0 iterations in 306 ms. Result :sat
Minimization took 1979 ms.
[2022-05-17 23:35:45] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2022-05-17 23:35:45] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 6 ms returned sat
[2022-05-17 23:35:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:46] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2022-05-17 23:35:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:35:46] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2022-05-17 23:35:46] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-17 23:35:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:46] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2022-05-17 23:35:47] [INFO ] [Nat]Added 1030 Read/Feed constraints in 954 ms returned sat
[2022-05-17 23:35:47] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 180 ms.
[2022-05-17 23:35:47] [INFO ] Added : 0 causal constraints over 0 iterations in 309 ms. Result :sat
Minimization took 1974 ms.
[2022-05-17 23:35:49] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2022-05-17 23:35:49] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2022-05-17 23:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:50] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2022-05-17 23:35:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:35:50] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2022-05-17 23:35:50] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 8 ms returned sat
[2022-05-17 23:35:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:50] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2022-05-17 23:35:51] [INFO ] [Nat]Added 1030 Read/Feed constraints in 937 ms returned sat
[2022-05-17 23:35:51] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 196 ms.
[2022-05-17 23:35:51] [INFO ] Added : 0 causal constraints over 0 iterations in 319 ms. Result :sat
Minimization took 1982 ms.
[2022-05-17 23:35:53] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2022-05-17 23:35:53] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-17 23:35:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:54] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2022-05-17 23:35:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:35:54] [INFO ] [Nat]Absence check using 30 positive place invariants in 6 ms returned sat
[2022-05-17 23:35:54] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2022-05-17 23:35:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:54] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2022-05-17 23:35:55] [INFO ] [Nat]Added 1030 Read/Feed constraints in 1020 ms returned sat
[2022-05-17 23:35:55] [INFO ] Deduced a trap composed of 40 places in 237 ms of which 1 ms to minimize.
[2022-05-17 23:35:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 767 ms
[2022-05-17 23:35:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 203 ms.
[2022-05-17 23:35:56] [INFO ] Added : 0 causal constraints over 0 iterations in 323 ms. Result :sat
Minimization took 1099 ms.
[2022-05-17 23:35:57] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2022-05-17 23:35:57] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2022-05-17 23:35:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:58] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2022-05-17 23:35:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:35:58] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2022-05-17 23:35:58] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2022-05-17 23:35:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:58] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2022-05-17 23:35:59] [INFO ] [Nat]Added 1030 Read/Feed constraints in 857 ms returned sat
[2022-05-17 23:35:59] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 182 ms.
[2022-05-17 23:35:59] [INFO ] Added : 0 causal constraints over 0 iterations in 307 ms. Result :sat
Minimization took 1958 ms.
Current structural bounds on expressions (after SMT) : [10, 10, 10, 10, 10, 2147483647, 10, 10, 10, 10, 10, 10, 10, 10, 10] Max seen :[2, 4, 4, 4, 4, 2, 4, 2, 4, 2, 2, 2, 2, 4, 2]
Incomplete Parikh walk after 533800 steps, including 65262 resets, run finished after 6640 ms. (steps per millisecond=80 ) properties (out of 15) seen :44 could not realise parikh vector
Incomplete Parikh walk after 808700 steps, including 98881 resets, run finished after 10060 ms. (steps per millisecond=80 ) properties (out of 15) seen :44 could not realise parikh vector
Incomplete Parikh walk after 662600 steps, including 80996 resets, run finished after 8092 ms. (steps per millisecond=81 ) properties (out of 15) seen :44 could not realise parikh vector
Incomplete Parikh walk after 662600 steps, including 80964 resets, run finished after 8099 ms. (steps per millisecond=81 ) properties (out of 15) seen :44 could not realise parikh vector
Incomplete Parikh walk after 662600 steps, including 81013 resets, run finished after 8060 ms. (steps per millisecond=82 ) properties (out of 15) seen :44 could not realise parikh vector
Incomplete Parikh walk after 662600 steps, including 80986 resets, run finished after 8075 ms. (steps per millisecond=82 ) properties (out of 15) seen :44 could not realise parikh vector
Incomplete Parikh walk after 533800 steps, including 65223 resets, run finished after 6603 ms. (steps per millisecond=80 ) properties (out of 15) seen :44 could not realise parikh vector
Incomplete Parikh walk after 808700 steps, including 98868 resets, run finished after 9941 ms. (steps per millisecond=81 ) properties (out of 15) seen :44 could not realise parikh vector
Incomplete Parikh walk after 430600 steps, including 52633 resets, run finished after 5373 ms. (steps per millisecond=80 ) properties (out of 15) seen :44 could not realise parikh vector
Incomplete Parikh walk after 501100 steps, including 61333 resets, run finished after 6319 ms. (steps per millisecond=79 ) properties (out of 15) seen :44 could not realise parikh vector
Incomplete Parikh walk after 501100 steps, including 61326 resets, run finished after 6245 ms. (steps per millisecond=80 ) properties (out of 15) seen :44 could not realise parikh vector
Incomplete Parikh walk after 808700 steps, including 98875 resets, run finished after 9937 ms. (steps per millisecond=81 ) properties (out of 15) seen :44 could not realise parikh vector
Incomplete Parikh walk after 808700 steps, including 98900 resets, run finished after 9895 ms. (steps per millisecond=81 ) properties (out of 15) seen :44 could not realise parikh vector
Incomplete Parikh walk after 533800 steps, including 65254 resets, run finished after 6504 ms. (steps per millisecond=82 ) properties (out of 15) seen :44 could not realise parikh vector
Support contains 150 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 220 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
[2022-05-17 23:37:51] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2022-05-17 23:37:51] [INFO ] Computed 39 place invariants in 28 ms
[2022-05-17 23:37:52] [INFO ] Dead Transitions using invariants and state equation in 727 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 85 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
[2022-05-17 23:37:52] [INFO ] Computed 39 place invariants in 34 ms
Incomplete random walk after 1000000 steps, including 119351 resets, run finished after 10963 ms. (steps per millisecond=91 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 1000001 steps, including 10016 resets, run finished after 1315 ms. (steps per millisecond=760 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 1000000 steps, including 9571 resets, run finished after 1426 ms. (steps per millisecond=701 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 1000001 steps, including 9579 resets, run finished after 1411 ms. (steps per millisecond=708 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 1000001 steps, including 9046 resets, run finished after 2450 ms. (steps per millisecond=408 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 1000001 steps, including 9042 resets, run finished after 2457 ms. (steps per millisecond=407 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 1000001 steps, including 8512 resets, run finished after 1340 ms. (steps per millisecond=746 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 1000001 steps, including 9580 resets, run finished after 1397 ms. (steps per millisecond=715 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 1000001 steps, including 10019 resets, run finished after 1300 ms. (steps per millisecond=769 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 1000001 steps, including 7082 resets, run finished after 1139 ms. (steps per millisecond=877 ) properties (out of 15) seen :28
Incomplete Best-First random walk after 1000001 steps, including 9790 resets, run finished after 1310 ms. (steps per millisecond=763 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 1000001 steps, including 9799 resets, run finished after 1314 ms. (steps per millisecond=761 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 1000001 steps, including 9820 resets, run finished after 1315 ms. (steps per millisecond=760 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 1000001 steps, including 9819 resets, run finished after 1319 ms. (steps per millisecond=758 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 1000001 steps, including 9570 resets, run finished after 1399 ms. (steps per millisecond=714 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 1000001 steps, including 10008 resets, run finished after 1301 ms. (steps per millisecond=768 ) properties (out of 15) seen :44
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:38:25] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-17 23:38:25] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:38:25] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 9 ms returned sat
[2022-05-17 23:38:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:38:26] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2022-05-17 23:38:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:38:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:38:26] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 10 ms returned sat
[2022-05-17 23:38:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:38:26] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2022-05-17 23:38:26] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:38:28] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1486 ms returned sat
[2022-05-17 23:38:28] [INFO ] Deduced a trap composed of 72 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:38:28] [INFO ] Deduced a trap composed of 80 places in 212 ms of which 1 ms to minimize.
[2022-05-17 23:38:28] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 0 ms to minimize.
[2022-05-17 23:38:29] [INFO ] Deduced a trap composed of 84 places in 234 ms of which 0 ms to minimize.
[2022-05-17 23:38:29] [INFO ] Deduced a trap composed of 77 places in 202 ms of which 0 ms to minimize.
[2022-05-17 23:38:29] [INFO ] Deduced a trap composed of 73 places in 202 ms of which 1 ms to minimize.
[2022-05-17 23:38:29] [INFO ] Deduced a trap composed of 73 places in 201 ms of which 1 ms to minimize.
[2022-05-17 23:38:30] [INFO ] Deduced a trap composed of 69 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:38:31] [INFO ] Deduced a trap composed of 71 places in 195 ms of which 1 ms to minimize.
[2022-05-17 23:38:31] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3025 ms
[2022-05-17 23:38:31] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 153 ms.
[2022-05-17 23:38:31] [INFO ] Added : 0 causal constraints over 0 iterations in 271 ms. Result :sat
Minimization took 3001 ms.
[2022-05-17 23:38:34] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:38:34] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2022-05-17 23:38:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:38:34] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2022-05-17 23:38:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:38:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:38:34] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:38:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:38:35] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2022-05-17 23:38:36] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1246 ms returned sat
[2022-05-17 23:38:36] [INFO ] Deduced a trap composed of 82 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:38:36] [INFO ] Deduced a trap composed of 52 places in 247 ms of which 0 ms to minimize.
[2022-05-17 23:38:37] [INFO ] Deduced a trap composed of 54 places in 213 ms of which 1 ms to minimize.
[2022-05-17 23:38:37] [INFO ] Deduced a trap composed of 92 places in 222 ms of which 1 ms to minimize.
[2022-05-17 23:38:37] [INFO ] Deduced a trap composed of 62 places in 218 ms of which 1 ms to minimize.
[2022-05-17 23:38:38] [INFO ] Deduced a trap composed of 64 places in 226 ms of which 5 ms to minimize.
[2022-05-17 23:38:38] [INFO ] Deduced a trap composed of 74 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:38:38] [INFO ] Deduced a trap composed of 77 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:38:39] [INFO ] Deduced a trap composed of 58 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:38:39] [INFO ] Deduced a trap composed of 73 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:38:39] [INFO ] Deduced a trap composed of 59 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:38:39] [INFO ] Deduced a trap composed of 62 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:38:40] [INFO ] Deduced a trap composed of 74 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:38:40] [INFO ] Deduced a trap composed of 71 places in 220 ms of which 1 ms to minimize.
[2022-05-17 23:38:41] [INFO ] Deduced a trap composed of 62 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:38:41] [INFO ] Deduced a trap composed of 48 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:38:41] [INFO ] Deduced a trap composed of 45 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:38:42] [INFO ] Deduced a trap composed of 83 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:38:42] [INFO ] Deduced a trap composed of 80 places in 218 ms of which 1 ms to minimize.
[2022-05-17 23:38:42] [INFO ] Deduced a trap composed of 49 places in 217 ms of which 1 ms to minimize.
[2022-05-17 23:38:43] [INFO ] Deduced a trap composed of 54 places in 227 ms of which 0 ms to minimize.
[2022-05-17 23:38:43] [INFO ] Deduced a trap composed of 55 places in 221 ms of which 2 ms to minimize.
[2022-05-17 23:38:43] [INFO ] Deduced a trap composed of 48 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:38:44] [INFO ] Deduced a trap composed of 48 places in 232 ms of which 1 ms to minimize.
[2022-05-17 23:38:44] [INFO ] Deduced a trap composed of 64 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:38:45] [INFO ] Deduced a trap composed of 60 places in 226 ms of which 1 ms to minimize.
[2022-05-17 23:38:45] [INFO ] Deduced a trap composed of 74 places in 223 ms of which 0 ms to minimize.
[2022-05-17 23:38:45] [INFO ] Deduced a trap composed of 45 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:38:46] [INFO ] Deduced a trap composed of 75 places in 240 ms of which 1 ms to minimize.
[2022-05-17 23:38:46] [INFO ] Deduced a trap composed of 61 places in 226 ms of which 1 ms to minimize.
[2022-05-17 23:38:46] [INFO ] Deduced a trap composed of 69 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:38:46] [INFO ] Deduced a trap composed of 63 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:38:47] [INFO ] Deduced a trap composed of 68 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:38:47] [INFO ] Deduced a trap composed of 69 places in 210 ms of which 1 ms to minimize.
[2022-05-17 23:38:47] [INFO ] Deduced a trap composed of 61 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:38:48] [INFO ] Deduced a trap composed of 73 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:38:48] [INFO ] Deduced a trap composed of 80 places in 225 ms of which 2 ms to minimize.
[2022-05-17 23:38:48] [INFO ] Deduced a trap composed of 48 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:38:49] [INFO ] Deduced a trap composed of 59 places in 214 ms of which 1 ms to minimize.
[2022-05-17 23:38:50] [INFO ] Deduced a trap composed of 64 places in 224 ms of which 0 ms to minimize.
[2022-05-17 23:38:50] [INFO ] Deduced a trap composed of 62 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:38:51] [INFO ] Deduced a trap composed of 60 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:38:51] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 0 ms to minimize.
[2022-05-17 23:38:51] [INFO ] Deduced a trap composed of 48 places in 220 ms of which 1 ms to minimize.
[2022-05-17 23:38:51] [INFO ] Deduced a trap composed of 58 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:38:52] [INFO ] Deduced a trap composed of 59 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:38:52] [INFO ] Deduced a trap composed of 49 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:38:52] [INFO ] Deduced a trap composed of 59 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:38:53] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:38:54] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:38:54] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 18222 ms
[2022-05-17 23:38:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 152 ms.
[2022-05-17 23:38:54] [INFO ] Added : 0 causal constraints over 0 iterations in 280 ms. Result :sat
Minimization took 2918 ms.
[2022-05-17 23:38:57] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-05-17 23:38:57] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 9 ms returned sat
[2022-05-17 23:38:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:38:58] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2022-05-17 23:38:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:38:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:38:58] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2022-05-17 23:38:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:38:58] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2022-05-17 23:38:59] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1236 ms returned sat
[2022-05-17 23:38:59] [INFO ] Deduced a trap composed of 82 places in 225 ms of which 1 ms to minimize.
[2022-05-17 23:39:00] [INFO ] Deduced a trap composed of 52 places in 228 ms of which 1 ms to minimize.
[2022-05-17 23:39:00] [INFO ] Deduced a trap composed of 54 places in 230 ms of which 0 ms to minimize.
[2022-05-17 23:39:00] [INFO ] Deduced a trap composed of 92 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:39:01] [INFO ] Deduced a trap composed of 62 places in 219 ms of which 1 ms to minimize.
[2022-05-17 23:39:01] [INFO ] Deduced a trap composed of 64 places in 219 ms of which 1 ms to minimize.
[2022-05-17 23:39:01] [INFO ] Deduced a trap composed of 74 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:39:02] [INFO ] Deduced a trap composed of 77 places in 217 ms of which 1 ms to minimize.
[2022-05-17 23:39:02] [INFO ] Deduced a trap composed of 58 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:39:02] [INFO ] Deduced a trap composed of 73 places in 225 ms of which 1 ms to minimize.
[2022-05-17 23:39:03] [INFO ] Deduced a trap composed of 59 places in 215 ms of which 1 ms to minimize.
[2022-05-17 23:39:03] [INFO ] Deduced a trap composed of 62 places in 211 ms of which 0 ms to minimize.
[2022-05-17 23:39:03] [INFO ] Deduced a trap composed of 74 places in 205 ms of which 1 ms to minimize.
[2022-05-17 23:39:04] [INFO ] Deduced a trap composed of 71 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:39:04] [INFO ] Deduced a trap composed of 62 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:39:04] [INFO ] Deduced a trap composed of 48 places in 230 ms of which 0 ms to minimize.
[2022-05-17 23:39:05] [INFO ] Deduced a trap composed of 45 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:39:05] [INFO ] Deduced a trap composed of 83 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:39:05] [INFO ] Deduced a trap composed of 80 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:39:06] [INFO ] Deduced a trap composed of 49 places in 231 ms of which 1 ms to minimize.
[2022-05-17 23:39:06] [INFO ] Deduced a trap composed of 54 places in 213 ms of which 1 ms to minimize.
[2022-05-17 23:39:06] [INFO ] Deduced a trap composed of 55 places in 216 ms of which 1 ms to minimize.
[2022-05-17 23:39:06] [INFO ] Deduced a trap composed of 48 places in 211 ms of which 0 ms to minimize.
[2022-05-17 23:39:07] [INFO ] Deduced a trap composed of 48 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:39:08] [INFO ] Deduced a trap composed of 64 places in 223 ms of which 0 ms to minimize.
[2022-05-17 23:39:08] [INFO ] Deduced a trap composed of 60 places in 215 ms of which 1 ms to minimize.
[2022-05-17 23:39:08] [INFO ] Deduced a trap composed of 74 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:39:08] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 0 ms to minimize.
[2022-05-17 23:39:09] [INFO ] Deduced a trap composed of 75 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:39:09] [INFO ] Deduced a trap composed of 61 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:39:09] [INFO ] Deduced a trap composed of 69 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:39:10] [INFO ] Deduced a trap composed of 63 places in 235 ms of which 0 ms to minimize.
[2022-05-17 23:39:10] [INFO ] Deduced a trap composed of 68 places in 247 ms of which 0 ms to minimize.
[2022-05-17 23:39:10] [INFO ] Deduced a trap composed of 69 places in 241 ms of which 0 ms to minimize.
[2022-05-17 23:39:11] [INFO ] Deduced a trap composed of 61 places in 245 ms of which 0 ms to minimize.
[2022-05-17 23:39:11] [INFO ] Deduced a trap composed of 73 places in 211 ms of which 0 ms to minimize.
[2022-05-17 23:39:11] [INFO ] Deduced a trap composed of 80 places in 211 ms of which 0 ms to minimize.
[2022-05-17 23:39:12] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:39:13] [INFO ] Deduced a trap composed of 59 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:39:13] [INFO ] Deduced a trap composed of 64 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:39:13] [INFO ] Deduced a trap composed of 62 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:39:14] [INFO ] Deduced a trap composed of 60 places in 212 ms of which 1 ms to minimize.
[2022-05-17 23:39:14] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 1 ms to minimize.
[2022-05-17 23:39:14] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:39:15] [INFO ] Deduced a trap composed of 58 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:39:15] [INFO ] Deduced a trap composed of 59 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:39:15] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:39:16] [INFO ] Deduced a trap composed of 59 places in 219 ms of which 1 ms to minimize.
[2022-05-17 23:39:17] [INFO ] Deduced a trap composed of 46 places in 245 ms of which 0 ms to minimize.
[2022-05-17 23:39:17] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:39:17] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 18096 ms
[2022-05-17 23:39:17] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 147 ms.
[2022-05-17 23:39:17] [INFO ] Added : 0 causal constraints over 0 iterations in 280 ms. Result :sat
Minimization took 2913 ms.
[2022-05-17 23:39:20] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:39:20] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2022-05-17 23:39:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:39:21] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2022-05-17 23:39:21] [INFO ] [Real]Added 1010 Read/Feed constraints in 168 ms returned sat
[2022-05-17 23:39:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:39:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:39:21] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 14 ms returned sat
[2022-05-17 23:39:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:39:21] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2022-05-17 23:39:23] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1338 ms returned sat
[2022-05-17 23:39:23] [INFO ] Deduced a trap composed of 82 places in 221 ms of which 1 ms to minimize.
[2022-05-17 23:39:23] [INFO ] Deduced a trap composed of 92 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:39:24] [INFO ] Deduced a trap composed of 88 places in 227 ms of which 0 ms to minimize.
[2022-05-17 23:39:24] [INFO ] Deduced a trap composed of 56 places in 231 ms of which 0 ms to minimize.
[2022-05-17 23:39:24] [INFO ] Deduced a trap composed of 91 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:39:25] [INFO ] Deduced a trap composed of 92 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:39:25] [INFO ] Deduced a trap composed of 88 places in 226 ms of which 1 ms to minimize.
[2022-05-17 23:39:25] [INFO ] Deduced a trap composed of 92 places in 220 ms of which 1 ms to minimize.
[2022-05-17 23:39:26] [INFO ] Deduced a trap composed of 89 places in 219 ms of which 1 ms to minimize.
[2022-05-17 23:39:26] [INFO ] Deduced a trap composed of 93 places in 215 ms of which 1 ms to minimize.
[2022-05-17 23:39:26] [INFO ] Deduced a trap composed of 94 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:39:27] [INFO ] Deduced a trap composed of 93 places in 220 ms of which 1 ms to minimize.
[2022-05-17 23:39:27] [INFO ] Deduced a trap composed of 82 places in 210 ms of which 1 ms to minimize.
[2022-05-17 23:39:27] [INFO ] Deduced a trap composed of 90 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:39:28] [INFO ] Deduced a trap composed of 52 places in 223 ms of which 0 ms to minimize.
[2022-05-17 23:39:28] [INFO ] Deduced a trap composed of 88 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:39:28] [INFO ] Deduced a trap composed of 94 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:39:29] [INFO ] Deduced a trap composed of 90 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:39:29] [INFO ] Deduced a trap composed of 89 places in 216 ms of which 1 ms to minimize.
[2022-05-17 23:39:29] [INFO ] Deduced a trap composed of 93 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:39:29] [INFO ] Deduced a trap composed of 97 places in 207 ms of which 0 ms to minimize.
[2022-05-17 23:39:30] [INFO ] Deduced a trap composed of 95 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:39:30] [INFO ] Deduced a trap composed of 89 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:39:31] [INFO ] Deduced a trap composed of 86 places in 242 ms of which 0 ms to minimize.
[2022-05-17 23:39:31] [INFO ] Deduced a trap composed of 79 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:39:32] [INFO ] Deduced a trap composed of 87 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:39:32] [INFO ] Deduced a trap composed of 92 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:39:32] [INFO ] Deduced a trap composed of 87 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:39:33] [INFO ] Deduced a trap composed of 85 places in 228 ms of which 0 ms to minimize.
[2022-05-17 23:39:33] [INFO ] Deduced a trap composed of 82 places in 231 ms of which 0 ms to minimize.
[2022-05-17 23:39:34] [INFO ] Deduced a trap composed of 95 places in 228 ms of which 0 ms to minimize.
[2022-05-17 23:39:34] [INFO ] Deduced a trap composed of 93 places in 224 ms of which 0 ms to minimize.
[2022-05-17 23:39:34] [INFO ] Deduced a trap composed of 89 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:39:35] [INFO ] Deduced a trap composed of 94 places in 224 ms of which 0 ms to minimize.
[2022-05-17 23:39:35] [INFO ] Deduced a trap composed of 85 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:39:36] [INFO ] Deduced a trap composed of 86 places in 224 ms of which 0 ms to minimize.
[2022-05-17 23:39:36] [INFO ] Deduced a trap composed of 93 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:39:37] [INFO ] Deduced a trap composed of 85 places in 217 ms of which 1 ms to minimize.
[2022-05-17 23:39:37] [INFO ] Deduced a trap composed of 89 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:39:37] [INFO ] Deduced a trap composed of 77 places in 230 ms of which 0 ms to minimize.
[2022-05-17 23:39:38] [INFO ] Deduced a trap composed of 88 places in 215 ms of which 1 ms to minimize.
[2022-05-17 23:39:38] [INFO ] Deduced a trap composed of 90 places in 227 ms of which 0 ms to minimize.
[2022-05-17 23:39:38] [INFO ] Deduced a trap composed of 81 places in 215 ms of which 1 ms to minimize.
[2022-05-17 23:39:39] [INFO ] Deduced a trap composed of 82 places in 228 ms of which 1 ms to minimize.
[2022-05-17 23:39:39] [INFO ] Deduced a trap composed of 84 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:39:39] [INFO ] Deduced a trap composed of 87 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:39:40] [INFO ] Deduced a trap composed of 84 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:39:42] [INFO ] Deduced a trap composed of 55 places in 221 ms of which 1 ms to minimize.
[2022-05-17 23:39:42] [INFO ] Deduced a trap composed of 65 places in 220 ms of which 1 ms to minimize.
[2022-05-17 23:39:43] [INFO ] Deduced a trap composed of 80 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:39:43] [INFO ] Deduced a trap composed of 77 places in 217 ms of which 1 ms to minimize.
[2022-05-17 23:39:44] [INFO ] Deduced a trap composed of 58 places in 233 ms of which 0 ms to minimize.
[2022-05-17 23:39:44] [INFO ] Deduced a trap composed of 59 places in 231 ms of which 0 ms to minimize.
[2022-05-17 23:39:45] [INFO ] Deduced a trap composed of 69 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:39:45] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 0 ms to minimize.
[2022-05-17 23:39:46] [INFO ] Deduced a trap composed of 71 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:39:46] [INFO ] Deduced a trap composed of 59 places in 229 ms of which 1 ms to minimize.
[2022-05-17 23:39:47] [INFO ] Deduced a trap composed of 82 places in 229 ms of which 1 ms to minimize.
[2022-05-17 23:39:47] [INFO ] Deduced a trap composed of 74 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:39:48] [INFO ] Deduced a trap composed of 66 places in 223 ms of which 1 ms to minimize.
[2022-05-17 23:39:48] [INFO ] Deduced a trap composed of 76 places in 216 ms of which 1 ms to minimize.
[2022-05-17 23:39:49] [INFO ] Deduced a trap composed of 69 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:39:50] [INFO ] Deduced a trap composed of 78 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:39:50] [INFO ] Deduced a trap composed of 61 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:39:51] [INFO ] Deduced a trap composed of 78 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:39:51] [INFO ] Deduced a trap composed of 56 places in 205 ms of which 0 ms to minimize.
[2022-05-17 23:39:52] [INFO ] Deduced a trap composed of 73 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:39:53] [INFO ] Deduced a trap composed of 82 places in 224 ms of which 0 ms to minimize.
[2022-05-17 23:39:53] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 0 ms to minimize.
[2022-05-17 23:39:53] [INFO ] Deduced a trap composed of 79 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:39:55] [INFO ] Deduced a trap composed of 49 places in 230 ms of which 0 ms to minimize.
[2022-05-17 23:39:56] [INFO ] Deduced a trap composed of 62 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:39:56] [INFO ] Deduced a trap composed of 48 places in 231 ms of which 0 ms to minimize.
[2022-05-17 23:39:56] [INFO ] Deduced a trap composed of 58 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:39:56] [INFO ] Trap strengthening (SAT) tested/added 75/74 trap constraints in 33681 ms
[2022-05-17 23:39:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 167 ms.
[2022-05-17 23:39:57] [INFO ] Added : 0 causal constraints over 0 iterations in 311 ms. Result :sat
Minimization took 3001 ms.
[2022-05-17 23:40:00] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:40:00] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2022-05-17 23:40:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:40:00] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2022-05-17 23:40:00] [INFO ] [Real]Added 1010 Read/Feed constraints in 178 ms returned sat
[2022-05-17 23:40:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:40:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:40:00] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:40:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:40:01] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2022-05-17 23:40:02] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1423 ms returned sat
[2022-05-17 23:40:02] [INFO ] Deduced a trap composed of 82 places in 224 ms of which 0 ms to minimize.
[2022-05-17 23:40:03] [INFO ] Deduced a trap composed of 92 places in 219 ms of which 1 ms to minimize.
[2022-05-17 23:40:03] [INFO ] Deduced a trap composed of 88 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:40:04] [INFO ] Deduced a trap composed of 56 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:40:04] [INFO ] Deduced a trap composed of 91 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:40:04] [INFO ] Deduced a trap composed of 92 places in 229 ms of which 1 ms to minimize.
[2022-05-17 23:40:04] [INFO ] Deduced a trap composed of 88 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:40:05] [INFO ] Deduced a trap composed of 92 places in 239 ms of which 0 ms to minimize.
[2022-05-17 23:40:05] [INFO ] Deduced a trap composed of 89 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:40:06] [INFO ] Deduced a trap composed of 93 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:40:06] [INFO ] Deduced a trap composed of 94 places in 224 ms of which 1 ms to minimize.
[2022-05-17 23:40:06] [INFO ] Deduced a trap composed of 93 places in 224 ms of which 0 ms to minimize.
[2022-05-17 23:40:06] [INFO ] Deduced a trap composed of 82 places in 226 ms of which 1 ms to minimize.
[2022-05-17 23:40:07] [INFO ] Deduced a trap composed of 90 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:40:07] [INFO ] Deduced a trap composed of 52 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:40:07] [INFO ] Deduced a trap composed of 88 places in 220 ms of which 1 ms to minimize.
[2022-05-17 23:40:08] [INFO ] Deduced a trap composed of 94 places in 228 ms of which 0 ms to minimize.
[2022-05-17 23:40:08] [INFO ] Deduced a trap composed of 90 places in 221 ms of which 1 ms to minimize.
[2022-05-17 23:40:08] [INFO ] Deduced a trap composed of 89 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:40:09] [INFO ] Deduced a trap composed of 93 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:40:09] [INFO ] Deduced a trap composed of 97 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:40:09] [INFO ] Deduced a trap composed of 95 places in 230 ms of which 0 ms to minimize.
[2022-05-17 23:40:10] [INFO ] Deduced a trap composed of 89 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:40:11] [INFO ] Deduced a trap composed of 86 places in 223 ms of which 0 ms to minimize.
[2022-05-17 23:40:11] [INFO ] Deduced a trap composed of 79 places in 221 ms of which 1 ms to minimize.
[2022-05-17 23:40:11] [INFO ] Deduced a trap composed of 87 places in 223 ms of which 0 ms to minimize.
[2022-05-17 23:40:12] [INFO ] Deduced a trap composed of 92 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:40:12] [INFO ] Deduced a trap composed of 87 places in 224 ms of which 1 ms to minimize.
[2022-05-17 23:40:13] [INFO ] Deduced a trap composed of 85 places in 222 ms of which 1 ms to minimize.
[2022-05-17 23:40:13] [INFO ] Deduced a trap composed of 82 places in 223 ms of which 1 ms to minimize.
[2022-05-17 23:40:13] [INFO ] Deduced a trap composed of 95 places in 222 ms of which 1 ms to minimize.
[2022-05-17 23:40:14] [INFO ] Deduced a trap composed of 93 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:40:14] [INFO ] Deduced a trap composed of 89 places in 224 ms of which 0 ms to minimize.
[2022-05-17 23:40:15] [INFO ] Deduced a trap composed of 94 places in 227 ms of which 0 ms to minimize.
[2022-05-17 23:40:15] [INFO ] Deduced a trap composed of 85 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:40:15] [INFO ] Deduced a trap composed of 86 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:40:16] [INFO ] Deduced a trap composed of 93 places in 215 ms of which 1 ms to minimize.
[2022-05-17 23:40:16] [INFO ] Deduced a trap composed of 85 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:40:16] [INFO ] Deduced a trap composed of 89 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:40:17] [INFO ] Deduced a trap composed of 77 places in 226 ms of which 0 ms to minimize.
[2022-05-17 23:40:17] [INFO ] Deduced a trap composed of 88 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:40:18] [INFO ] Deduced a trap composed of 90 places in 219 ms of which 1 ms to minimize.
[2022-05-17 23:40:18] [INFO ] Deduced a trap composed of 81 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:40:18] [INFO ] Deduced a trap composed of 82 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:40:19] [INFO ] Deduced a trap composed of 84 places in 218 ms of which 1 ms to minimize.
[2022-05-17 23:40:19] [INFO ] Deduced a trap composed of 87 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:40:20] [INFO ] Deduced a trap composed of 84 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:40:21] [INFO ] Deduced a trap composed of 55 places in 227 ms of which 0 ms to minimize.
[2022-05-17 23:40:22] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 0 ms to minimize.
[2022-05-17 23:40:22] [INFO ] Deduced a trap composed of 80 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:40:23] [INFO ] Deduced a trap composed of 77 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:40:23] [INFO ] Deduced a trap composed of 58 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:40:24] [INFO ] Deduced a trap composed of 59 places in 207 ms of which 0 ms to minimize.
[2022-05-17 23:40:24] [INFO ] Deduced a trap composed of 69 places in 215 ms of which 1 ms to minimize.
[2022-05-17 23:40:25] [INFO ] Deduced a trap composed of 47 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:40:25] [INFO ] Deduced a trap composed of 71 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:40:25] [INFO ] Deduced a trap composed of 59 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:40:26] [INFO ] Deduced a trap composed of 82 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:40:26] [INFO ] Deduced a trap composed of 74 places in 231 ms of which 1 ms to minimize.
[2022-05-17 23:40:27] [INFO ] Deduced a trap composed of 66 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:40:27] [INFO ] Deduced a trap composed of 76 places in 213 ms of which 1 ms to minimize.
[2022-05-17 23:40:28] [INFO ] Deduced a trap composed of 69 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:40:29] [INFO ] Deduced a trap composed of 78 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:40:29] [INFO ] Deduced a trap composed of 61 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:40:30] [INFO ] Deduced a trap composed of 78 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:40:30] [INFO ] Deduced a trap composed of 56 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:40:31] [INFO ] Deduced a trap composed of 73 places in 224 ms of which 0 ms to minimize.
[2022-05-17 23:40:32] [INFO ] Deduced a trap composed of 82 places in 217 ms of which 1 ms to minimize.
[2022-05-17 23:40:32] [INFO ] Deduced a trap composed of 58 places in 212 ms of which 1 ms to minimize.
[2022-05-17 23:40:32] [INFO ] Deduced a trap composed of 79 places in 209 ms of which 0 ms to minimize.
[2022-05-17 23:40:34] [INFO ] Deduced a trap composed of 49 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:40:34] [INFO ] Deduced a trap composed of 62 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:40:35] [INFO ] Deduced a trap composed of 48 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:40:35] [INFO ] Deduced a trap composed of 58 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:40:35] [INFO ] Trap strengthening (SAT) tested/added 75/74 trap constraints in 33119 ms
[2022-05-17 23:40:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 151 ms.
[2022-05-17 23:40:36] [INFO ] Added : 0 causal constraints over 0 iterations in 293 ms. Result :sat
Minimization took 3001 ms.
[2022-05-17 23:40:39] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:40:39] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:40:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:40:39] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2022-05-17 23:40:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:40:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:40:39] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:40:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:40:39] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2022-05-17 23:40:41] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1365 ms returned sat
[2022-05-17 23:40:41] [INFO ] Deduced a trap composed of 76 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:40:41] [INFO ] Deduced a trap composed of 63 places in 207 ms of which 1 ms to minimize.
[2022-05-17 23:40:41] [INFO ] Deduced a trap composed of 76 places in 203 ms of which 0 ms to minimize.
[2022-05-17 23:40:42] [INFO ] Deduced a trap composed of 77 places in 202 ms of which 1 ms to minimize.
[2022-05-17 23:40:42] [INFO ] Deduced a trap composed of 75 places in 207 ms of which 0 ms to minimize.
[2022-05-17 23:40:42] [INFO ] Deduced a trap composed of 74 places in 211 ms of which 1 ms to minimize.
[2022-05-17 23:40:42] [INFO ] Deduced a trap composed of 69 places in 202 ms of which 0 ms to minimize.
[2022-05-17 23:40:43] [INFO ] Deduced a trap composed of 79 places in 207 ms of which 0 ms to minimize.
[2022-05-17 23:40:44] [INFO ] Deduced a trap composed of 81 places in 205 ms of which 0 ms to minimize.
[2022-05-17 23:40:44] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3075 ms
[2022-05-17 23:40:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 166 ms.
[2022-05-17 23:40:44] [INFO ] Added : 0 causal constraints over 0 iterations in 292 ms. Result :sat
Minimization took 3002 ms.
[2022-05-17 23:40:47] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:40:47] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:40:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:40:47] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2022-05-17 23:40:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:40:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:40:47] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:40:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:40:48] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2022-05-17 23:40:49] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1232 ms returned sat
[2022-05-17 23:40:49] [INFO ] Deduced a trap composed of 82 places in 226 ms of which 0 ms to minimize.
[2022-05-17 23:40:49] [INFO ] Deduced a trap composed of 52 places in 211 ms of which 1 ms to minimize.
[2022-05-17 23:40:50] [INFO ] Deduced a trap composed of 54 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:40:50] [INFO ] Deduced a trap composed of 92 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:40:50] [INFO ] Deduced a trap composed of 62 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:40:51] [INFO ] Deduced a trap composed of 64 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:40:51] [INFO ] Deduced a trap composed of 74 places in 207 ms of which 0 ms to minimize.
[2022-05-17 23:40:51] [INFO ] Deduced a trap composed of 77 places in 207 ms of which 0 ms to minimize.
[2022-05-17 23:40:52] [INFO ] Deduced a trap composed of 58 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:40:52] [INFO ] Deduced a trap composed of 73 places in 223 ms of which 1 ms to minimize.
[2022-05-17 23:40:52] [INFO ] Deduced a trap composed of 59 places in 223 ms of which 0 ms to minimize.
[2022-05-17 23:40:52] [INFO ] Deduced a trap composed of 62 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:40:53] [INFO ] Deduced a trap composed of 74 places in 207 ms of which 0 ms to minimize.
[2022-05-17 23:40:53] [INFO ] Deduced a trap composed of 71 places in 210 ms of which 1 ms to minimize.
[2022-05-17 23:40:53] [INFO ] Deduced a trap composed of 62 places in 204 ms of which 0 ms to minimize.
[2022-05-17 23:40:54] [INFO ] Deduced a trap composed of 48 places in 205 ms of which 0 ms to minimize.
[2022-05-17 23:40:54] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 1 ms to minimize.
[2022-05-17 23:40:54] [INFO ] Deduced a trap composed of 83 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:40:55] [INFO ] Deduced a trap composed of 80 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:40:55] [INFO ] Deduced a trap composed of 49 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:40:55] [INFO ] Deduced a trap composed of 54 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:40:56] [INFO ] Deduced a trap composed of 55 places in 209 ms of which 1 ms to minimize.
[2022-05-17 23:40:56] [INFO ] Deduced a trap composed of 48 places in 219 ms of which 1 ms to minimize.
[2022-05-17 23:40:57] [INFO ] Deduced a trap composed of 48 places in 213 ms of which 1 ms to minimize.
[2022-05-17 23:40:57] [INFO ] Deduced a trap composed of 64 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:40:57] [INFO ] Deduced a trap composed of 60 places in 211 ms of which 1 ms to minimize.
[2022-05-17 23:40:58] [INFO ] Deduced a trap composed of 74 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:40:58] [INFO ] Deduced a trap composed of 45 places in 221 ms of which 1 ms to minimize.
[2022-05-17 23:40:58] [INFO ] Deduced a trap composed of 75 places in 215 ms of which 1 ms to minimize.
[2022-05-17 23:40:59] [INFO ] Deduced a trap composed of 61 places in 214 ms of which 1 ms to minimize.
[2022-05-17 23:40:59] [INFO ] Deduced a trap composed of 69 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:40:59] [INFO ] Deduced a trap composed of 63 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:40:59] [INFO ] Deduced a trap composed of 68 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:41:00] [INFO ] Deduced a trap composed of 69 places in 204 ms of which 0 ms to minimize.
[2022-05-17 23:41:00] [INFO ] Deduced a trap composed of 61 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:41:00] [INFO ] Deduced a trap composed of 73 places in 211 ms of which 0 ms to minimize.
[2022-05-17 23:41:01] [INFO ] Deduced a trap composed of 80 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:41:01] [INFO ] Deduced a trap composed of 48 places in 211 ms of which 1 ms to minimize.
[2022-05-17 23:41:02] [INFO ] Deduced a trap composed of 59 places in 227 ms of which 0 ms to minimize.
[2022-05-17 23:41:02] [INFO ] Deduced a trap composed of 64 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:41:03] [INFO ] Deduced a trap composed of 62 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:41:03] [INFO ] Deduced a trap composed of 60 places in 212 ms of which 1 ms to minimize.
[2022-05-17 23:41:03] [INFO ] Deduced a trap composed of 65 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:41:04] [INFO ] Deduced a trap composed of 48 places in 220 ms of which 1 ms to minimize.
[2022-05-17 23:41:04] [INFO ] Deduced a trap composed of 58 places in 221 ms of which 1 ms to minimize.
[2022-05-17 23:41:04] [INFO ] Deduced a trap composed of 59 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:41:05] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:41:05] [INFO ] Deduced a trap composed of 59 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:41:06] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:41:06] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:41:06] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 17620 ms
[2022-05-17 23:41:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 140 ms.
[2022-05-17 23:41:07] [INFO ] Added : 0 causal constraints over 0 iterations in 264 ms. Result :sat
Minimization took 2853 ms.
[2022-05-17 23:41:10] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:41:10] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2022-05-17 23:41:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:41:10] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2022-05-17 23:41:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:41:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:41:10] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:41:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:41:10] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2022-05-17 23:41:12] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1462 ms returned sat
[2022-05-17 23:41:12] [INFO ] Deduced a trap composed of 72 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:41:12] [INFO ] Deduced a trap composed of 80 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:41:13] [INFO ] Deduced a trap composed of 70 places in 211 ms of which 1 ms to minimize.
[2022-05-17 23:41:13] [INFO ] Deduced a trap composed of 84 places in 209 ms of which 0 ms to minimize.
[2022-05-17 23:41:13] [INFO ] Deduced a trap composed of 77 places in 207 ms of which 0 ms to minimize.
[2022-05-17 23:41:13] [INFO ] Deduced a trap composed of 73 places in 200 ms of which 0 ms to minimize.
[2022-05-17 23:41:14] [INFO ] Deduced a trap composed of 73 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:41:14] [INFO ] Deduced a trap composed of 69 places in 198 ms of which 1 ms to minimize.
[2022-05-17 23:41:15] [INFO ] Deduced a trap composed of 71 places in 204 ms of which 0 ms to minimize.
[2022-05-17 23:41:15] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3030 ms
[2022-05-17 23:41:15] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 149 ms.
[2022-05-17 23:41:15] [INFO ] Added : 0 causal constraints over 0 iterations in 268 ms. Result :sat
Minimization took 3001 ms.
[2022-05-17 23:41:18] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:41:18] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:41:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:41:18] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2022-05-17 23:41:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:41:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:41:18] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:41:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:41:19] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2022-05-17 23:41:20] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1589 ms returned sat
[2022-05-17 23:41:20] [INFO ] Deduced a trap composed of 82 places in 223 ms of which 1 ms to minimize.
[2022-05-17 23:41:21] [INFO ] Deduced a trap composed of 88 places in 212 ms of which 1 ms to minimize.
[2022-05-17 23:41:21] [INFO ] Deduced a trap composed of 84 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:41:22] [INFO ] Deduced a trap composed of 85 places in 223 ms of which 0 ms to minimize.
[2022-05-17 23:41:22] [INFO ] Deduced a trap composed of 83 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:41:22] [INFO ] Deduced a trap composed of 85 places in 224 ms of which 0 ms to minimize.
[2022-05-17 23:41:23] [INFO ] Deduced a trap composed of 91 places in 238 ms of which 0 ms to minimize.
[2022-05-17 23:41:23] [INFO ] Deduced a trap composed of 95 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:41:23] [INFO ] Deduced a trap composed of 90 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:41:24] [INFO ] Deduced a trap composed of 89 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:41:24] [INFO ] Deduced a trap composed of 84 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:41:25] [INFO ] Deduced a trap composed of 75 places in 244 ms of which 0 ms to minimize.
[2022-05-17 23:41:25] [INFO ] Deduced a trap composed of 70 places in 243 ms of which 0 ms to minimize.
[2022-05-17 23:41:26] [INFO ] Deduced a trap composed of 85 places in 247 ms of which 0 ms to minimize.
[2022-05-17 23:41:26] [INFO ] Deduced a trap composed of 89 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:41:27] [INFO ] Deduced a trap composed of 76 places in 215 ms of which 1 ms to minimize.
[2022-05-17 23:41:28] [INFO ] Deduced a trap composed of 58 places in 220 ms of which 1 ms to minimize.
[2022-05-17 23:41:28] [INFO ] Deduced a trap composed of 85 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:41:29] [INFO ] Deduced a trap composed of 90 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:41:29] [INFO ] Deduced a trap composed of 90 places in 211 ms of which 1 ms to minimize.
[2022-05-17 23:41:30] [INFO ] Deduced a trap composed of 57 places in 226 ms of which 0 ms to minimize.
[2022-05-17 23:41:30] [INFO ] Deduced a trap composed of 90 places in 221 ms of which 1 ms to minimize.
[2022-05-17 23:41:30] [INFO ] Deduced a trap composed of 96 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:41:31] [INFO ] Deduced a trap composed of 93 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:41:32] [INFO ] Deduced a trap composed of 46 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:41:32] [INFO ] Deduced a trap composed of 60 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:41:33] [INFO ] Deduced a trap composed of 48 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:41:34] [INFO ] Deduced a trap composed of 45 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:41:34] [INFO ] Deduced a trap composed of 61 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:41:35] [INFO ] Deduced a trap composed of 65 places in 219 ms of which 1 ms to minimize.
[2022-05-17 23:41:35] [INFO ] Deduced a trap composed of 63 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:41:35] [INFO ] Deduced a trap composed of 48 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:41:37] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 16370 ms
[2022-05-17 23:41:37] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 144 ms.
[2022-05-17 23:41:37] [INFO ] Added : 0 causal constraints over 0 iterations in 271 ms. Result :sat
Minimization took 3052 ms.
[2022-05-17 23:41:40] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:41:40] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:41:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:41:40] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2022-05-17 23:41:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:41:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:41:40] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2022-05-17 23:41:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:41:41] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2022-05-17 23:41:42] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1272 ms returned sat
[2022-05-17 23:41:42] [INFO ] Deduced a trap composed of 75 places in 202 ms of which 0 ms to minimize.
[2022-05-17 23:41:42] [INFO ] Deduced a trap composed of 76 places in 202 ms of which 1 ms to minimize.
[2022-05-17 23:41:43] [INFO ] Deduced a trap composed of 77 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:41:43] [INFO ] Deduced a trap composed of 84 places in 202 ms of which 0 ms to minimize.
[2022-05-17 23:41:43] [INFO ] Deduced a trap composed of 75 places in 213 ms of which 1 ms to minimize.
[2022-05-17 23:41:43] [INFO ] Deduced a trap composed of 76 places in 202 ms of which 0 ms to minimize.
[2022-05-17 23:41:44] [INFO ] Deduced a trap composed of 72 places in 200 ms of which 1 ms to minimize.
[2022-05-17 23:41:44] [INFO ] Deduced a trap composed of 69 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:41:44] [INFO ] Deduced a trap composed of 72 places in 207 ms of which 0 ms to minimize.
[2022-05-17 23:41:45] [INFO ] Deduced a trap composed of 79 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:41:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3419 ms
[2022-05-17 23:41:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 147 ms.
[2022-05-17 23:41:46] [INFO ] Added : 0 causal constraints over 0 iterations in 272 ms. Result :sat
Minimization took 3001 ms.
[2022-05-17 23:41:49] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:41:49] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:41:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:41:49] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2022-05-17 23:41:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:41:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:41:49] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:41:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:41:49] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2022-05-17 23:41:51] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1307 ms returned sat
[2022-05-17 23:41:51] [INFO ] Deduced a trap composed of 75 places in 233 ms of which 1 ms to minimize.
[2022-05-17 23:41:51] [INFO ] Deduced a trap composed of 76 places in 234 ms of which 0 ms to minimize.
[2022-05-17 23:41:51] [INFO ] Deduced a trap composed of 77 places in 231 ms of which 0 ms to minimize.
[2022-05-17 23:41:52] [INFO ] Deduced a trap composed of 84 places in 204 ms of which 1 ms to minimize.
[2022-05-17 23:41:52] [INFO ] Deduced a trap composed of 75 places in 232 ms of which 1 ms to minimize.
[2022-05-17 23:41:52] [INFO ] Deduced a trap composed of 76 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:41:53] [INFO ] Deduced a trap composed of 72 places in 228 ms of which 0 ms to minimize.
[2022-05-17 23:41:53] [INFO ] Deduced a trap composed of 69 places in 204 ms of which 0 ms to minimize.
[2022-05-17 23:41:53] [INFO ] Deduced a trap composed of 72 places in 235 ms of which 0 ms to minimize.
[2022-05-17 23:41:54] [INFO ] Deduced a trap composed of 79 places in 197 ms of which 0 ms to minimize.
[2022-05-17 23:41:54] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3571 ms
[2022-05-17 23:41:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 146 ms.
[2022-05-17 23:41:54] [INFO ] Added : 0 causal constraints over 0 iterations in 269 ms. Result :sat
Minimization took 3001 ms.
[2022-05-17 23:41:57] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:41:57] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2022-05-17 23:41:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:41:58] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2022-05-17 23:41:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:41:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:41:58] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:41:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:41:58] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2022-05-17 23:42:00] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1315 ms returned sat
[2022-05-17 23:42:00] [INFO ] Deduced a trap composed of 75 places in 275 ms of which 0 ms to minimize.
[2022-05-17 23:42:00] [INFO ] Deduced a trap composed of 76 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:42:00] [INFO ] Deduced a trap composed of 77 places in 197 ms of which 0 ms to minimize.
[2022-05-17 23:42:01] [INFO ] Deduced a trap composed of 84 places in 206 ms of which 1 ms to minimize.
[2022-05-17 23:42:01] [INFO ] Deduced a trap composed of 75 places in 203 ms of which 0 ms to minimize.
[2022-05-17 23:42:01] [INFO ] Deduced a trap composed of 76 places in 204 ms of which 0 ms to minimize.
[2022-05-17 23:42:01] [INFO ] Deduced a trap composed of 72 places in 204 ms of which 1 ms to minimize.
[2022-05-17 23:42:02] [INFO ] Deduced a trap composed of 69 places in 206 ms of which 0 ms to minimize.
[2022-05-17 23:42:02] [INFO ] Deduced a trap composed of 72 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:42:03] [INFO ] Deduced a trap composed of 79 places in 190 ms of which 0 ms to minimize.
[2022-05-17 23:42:03] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3451 ms
[2022-05-17 23:42:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 147 ms.
[2022-05-17 23:42:03] [INFO ] Added : 0 causal constraints over 0 iterations in 269 ms. Result :sat
Minimization took 3001 ms.
[2022-05-17 23:42:06] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:42:06] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:42:07] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2022-05-17 23:42:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:42:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:42:07] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:42:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:42:07] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2022-05-17 23:42:08] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1284 ms returned sat
[2022-05-17 23:42:09] [INFO ] Deduced a trap composed of 75 places in 194 ms of which 0 ms to minimize.
[2022-05-17 23:42:09] [INFO ] Deduced a trap composed of 76 places in 207 ms of which 0 ms to minimize.
[2022-05-17 23:42:09] [INFO ] Deduced a trap composed of 77 places in 209 ms of which 0 ms to minimize.
[2022-05-17 23:42:09] [INFO ] Deduced a trap composed of 84 places in 202 ms of which 0 ms to minimize.
[2022-05-17 23:42:10] [INFO ] Deduced a trap composed of 75 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:42:10] [INFO ] Deduced a trap composed of 76 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:42:10] [INFO ] Deduced a trap composed of 72 places in 209 ms of which 1 ms to minimize.
[2022-05-17 23:42:10] [INFO ] Deduced a trap composed of 69 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:42:11] [INFO ] Deduced a trap composed of 72 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:42:12] [INFO ] Deduced a trap composed of 79 places in 201 ms of which 0 ms to minimize.
[2022-05-17 23:42:12] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3378 ms
[2022-05-17 23:42:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 150 ms.
[2022-05-17 23:42:12] [INFO ] Added : 0 causal constraints over 0 iterations in 278 ms. Result :sat
Minimization took 3001 ms.
[2022-05-17 23:42:15] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:42:15] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2022-05-17 23:42:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:42:15] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2022-05-17 23:42:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:42:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:42:15] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2022-05-17 23:42:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:42:16] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2022-05-17 23:42:17] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1241 ms returned sat
[2022-05-17 23:42:17] [INFO ] Deduced a trap composed of 82 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:42:17] [INFO ] Deduced a trap composed of 52 places in 211 ms of which 0 ms to minimize.
[2022-05-17 23:42:18] [INFO ] Deduced a trap composed of 54 places in 226 ms of which 0 ms to minimize.
[2022-05-17 23:42:18] [INFO ] Deduced a trap composed of 92 places in 226 ms of which 0 ms to minimize.
[2022-05-17 23:42:18] [INFO ] Deduced a trap composed of 62 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:42:19] [INFO ] Deduced a trap composed of 64 places in 224 ms of which 0 ms to minimize.
[2022-05-17 23:42:19] [INFO ] Deduced a trap composed of 74 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:42:19] [INFO ] Deduced a trap composed of 77 places in 211 ms of which 1 ms to minimize.
[2022-05-17 23:42:20] [INFO ] Deduced a trap composed of 58 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:42:20] [INFO ] Deduced a trap composed of 73 places in 222 ms of which 1 ms to minimize.
[2022-05-17 23:42:20] [INFO ] Deduced a trap composed of 59 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:42:21] [INFO ] Deduced a trap composed of 62 places in 232 ms of which 1 ms to minimize.
[2022-05-17 23:42:21] [INFO ] Deduced a trap composed of 74 places in 225 ms of which 1 ms to minimize.
[2022-05-17 23:42:21] [INFO ] Deduced a trap composed of 71 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:42:22] [INFO ] Deduced a trap composed of 62 places in 218 ms of which 1 ms to minimize.
[2022-05-17 23:42:22] [INFO ] Deduced a trap composed of 48 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:42:22] [INFO ] Deduced a trap composed of 45 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:42:23] [INFO ] Deduced a trap composed of 83 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:42:23] [INFO ] Deduced a trap composed of 80 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:42:23] [INFO ] Deduced a trap composed of 49 places in 213 ms of which 1 ms to minimize.
[2022-05-17 23:42:24] [INFO ] Deduced a trap composed of 54 places in 228 ms of which 0 ms to minimize.
[2022-05-17 23:42:24] [INFO ] Deduced a trap composed of 55 places in 219 ms of which 1 ms to minimize.
[2022-05-17 23:42:24] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:42:25] [INFO ] Deduced a trap composed of 48 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:42:25] [INFO ] Deduced a trap composed of 64 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:42:26] [INFO ] Deduced a trap composed of 60 places in 218 ms of which 1 ms to minimize.
[2022-05-17 23:42:26] [INFO ] Deduced a trap composed of 74 places in 212 ms of which 1 ms to minimize.
[2022-05-17 23:42:26] [INFO ] Deduced a trap composed of 45 places in 223 ms of which 0 ms to minimize.
[2022-05-17 23:42:27] [INFO ] Deduced a trap composed of 75 places in 229 ms of which 0 ms to minimize.
[2022-05-17 23:42:27] [INFO ] Deduced a trap composed of 61 places in 224 ms of which 0 ms to minimize.
[2022-05-17 23:42:27] [INFO ] Deduced a trap composed of 69 places in 228 ms of which 0 ms to minimize.
[2022-05-17 23:42:27] [INFO ] Deduced a trap composed of 63 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:42:28] [INFO ] Deduced a trap composed of 68 places in 230 ms of which 0 ms to minimize.
[2022-05-17 23:42:28] [INFO ] Deduced a trap composed of 69 places in 217 ms of which 1 ms to minimize.
[2022-05-17 23:42:28] [INFO ] Deduced a trap composed of 61 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:42:29] [INFO ] Deduced a trap composed of 73 places in 211 ms of which 0 ms to minimize.
[2022-05-17 23:42:29] [INFO ] Deduced a trap composed of 80 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:42:29] [INFO ] Deduced a trap composed of 48 places in 209 ms of which 1 ms to minimize.
[2022-05-17 23:42:30] [INFO ] Deduced a trap composed of 59 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:42:31] [INFO ] Deduced a trap composed of 64 places in 207 ms of which 0 ms to minimize.
[2022-05-17 23:42:31] [INFO ] Deduced a trap composed of 62 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:42:32] [INFO ] Deduced a trap composed of 60 places in 212 ms of which 1 ms to minimize.
[2022-05-17 23:42:32] [INFO ] Deduced a trap composed of 65 places in 224 ms of which 0 ms to minimize.
[2022-05-17 23:42:32] [INFO ] Deduced a trap composed of 48 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:42:32] [INFO ] Deduced a trap composed of 58 places in 211 ms of which 0 ms to minimize.
[2022-05-17 23:42:33] [INFO ] Deduced a trap composed of 59 places in 214 ms of which 1 ms to minimize.
[2022-05-17 23:42:33] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 1 ms to minimize.
[2022-05-17 23:42:33] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 1 ms to minimize.
[2022-05-17 23:42:34] [INFO ] Deduced a trap composed of 46 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:42:35] [INFO ] Deduced a trap composed of 40 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:42:35] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 18116 ms
[2022-05-17 23:42:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 148 ms.
[2022-05-17 23:42:35] [INFO ] Added : 0 causal constraints over 0 iterations in 284 ms. Result :sat
Minimization took 3025 ms.
[2022-05-17 23:42:38] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:42:38] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 11 ms returned sat
[2022-05-17 23:42:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:42:39] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2022-05-17 23:42:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:42:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:42:39] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2022-05-17 23:42:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:42:39] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2022-05-17 23:42:41] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1546 ms returned sat
[2022-05-17 23:42:41] [INFO ] Deduced a trap composed of 72 places in 205 ms of which 0 ms to minimize.
[2022-05-17 23:42:41] [INFO ] Deduced a trap composed of 80 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:42:41] [INFO ] Deduced a trap composed of 70 places in 207 ms of which 0 ms to minimize.
[2022-05-17 23:42:42] [INFO ] Deduced a trap composed of 84 places in 206 ms of which 0 ms to minimize.
[2022-05-17 23:42:42] [INFO ] Deduced a trap composed of 77 places in 207 ms of which 1 ms to minimize.
[2022-05-17 23:42:42] [INFO ] Deduced a trap composed of 73 places in 227 ms of which 0 ms to minimize.
[2022-05-17 23:42:42] [INFO ] Deduced a trap composed of 73 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:42:43] [INFO ] Deduced a trap composed of 69 places in 209 ms of which 0 ms to minimize.
[2022-05-17 23:42:44] [INFO ] Deduced a trap composed of 71 places in 208 ms of which 1 ms to minimize.
[2022-05-17 23:42:44] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3101 ms
[2022-05-17 23:42:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 160 ms.
[2022-05-17 23:42:44] [INFO ] Added : 0 causal constraints over 0 iterations in 284 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [10, 10, 10, 10, 10, 2147483647, 10, 10, 10, 10, 10, 10, 10, 10, 10] Max seen :[2, 4, 4, 4, 4, 2, 4, 2, 4, 2, 2, 2, 2, 4, 2]
Incomplete Parikh walk after 391100 steps, including 47689 resets, run finished after 4467 ms. (steps per millisecond=87 ) properties (out of 15) seen :44 could not realise parikh vector
Incomplete Parikh walk after 391100 steps, including 47755 resets, run finished after 4440 ms. (steps per millisecond=88 ) properties (out of 15) seen :44 could not realise parikh vector
Incomplete Parikh walk after 391100 steps, including 47784 resets, run finished after 4441 ms. (steps per millisecond=88 ) properties (out of 15) seen :44 could not realise parikh vector
Support contains 150 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 85 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 72 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:43:00] [INFO ] Computed 39 place invariants in 23 ms
[2022-05-17 23:43:01] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:43:01] [INFO ] Computed 39 place invariants in 25 ms
[2022-05-17 23:43:01] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:43:02] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
[2022-05-17 23:43:02] [INFO ] Redundant transitions in 173 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:43:02] [INFO ] Computed 39 place invariants in 28 ms
[2022-05-17 23:43:02] [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.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-00
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:43:02] [INFO ] Computed 39 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 1199 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:43:02] [INFO ] Computed 39 place invariants in 32 ms
[2022-05-17 23:43:02] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:43:02] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:43:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:43:03] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2022-05-17 23:43:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:43:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:43:03] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:43:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:43:03] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2022-05-17 23:43:03] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:43:05] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1427 ms returned sat
[2022-05-17 23:43:05] [INFO ] Deduced a trap composed of 72 places in 200 ms of which 1 ms to minimize.
[2022-05-17 23:43:05] [INFO ] Deduced a trap composed of 80 places in 201 ms of which 0 ms to minimize.
[2022-05-17 23:43:05] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 0 ms to minimize.
[2022-05-17 23:43:06] [INFO ] Deduced a trap composed of 84 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:43:06] [INFO ] Deduced a trap composed of 77 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:43:06] [INFO ] Deduced a trap composed of 73 places in 203 ms of which 0 ms to minimize.
[2022-05-17 23:43:06] [INFO ] Deduced a trap composed of 73 places in 199 ms of which 0 ms to minimize.
[2022-05-17 23:43:07] [INFO ] Deduced a trap composed of 69 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:43:07] [INFO ] Deduced a trap composed of 71 places in 191 ms of which 0 ms to minimize.
[2022-05-17 23:43:07] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2954 ms
[2022-05-17 23:43:08] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 186 ms.
[2022-05-17 23:43:08] [INFO ] Added : 0 causal constraints over 0 iterations in 290 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [198] Max seen :[2]
Incomplete Parikh walk after 274500 steps, including 33540 resets, run finished after 1774 ms. (steps per millisecond=154 ) properties (out of 1) seen :2 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 107 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:43:10] [INFO ] Computed 39 place invariants in 28 ms
[2022-05-17 23:43:10] [INFO ] Dead Transitions using invariants and state equation in 586 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:43:10] [INFO ] Computed 39 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 119294 resets, run finished after 5807 ms. (steps per millisecond=172 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 10000 resets, run finished after 915 ms. (steps per millisecond=1092 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:43:17] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-17 23:43:17] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:43:17] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:43:17] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2022-05-17 23:43:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:43:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:43:17] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2022-05-17 23:43:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:43:18] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2022-05-17 23:43:18] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:43:19] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1501 ms returned sat
[2022-05-17 23:43:19] [INFO ] Deduced a trap composed of 72 places in 206 ms of which 1 ms to minimize.
[2022-05-17 23:43:20] [INFO ] Deduced a trap composed of 80 places in 209 ms of which 1 ms to minimize.
[2022-05-17 23:43:20] [INFO ] Deduced a trap composed of 70 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:43:20] [INFO ] Deduced a trap composed of 84 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:43:21] [INFO ] Deduced a trap composed of 77 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:43:21] [INFO ] Deduced a trap composed of 73 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:43:21] [INFO ] Deduced a trap composed of 73 places in 206 ms of which 0 ms to minimize.
[2022-05-17 23:43:21] [INFO ] Deduced a trap composed of 69 places in 201 ms of which 0 ms to minimize.
[2022-05-17 23:43:22] [INFO ] Deduced a trap composed of 71 places in 203 ms of which 1 ms to minimize.
[2022-05-17 23:43:22] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3027 ms
[2022-05-17 23:43:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 177 ms.
[2022-05-17 23:43:23] [INFO ] Added : 0 causal constraints over 0 iterations in 294 ms. Result :sat
Minimization took 3002 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 84 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 82 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:43:26] [INFO ] Computed 39 place invariants in 29 ms
[2022-05-17 23:43:26] [INFO ] Implicit Places using invariants in 357 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:43:26] [INFO ] Computed 39 place invariants in 22 ms
[2022-05-17 23:43:26] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:43:32] [INFO ] Implicit Places using invariants and state equation in 5518 ms returned []
Implicit Place search using SMT with State Equation took 5878 ms to find 0 implicit places.
[2022-05-17 23:43:32] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:43:32] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-17 23:43:32] [INFO ] Dead Transitions using invariants and state equation in 567 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 29948 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-01
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:43:32] [INFO ] Computed 39 place invariants in 39 ms
Incomplete random walk after 10000 steps, including 1209 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 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:43:32] [INFO ] Computed 39 place invariants in 26 ms
[2022-05-17 23:43:32] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:43:32] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2022-05-17 23:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:43:33] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2022-05-17 23:43:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:43:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:43:33] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 12 ms returned sat
[2022-05-17 23:43:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:43:33] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2022-05-17 23:43:33] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:43:34] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1229 ms returned sat
[2022-05-17 23:43:35] [INFO ] Deduced a trap composed of 82 places in 223 ms of which 0 ms to minimize.
[2022-05-17 23:43:35] [INFO ] Deduced a trap composed of 52 places in 227 ms of which 0 ms to minimize.
[2022-05-17 23:43:35] [INFO ] Deduced a trap composed of 54 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:43:36] [INFO ] Deduced a trap composed of 92 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:43:36] [INFO ] Deduced a trap composed of 62 places in 208 ms of which 1 ms to minimize.
[2022-05-17 23:43:36] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:43:36] [INFO ] Deduced a trap composed of 74 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:43:37] [INFO ] Deduced a trap composed of 77 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:43:37] [INFO ] Deduced a trap composed of 58 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:43:37] [INFO ] Deduced a trap composed of 73 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:43:38] [INFO ] Deduced a trap composed of 59 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:43:38] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 1 ms to minimize.
[2022-05-17 23:43:38] [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 162 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:43:38] [INFO ] Computed 39 place invariants in 21 ms
[2022-05-17 23:43:39] [INFO ] Dead Transitions using invariants and state equation in 554 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:43:39] [INFO ] Computed 39 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 119402 resets, run finished after 6030 ms. (steps per millisecond=165 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9739 resets, run finished after 1009 ms. (steps per millisecond=991 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:43:46] [INFO ] Computed 39 place invariants in 32 ms
[2022-05-17 23:43:46] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:43:46] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:43:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:43:46] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2022-05-17 23:43:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:43:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:43:46] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2022-05-17 23:43:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:43:46] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2022-05-17 23:43:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:43:47] [INFO ] [Nat]Added 1010 Read/Feed constraints in 406 ms returned sat
[2022-05-17 23:43:47] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 169 ms.
[2022-05-17 23:43:47] [INFO ] Added : 0 causal constraints over 0 iterations in 305 ms. Result :sat
Minimization took 1276 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Incomplete Parikh walk after 88000 steps, including 11063 resets, run finished after 531 ms. (steps per millisecond=165 ) 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 77 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 75 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:43:49] [INFO ] Computed 39 place invariants in 31 ms
[2022-05-17 23:43:50] [INFO ] Implicit Places using invariants in 385 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 389 ms to find 10 implicit places.
[2022-05-17 23:43:50] [INFO ] Redundant transitions in 139 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:43:50] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-17 23:43:50] [INFO ] Dead Transitions using invariants and state equation in 560 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 75 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2022-05-17 23:43:50] [INFO ] Redundant transitions in 43 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:43:50] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-17 23:43:51] [INFO ] Dead Transitions using invariants and state equation in 605 ms returned []
Finished structural reductions, in 2 iterations. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:43:51] [INFO ] Computed 29 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 119368 resets, run finished after 5807 ms. (steps per millisecond=172 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9739 resets, run finished after 975 ms. (steps per millisecond=1025 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:43:58] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-17 23:43:58] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:43:58] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 6 ms returned sat
[2022-05-17 23:43:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:43:58] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2022-05-17 23:43:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:43:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:43:58] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 6 ms returned sat
[2022-05-17 23:43:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:43:58] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2022-05-17 23:43:59] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:43:59] [INFO ] [Nat]Added 1010 Read/Feed constraints in 472 ms returned sat
[2022-05-17 23:43:59] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 145 ms.
[2022-05-17 23:43:59] [INFO ] Added : 0 causal constraints over 0 iterations in 278 ms. Result :sat
Minimization took 1828 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Incomplete Parikh walk after 303700 steps, including 38432 resets, run finished after 1899 ms. (steps per millisecond=159 ) 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 73 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
[2022-05-17 23:44:03] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-17 23:44:04] [INFO ] Implicit Places using invariants in 331 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:44:04] [INFO ] Computed 29 place invariants in 23 ms
[2022-05-17 23:44:04] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:44:08] [INFO ] Implicit Places using invariants and state equation in 4582 ms returned []
Implicit Place search using SMT with State Equation took 4915 ms to find 0 implicit places.
[2022-05-17 23:44:08] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:44:08] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-17 23:44:09] [INFO ] Dead Transitions using invariants and state equation in 561 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 36481 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-02
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:44:09] [INFO ] Computed 39 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 1194 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 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:44:09] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-17 23:44:09] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:44:09] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:44:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:44:09] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2022-05-17 23:44:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:44:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:44:09] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:44:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:44:09] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2022-05-17 23:44:09] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:44:11] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1249 ms returned sat
[2022-05-17 23:44:11] [INFO ] Deduced a trap composed of 82 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:44:11] [INFO ] Deduced a trap composed of 52 places in 226 ms of which 0 ms to minimize.
[2022-05-17 23:44:12] [INFO ] Deduced a trap composed of 54 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:44:12] [INFO ] Deduced a trap composed of 92 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:44:12] [INFO ] Deduced a trap composed of 62 places in 213 ms of which 1 ms to minimize.
[2022-05-17 23:44:13] [INFO ] Deduced a trap composed of 64 places in 226 ms of which 4 ms to minimize.
[2022-05-17 23:44:13] [INFO ] Deduced a trap composed of 74 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:44:13] [INFO ] Deduced a trap composed of 77 places in 218 ms of which 1 ms to minimize.
[2022-05-17 23:44:14] [INFO ] Deduced a trap composed of 58 places in 211 ms of which 1 ms to minimize.
[2022-05-17 23:44:14] [INFO ] Deduced a trap composed of 73 places in 274 ms of which 0 ms to minimize.
[2022-05-17 23:44:14] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 1 ms to minimize.
[2022-05-17 23:44:14] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 0 ms to minimize.
[2022-05-17 23:44:14] [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 151 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:44:15] [INFO ] Computed 39 place invariants in 28 ms
[2022-05-17 23:44:15] [INFO ] Dead Transitions using invariants and state equation in 545 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:44:15] [INFO ] Computed 39 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 119260 resets, run finished after 6021 ms. (steps per millisecond=166 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9744 resets, run finished after 1003 ms. (steps per millisecond=997 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:44:22] [INFO ] Computed 39 place invariants in 31 ms
[2022-05-17 23:44:22] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:44:22] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:44:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:44:23] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2022-05-17 23:44:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:44:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:44:23] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2022-05-17 23:44:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:44:23] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2022-05-17 23:44:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:44:23] [INFO ] [Nat]Added 1010 Read/Feed constraints in 381 ms returned sat
[2022-05-17 23:44:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 143 ms.
[2022-05-17 23:44:24] [INFO ] Added : 0 causal constraints over 0 iterations in 278 ms. Result :sat
Minimization took 1189 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Incomplete Parikh walk after 88000 steps, including 11026 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 73 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 73 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:44:25] [INFO ] Computed 39 place invariants in 29 ms
[2022-05-17 23:44:26] [INFO ] Implicit Places using invariants in 352 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 355 ms to find 10 implicit places.
[2022-05-17 23:44:26] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:44:26] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-17 23:44:26] [INFO ] Dead Transitions using invariants and state equation in 526 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 72 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2022-05-17 23:44:26] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:44:26] [INFO ] Computed 29 place invariants in 23 ms
[2022-05-17 23:44:27] [INFO ] Dead Transitions using invariants and state equation in 532 ms returned []
Finished structural reductions, in 2 iterations. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:44:27] [INFO ] Computed 29 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 119272 resets, run finished after 5715 ms. (steps per millisecond=174 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9739 resets, run finished after 945 ms. (steps per millisecond=1058 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:44:34] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-17 23:44:34] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:44:34] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 7 ms returned sat
[2022-05-17 23:44:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:44:34] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2022-05-17 23:44:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:44:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:44:34] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 6 ms returned sat
[2022-05-17 23:44:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:44:34] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2022-05-17 23:44:34] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:44:35] [INFO ] [Nat]Added 1010 Read/Feed constraints in 431 ms returned sat
[2022-05-17 23:44:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 138 ms.
[2022-05-17 23:44:35] [INFO ] Added : 0 causal constraints over 0 iterations in 280 ms. Result :sat
Minimization took 1834 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Incomplete Parikh walk after 303700 steps, including 38358 resets, run finished after 1890 ms. (steps per millisecond=160 ) 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 71 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 70 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:44:39] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-17 23:44:39] [INFO ] Implicit Places using invariants in 309 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:44:39] [INFO ] Computed 29 place invariants in 17 ms
[2022-05-17 23:44:40] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:44:43] [INFO ] Implicit Places using invariants and state equation in 4196 ms returned []
Implicit Place search using SMT with State Equation took 4506 ms to find 0 implicit places.
[2022-05-17 23:44:44] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:44:44] [INFO ] Computed 29 place invariants in 17 ms
[2022-05-17 23:44:44] [INFO ] Dead Transitions using invariants and state equation in 558 ms returned []
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-02 in 35342 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-03
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:44:44] [INFO ] Computed 39 place invariants in 21 ms
Incomplete random walk after 10000 steps, including 1191 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:44:44] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-17 23:44:44] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2022-05-17 23:44:44] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 9 ms returned sat
[2022-05-17 23:44:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:44:45] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2022-05-17 23:44:45] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:44:45] [INFO ] [Real]Added 1010 Read/Feed constraints in 164 ms returned sat
[2022-05-17 23:44:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:44:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:44:45] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2022-05-17 23:44:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:44:45] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2022-05-17 23:44:46] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1339 ms returned sat
[2022-05-17 23:44:47] [INFO ] Deduced a trap composed of 82 places in 219 ms of which 1 ms to minimize.
[2022-05-17 23:44:47] [INFO ] Deduced a trap composed of 92 places in 233 ms of which 0 ms to minimize.
[2022-05-17 23:44:48] [INFO ] Deduced a trap composed of 88 places in 215 ms of which 1 ms to minimize.
[2022-05-17 23:44:48] [INFO ] Deduced a trap composed of 56 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:44:48] [INFO ] Deduced a trap composed of 91 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:44:48] [INFO ] Deduced a trap composed of 92 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:44:49] [INFO ] Deduced a trap composed of 88 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:44:49] [INFO ] Deduced a trap composed of 92 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:44:49] [INFO ] Deduced a trap composed of 89 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:44:50] [INFO ] Deduced a trap composed of 93 places in 220 ms of which 1 ms to minimize.
[2022-05-17 23:44:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 147 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:44:50] [INFO ] Computed 39 place invariants in 25 ms
[2022-05-17 23:44:51] [INFO ] Dead Transitions using invariants and state equation in 541 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:44:51] [INFO ] Computed 39 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 119350 resets, run finished after 7171 ms. (steps per millisecond=139 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9400 resets, run finished after 2123 ms. (steps per millisecond=471 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:45:00] [INFO ] Computed 39 place invariants in 27 ms
[2022-05-17 23:45:00] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:45:00] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:45:00] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2022-05-17 23:45:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:45:01] [INFO ] [Real]Added 1010 Read/Feed constraints in 342 ms returned sat
[2022-05-17 23:45:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:45:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:45:01] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 14 ms returned sat
[2022-05-17 23:45:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:45:01] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2022-05-17 23:45:01] [INFO ] [Nat]Added 1010 Read/Feed constraints in 354 ms returned sat
[2022-05-17 23:45:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 157 ms.
[2022-05-17 23:45:02] [INFO ] Added : 0 causal constraints over 0 iterations in 294 ms. Result :sat
Minimization took 953 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 124500 steps, including 15872 resets, run finished after 905 ms. (steps per millisecond=137 ) 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 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
[2022-05-17 23:45:04] [INFO ] Computed 39 place invariants in 27 ms
[2022-05-17 23:45:04] [INFO ] Implicit Places using invariants in 225 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 227 ms to find 10 implicit places.
[2022-05-17 23:45:04] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:45:04] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-17 23:45:05] [INFO ] Dead Transitions using invariants and state equation in 540 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 144 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:45:05] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-17 23:45:05] [INFO ] Implicit Places using invariants in 206 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:45:05] [INFO ] Computed 29 place invariants in 16 ms
[2022-05-17 23:45:05] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:45:06] [INFO ] Implicit Places using invariants and state equation in 1553 ms returned []
Implicit Place search using SMT with State Equation took 1762 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
[2022-05-17 23:45:07] [INFO ] Computed 29 place invariants in 26 ms
Incomplete random walk after 1000000 steps, including 178901 resets, run finished after 9018 ms. (steps per millisecond=110 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 11363 resets, run finished after 2151 ms. (steps per millisecond=464 ) properties (out of 1) seen :4
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:45:18] [INFO ] Computed 29 place invariants in 28 ms
[2022-05-17 23:45:18] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:45:18] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 7 ms returned sat
[2022-05-17 23:45:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:45:18] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2022-05-17 23:45:18] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:45:18] [INFO ] [Real]Added 1010 Read/Feed constraints in 217 ms returned sat
[2022-05-17 23:45:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:45:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:45:18] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 4 ms returned sat
[2022-05-17 23:45:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:45:19] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2022-05-17 23:45:20] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1362 ms returned sat
[2022-05-17 23:45:20] [INFO ] Deduced a trap composed of 79 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:45:21] [INFO ] Deduced a trap composed of 87 places in 229 ms of which 0 ms to minimize.
[2022-05-17 23:45:21] [INFO ] Deduced a trap composed of 60 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:45:21] [INFO ] Deduced a trap composed of 47 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:45:22] [INFO ] Deduced a trap composed of 62 places in 226 ms of which 0 ms to minimize.
[2022-05-17 23:45:22] [INFO ] Deduced a trap composed of 59 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:45:22] [INFO ] Deduced a trap composed of 84 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:45:22] [INFO ] Deduced a trap composed of 84 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:45:23] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:45:23] [INFO ] Deduced a trap composed of 76 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:45:23] [INFO ] Deduced a trap composed of 52 places in 207 ms of which 0 ms to minimize.
[2022-05-17 23:45:24] [INFO ] Deduced a trap composed of 52 places in 209 ms of which 0 ms to minimize.
[2022-05-17 23:45:24] [INFO ] Deduced a trap composed of 48 places in 211 ms of which 0 ms to minimize.
[2022-05-17 23:45:24] [INFO ] Deduced a trap composed of 53 places in 209 ms of which 1 ms to minimize.
[2022-05-17 23:45:24] [INFO ] Deduced a trap composed of 54 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:45:25] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:45:25] [INFO ] Deduced a trap composed of 62 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:45:25] [INFO ] Deduced a trap composed of 51 places in 207 ms of which 1 ms to minimize.
[2022-05-17 23:45:26] [INFO ] Deduced a trap composed of 59 places in 232 ms of which 0 ms to minimize.
[2022-05-17 23:45:26] [INFO ] Deduced a trap composed of 69 places in 212 ms of which 1 ms to minimize.
[2022-05-17 23:45:26] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:45:26] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 0 ms to minimize.
[2022-05-17 23:45:27] [INFO ] Deduced a trap composed of 31 places in 204 ms of which 0 ms to minimize.
[2022-05-17 23:45:27] [INFO ] Deduced a trap composed of 84 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:45:27] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 7285 ms
[2022-05-17 23:45:27] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 153 ms.
[2022-05-17 23:45:28] [INFO ] Added : 0 causal constraints over 0 iterations in 290 ms. Result :sat
Minimization took 1365 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 327500 steps, including 56642 resets, run finished after 3114 ms. (steps per millisecond=105 ) 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 70 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 70 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:45:32] [INFO ] Computed 29 place invariants in 27 ms
[2022-05-17 23:45:33] [INFO ] Implicit Places using invariants in 211 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:45:33] [INFO ] Computed 29 place invariants in 22 ms
[2022-05-17 23:45:33] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:45:34] [INFO ] Implicit Places using invariants and state equation in 1482 ms returned []
Implicit Place search using SMT with State Equation took 1695 ms to find 0 implicit places.
[2022-05-17 23:45:34] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:45:34] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-17 23:45:35] [INFO ] Dead Transitions using invariants and state equation in 545 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 50513 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-04
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:45:35] [INFO ] Computed 39 place invariants in 21 ms
Incomplete random walk after 10000 steps, including 1201 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 90 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:45:35] [INFO ] Computed 39 place invariants in 28 ms
[2022-05-17 23:45:35] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:45:35] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:45:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:45:35] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2022-05-17 23:45:35] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:45:35] [INFO ] [Real]Added 1010 Read/Feed constraints in 168 ms returned sat
[2022-05-17 23:45:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:45:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:45:35] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:45:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:45:36] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2022-05-17 23:45:37] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1349 ms returned sat
[2022-05-17 23:45:37] [INFO ] Deduced a trap composed of 82 places in 226 ms of which 0 ms to minimize.
[2022-05-17 23:45:38] [INFO ] Deduced a trap composed of 92 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:45:38] [INFO ] Deduced a trap composed of 88 places in 223 ms of which 0 ms to minimize.
[2022-05-17 23:45:38] [INFO ] Deduced a trap composed of 56 places in 223 ms of which 0 ms to minimize.
[2022-05-17 23:45:39] [INFO ] Deduced a trap composed of 91 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:45:39] [INFO ] Deduced a trap composed of 92 places in 216 ms of which 1 ms to minimize.
[2022-05-17 23:45:39] [INFO ] Deduced a trap composed of 88 places in 227 ms of which 1 ms to minimize.
[2022-05-17 23:45:40] [INFO ] Deduced a trap composed of 92 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:45:40] [INFO ] Deduced a trap composed of 89 places in 219 ms of which 1 ms to minimize.
[2022-05-17 23:45:41] [INFO ] Deduced a trap composed of 93 places in 248 ms of which 1 ms to minimize.
[2022-05-17 23:45:41] [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 150 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:45:41] [INFO ] Computed 39 place invariants in 26 ms
[2022-05-17 23:45:41] [INFO ] Dead Transitions using invariants and state equation in 540 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:45:41] [INFO ] Computed 39 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 119280 resets, run finished after 7187 ms. (steps per millisecond=139 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9406 resets, run finished after 2138 ms. (steps per millisecond=467 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:45:51] [INFO ] Computed 39 place invariants in 28 ms
[2022-05-17 23:45:51] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:45:51] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:45:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:45:51] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2022-05-17 23:45:51] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:45:51] [INFO ] [Real]Added 1010 Read/Feed constraints in 342 ms returned sat
[2022-05-17 23:45:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:45:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:45:51] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:45:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:45:52] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2022-05-17 23:45:52] [INFO ] [Nat]Added 1010 Read/Feed constraints in 358 ms returned sat
[2022-05-17 23:45:52] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 140 ms.
[2022-05-17 23:45:52] [INFO ] Added : 0 causal constraints over 0 iterations in 282 ms. Result :sat
Minimization took 942 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 124500 steps, including 15820 resets, run finished after 901 ms. (steps per millisecond=138 ) 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 86 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 71 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:45:54] [INFO ] Computed 39 place invariants in 31 ms
[2022-05-17 23:45:55] [INFO ] Implicit Places using invariants in 238 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 240 ms to find 10 implicit places.
[2022-05-17 23:45:55] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:45:55] [INFO ] Computed 29 place invariants in 28 ms
[2022-05-17 23:45:55] [INFO ] Dead Transitions using invariants and state equation in 530 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 145 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:45:55] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-17 23:45:55] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:45:56] [INFO ] Computed 29 place invariants in 17 ms
[2022-05-17 23:45:56] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:45:57] [INFO ] Implicit Places using invariants and state equation in 1341 ms returned []
Implicit Place search using SMT with State Equation took 1553 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
[2022-05-17 23:45:57] [INFO ] Computed 29 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 178852 resets, run finished after 9021 ms. (steps per millisecond=110 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 11363 resets, run finished after 2111 ms. (steps per millisecond=473 ) properties (out of 1) seen :4
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:46:08] [INFO ] Computed 29 place invariants in 28 ms
[2022-05-17 23:46:08] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:46:08] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 4 ms returned sat
[2022-05-17 23:46:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:46:08] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2022-05-17 23:46:08] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:46:09] [INFO ] [Real]Added 1010 Read/Feed constraints in 197 ms returned sat
[2022-05-17 23:46:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:46:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:46:09] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 4 ms returned sat
[2022-05-17 23:46:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:46:09] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2022-05-17 23:46:10] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1200 ms returned sat
[2022-05-17 23:46:10] [INFO ] Deduced a trap composed of 79 places in 207 ms of which 0 ms to minimize.
[2022-05-17 23:46:11] [INFO ] Deduced a trap composed of 87 places in 209 ms of which 0 ms to minimize.
[2022-05-17 23:46:11] [INFO ] Deduced a trap composed of 60 places in 203 ms of which 0 ms to minimize.
[2022-05-17 23:46:11] [INFO ] Deduced a trap composed of 47 places in 205 ms of which 0 ms to minimize.
[2022-05-17 23:46:11] [INFO ] Deduced a trap composed of 62 places in 205 ms of which 0 ms to minimize.
[2022-05-17 23:46:12] [INFO ] Deduced a trap composed of 59 places in 208 ms of which 1 ms to minimize.
[2022-05-17 23:46:12] [INFO ] Deduced a trap composed of 84 places in 205 ms of which 0 ms to minimize.
[2022-05-17 23:46:12] [INFO ] Deduced a trap composed of 84 places in 207 ms of which 0 ms to minimize.
[2022-05-17 23:46:13] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 1 ms to minimize.
[2022-05-17 23:46:13] [INFO ] Deduced a trap composed of 76 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:46:13] [INFO ] Deduced a trap composed of 52 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:46:14] [INFO ] Deduced a trap composed of 52 places in 224 ms of which 0 ms to minimize.
[2022-05-17 23:46:14] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 1 ms to minimize.
[2022-05-17 23:46:14] [INFO ] Deduced a trap composed of 53 places in 204 ms of which 0 ms to minimize.
[2022-05-17 23:46:14] [INFO ] Deduced a trap composed of 54 places in 205 ms of which 0 ms to minimize.
[2022-05-17 23:46:15] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 1 ms to minimize.
[2022-05-17 23:46:15] [INFO ] Deduced a trap composed of 62 places in 204 ms of which 0 ms to minimize.
[2022-05-17 23:46:15] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 0 ms to minimize.
[2022-05-17 23:46:15] [INFO ] Deduced a trap composed of 59 places in 201 ms of which 0 ms to minimize.
[2022-05-17 23:46:16] [INFO ] Deduced a trap composed of 69 places in 207 ms of which 0 ms to minimize.
[2022-05-17 23:46:16] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 0 ms to minimize.
[2022-05-17 23:46:16] [INFO ] Deduced a trap composed of 38 places in 211 ms of which 0 ms to minimize.
[2022-05-17 23:46:17] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 0 ms to minimize.
[2022-05-17 23:46:17] [INFO ] Deduced a trap composed of 84 places in 202 ms of which 0 ms to minimize.
[2022-05-17 23:46:17] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 7058 ms
[2022-05-17 23:46:17] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 155 ms.
[2022-05-17 23:46:17] [INFO ] Added : 0 causal constraints over 0 iterations in 283 ms. Result :sat
Minimization took 1172 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 327500 steps, including 56600 resets, run finished after 3110 ms. (steps per millisecond=105 ) 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 69 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 70 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:46:22] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-17 23:46:22] [INFO ] Implicit Places using invariants in 205 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:46:22] [INFO ] Computed 29 place invariants in 22 ms
[2022-05-17 23:46:22] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:46:23] [INFO ] Implicit Places using invariants and state equation in 1406 ms returned []
Implicit Place search using SMT with State Equation took 1612 ms to find 0 implicit places.
[2022-05-17 23:46:24] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:46:24] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-17 23:46:24] [INFO ] Dead Transitions using invariants and state equation in 534 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 49477 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-05
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:46:24] [INFO ] Computed 39 place invariants in 21 ms
Incomplete random walk after 10000 steps, including 1207 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:46:24] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-17 23:46:24] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:46:24] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 5 ms returned sat
[2022-05-17 23:46:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:46:25] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2022-05-17 23:46:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:46:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:46:25] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2022-05-17 23:46:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:46:25] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2022-05-17 23:46:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:46:26] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1385 ms returned sat
[2022-05-17 23:46:27] [INFO ] Deduced a trap composed of 76 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:46:27] [INFO ] Deduced a trap composed of 63 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:46:27] [INFO ] Deduced a trap composed of 76 places in 225 ms of which 1 ms to minimize.
[2022-05-17 23:46:27] [INFO ] Deduced a trap composed of 77 places in 200 ms of which 0 ms to minimize.
[2022-05-17 23:46:28] [INFO ] Deduced a trap composed of 75 places in 206 ms of which 1 ms to minimize.
[2022-05-17 23:46:28] [INFO ] Deduced a trap composed of 74 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:46:28] [INFO ] Deduced a trap composed of 69 places in 204 ms of which 0 ms to minimize.
[2022-05-17 23:46:28] [INFO ] Deduced a trap composed of 79 places in 210 ms of which 1 ms to minimize.
[2022-05-17 23:46:29] [INFO ] Deduced a trap composed of 81 places in 205 ms of which 0 ms to minimize.
[2022-05-17 23:46:29] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3058 ms
[2022-05-17 23:46:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 148 ms.
[2022-05-17 23:46:30] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 0 ms to minimize.
[2022-05-17 23:46:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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 71 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:46:30] [INFO ] Computed 39 place invariants in 28 ms
[2022-05-17 23:46:30] [INFO ] Dead Transitions using invariants and state equation in 543 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:46:30] [INFO ] Computed 39 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 119277 resets, run finished after 5929 ms. (steps per millisecond=168 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 8517 resets, run finished after 916 ms. (steps per millisecond=1091 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:46:37] [INFO ] Computed 39 place invariants in 32 ms
[2022-05-17 23:46:37] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:46:37] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 5 ms returned sat
[2022-05-17 23:46:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:46:38] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2022-05-17 23:46:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:46:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:46:38] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:46:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:46:38] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2022-05-17 23:46:38] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:46:39] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1372 ms returned sat
[2022-05-17 23:46:40] [INFO ] Deduced a trap composed of 76 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:46:40] [INFO ] Deduced a trap composed of 63 places in 219 ms of which 1 ms to minimize.
[2022-05-17 23:46:40] [INFO ] Deduced a trap composed of 76 places in 205 ms of which 0 ms to minimize.
[2022-05-17 23:46:41] [INFO ] Deduced a trap composed of 77 places in 246 ms of which 0 ms to minimize.
[2022-05-17 23:46:41] [INFO ] Deduced a trap composed of 75 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:46:41] [INFO ] Deduced a trap composed of 74 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:46:41] [INFO ] Deduced a trap composed of 69 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:46:42] [INFO ] Deduced a trap composed of 79 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:46:43] [INFO ] Deduced a trap composed of 81 places in 222 ms of which 1 ms to minimize.
[2022-05-17 23:46:43] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3163 ms
[2022-05-17 23:46:43] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 154 ms.
[2022-05-17 23:46:43] [INFO ] Added : 0 causal constraints over 0 iterations in 279 ms. Result :sat
Minimization took 3000 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 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 69 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:46:46] [INFO ] Computed 39 place invariants in 28 ms
[2022-05-17 23:46:46] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:46:46] [INFO ] Computed 39 place invariants in 21 ms
[2022-05-17 23:46:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:46:52] [INFO ] Implicit Places using invariants and state equation in 5600 ms returned []
Implicit Place search using SMT with State Equation took 5871 ms to find 0 implicit places.
[2022-05-17 23:46:52] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:46:52] [INFO ] Computed 39 place invariants in 25 ms
[2022-05-17 23:46:53] [INFO ] Dead Transitions using invariants and state equation in 548 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-05 in 28454 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-06
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:46:53] [INFO ] Computed 39 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 1194 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10000 steps, including 95 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:46:53] [INFO ] Computed 39 place invariants in 29 ms
[2022-05-17 23:46:53] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:46:53] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:46:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:46:53] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2022-05-17 23:46:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:46:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:46:53] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:46:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:46:53] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2022-05-17 23:46:53] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:46:55] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1226 ms returned sat
[2022-05-17 23:46:55] [INFO ] Deduced a trap composed of 82 places in 208 ms of which 1 ms to minimize.
[2022-05-17 23:46:55] [INFO ] Deduced a trap composed of 52 places in 215 ms of which 1 ms to minimize.
[2022-05-17 23:46:55] [INFO ] Deduced a trap composed of 54 places in 214 ms of which 1 ms to minimize.
[2022-05-17 23:46:56] [INFO ] Deduced a trap composed of 92 places in 219 ms of which 1 ms to minimize.
[2022-05-17 23:46:56] [INFO ] Deduced a trap composed of 62 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:46:56] [INFO ] Deduced a trap composed of 64 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:46:57] [INFO ] Deduced a trap composed of 74 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:46:57] [INFO ] Deduced a trap composed of 77 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:46:57] [INFO ] Deduced a trap composed of 58 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:46:58] [INFO ] Deduced a trap composed of 73 places in 258 ms of which 0 ms to minimize.
[2022-05-17 23:46:58] [INFO ] Deduced a trap composed of 59 places in 223 ms of which 0 ms to minimize.
[2022-05-17 23:46:58] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 0 ms to minimize.
[2022-05-17 23:46:58] [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 145 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:46:58] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-17 23:46:59] [INFO ] Dead Transitions using invariants and state equation in 532 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:46:59] [INFO ] Computed 39 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 119230 resets, run finished after 5980 ms. (steps per millisecond=167 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9740 resets, run finished after 992 ms. (steps per millisecond=1008 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:47:06] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-17 23:47:06] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:47:06] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:47:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:47:06] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2022-05-17 23:47:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:47:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:47:06] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2022-05-17 23:47:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:47:07] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2022-05-17 23:47:07] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:47:07] [INFO ] [Nat]Added 1010 Read/Feed constraints in 383 ms returned sat
[2022-05-17 23:47:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 142 ms.
[2022-05-17 23:47:07] [INFO ] Added : 0 causal constraints over 0 iterations in 282 ms. Result :sat
Minimization took 1169 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Incomplete Parikh walk after 88000 steps, including 11045 resets, run finished after 521 ms. (steps per millisecond=168 ) 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 71 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
[2022-05-17 23:47:09] [INFO ] Computed 39 place invariants in 27 ms
[2022-05-17 23:47:09] [INFO ] Implicit Places using invariants in 355 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 357 ms to find 10 implicit places.
[2022-05-17 23:47:10] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:47:10] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-17 23:47:10] [INFO ] Dead Transitions using invariants and state equation in 533 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 72 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2022-05-17 23:47:10] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:47:10] [INFO ] Computed 29 place invariants in 17 ms
[2022-05-17 23:47:11] [INFO ] Dead Transitions using invariants and state equation in 540 ms returned []
Finished structural reductions, in 2 iterations. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:47:11] [INFO ] Computed 29 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 119366 resets, run finished after 5786 ms. (steps per millisecond=172 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9736 resets, run finished after 943 ms. (steps per millisecond=1060 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:47:17] [INFO ] Computed 29 place invariants in 22 ms
[2022-05-17 23:47:17] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:47:18] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 4 ms returned sat
[2022-05-17 23:47:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:47:18] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2022-05-17 23:47:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:47:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:47:18] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 4 ms returned sat
[2022-05-17 23:47:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:47:18] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2022-05-17 23:47:18] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:47:18] [INFO ] [Nat]Added 1010 Read/Feed constraints in 432 ms returned sat
[2022-05-17 23:47:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 142 ms.
[2022-05-17 23:47:19] [INFO ] Added : 0 causal constraints over 0 iterations in 277 ms. Result :sat
Minimization took 1821 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Incomplete Parikh walk after 303700 steps, including 38401 resets, run finished after 1911 ms. (steps per millisecond=158 ) 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 71 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 71 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:47:23] [INFO ] Computed 29 place invariants in 27 ms
[2022-05-17 23:47:23] [INFO ] Implicit Places using invariants in 324 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:47:23] [INFO ] Computed 29 place invariants in 17 ms
[2022-05-17 23:47:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:47:27] [INFO ] Implicit Places using invariants and state equation in 4255 ms returned []
Implicit Place search using SMT with State Equation took 4581 ms to find 0 implicit places.
[2022-05-17 23:47:27] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:47:27] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-17 23:47:28] [INFO ] Dead Transitions using invariants and state equation in 529 ms returned []
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-06 in 35334 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-07
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:47:28] [INFO ] Computed 39 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 1198 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:47:28] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-17 23:47:28] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:47:28] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:47:28] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2022-05-17 23:47:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:47:28] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:47:28] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:47:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:47:29] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2022-05-17 23:47:29] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:47:30] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1502 ms returned sat
[2022-05-17 23:47:30] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 1 ms to minimize.
[2022-05-17 23:47:31] [INFO ] Deduced a trap composed of 80 places in 232 ms of which 0 ms to minimize.
[2022-05-17 23:47:31] [INFO ] Deduced a trap composed of 70 places in 199 ms of which 1 ms to minimize.
[2022-05-17 23:47:31] [INFO ] Deduced a trap composed of 84 places in 198 ms of which 1 ms to minimize.
[2022-05-17 23:47:31] [INFO ] Deduced a trap composed of 77 places in 205 ms of which 0 ms to minimize.
[2022-05-17 23:47:32] [INFO ] Deduced a trap composed of 73 places in 209 ms of which 0 ms to minimize.
[2022-05-17 23:47:32] [INFO ] Deduced a trap composed of 73 places in 205 ms of which 1 ms to minimize.
[2022-05-17 23:47:32] [INFO ] Deduced a trap composed of 69 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:47:33] [INFO ] Deduced a trap composed of 71 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:47:33] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3012 ms
[2022-05-17 23:47:33] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 151 ms.
[2022-05-17 23:47:33] [INFO ] Added : 0 causal constraints over 0 iterations in 154 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [198] Max seen :[2]
Incomplete Parikh walk after 274500 steps, including 33445 resets, run finished after 1847 ms. (steps per millisecond=148 ) properties (out of 1) seen :2 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 71 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:47:35] [INFO ] Computed 39 place invariants in 33 ms
[2022-05-17 23:47:36] [INFO ] Dead Transitions using invariants and state equation in 572 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:47:36] [INFO ] Computed 39 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 119357 resets, run finished after 5946 ms. (steps per millisecond=168 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 9994 resets, run finished after 921 ms. (steps per millisecond=1085 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:47:43] [INFO ] Computed 39 place invariants in 28 ms
[2022-05-17 23:47:43] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:47:43] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:47:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:47:43] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2022-05-17 23:47:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:47:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:47:43] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2022-05-17 23:47:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:47:43] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2022-05-17 23:47:43] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:47:45] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1500 ms returned sat
[2022-05-17 23:47:45] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 1 ms to minimize.
[2022-05-17 23:47:45] [INFO ] Deduced a trap composed of 80 places in 201 ms of which 1 ms to minimize.
[2022-05-17 23:47:46] [INFO ] Deduced a trap composed of 70 places in 205 ms of which 0 ms to minimize.
[2022-05-17 23:47:46] [INFO ] Deduced a trap composed of 84 places in 207 ms of which 1 ms to minimize.
[2022-05-17 23:47:46] [INFO ] Deduced a trap composed of 77 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:47:47] [INFO ] Deduced a trap composed of 73 places in 210 ms of which 1 ms to minimize.
[2022-05-17 23:47:47] [INFO ] Deduced a trap composed of 73 places in 205 ms of which 0 ms to minimize.
[2022-05-17 23:47:47] [INFO ] Deduced a trap composed of 69 places in 207 ms of which 2 ms to minimize.
[2022-05-17 23:47:48] [INFO ] Deduced a trap composed of 71 places in 205 ms of which 0 ms to minimize.
[2022-05-17 23:47:48] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3041 ms
[2022-05-17 23:47:48] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 150 ms.
[2022-05-17 23:47:48] [INFO ] Added : 0 causal constraints over 0 iterations in 275 ms. Result :sat
Minimization took 3000 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 82 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 70 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:47:51] [INFO ] Computed 39 place invariants in 28 ms
[2022-05-17 23:47:52] [INFO ] Implicit Places using invariants in 324 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:47:52] [INFO ] Computed 39 place invariants in 21 ms
[2022-05-17 23:47:52] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:47:58] [INFO ] Implicit Places using invariants and state equation in 5736 ms returned []
Implicit Place search using SMT with State Equation took 6064 ms to find 0 implicit places.
[2022-05-17 23:47:58] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:47:58] [INFO ] Computed 39 place invariants in 26 ms
[2022-05-17 23:47:58] [INFO ] Dead Transitions using invariants and state equation in 555 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 30275 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-08
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:47:58] [INFO ] Computed 39 place invariants in 27 ms
Incomplete random walk after 10000 steps, including 1186 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 71 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:47:58] [INFO ] Computed 39 place invariants in 26 ms
[2022-05-17 23:47:58] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:47:58] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:47:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:47:59] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2022-05-17 23:47:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:47:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:47:59] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:47:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:47:59] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2022-05-17 23:47:59] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:48:00] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1576 ms returned sat
[2022-05-17 23:48:01] [INFO ] Deduced a trap composed of 82 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:48:01] [INFO ] Deduced a trap composed of 88 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:48:02] [INFO ] Deduced a trap composed of 84 places in 210 ms of which 1 ms to minimize.
[2022-05-17 23:48:02] [INFO ] Deduced a trap composed of 85 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:48:02] [INFO ] Deduced a trap composed of 83 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:48:03] [INFO ] Deduced a trap composed of 85 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:48:03] [INFO ] Deduced a trap composed of 91 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:48:03] [INFO ] Deduced a trap composed of 95 places in 250 ms of which 0 ms to minimize.
[2022-05-17 23:48:04] [INFO ] Deduced a trap composed of 90 places in 230 ms of which 0 ms to minimize.
[2022-05-17 23:48:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 145 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:48:04] [INFO ] Computed 39 place invariants in 31 ms
[2022-05-17 23:48:04] [INFO ] Dead Transitions using invariants and state equation in 552 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:48:04] [INFO ] Computed 39 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 119315 resets, run finished after 6016 ms. (steps per millisecond=166 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7462 resets, run finished after 863 ms. (steps per millisecond=1158 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:48:11] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-17 23:48:11] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:48:11] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2022-05-17 23:48:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:12] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2022-05-17 23:48:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:48:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:48:12] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:48:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:12] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2022-05-17 23:48:12] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:48:12] [INFO ] [Nat]Added 1010 Read/Feed constraints in 507 ms returned sat
[2022-05-17 23:48:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 147 ms.
[2022-05-17 23:48:13] [INFO ] Added : 0 causal constraints over 0 iterations in 293 ms. Result :sat
Minimization took 1480 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Incomplete Parikh walk after 141800 steps, including 17911 resets, run finished after 859 ms. (steps per millisecond=165 ) 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 72 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 76 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:48:15] [INFO ] Computed 39 place invariants in 32 ms
[2022-05-17 23:48:16] [INFO ] Implicit Places using invariants in 378 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 380 ms to find 10 implicit places.
[2022-05-17 23:48:16] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:48:16] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-17 23:48:16] [INFO ] Dead Transitions using invariants and state equation in 548 ms returned []
Starting structural reductions, iteration 1 : 150/160 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.
[2022-05-17 23:48:16] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:48:16] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-17 23:48:17] [INFO ] Dead Transitions using invariants and state equation in 531 ms returned []
Finished structural reductions, in 2 iterations. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:48:17] [INFO ] Computed 29 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 119223 resets, run finished after 5716 ms. (steps per millisecond=174 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7462 resets, run finished after 811 ms. (steps per millisecond=1233 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:48:24] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-17 23:48:24] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:48:24] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 5 ms returned sat
[2022-05-17 23:48:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:24] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2022-05-17 23:48:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:48:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:48:24] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 5 ms returned sat
[2022-05-17 23:48:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:24] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2022-05-17 23:48:24] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:48:25] [INFO ] [Nat]Added 1010 Read/Feed constraints in 456 ms returned sat
[2022-05-17 23:48:25] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 139 ms.
[2022-05-17 23:48:25] [INFO ] Added : 0 causal constraints over 0 iterations in 273 ms. Result :sat
Minimization took 1853 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Incomplete Parikh walk after 208100 steps, including 26233 resets, run finished after 1321 ms. (steps per millisecond=157 ) 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 70 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 70 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:48:28] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-17 23:48:29] [INFO ] Implicit Places using invariants in 306 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:48:29] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-17 23:48:29] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:48:33] [INFO ] Implicit Places using invariants and state equation in 3976 ms returned []
Implicit Place search using SMT with State Equation took 4283 ms to find 0 implicit places.
[2022-05-17 23:48:33] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:48:33] [INFO ] Computed 29 place invariants in 23 ms
[2022-05-17 23:48:33] [INFO ] Dead Transitions using invariants and state equation in 528 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 35042 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-09
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:48:33] [INFO ] Computed 39 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 1187 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:48:33] [INFO ] Computed 39 place invariants in 31 ms
[2022-05-17 23:48:33] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:48:33] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:48:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:34] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2022-05-17 23:48:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:48:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:48:34] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 5 ms returned sat
[2022-05-17 23:48:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:34] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2022-05-17 23:48:34] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:48:35] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1286 ms returned sat
[2022-05-17 23:48:35] [INFO ] Deduced a trap composed of 75 places in 197 ms of which 0 ms to minimize.
[2022-05-17 23:48:36] [INFO ] Deduced a trap composed of 76 places in 202 ms of which 0 ms to minimize.
[2022-05-17 23:48:36] [INFO ] Deduced a trap composed of 77 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:48:36] [INFO ] Deduced a trap composed of 84 places in 208 ms of which 1 ms to minimize.
[2022-05-17 23:48:37] [INFO ] Deduced a trap composed of 75 places in 207 ms of which 0 ms to minimize.
[2022-05-17 23:48:37] [INFO ] Deduced a trap composed of 76 places in 207 ms of which 0 ms to minimize.
[2022-05-17 23:48:37] [INFO ] Deduced a trap composed of 72 places in 197 ms of which 0 ms to minimize.
[2022-05-17 23:48:37] [INFO ] Deduced a trap composed of 69 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:48:38] [INFO ] Deduced a trap composed of 72 places in 211 ms of which 1 ms to minimize.
[2022-05-17 23:48:39] [INFO ] Deduced a trap composed of 79 places in 201 ms of which 0 ms to minimize.
[2022-05-17 23:48:39] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3359 ms
[2022-05-17 23:48:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:671)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [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 143 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:48:39] [INFO ] Computed 39 place invariants in 31 ms
[2022-05-17 23:48:39] [INFO ] Dead Transitions using invariants and state equation in 543 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:48:39] [INFO ] Computed 39 place invariants in 26 ms
Incomplete random walk after 1000000 steps, including 119146 resets, run finished after 5818 ms. (steps per millisecond=171 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 10385 resets, run finished after 903 ms. (steps per millisecond=1107 ) properties (out of 1) seen :2
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:48:46] [INFO ] Computed 39 place invariants in 28 ms
[2022-05-17 23:48:46] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:48:46] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 5 ms returned sat
[2022-05-17 23:48:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:46] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2022-05-17 23:48:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:48:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:48:46] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 5 ms returned sat
[2022-05-17 23:48:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:48:47] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2022-05-17 23:48:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:48:47] [INFO ] [Nat]Added 1010 Read/Feed constraints in 492 ms returned sat
[2022-05-17 23:48:47] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 152 ms.
[2022-05-17 23:48:48] [INFO ] Added : 0 causal constraints over 0 iterations in 282 ms. Result :sat
Minimization took 1459 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[2]
Incomplete Parikh walk after 185500 steps, including 23435 resets, run finished after 1098 ms. (steps per millisecond=168 ) 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 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 69 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:48:50] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-17 23:48:51] [INFO ] Implicit Places using invariants in 352 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 355 ms to find 10 implicit places.
[2022-05-17 23:48:51] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:48:51] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-17 23:48:51] [INFO ] Dead Transitions using invariants and state equation in 537 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 151 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:48:51] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-17 23:48:52] [INFO ] Implicit Places using invariants in 321 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:48:52] [INFO ] Computed 29 place invariants in 17 ms
[2022-05-17 23:48:52] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:48:55] [INFO ] Implicit Places using invariants and state equation in 3754 ms returned []
Implicit Place search using SMT with State Equation took 4076 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
[2022-05-17 23:48:55] [INFO ] Computed 29 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 178817 resets, run finished after 7743 ms. (steps per millisecond=129 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 14084 resets, run finished after 788 ms. (steps per millisecond=1269 ) properties (out of 1) seen :2
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:49:04] [INFO ] Computed 29 place invariants in 22 ms
[2022-05-17 23:49:04] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:49:04] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 5 ms returned sat
[2022-05-17 23:49:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:04] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2022-05-17 23:49:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:49:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:49:04] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 4 ms returned sat
[2022-05-17 23:49:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:05] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2022-05-17 23:49:05] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:49:05] [INFO ] [Nat]Added 1010 Read/Feed constraints in 888 ms returned sat
[2022-05-17 23:49:06] [INFO ] Deduced a trap composed of 81 places in 197 ms of which 0 ms to minimize.
[2022-05-17 23:49:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2022-05-17 23:49:06] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 151 ms.
[2022-05-17 23:49:06] [INFO ] Added : 0 causal constraints over 0 iterations in 296 ms. Result :sat
Minimization took 1966 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[2]
Incomplete Parikh walk after 436900 steps, including 75496 resets, run finished after 3620 ms. (steps per millisecond=120 ) 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 71 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 71 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:49:12] [INFO ] Computed 29 place invariants in 23 ms
[2022-05-17 23:49:12] [INFO ] Implicit Places using invariants in 331 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:49:12] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-17 23:49:12] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:49:16] [INFO ] Implicit Places using invariants and state equation in 3971 ms returned []
Implicit Place search using SMT with State Equation took 4304 ms to find 0 implicit places.
[2022-05-17 23:49:16] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:49:16] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-17 23:49:17] [INFO ] Dead Transitions using invariants and state equation in 532 ms returned []
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-09 in 43528 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-10
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:49:17] [INFO ] Computed 39 place invariants in 27 ms
Incomplete random walk after 10000 steps, including 1195 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:49:17] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-17 23:49:17] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:49:17] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:49:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:17] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2022-05-17 23:49:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:49:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:49:17] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2022-05-17 23:49:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:18] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2022-05-17 23:49:18] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:49:19] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1359 ms returned sat
[2022-05-17 23:49:19] [INFO ] Deduced a trap composed of 75 places in 233 ms of which 0 ms to minimize.
[2022-05-17 23:49:19] [INFO ] Deduced a trap composed of 76 places in 203 ms of which 0 ms to minimize.
[2022-05-17 23:49:20] [INFO ] Deduced a trap composed of 77 places in 208 ms of which 1 ms to minimize.
[2022-05-17 23:49:20] [INFO ] Deduced a trap composed of 84 places in 206 ms of which 1 ms to minimize.
[2022-05-17 23:49:20] [INFO ] Deduced a trap composed of 75 places in 209 ms of which 0 ms to minimize.
[2022-05-17 23:49:20] [INFO ] Deduced a trap composed of 76 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:49:21] [INFO ] Deduced a trap composed of 72 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:49:21] [INFO ] Deduced a trap composed of 69 places in 203 ms of which 0 ms to minimize.
[2022-05-17 23:49:21] [INFO ] Deduced a trap composed of 72 places in 202 ms of which 1 ms to minimize.
[2022-05-17 23:49:22] [INFO ] Deduced a trap composed of 79 places in 205 ms of which 0 ms to minimize.
[2022-05-17 23:49:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 153 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:49:22] [INFO ] Computed 39 place invariants in 27 ms
[2022-05-17 23:49:23] [INFO ] Dead Transitions using invariants and state equation in 548 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:49:23] [INFO ] Computed 39 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 119273 resets, run finished after 5921 ms. (steps per millisecond=168 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 10371 resets, run finished after 917 ms. (steps per millisecond=1090 ) properties (out of 1) seen :2
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:49:30] [INFO ] Computed 39 place invariants in 31 ms
[2022-05-17 23:49:30] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:49:30] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:30] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2022-05-17 23:49:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:49:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:49:30] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:49:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:30] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2022-05-17 23:49:30] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:49:31] [INFO ] [Nat]Added 1010 Read/Feed constraints in 485 ms returned sat
[2022-05-17 23:49:31] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 165 ms.
[2022-05-17 23:49:31] [INFO ] Added : 0 causal constraints over 0 iterations in 297 ms. Result :sat
Minimization took 1568 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[2]
Incomplete Parikh walk after 185500 steps, including 23501 resets, run finished after 1122 ms. (steps per millisecond=165 ) 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 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 71 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:49:34] [INFO ] Computed 39 place invariants in 24 ms
[2022-05-17 23:49:34] [INFO ] Implicit Places using invariants in 353 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 354 ms to find 10 implicit places.
[2022-05-17 23:49:35] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:49:35] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-17 23:49:35] [INFO ] Dead Transitions using invariants and state equation in 538 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 147 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:49:35] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-17 23:49:36] [INFO ] Implicit Places using invariants in 330 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:49:36] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-17 23:49:36] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:49:39] [INFO ] Implicit Places using invariants and state equation in 3653 ms returned []
Implicit Place search using SMT with State Equation took 3985 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
[2022-05-17 23:49:39] [INFO ] Computed 29 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 178753 resets, run finished after 7721 ms. (steps per millisecond=129 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 14084 resets, run finished after 786 ms. (steps per millisecond=1272 ) properties (out of 1) seen :2
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:49:48] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-17 23:49:48] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:49:48] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 4 ms returned sat
[2022-05-17 23:49:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:48] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2022-05-17 23:49:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:49:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:49:48] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 5 ms returned sat
[2022-05-17 23:49:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:48] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2022-05-17 23:49:48] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:49:49] [INFO ] [Nat]Added 1010 Read/Feed constraints in 853 ms returned sat
[2022-05-17 23:49:49] [INFO ] Deduced a trap composed of 81 places in 196 ms of which 0 ms to minimize.
[2022-05-17 23:49:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2022-05-17 23:49:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 148 ms.
[2022-05-17 23:49:50] [INFO ] Added : 0 causal constraints over 0 iterations in 265 ms. Result :sat
Minimization took 1886 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[2]
Incomplete Parikh walk after 436900 steps, including 75452 resets, run finished after 3600 ms. (steps per millisecond=121 ) 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 71 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 71 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:49:55] [INFO ] Computed 29 place invariants in 23 ms
[2022-05-17 23:49:56] [INFO ] Implicit Places using invariants in 350 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:49:56] [INFO ] Computed 29 place invariants in 23 ms
[2022-05-17 23:49:56] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:50:00] [INFO ] Implicit Places using invariants and state equation in 3857 ms returned []
Implicit Place search using SMT with State Equation took 4219 ms to find 0 implicit places.
[2022-05-17 23:50:00] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:50:00] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-17 23:50:00] [INFO ] Dead Transitions using invariants and state equation in 531 ms returned []
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-10 in 43509 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-11
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:50:00] [INFO ] Computed 39 place invariants in 27 ms
Incomplete random walk after 10000 steps, including 1213 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:50:00] [INFO ] Computed 39 place invariants in 29 ms
[2022-05-17 23:50:00] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:50:00] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:50:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:50:01] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2022-05-17 23:50:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:50:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:50:01] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:50:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:50:01] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2022-05-17 23:50:01] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:50:02] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1369 ms returned sat
[2022-05-17 23:50:03] [INFO ] Deduced a trap composed of 75 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:50:03] [INFO ] Deduced a trap composed of 76 places in 215 ms of which 1 ms to minimize.
[2022-05-17 23:50:03] [INFO ] Deduced a trap composed of 77 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:50:04] [INFO ] Deduced a trap composed of 84 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:50:04] [INFO ] Deduced a trap composed of 75 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:50:04] [INFO ] Deduced a trap composed of 76 places in 218 ms of which 1 ms to minimize.
[2022-05-17 23:50:04] [INFO ] Deduced a trap composed of 72 places in 201 ms of which 1 ms to minimize.
[2022-05-17 23:50:05] [INFO ] Deduced a trap composed of 69 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:50:05] [INFO ] Deduced a trap composed of 72 places in 205 ms of which 1 ms to minimize.
[2022-05-17 23:50:06] [INFO ] Deduced a trap composed of 79 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:50:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 144 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:50:06] [INFO ] Computed 39 place invariants in 28 ms
[2022-05-17 23:50:07] [INFO ] Dead Transitions using invariants and state equation in 563 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:50:07] [INFO ] Computed 39 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 119442 resets, run finished after 5958 ms. (steps per millisecond=167 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 10370 resets, run finished after 919 ms. (steps per millisecond=1088 ) properties (out of 1) seen :2
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:50:14] [INFO ] Computed 39 place invariants in 29 ms
[2022-05-17 23:50:14] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:50:14] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:50:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:50:14] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2022-05-17 23:50:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:50:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:50:14] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2022-05-17 23:50:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:50:14] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2022-05-17 23:50:14] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:50:15] [INFO ] [Nat]Added 1010 Read/Feed constraints in 545 ms returned sat
[2022-05-17 23:50:15] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 172 ms.
[2022-05-17 23:50:15] [INFO ] Added : 0 causal constraints over 0 iterations in 316 ms. Result :sat
Minimization took 1700 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[2]
Incomplete Parikh walk after 185500 steps, including 23463 resets, run finished after 1142 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 71 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
[2022-05-17 23:50:18] [INFO ] Computed 39 place invariants in 28 ms
[2022-05-17 23:50:18] [INFO ] Implicit Places using invariants in 365 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 367 ms to find 10 implicit places.
[2022-05-17 23:50:18] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:50:18] [INFO ] Computed 29 place invariants in 17 ms
[2022-05-17 23:50:19] [INFO ] Dead Transitions using invariants and state equation in 542 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 157 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:50:19] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-17 23:50:20] [INFO ] Implicit Places using invariants in 329 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:50:20] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-17 23:50:20] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:50:23] [INFO ] Implicit Places using invariants and state equation in 3932 ms returned []
Implicit Place search using SMT with State Equation took 4262 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
[2022-05-17 23:50:23] [INFO ] Computed 29 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 179058 resets, run finished after 7808 ms. (steps per millisecond=128 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 14084 resets, run finished after 790 ms. (steps per millisecond=1265 ) properties (out of 1) seen :2
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:50:32] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-17 23:50:32] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:50:32] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 4 ms returned sat
[2022-05-17 23:50:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:50:32] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2022-05-17 23:50:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:50:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:50:32] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 4 ms returned sat
[2022-05-17 23:50:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:50:33] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2022-05-17 23:50:33] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:50:34] [INFO ] [Nat]Added 1010 Read/Feed constraints in 903 ms returned sat
[2022-05-17 23:50:34] [INFO ] Deduced a trap composed of 81 places in 198 ms of which 0 ms to minimize.
[2022-05-17 23:50:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2022-05-17 23:50:34] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 151 ms.
[2022-05-17 23:50:34] [INFO ] Added : 0 causal constraints over 0 iterations in 267 ms. Result :sat
Minimization took 1915 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[2]
Incomplete Parikh walk after 436900 steps, including 75483 resets, run finished after 3680 ms. (steps per millisecond=118 ) 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 72 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 72 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:50:40] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-17 23:50:40] [INFO ] Implicit Places using invariants in 354 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:50:40] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-17 23:50:41] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:50:45] [INFO ] Implicit Places using invariants and state equation in 4287 ms returned []
Implicit Place search using SMT with State Equation took 4643 ms to find 0 implicit places.
[2022-05-17 23:50:45] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:50:45] [INFO ] Computed 29 place invariants in 23 ms
[2022-05-17 23:50:45] [INFO ] Dead Transitions using invariants and state equation in 540 ms returned []
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-11 in 44946 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-12
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:50:45] [INFO ] Computed 39 place invariants in 21 ms
Incomplete random walk after 10000 steps, including 1196 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:50:45] [INFO ] Computed 39 place invariants in 31 ms
[2022-05-17 23:50:45] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:50:45] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2022-05-17 23:50:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:50:46] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2022-05-17 23:50:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:50:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:50:46] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:50:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:50:46] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2022-05-17 23:50:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:50:47] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1377 ms returned sat
[2022-05-17 23:50:48] [INFO ] Deduced a trap composed of 75 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:50:48] [INFO ] Deduced a trap composed of 76 places in 214 ms of which 1 ms to minimize.
[2022-05-17 23:50:48] [INFO ] Deduced a trap composed of 77 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:50:49] [INFO ] Deduced a trap composed of 84 places in 274 ms of which 0 ms to minimize.
[2022-05-17 23:50:49] [INFO ] Deduced a trap composed of 75 places in 213 ms of which 1 ms to minimize.
[2022-05-17 23:50:49] [INFO ] Deduced a trap composed of 76 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:50:49] [INFO ] Deduced a trap composed of 72 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:50:50] [INFO ] Deduced a trap composed of 69 places in 206 ms of which 0 ms to minimize.
[2022-05-17 23:50:50] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 1 ms to minimize.
[2022-05-17 23:50:51] [INFO ] Deduced a trap composed of 79 places in 202 ms of which 1 ms to minimize.
[2022-05-17 23:50:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 144 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:50:51] [INFO ] Computed 39 place invariants in 29 ms
[2022-05-17 23:50:52] [INFO ] Dead Transitions using invariants and state equation in 545 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:50:52] [INFO ] Computed 39 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 119343 resets, run finished after 5944 ms. (steps per millisecond=168 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 10351 resets, run finished after 917 ms. (steps per millisecond=1090 ) properties (out of 1) seen :2
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:50:58] [INFO ] Computed 39 place invariants in 27 ms
[2022-05-17 23:50:58] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:50:59] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:50:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:50:59] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2022-05-17 23:50:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:50:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:50:59] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 9 ms returned sat
[2022-05-17 23:50:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:50:59] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2022-05-17 23:50:59] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:51:00] [INFO ] [Nat]Added 1010 Read/Feed constraints in 511 ms returned sat
[2022-05-17 23:51:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 143 ms.
[2022-05-17 23:51:00] [INFO ] Added : 0 causal constraints over 0 iterations in 306 ms. Result :sat
Minimization took 1578 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[2]
Incomplete Parikh walk after 185500 steps, including 23433 resets, run finished after 1145 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 71 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 71 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:51:03] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-17 23:51:03] [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 358 ms to find 10 implicit places.
[2022-05-17 23:51:03] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:51:03] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-17 23:51:04] [INFO ] Dead Transitions using invariants and state equation in 535 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 145 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:51:04] [INFO ] Computed 29 place invariants in 28 ms
[2022-05-17 23:51:04] [INFO ] Implicit Places using invariants in 355 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:51:04] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-17 23:51:05] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:51:08] [INFO ] Implicit Places using invariants and state equation in 3864 ms returned []
Implicit Place search using SMT with State Equation took 4221 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
[2022-05-17 23:51:08] [INFO ] Computed 29 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 178830 resets, run finished after 7713 ms. (steps per millisecond=129 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 14084 resets, run finished after 785 ms. (steps per millisecond=1273 ) properties (out of 1) seen :2
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:51:17] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-17 23:51:17] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:51:17] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 4 ms returned sat
[2022-05-17 23:51:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:51:17] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2022-05-17 23:51:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:51:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:51:17] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 4 ms returned sat
[2022-05-17 23:51:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:51:17] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2022-05-17 23:51:17] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:51:18] [INFO ] [Nat]Added 1010 Read/Feed constraints in 851 ms returned sat
[2022-05-17 23:51:18] [INFO ] Deduced a trap composed of 81 places in 185 ms of which 1 ms to minimize.
[2022-05-17 23:51:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2022-05-17 23:51:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 149 ms.
[2022-05-17 23:51:19] [INFO ] Added : 0 causal constraints over 0 iterations in 268 ms. Result :sat
Minimization took 1853 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[2]
Incomplete Parikh walk after 436900 steps, including 75421 resets, run finished after 3601 ms. (steps per millisecond=121 ) 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 72 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 71 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:51:24] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-17 23:51:25] [INFO ] Implicit Places using invariants in 323 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:51:25] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-17 23:51:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:51:29] [INFO ] Implicit Places using invariants and state equation in 4098 ms returned []
Implicit Place search using SMT with State Equation took 4423 ms to find 0 implicit places.
[2022-05-17 23:51:29] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:51:29] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-17 23:51:29] [INFO ] Dead Transitions using invariants and state equation in 528 ms returned []
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-12 in 44186 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-13
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:51:29] [INFO ] Computed 39 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 1198 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:51:29] [INFO ] Computed 39 place invariants in 32 ms
[2022-05-17 23:51:29] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:51:29] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:51:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:51:30] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2022-05-17 23:51:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:51:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:51:30] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2022-05-17 23:51:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:51:30] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2022-05-17 23:51:30] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:51:31] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1253 ms returned sat
[2022-05-17 23:51:32] [INFO ] Deduced a trap composed of 82 places in 223 ms of which 1 ms to minimize.
[2022-05-17 23:51:32] [INFO ] Deduced a trap composed of 52 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:51:32] [INFO ] Deduced a trap composed of 54 places in 211 ms of which 0 ms to minimize.
[2022-05-17 23:51:33] [INFO ] Deduced a trap composed of 92 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:51:33] [INFO ] Deduced a trap composed of 62 places in 274 ms of which 0 ms to minimize.
[2022-05-17 23:51:33] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 1 ms to minimize.
[2022-05-17 23:51:34] [INFO ] Deduced a trap composed of 74 places in 229 ms of which 0 ms to minimize.
[2022-05-17 23:51:34] [INFO ] Deduced a trap composed of 77 places in 223 ms of which 1 ms to minimize.
[2022-05-17 23:51:34] [INFO ] Deduced a trap composed of 58 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:51:35] [INFO ] Deduced a trap composed of 73 places in 217 ms of which 1 ms to minimize.
[2022-05-17 23:51:35] [INFO ] Deduced a trap composed of 59 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:51:35] [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 145 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:51:35] [INFO ] Computed 39 place invariants in 32 ms
[2022-05-17 23:51:36] [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
[2022-05-17 23:51:36] [INFO ] Computed 39 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 119357 resets, run finished after 6055 ms. (steps per millisecond=165 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9739 resets, run finished after 981 ms. (steps per millisecond=1019 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:51:43] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-17 23:51:43] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:51:43] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 11 ms returned sat
[2022-05-17 23:51:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:51:43] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2022-05-17 23:51:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:51:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-05-17 23:51:43] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:51:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:51:43] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2022-05-17 23:51:43] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:51:44] [INFO ] [Nat]Added 1010 Read/Feed constraints in 385 ms returned sat
[2022-05-17 23:51:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 168 ms.
[2022-05-17 23:51:44] [INFO ] Added : 0 causal constraints over 0 iterations in 299 ms. Result :sat
Minimization took 1175 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Incomplete Parikh walk after 88000 steps, including 11091 resets, run finished after 518 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 71 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 71 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:51:46] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-17 23:51:46] [INFO ] Implicit Places using invariants in 385 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 388 ms to find 10 implicit places.
[2022-05-17 23:51:46] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:51:46] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-17 23:51:47] [INFO ] Dead Transitions using invariants and state equation in 534 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 72 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2022-05-17 23:51:47] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:51:47] [INFO ] Computed 29 place invariants in 23 ms
[2022-05-17 23:51:47] [INFO ] Dead Transitions using invariants and state equation in 522 ms returned []
Finished structural reductions, in 2 iterations. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:51:47] [INFO ] Computed 29 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 119384 resets, run finished after 5758 ms. (steps per millisecond=173 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9739 resets, run finished after 944 ms. (steps per millisecond=1059 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:51:54] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-17 23:51:54] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:51:54] [INFO ] [Real]Absence check using 9 positive and 20 generalized place invariants in 5 ms returned sat
[2022-05-17 23:51:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:51:54] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2022-05-17 23:51:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:51:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:51:54] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 8 ms returned sat
[2022-05-17 23:51:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:51:55] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2022-05-17 23:51:55] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:51:55] [INFO ] [Nat]Added 1010 Read/Feed constraints in 430 ms returned sat
[2022-05-17 23:51:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 141 ms.
[2022-05-17 23:51:55] [INFO ] Added : 0 causal constraints over 0 iterations in 273 ms. Result :sat
Minimization took 1825 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[4]
Incomplete Parikh walk after 303700 steps, including 38369 resets, run finished after 1907 ms. (steps per millisecond=159 ) 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 71 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 72 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:51:59] [INFO ] Computed 29 place invariants in 23 ms
[2022-05-17 23:52:00] [INFO ] Implicit Places using invariants in 318 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:52:00] [INFO ] Computed 29 place invariants in 17 ms
[2022-05-17 23:52:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:52:05] [INFO ] Implicit Places using invariants and state equation in 5262 ms returned []
Implicit Place search using SMT with State Equation took 5583 ms to find 0 implicit places.
[2022-05-17 23:52:05] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:52:05] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-17 23:52:06] [INFO ] Dead Transitions using invariants and state equation in 543 ms returned []
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-13 in 36189 ms.
Starting property specific reduction for PhilosophersDyn-COL-10-UpperBounds-14
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:52:06] [INFO ] Computed 39 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 1189 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:52:06] [INFO ] Computed 39 place invariants in 28 ms
[2022-05-17 23:52:06] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:52:06] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:52:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:52:06] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2022-05-17 23:52:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:52:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:52:06] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 10 ms returned sat
[2022-05-17 23:52:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:52:06] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2022-05-17 23:52:06] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:52:08] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1556 ms returned sat
[2022-05-17 23:52:08] [INFO ] Deduced a trap composed of 72 places in 197 ms of which 0 ms to minimize.
[2022-05-17 23:52:08] [INFO ] Deduced a trap composed of 80 places in 206 ms of which 1 ms to minimize.
[2022-05-17 23:52:09] [INFO ] Deduced a trap composed of 70 places in 209 ms of which 0 ms to minimize.
[2022-05-17 23:52:09] [INFO ] Deduced a trap composed of 84 places in 208 ms of which 1 ms to minimize.
[2022-05-17 23:52:09] [INFO ] Deduced a trap composed of 77 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:52:10] [INFO ] Deduced a trap composed of 73 places in 209 ms of which 1 ms to minimize.
[2022-05-17 23:52:10] [INFO ] Deduced a trap composed of 73 places in 203 ms of which 1 ms to minimize.
[2022-05-17 23:52:10] [INFO ] Deduced a trap composed of 69 places in 205 ms of which 0 ms to minimize.
[2022-05-17 23:52:11] [INFO ] Deduced a trap composed of 71 places in 203 ms of which 0 ms to minimize.
[2022-05-17 23:52:11] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3103 ms
[2022-05-17 23:52:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:671)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [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 88 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:52:11] [INFO ] Computed 39 place invariants in 27 ms
[2022-05-17 23:52:12] [INFO ] Dead Transitions using invariants and state equation in 558 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:52:12] [INFO ] Computed 39 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 119629 resets, run finished after 5896 ms. (steps per millisecond=169 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 10004 resets, run finished after 921 ms. (steps per millisecond=1085 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:52:19] [INFO ] Computed 39 place invariants in 28 ms
[2022-05-17 23:52:19] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 23:52:19] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 6 ms returned sat
[2022-05-17 23:52:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:52:19] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2022-05-17 23:52:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:52:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-17 23:52:19] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2022-05-17 23:52:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:52:19] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2022-05-17 23:52:19] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:52:21] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1500 ms returned sat
[2022-05-17 23:52:21] [INFO ] Deduced a trap composed of 72 places in 209 ms of which 1 ms to minimize.
[2022-05-17 23:52:21] [INFO ] Deduced a trap composed of 80 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:52:22] [INFO ] Deduced a trap composed of 70 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:52:22] [INFO ] Deduced a trap composed of 84 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:52:22] [INFO ] Deduced a trap composed of 77 places in 206 ms of which 0 ms to minimize.
[2022-05-17 23:52:22] [INFO ] Deduced a trap composed of 73 places in 205 ms of which 1 ms to minimize.
[2022-05-17 23:52:23] [INFO ] Deduced a trap composed of 73 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:52:23] [INFO ] Deduced a trap composed of 69 places in 207 ms of which 1 ms to minimize.
[2022-05-17 23:52:24] [INFO ] Deduced a trap composed of 71 places in 201 ms of which 0 ms to minimize.
[2022-05-17 23:52:24] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3030 ms
[2022-05-17 23:52:24] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 182 ms.
[2022-05-17 23:52:24] [INFO ] Added : 0 causal constraints over 0 iterations in 291 ms. Result :sat
Minimization took 3000 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 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 70 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:52:27] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-17 23:52:28] [INFO ] Implicit Places using invariants in 333 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:52:28] [INFO ] Computed 39 place invariants in 40 ms
[2022-05-17 23:52:28] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:52:33] [INFO ] Implicit Places using invariants and state equation in 5905 ms returned []
Implicit Place search using SMT with State Equation took 6240 ms to find 0 implicit places.
[2022-05-17 23:52:34] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:52:34] [INFO ] Computed 39 place invariants in 21 ms
[2022-05-17 23:52:34] [INFO ] Dead Transitions using invariants and state equation in 550 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-COL-10-UpperBounds-14 in 28564 ms.
[2022-05-17 23:52:34] [INFO ] Flatten gal took : 268 ms
[2022-05-17 23:52:35] [INFO ] Applying decomposition
[2022-05-17 23:52:35] [INFO ] Flatten gal took : 181 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/graph12057385923892559390.txt, -o, /tmp/graph12057385923892559390.bin, -w, /tmp/graph12057385923892559390.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/graph12057385923892559390.bin, -l, -1, -v, -w, /tmp/graph12057385923892559390.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-17 23:52:35] [INFO ] Decomposing Gal with order
[2022-05-17 23:52:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 23:52:36] [INFO ] Removed a total of 2660 redundant transitions.
[2022-05-17 23:52:36] [INFO ] Flatten gal took : 644 ms
[2022-05-17 23:52:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2022-05-17 23:52:36] [INFO ] Time to serialize gal into /tmp/UpperBounds7638004269289373647.gal : 18 ms
[2022-05-17 23:52:36] [INFO ] Time to serialize properties into /tmp/UpperBounds3279223023196831102.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/UpperBounds7638004269289373647.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds3279223023196831102.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/UpperBounds7638004269289373647.gal -t CGAL -reachable-file /tmp/UpperBounds3279223023196831102.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds3279223023196831102.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,181.602,2408996,2,232442,5,3.06704e+06,6,0,2588,924348,0
Total reachable state count : 199051
Verifying 15 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-10-UpperBounds-00 :0 <= gu0.HasLeft_0+gu1.HasLeft_1+gu7.HasLeft_2+gu2.HasLeft_3+gu3.HasLeft_4+gu4.HasLeft_5+gu8.HasLeft_6+gu9.HasLeft_7+gu5.HasLeft_8+gu6.HasLeft_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,181.892,2408996,1,0,7,3.06704e+06,9,1,3104,924348,4
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-COL-10-UpperBounds-01 :0 <= gu0.Think_0+gu1.Think_1+gu7.Think_2+gu2.Think_3+gu3.Think_4+gu4.Think_5+gu8.Think_6+gu9.Think_7+gu5.Think_8+gu6.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,182.145,2408996,1,0,8,3.06704e+06,10,1,3402,924348,5
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-COL-10-UpperBounds-02 :0 <= gu0.Think_0+gu1.Think_1+gu7.Think_2+gu2.Think_3+gu3.Think_4+gu4.Think_5+gu8.Think_6+gu9.Think_7+gu5.Think_8+gu6.Think_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,182.145,2408996,1,0,8,3.06704e+06,10,1,3402,924348,5
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-COL-10-UpperBounds-03 :0 <= gu0.Neighbourhood_0+gu0.Neighbourhood_1+gu0.Neighbourhood_2+gu0.Neighbourhood_3+gu0.Neighbourhood_4+gu0.Neighbourhood_5+gu0.Neighbourhood_6+gu0.Neighbourhood_7+gu0.Neighbourhood_8+gu0.Neighbourhood_9+gu1.Neighbourhood_10+gu1.Neighbourhood_11+gu1.Neighbourhood_12+gu1.Neighbourhood_13+gu1.Neighbourhood_14+gu1.Neighbourhood_15+gu1.Neighbourhood_16+gu1.Neighbourhood_17+gu1.Neighbourhood_18+gu1.Neighbourhood_19+gu7.Neighbourhood_20+gu7.Neighbourhood_21+gu7.Neighbourhood_22+gu7.Neighbourhood_23+gu7.Neighbourhood_24+gu7.Neighbourhood_25+gu7.Neighbourhood_26+gu7.Neighbourhood_27+gu7.Neighbourhood_28+gu7.Neighbourhood_29+gu2.Neighbourhood_30+gu2.Neighbourhood_31+gu2.Neighbourhood_32+gu2.Neighbourhood_33+gu2.Neighbourhood_34+gu2.Neighbourhood_35+gu2.Neighbourhood_36+gu2.Neighbourhood_37+gu2.Neighbourhood_38+gu2.Neighbourhood_39+gu3.Neighbourhood_40+gu3.Neighbourhood_41+gu3.Neighbourhood_42+gu3.Neighbourhood_43+gu3.Neighbourhood_44+gu3.Neighbourhood_45+gu3.Neighbourhood_46+gu3.Neighbourhood_47+gu3.Neighbourhood_48+gu3.Neighbourhood_49+gu4.Neighbourhood_50+gu4.Neighbourhood_51+gu4.Neighbourhood_52+gu4.Neighbourhood_53+gu4.Neighbourhood_54+gu4.Neighbourhood_55+gu4.Neighbourhood_56+gu4.Neighbourhood_57+gu4.Neighbourhood_58+gu4.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+gu9.Neighbourhood_70+gu9.Neighbourhood_71+gu9.Neighbourhood_72+gu9.Neighbourhood_73+gu9.Neighbourhood_74+gu9.Neighbourhood_75+gu9.Neighbourhood_76+gu9.Neighbourhood_77+gu9.Neighbourhood_78+gu9.Neighbourhood_79+gu5.Neighbourhood_80+gu5.Neighbourhood_81+gu5.Neighbourhood_82+gu5.Neighbourhood_83+gu5.Neighbourhood_84+gu5.Neighbourhood_85+gu5.Neighbourhood_86+gu5.Neighbourhood_87+gu5.Neighbourhood_88+gu5.Neighbourhood_89+gu6.Neighbourhood_90+gu6.Neighbourhood_91+gu6.Neighbourhood_92+gu6.Neighbourhood_93+gu6.Neighbourhood_94+gu6.Neighbourhood_95+gu6.Neighbourhood_96+gu6.Neighbourhood_97+gu6.Neighbourhood_98+gu6.Neighbourhood_99 <= 4
FORMULA PhilosophersDyn-COL-10-UpperBounds-03 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-03,0,182.442,2408996,1,0,9,3.06704e+06,11,1,3820,924348,6
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-COL-10-UpperBounds-04 :0 <= gu0.Neighbourhood_0+gu0.Neighbourhood_1+gu0.Neighbourhood_2+gu0.Neighbourhood_3+gu0.Neighbourhood_4+gu0.Neighbourhood_5+gu0.Neighbourhood_6+gu0.Neighbourhood_7+gu0.Neighbourhood_8+gu0.Neighbourhood_9+gu1.Neighbourhood_10+gu1.Neighbourhood_11+gu1.Neighbourhood_12+gu1.Neighbourhood_13+gu1.Neighbourhood_14+gu1.Neighbourhood_15+gu1.Neighbourhood_16+gu1.Neighbourhood_17+gu1.Neighbourhood_18+gu1.Neighbourhood_19+gu7.Neighbourhood_20+gu7.Neighbourhood_21+gu7.Neighbourhood_22+gu7.Neighbourhood_23+gu7.Neighbourhood_24+gu7.Neighbourhood_25+gu7.Neighbourhood_26+gu7.Neighbourhood_27+gu7.Neighbourhood_28+gu7.Neighbourhood_29+gu2.Neighbourhood_30+gu2.Neighbourhood_31+gu2.Neighbourhood_32+gu2.Neighbourhood_33+gu2.Neighbourhood_34+gu2.Neighbourhood_35+gu2.Neighbourhood_36+gu2.Neighbourhood_37+gu2.Neighbourhood_38+gu2.Neighbourhood_39+gu3.Neighbourhood_40+gu3.Neighbourhood_41+gu3.Neighbourhood_42+gu3.Neighbourhood_43+gu3.Neighbourhood_44+gu3.Neighbourhood_45+gu3.Neighbourhood_46+gu3.Neighbourhood_47+gu3.Neighbourhood_48+gu3.Neighbourhood_49+gu4.Neighbourhood_50+gu4.Neighbourhood_51+gu4.Neighbourhood_52+gu4.Neighbourhood_53+gu4.Neighbourhood_54+gu4.Neighbourhood_55+gu4.Neighbourhood_56+gu4.Neighbourhood_57+gu4.Neighbourhood_58+gu4.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+gu9.Neighbourhood_70+gu9.Neighbourhood_71+gu9.Neighbourhood_72+gu9.Neighbourhood_73+gu9.Neighbourhood_74+gu9.Neighbourhood_75+gu9.Neighbourhood_76+gu9.Neighbourhood_77+gu9.Neighbourhood_78+gu9.Neighbourhood_79+gu5.Neighbourhood_80+gu5.Neighbourhood_81+gu5.Neighbourhood_82+gu5.Neighbourhood_83+gu5.Neighbourhood_84+gu5.Neighbourhood_85+gu5.Neighbourhood_86+gu5.Neighbourhood_87+gu5.Neighbourhood_88+gu5.Neighbourhood_89+gu6.Neighbourhood_90+gu6.Neighbourhood_91+gu6.Neighbourhood_92+gu6.Neighbourhood_93+gu6.Neighbourhood_94+gu6.Neighbourhood_95+gu6.Neighbourhood_96+gu6.Neighbourhood_97+gu6.Neighbourhood_98+gu6.Neighbourhood_99 <= 4
FORMULA PhilosophersDyn-COL-10-UpperBounds-04 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-04,0,182.453,2408996,1,0,9,3.06704e+06,11,1,3820,924348,6
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-10-UpperBounds-05 :0 <= gu0.Forks_0+gu1.Forks_1+gu7.Forks_2+gu2.Forks_3+gu3.Forks_4+gu4.Forks_5+gu8.Forks_6+gu9.Forks_7+gu5.Forks_8+gu6.Forks_9 <= 2
FORMULA PhilosophersDyn-COL-10-UpperBounds-05 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-05,0,182.69,2408996,1,0,10,3.06704e+06,12,1,4110,924348,7
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-COL-10-UpperBounds-06 :0 <= gu0.Think_0+gu1.Think_1+gu7.Think_2+gu2.Think_3+gu3.Think_4+gu4.Think_5+gu8.Think_6+gu9.Think_7+gu5.Think_8+gu6.Think_9 <= 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,182.69,2408996,1,0,10,3.06704e+06,12,1,4110,924348,7
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-10-UpperBounds-07 :0 <= gu0.HasLeft_0+gu1.HasLeft_1+gu7.HasLeft_2+gu2.HasLeft_3+gu3.HasLeft_4+gu4.HasLeft_5+gu8.HasLeft_6+gu9.HasLeft_7+gu5.HasLeft_8+gu6.HasLeft_9 <= 2
FORMULA PhilosophersDyn-COL-10-UpperBounds-07 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-07,0,182.691,2408996,1,0,10,3.06704e+06,12,1,4110,924348,7
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-COL-10-UpperBounds-08 :0 <= gu0.WaitRight_0+gu1.WaitRight_1+gu7.WaitRight_2+gu2.WaitRight_3+gu3.WaitRight_4+gu4.WaitRight_5+gu8.WaitRight_6+gu9.WaitRight_7+gu5.WaitRight_8+gu6.WaitRight_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,183.008,2408996,1,0,11,3.06704e+06,13,1,4458,924348,8
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-10-UpperBounds-09 :0 <= gu0.HasRight_0+gu1.HasRight_1+gu7.HasRight_2+gu2.HasRight_3+gu3.HasRight_4+gu4.HasRight_5+gu8.HasRight_6+gu9.HasRight_7+gu5.HasRight_8+gu6.HasRight_9 <= 2
FORMULA PhilosophersDyn-COL-10-UpperBounds-09 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-09,0,183.305,2408996,1,0,12,3.06704e+06,14,1,4804,924348,9
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-10-UpperBounds-10 :0 <= gu0.HasRight_0+gu1.HasRight_1+gu7.HasRight_2+gu2.HasRight_3+gu3.HasRight_4+gu4.HasRight_5+gu8.HasRight_6+gu9.HasRight_7+gu5.HasRight_8+gu6.HasRight_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,183.306,2408996,1,0,12,3.06704e+06,14,1,4804,924348,9
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-10-UpperBounds-11 :0 <= gu0.HasRight_0+gu1.HasRight_1+gu7.HasRight_2+gu2.HasRight_3+gu3.HasRight_4+gu4.HasRight_5+gu8.HasRight_6+gu9.HasRight_7+gu5.HasRight_8+gu6.HasRight_9 <= 2
FORMULA PhilosophersDyn-COL-10-UpperBounds-11 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-11,0,183.307,2408996,1,0,12,3.06704e+06,14,1,4804,924348,9
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-10-UpperBounds-12 :0 <= gu0.HasRight_0+gu1.HasRight_1+gu7.HasRight_2+gu2.HasRight_3+gu3.HasRight_4+gu4.HasRight_5+gu8.HasRight_6+gu9.HasRight_7+gu5.HasRight_8+gu6.HasRight_9 <= 2
FORMULA PhilosophersDyn-COL-10-UpperBounds-12 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-12,0,183.307,2408996,1,0,12,3.06704e+06,14,1,4804,924348,9
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-COL-10-UpperBounds-13 :0 <= gu0.Think_0+gu1.Think_1+gu7.Think_2+gu2.Think_3+gu3.Think_4+gu4.Think_5+gu8.Think_6+gu9.Think_7+gu5.Think_8+gu6.Think_9 <= 4
FORMULA PhilosophersDyn-COL-10-UpperBounds-13 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-13,0,183.308,2408996,1,0,12,3.06704e+06,14,1,4804,924348,9
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-10-UpperBounds-14 :0 <= gu0.HasLeft_0+gu1.HasLeft_1+gu7.HasLeft_2+gu2.HasLeft_3+gu3.HasLeft_4+gu4.HasLeft_5+gu8.HasLeft_6+gu9.HasLeft_7+gu5.HasLeft_8+gu6.HasLeft_9 <= 2
FORMULA PhilosophersDyn-COL-10-UpperBounds-14 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-14,0,183.308,2408996,1,0,12,3.06704e+06,14,1,4804,924348,9
BK_STOP 1652831741463
--------------------
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="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is 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 r179-tall-165277026900142"
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 '
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 ;