About the Execution of 2021-gold for PolyORBNT-COL-S10J20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16240.876 | 3600000.00 | 2906938.00 | 430968.30 | 1 1 1 1 1 1 1 1 4 2 ? ? 3 ? 1 1 | 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-165277027100289.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 PolyORBNT-COL-S10J20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277027100289
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 9.3K Apr 30 04:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 30 04:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 03:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 03:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 92K 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 PolyORBNT-COL-S10J20-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652836980968
Running Version 0
[2022-05-18 01:23:02] [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-18 01:23:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 01:23:02] [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-18 01:23:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 01:23:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 591 ms
[2022-05-18 01:23:03] [INFO ] ms1 symmetric to ms4 in transition trans_489
[2022-05-18 01:23:03] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2022-05-18 01:23:03] [INFO ] ms2 symmetric to ms3 in transition trans_489
[2022-05-18 01:23:03] [INFO ] ms1 symmetric to ms2 in transition trans_488
[2022-05-18 01:23:03] [INFO ] ms2 symmetric to ms3 in transition trans_488
[2022-05-18 01:23:03] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2022-05-18 01:23:03] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-18 01:23:03] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions in 10 ms.
[2022-05-18 01:23:03] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_1276757790184278331.dot
// Phase 1: matrix 38 rows 48 cols
[2022-05-18 01:23:03] [INFO ] Computed 13 place invariants in 7 ms
FORMULA PolyORBNT-COL-S10J20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-18 01:23:03] [INFO ] Unfolded HLPN to a Petri net with 494 places and 1670 transitions in 31 ms.
[2022-05-18 01:23:03] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2022-05-18 01:23:03] [INFO ] Computed 13 place invariants in 9 ms
[2022-05-18 01:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-18 01:23:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-18 01:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:03] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-05-18 01:23:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2022-05-18 01:23:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-18 01:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:03] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-18 01:23:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:23:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:23:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 01:23:03] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 3 ms to minimize.
[2022-05-18 01:23:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2022-05-18 01:23:03] [INFO ] Added : 36 causal constraints over 8 iterations in 126 ms. Result :sat
Minimization took 12 ms.
[2022-05-18 01:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-18 01:23:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:03] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-18 01:23:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:23:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:04] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-18 01:23:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:23:04] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
[2022-05-18 01:23:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2022-05-18 01:23:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 01:23:04] [INFO ] Added : 15 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 35 ms.
[2022-05-18 01:23:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:23:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-18 01:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:04] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2022-05-18 01:23:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:23:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:04] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:23:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:23:04] [INFO ] Deduced a trap composed of 14 places in 12 ms of which 1 ms to minimize.
[2022-05-18 01:23:04] [INFO ] Deduced a trap composed of 14 places in 14 ms of which 1 ms to minimize.
[2022-05-18 01:23:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 34 ms
[2022-05-18 01:23:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:23:04] [INFO ] Added : 36 causal constraints over 8 iterations in 45 ms. Result :sat
Minimization took 14 ms.
[2022-05-18 01:23:04] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:23:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:04] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:23:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:23:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-18 01:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:04] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-18 01:23:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:23:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:23:04] [INFO ] Added : 36 causal constraints over 8 iterations in 40 ms. Result :sat
Minimization took 16 ms.
[2022-05-18 01:23:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:23:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:23:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:23:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:04] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:23:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:23:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:23:04] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2022-05-18 01:23:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-05-18 01:23:04] [INFO ] Added : 36 causal constraints over 8 iterations in 240 ms. Result :sat
Minimization took 27 ms.
[2022-05-18 01:23:04] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:23:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:04] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-18 01:23:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:23:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:04] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:23:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:23:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:23:05] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2022-05-18 01:23:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2022-05-18 01:23:05] [INFO ] Added : 36 causal constraints over 8 iterations in 195 ms. Result :sat
Minimization took 13 ms.
[2022-05-18 01:23:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:23:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:23:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:05] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:23:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:23:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:23:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:05] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:23:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:23:05] [INFO ] Deduced a trap composed of 13 places in 14 ms of which 0 ms to minimize.
[2022-05-18 01:23:05] [INFO ] Deduced a trap composed of 14 places in 15 ms of which 1 ms to minimize.
[2022-05-18 01:23:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 38 ms
[2022-05-18 01:23:05] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:23:05] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2022-05-18 01:23:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2022-05-18 01:23:05] [INFO ] Added : 36 causal constraints over 8 iterations in 153 ms. Result :sat
Minimization took 15 ms.
[2022-05-18 01:23:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:23:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:23:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:05] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-18 01:23:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:23:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:23:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:05] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:23:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-18 01:23:05] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2022-05-18 01:23:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2022-05-18 01:23:05] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:23:05] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2022-05-18 01:23:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2022-05-18 01:23:05] [INFO ] Added : 36 causal constraints over 8 iterations in 142 ms. Result :sat
Minimization took 62 ms.
[2022-05-18 01:23:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:23:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:23:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:05] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-18 01:23:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:23:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:23:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:05] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-18 01:23:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:23:05] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 0 ms to minimize.
[2022-05-18 01:23:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2022-05-18 01:23:05] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:23:05] [INFO ] Added : 19 causal constraints over 4 iterations in 24 ms. Result :sat
Minimization took 18 ms.
[2022-05-18 01:23:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:23:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:23:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:05] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:23:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-05-18 01:23:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:23:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:05] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:23:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:23:05] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2022-05-18 01:23:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2022-05-18 01:23:05] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:23:06] [INFO ] Added : 23 causal constraints over 5 iterations in 487 ms. Result :sat
Minimization took 192 ms.
[2022-05-18 01:23:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:23:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-18 01:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:23:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:23:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:06] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:23:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:23:06] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2022-05-18 01:23:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2022-05-18 01:23:06] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:23:06] [INFO ] Deduced a trap composed of 25 places in 17 ms of which 1 ms to minimize.
[2022-05-18 01:23:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2022-05-18 01:23:06] [INFO ] Added : 36 causal constraints over 8 iterations in 159 ms. Result :sat
Minimization took 46 ms.
[2022-05-18 01:23:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:23:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:23:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:23:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:07] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-05-18 01:23:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:23:07] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2022-05-18 01:23:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2022-05-18 01:23:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:23:07] [INFO ] Added : 21 causal constraints over 5 iterations in 43 ms. Result :sat
Minimization took 14 ms.
[2022-05-18 01:23:07] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:23:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:07] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:23:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:23:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:07] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-05-18 01:23:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:23:07] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2022-05-18 01:23:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-05-18 01:23:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 01:23:07] [INFO ] Added : 22 causal constraints over 5 iterations in 31 ms. Result :sat
Minimization took 56 ms.
[2022-05-18 01:23:07] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:23:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:07] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:23:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:23:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:07] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:23:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:23:07] [INFO ] Deduced a trap composed of 13 places in 14 ms of which 0 ms to minimize.
[2022-05-18 01:23:07] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2022-05-18 01:23:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 49 ms
[2022-05-18 01:23:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:23:07] [INFO ] Added : 36 causal constraints over 8 iterations in 43 ms. Result :sat
Minimization took 15 ms.
[2022-05-18 01:23:07] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:23:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:07] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:23:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:23:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-18 01:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:07] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:23:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:23:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:23:07] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2022-05-18 01:23:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-18 01:23:07] [INFO ] Added : 36 causal constraints over 8 iterations in 156 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, -1, -1, -1, -1, 1, 10, 2, 10, 10, 3, 4, -1, -1]
[2022-05-18 01:23:07] [INFO ] Unfolded HLPN to a Petri net with 494 places and 1670 transitions in 20 ms.
[2022-05-18 01:23:07] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_9408807978030889998.dot
Deduced a syphon composed of 20 places in 13 ms
Reduce places removed 20 places and 20 transitions.
Incomplete random walk after 10000 steps, including 561 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10000 steps, including 102 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 15) seen :1
[2022-05-18 01:23:08] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2022-05-18 01:23:08] [INFO ] Computed 72 place invariants in 74 ms
[2022-05-18 01:23:08] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-18 01:23:08] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-18 01:23:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:09] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2022-05-18 01:23:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:09] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2022-05-18 01:23:09] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-18 01:23:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:10] [INFO ] [Nat]Absence check using state equation in 915 ms returned sat
[2022-05-18 01:23:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:23:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 50 ms returned sat
[2022-05-18 01:23:10] [INFO ] Deduced a trap composed of 12 places in 305 ms of which 1 ms to minimize.
[2022-05-18 01:23:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 408 ms
[2022-05-18 01:23:10] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 175 ms.
[2022-05-18 01:23:12] [INFO ] Deduced a trap composed of 19 places in 390 ms of which 1 ms to minimize.
[2022-05-18 01:23:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 626 ms
[2022-05-18 01:23:12] [INFO ] Added : 43 causal constraints over 10 iterations in 1838 ms. Result :sat
Minimization took 489 ms.
[2022-05-18 01:23:13] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-18 01:23:13] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-18 01:23:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:13] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2022-05-18 01:23:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:13] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-18 01:23:13] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-18 01:23:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:14] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2022-05-18 01:23:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2022-05-18 01:23:14] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 360 ms.
[2022-05-18 01:23:14] [INFO ] Added : 7 causal constraints over 2 iterations in 597 ms. Result :sat
Minimization took 481 ms.
[2022-05-18 01:23:15] [INFO ] [Real]Absence check using 65 positive place invariants in 18 ms returned sat
[2022-05-18 01:23:15] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-18 01:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:15] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2022-05-18 01:23:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:15] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-18 01:23:15] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-18 01:23:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:16] [INFO ] [Nat]Absence check using state equation in 924 ms returned sat
[2022-05-18 01:23:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 89 ms returned sat
[2022-05-18 01:23:17] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 1 ms to minimize.
[2022-05-18 01:23:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
[2022-05-18 01:23:17] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 126 ms.
[2022-05-18 01:23:18] [INFO ] Deduced a trap composed of 20 places in 393 ms of which 1 ms to minimize.
[2022-05-18 01:23:18] [INFO ] Deduced a trap composed of 20 places in 303 ms of which 1 ms to minimize.
[2022-05-18 01:23:19] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 1 ms to minimize.
[2022-05-18 01:23:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1321 ms
[2022-05-18 01:23:19] [INFO ] Added : 37 causal constraints over 8 iterations in 2222 ms. Result :sat
Minimization took 400 ms.
[2022-05-18 01:23:19] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-18 01:23:19] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-18 01:23:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:20] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2022-05-18 01:23:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:20] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-18 01:23:20] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-18 01:23:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:20] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2022-05-18 01:23:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 110 ms returned sat
[2022-05-18 01:23:21] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 1 ms to minimize.
[2022-05-18 01:23:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2022-05-18 01:23:21] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 123 ms.
[2022-05-18 01:23:25] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 1 ms to minimize.
[2022-05-18 01:23:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 543 ms
[2022-05-18 01:23:25] [INFO ] Deduced a trap composed of 7 places in 395 ms of which 0 ms to minimize.
[2022-05-18 01:23:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-18 01:23:25] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2022-05-18 01:23:25] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 5 ms returned unsat
[2022-05-18 01:23:25] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2022-05-18 01:23:26] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-18 01:23:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:26] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2022-05-18 01:23:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:26] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2022-05-18 01:23:26] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-18 01:23:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:27] [INFO ] [Nat]Absence check using state equation in 666 ms returned sat
[2022-05-18 01:23:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 153 ms returned sat
[2022-05-18 01:23:27] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 118 ms.
[2022-05-18 01:23:28] [INFO ] Deduced a trap composed of 24 places in 383 ms of which 1 ms to minimize.
[2022-05-18 01:23:28] [INFO ] Deduced a trap composed of 19 places in 274 ms of which 0 ms to minimize.
[2022-05-18 01:23:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1350 ms
[2022-05-18 01:23:29] [INFO ] Added : 41 causal constraints over 9 iterations in 2333 ms. Result :sat
Minimization took 476 ms.
[2022-05-18 01:23:30] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-18 01:23:30] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-18 01:23:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:30] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2022-05-18 01:23:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:30] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-18 01:23:30] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-18 01:23:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:31] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2022-05-18 01:23:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 216 ms returned sat
[2022-05-18 01:23:31] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 1 ms to minimize.
[2022-05-18 01:23:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2022-05-18 01:23:31] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 114 ms.
[2022-05-18 01:23:32] [INFO ] Added : 8 causal constraints over 2 iterations in 346 ms. Result :sat
Minimization took 351 ms.
[2022-05-18 01:23:32] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2022-05-18 01:23:32] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-18 01:23:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:32] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2022-05-18 01:23:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:33] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-18 01:23:33] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-18 01:23:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:33] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2022-05-18 01:23:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:23:33] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 116 ms.
[2022-05-18 01:23:34] [INFO ] Deduced a trap composed of 19 places in 364 ms of which 1 ms to minimize.
[2022-05-18 01:23:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 686 ms
[2022-05-18 01:23:35] [INFO ] Added : 39 causal constraints over 8 iterations in 1697 ms. Result :sat
Minimization took 1130 ms.
[2022-05-18 01:23:36] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2022-05-18 01:23:36] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 14 ms returned sat
[2022-05-18 01:23:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:36] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2022-05-18 01:23:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:36] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2022-05-18 01:23:36] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-18 01:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:37] [INFO ] [Nat]Absence check using state equation in 896 ms returned sat
[2022-05-18 01:23:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 43 ms returned sat
[2022-05-18 01:23:37] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 115 ms.
[2022-05-18 01:23:38] [INFO ] Added : 7 causal constraints over 2 iterations in 361 ms. Result :sat
Minimization took 596 ms.
[2022-05-18 01:23:38] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2022-05-18 01:23:38] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-18 01:23:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:39] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2022-05-18 01:23:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:39] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-18 01:23:39] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-18 01:23:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:40] [INFO ] [Nat]Absence check using state equation in 994 ms returned sat
[2022-05-18 01:23:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2022-05-18 01:23:40] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 114 ms.
[2022-05-18 01:23:40] [INFO ] Added : 7 causal constraints over 2 iterations in 337 ms. Result :sat
Minimization took 945 ms.
[2022-05-18 01:23:41] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2022-05-18 01:23:41] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-18 01:23:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:42] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2022-05-18 01:23:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:42] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-18 01:23:42] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-18 01:23:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:43] [INFO ] [Nat]Absence check using state equation in 1035 ms returned sat
[2022-05-18 01:23:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 48 ms returned sat
[2022-05-18 01:23:43] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 117 ms.
[2022-05-18 01:23:44] [INFO ] Deduced a trap composed of 19 places in 385 ms of which 1 ms to minimize.
[2022-05-18 01:23:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 685 ms
[2022-05-18 01:23:44] [INFO ] Added : 36 causal constraints over 8 iterations in 1563 ms. Result :sat
Minimization took 2243 ms.
[2022-05-18 01:23:47] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-18 01:23:47] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-18 01:23:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:47] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2022-05-18 01:23:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:47] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-18 01:23:47] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-18 01:23:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:48] [INFO ] [Nat]Absence check using state equation in 977 ms returned sat
[2022-05-18 01:23:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 29 ms returned sat
[2022-05-18 01:23:48] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 116 ms.
[2022-05-18 01:23:49] [INFO ] Added : 7 causal constraints over 2 iterations in 345 ms. Result :sat
Minimization took 702 ms.
[2022-05-18 01:23:49] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-18 01:23:49] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-18 01:23:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:50] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2022-05-18 01:23:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:50] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-18 01:23:50] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-18 01:23:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:50] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2022-05-18 01:23:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1818 ms returned sat
[2022-05-18 01:23:52] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 111 ms.
[2022-05-18 01:23:53] [INFO ] Added : 13 causal constraints over 3 iterations in 423 ms. Result :sat
Minimization took 719 ms.
[2022-05-18 01:23:54] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-18 01:23:54] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-18 01:23:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:54] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2022-05-18 01:23:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:54] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-18 01:23:54] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-18 01:23:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:54] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2022-05-18 01:23:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-18 01:23:55] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 118 ms.
[2022-05-18 01:23:56] [INFO ] Deduced a trap composed of 19 places in 342 ms of which 2 ms to minimize.
[2022-05-18 01:23:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 504 ms
[2022-05-18 01:23:56] [INFO ] Added : 44 causal constraints over 9 iterations in 1568 ms. Result :sat
Minimization took 539 ms.
[2022-05-18 01:23:57] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2022-05-18 01:23:57] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-18 01:23:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:57] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2022-05-18 01:23:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:23:57] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-18 01:23:57] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-18 01:23:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:23:58] [INFO ] [Nat]Absence check using state equation in 670 ms returned sat
[2022-05-18 01:23:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 58 ms returned sat
[2022-05-18 01:23:58] [INFO ] Deduced a trap composed of 105 places in 262 ms of which 0 ms to minimize.
[2022-05-18 01:23:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 361 ms
[2022-05-18 01:23:58] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 112 ms.
[2022-05-18 01:23:59] [INFO ] Deduced a trap composed of 19 places in 279 ms of which 0 ms to minimize.
[2022-05-18 01:24:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 668 ms
[2022-05-18 01:24:00] [INFO ] Added : 39 causal constraints over 9 iterations in 1650 ms. Result :sat
Minimization took 547 ms.
Current structural bounds on expressions (after SMT) : [2147483647, 1, 2147483647, 2147483647, 1, 2147483647, 1, 10, 2, 10, 10, 3, 4, 2147483647, 2147483647] Max seen :[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 19400 steps, including 1214 resets, run finished after 285 ms. (steps per millisecond=68 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 16800 steps, including 1052 resets, run finished after 236 ms. (steps per millisecond=71 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 5300 steps, including 296 resets, run finished after 82 ms. (steps per millisecond=64 ) properties (out of 14) seen :12 could not realise parikh vector
FORMULA PolyORBNT-COL-S10J20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 2600 steps, including 119 resets, run finished after 28 ms. (steps per millisecond=92 ) properties (out of 13) seen :15 could not realise parikh vector
FORMULA PolyORBNT-COL-S10J20-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 3100 steps, including 151 resets, run finished after 33 ms. (steps per millisecond=93 ) properties (out of 11) seen :14 could not realise parikh vector
Incomplete Parikh walk after 2700 steps, including 152 resets, run finished after 27 ms. (steps per millisecond=100 ) properties (out of 11) seen :9 could not realise parikh vector
FORMULA PolyORBNT-COL-S10J20-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 16000 steps, including 1002 resets, run finished after 227 ms. (steps per millisecond=70 ) properties (out of 10) seen :0 could not realise parikh vector
Incomplete Parikh walk after 2800 steps, including 167 resets, run finished after 40 ms. (steps per millisecond=70 ) properties (out of 10) seen :0 could not realise parikh vector
Incomplete Parikh walk after 17900 steps, including 1087 resets, run finished after 255 ms. (steps per millisecond=70 ) properties (out of 10) seen :0 could not realise parikh vector
Incomplete Parikh walk after 16100 steps, including 950 resets, run finished after 230 ms. (steps per millisecond=70 ) properties (out of 10) seen :18 could not realise parikh vector
Incomplete Parikh walk after 1400 steps, including 93 resets, run finished after 14 ms. (steps per millisecond=100 ) properties (out of 10) seen :3 could not realise parikh vector
Incomplete Parikh walk after 17900 steps, including 1007 resets, run finished after 254 ms. (steps per millisecond=70 ) properties (out of 10) seen :7 could not realise parikh vector
Support contains 299 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 464 transition count 1647
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 17 place count 461 transition count 1646
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 460 transition count 1646
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 18 place count 460 transition count 1643
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 24 place count 457 transition count 1643
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 456 transition count 1642
Applied a total of 26 rules in 218 ms. Remains 456 /474 variables (removed 18) and now considering 1642/1650 (removed 8) transitions.
[2022-05-18 01:24:02] [INFO ] Flow matrix only has 1633 transitions (discarded 9 similar events)
// Phase 1: matrix 1633 rows 456 cols
[2022-05-18 01:24:02] [INFO ] Computed 62 place invariants in 54 ms
[2022-05-18 01:24:03] [INFO ] Dead Transitions using invariants and state equation in 831 ms returned [626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 667, 668, 669, 670, 671, 673, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 702, 703, 704, 705, 706, 708, 711, 712, 713, 714, 715, 716, 718, 721, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 758, 759, 760, 761, 762, 764, 767, 768, 769, 770, 771, 772, 774, 777, 781, 782, 783, 784, 785, 786, 787, 789, 792, 796, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 823, 824, 825, 826, 827, 828, 829, 830, 831, 832, 833, 834, 835, 836, 837, 838, 839, 840, 842, 843, 844, 845, 846, 848, 851, 852, 853, 854, 855, 856, 858, 861, 865, 866, 867, 868, 869, 870, 871, 873, 876, 880, 885, 886, 887, 888, 889, 890, 891, 892, 894, 897, 901, 906, 912, 913, 914, 915, 916, 917, 918, 919, 920, 921, 922, 923, 924, 925, 926, 927, 928, 929, 930, 931, 932, 933, 934, 935, 936, 937, 938, 939, 940, 941, 942, 943, 944, 945, 946, 947, 948, 949, 950, 951, 952, 953, 954, 955, 956, 957, 958, 959, 960, 962, 963, 964, 965, 966, 968, 971, 972, 973, 974, 975, 976, 978, 981, 985, 986, 987, 988, 989, 990, 991, 993, 996, 1000, 1005, 1006, 1007, 1008, 1009, 1010, 1011, 1012, 1014, 1017, 1021, 1026, 1032, 1033, 1034, 1035, 1036, 1037, 1038, 1039, 1040, 1042, 1045, 1049, 1054, 1060, 1067, 1068, 1069, 1070, 1071, 1072, 1073, 1074, 1075, 1076, 1077, 1078, 1079, 1080, 1081, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1102, 1103, 1104, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1120, 1121, 1122, 1123, 1124, 1125, 1127, 1128, 1129, 1130, 1131, 1133, 1136, 1137, 1138, 1139, 1140, 1141, 1143, 1146, 1150, 1151, 1152, 1153, 1154, 1155, 1156, 1158, 1161, 1165, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1179, 1182, 1186, 1191, 1197, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1207, 1210, 1214, 1219, 1225, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1239, 1240, 1241, 1243, 1246, 1250, 1255, 1261, 1268, 1276, 1277, 1278, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301, 1302, 1303, 1304, 1305, 1306, 1307, 1308, 1309, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1317, 1318, 1319, 1320, 1321, 1322, 1323, 1324, 1325, 1326, 1327, 1328, 1329, 1330, 1331, 1332, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1341, 1342, 1343, 1344, 1345, 1347, 1348, 1349, 1350, 1351, 1353, 1356, 1357, 1358, 1359, 1360, 1361, 1363, 1366, 1370, 1371, 1372, 1373, 1374, 1375, 1376, 1378, 1381, 1385, 1390, 1391, 1392, 1393, 1394, 1395, 1396, 1397, 1399, 1402, 1406, 1411, 1417, 1418, 1419, 1420, 1421, 1422, 1423, 1424, 1425, 1427, 1430, 1434, 1439, 1445, 1452, 1453, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1461, 1463, 1466, 1470, 1475, 1481, 1488, 1496, 1497, 1498, 1499, 1500, 1501, 1502, 1503, 1504, 1505, 1506, 1508, 1511, 1515, 1520, 1526, 1533, 1541, 1550, 1551, 1552, 1553, 1554, 1555, 1556, 1557, 1558, 1559, 1560, 1561, 1563, 1566, 1570, 1575, 1581, 1588, 1596, 1605, 1615]
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions :[1615, 1605, 1596, 1588, 1581, 1575, 1570, 1566, 1563, 1561, 1560, 1559, 1558, 1557, 1556, 1555, 1554, 1553, 1552, 1551, 1550, 1541, 1533, 1526, 1520, 1515, 1511, 1508, 1506, 1505, 1504, 1503, 1502, 1501, 1500, 1499, 1498, 1497, 1496, 1488, 1481, 1475, 1470, 1466, 1463, 1461, 1460, 1459, 1458, 1457, 1456, 1455, 1454, 1453, 1452, 1445, 1439, 1434, 1430, 1427, 1425, 1424, 1423, 1422, 1421, 1420, 1419, 1418, 1417, 1411, 1406, 1402, 1399, 1397, 1396, 1395, 1394, 1393, 1392, 1391, 1390, 1385, 1381, 1378, 1376, 1375, 1374, 1373, 1372, 1371, 1370, 1366, 1363, 1361, 1360, 1359, 1358, 1357, 1356, 1353, 1351, 1350, 1349, 1348, 1347, 1345, 1344, 1343, 1342, 1341, 1340, 1339, 1338, 1337, 1336, 1335, 1334, 1333, 1332, 1331, 1330, 1329, 1328, 1327, 1326, 1325, 1324, 1323, 1322, 1321, 1320, 1319, 1318, 1317, 1316, 1315, 1314, 1313, 1312, 1311, 1310, 1309, 1308, 1307, 1306, 1305, 1304, 1303, 1302, 1301, 1300, 1299, 1298, 1297, 1296, 1295, 1294, 1293, 1292, 1291, 1290, 1289, 1288, 1287, 1286, 1285, 1284, 1283, 1282, 1281, 1280, 1279, 1278, 1277, 1276, 1268, 1261, 1255, 1250, 1246, 1243, 1241, 1240, 1239, 1238, 1237, 1236, 1235, 1234, 1233, 1232, 1225, 1219, 1214, 1210, 1207, 1205, 1204, 1203, 1202, 1201, 1200, 1199, 1198, 1197, 1191, 1186, 1182, 1179, 1177, 1176, 1175, 1174, 1173, 1172, 1171, 1170, 1165, 1161, 1158, 1156, 1155, 1154, 1153, 1152, 1151, 1150, 1146, 1143, 1141, 1140, 1139, 1138, 1137, 1136, 1133, 1131, 1130, 1129, 1128, 1127, 1125, 1124, 1123, 1122, 1121, 1120, 1119, 1118, 1117, 1116, 1115, 1114, 1113, 1112, 1111, 1110, 1109, 1108, 1107, 1106, 1105, 1104, 1103, 1102, 1101, 1100, 1099, 1098, 1097, 1096, 1095, 1094, 1093, 1092, 1091, 1090, 1089, 1088, 1087, 1086, 1085, 1084, 1083, 1082, 1081, 1080, 1079, 1078, 1077, 1076, 1075, 1074, 1073, 1072, 1071, 1070, 1069, 1068, 1067, 1060, 1054, 1049, 1045, 1042, 1040, 1039, 1038, 1037, 1036, 1035, 1034, 1033, 1032, 1026, 1021, 1017, 1014, 1012, 1011, 1010, 1009, 1008, 1007, 1006, 1005, 1000, 996, 993, 991, 990, 989, 988, 987, 986, 985, 981, 978, 976, 975, 974, 973, 972, 971, 968, 966, 965, 964, 963, 962, 960, 959, 958, 957, 956, 955, 954, 953, 952, 951, 950, 949, 948, 947, 946, 945, 944, 943, 942, 941, 940, 939, 938, 937, 936, 935, 934, 933, 932, 931, 930, 929, 928, 927, 926, 925, 924, 923, 922, 921, 920, 919, 918, 917, 916, 915, 914, 913, 912, 906, 901, 897, 894, 892, 891, 890, 889, 888, 887, 886, 885, 880, 876, 873, 871, 870, 869, 868, 867, 866, 865, 861, 858, 856, 855, 854, 853, 852, 851, 848, 846, 845, 844, 843, 842, 840, 839, 838, 837, 836, 835, 834, 833, 832, 831, 830, 829, 828, 827, 826, 825, 824, 823, 822, 821, 820, 819, 818, 817, 816, 815, 814, 813, 812, 811, 810, 809, 808, 807, 806, 805, 804, 803, 802, 801, 796, 792, 789, 787, 786, 785, 784, 783, 782, 781, 777, 774, 772, 771, 770, 769, 768, 767, 764, 762, 761, 760, 759, 758, 756, 755, 754, 753, 752, 751, 750, 749, 748, 747, 746, 745, 744, 743, 742, 741, 740, 739, 738, 737, 736, 735, 734, 733, 732, 731, 730, 729, 728, 727, 726, 725, 721, 718, 716, 715, 714, 713, 712, 711, 708, 706, 705, 704, 703, 702, 700, 699, 698, 697, 696, 695, 694, 693, 692, 691, 690, 689, 688, 687, 686, 685, 684, 683, 682, 681, 680, 679, 678, 677, 676, 673, 671, 670, 669, 668, 667, 665, 664, 663, 662, 661, 660, 659, 658, 657, 656, 655, 654, 653, 652, 651, 650, 649, 648, 647, 645, 644, 643, 642, 641, 640, 639, 638, 637, 636, 635, 634, 633, 632, 631, 630, 629, 628, 627, 626]
Starting structural reductions, iteration 1 : 456/474 places, 1027/1650 transitions.
Applied a total of 0 rules in 30 ms. Remains 456 /456 variables (removed 0) and now considering 1027/1027 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 456/474 places, 1027/1650 transitions.
Normalized transition count is 1018 out of 1027 initially.
// Phase 1: matrix 1018 rows 456 cols
[2022-05-18 01:24:03] [INFO ] Computed 62 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 67057 resets, run finished after 12901 ms. (steps per millisecond=77 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 1000001 steps, including 9593 resets, run finished after 2597 ms. (steps per millisecond=385 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 1000000 steps, including 9344 resets, run finished after 2537 ms. (steps per millisecond=394 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 1000001 steps, including 9555 resets, run finished after 2282 ms. (steps per millisecond=438 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 1000001 steps, including 9517 resets, run finished after 2554 ms. (steps per millisecond=391 ) properties (out of 10) seen :20
Interrupted Best-First random walk after 979965 steps, including 9365 resets, run timeout after 5001 ms. (steps per millisecond=195 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=4, 5=3, 6=4, 7=3, 8=1, 9=1}
Incomplete Best-First random walk after 1000001 steps, including 9491 resets, run finished after 2363 ms. (steps per millisecond=423 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 1000001 steps, including 8744 resets, run finished after 2163 ms. (steps per millisecond=462 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 1000001 steps, including 9522 resets, run finished after 2275 ms. (steps per millisecond=439 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 1000001 steps, including 9436 resets, run finished after 2244 ms. (steps per millisecond=445 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 1000001 steps, including 9566 resets, run finished after 2592 ms. (steps per millisecond=385 ) properties (out of 10) seen :20
[2022-05-18 01:24:43] [INFO ] Flow matrix only has 1018 transitions (discarded 9 similar events)
// Phase 1: matrix 1018 rows 456 cols
[2022-05-18 01:24:43] [INFO ] Computed 62 place invariants in 18 ms
[2022-05-18 01:24:43] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2022-05-18 01:24:43] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-18 01:24:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:24:43] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2022-05-18 01:24:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:24:43] [INFO ] [Nat]Absence check using 56 positive place invariants in 13 ms returned sat
[2022-05-18 01:24:43] [INFO ] [Nat]Absence check using 56 positive and 6 generalized place invariants in 5 ms returned unsat
[2022-05-18 01:24:43] [INFO ] [Real]Absence check using 56 positive place invariants in 14 ms returned sat
[2022-05-18 01:24:43] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 13 ms returned sat
[2022-05-18 01:24:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:24:44] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2022-05-18 01:24:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:24:44] [INFO ] [Nat]Absence check using 56 positive place invariants in 13 ms returned sat
[2022-05-18 01:24:44] [INFO ] [Nat]Absence check using 56 positive and 6 generalized place invariants in 5 ms returned unsat
[2022-05-18 01:24:44] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2022-05-18 01:24:44] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 4 ms returned unsat
[2022-05-18 01:24:44] [INFO ] [Real]Absence check using 56 positive place invariants in 13 ms returned sat
[2022-05-18 01:24:44] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 13 ms returned unsat
[2022-05-18 01:24:44] [INFO ] [Real]Absence check using 56 positive place invariants in 13 ms returned sat
[2022-05-18 01:24:44] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-18 01:24:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:24:44] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2022-05-18 01:24:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:24:44] [INFO ] [Nat]Absence check using 56 positive place invariants in 13 ms returned sat
[2022-05-18 01:24:44] [INFO ] [Nat]Absence check using 56 positive and 6 generalized place invariants in 12 ms returned sat
[2022-05-18 01:24:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:24:45] [INFO ] [Nat]Absence check using state equation in 956 ms returned unsat
[2022-05-18 01:24:45] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2022-05-18 01:24:45] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-18 01:24:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:24:45] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2022-05-18 01:24:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:24:45] [INFO ] [Nat]Absence check using 56 positive place invariants in 13 ms returned sat
[2022-05-18 01:24:45] [INFO ] [Nat]Absence check using 56 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-18 01:24:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:24:46] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2022-05-18 01:24:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:24:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 65 ms returned sat
[2022-05-18 01:24:46] [INFO ] Deduced a trap composed of 214 places in 203 ms of which 0 ms to minimize.
[2022-05-18 01:24:46] [INFO ] Deduced a trap composed of 207 places in 201 ms of which 1 ms to minimize.
[2022-05-18 01:24:46] [INFO ] Deduced a trap composed of 205 places in 204 ms of which 0 ms to minimize.
[2022-05-18 01:24:47] [INFO ] Deduced a trap composed of 210 places in 199 ms of which 1 ms to minimize.
[2022-05-18 01:24:47] [INFO ] Deduced a trap composed of 204 places in 199 ms of which 0 ms to minimize.
[2022-05-18 01:24:47] [INFO ] Deduced a trap composed of 205 places in 199 ms of which 0 ms to minimize.
[2022-05-18 01:24:47] [INFO ] Deduced a trap composed of 209 places in 205 ms of which 0 ms to minimize.
[2022-05-18 01:24:48] [INFO ] Deduced a trap composed of 205 places in 199 ms of which 1 ms to minimize.
[2022-05-18 01:24:48] [INFO ] Deduced a trap composed of 208 places in 203 ms of which 0 ms to minimize.
[2022-05-18 01:24:48] [INFO ] Deduced a trap composed of 211 places in 204 ms of which 0 ms to minimize.
[2022-05-18 01:24:48] [INFO ] Deduced a trap composed of 220 places in 206 ms of which 0 ms to minimize.
[2022-05-18 01:24:49] [INFO ] Deduced a trap composed of 222 places in 200 ms of which 0 ms to minimize.
[2022-05-18 01:24:49] [INFO ] Deduced a trap composed of 211 places in 203 ms of which 0 ms to minimize.
[2022-05-18 01:24:49] [INFO ] Deduced a trap composed of 205 places in 204 ms of which 2 ms to minimize.
[2022-05-18 01:24:50] [INFO ] Deduced a trap composed of 205 places in 194 ms of which 0 ms to minimize.
[2022-05-18 01:24:50] [INFO ] Deduced a trap composed of 220 places in 207 ms of which 6 ms to minimize.
[2022-05-18 01:24:50] [INFO ] Deduced a trap composed of 210 places in 201 ms of which 1 ms to minimize.
[2022-05-18 01:24:50] [INFO ] Deduced a trap composed of 218 places in 196 ms of which 1 ms to minimize.
[2022-05-18 01:24:51] [INFO ] Deduced a trap composed of 216 places in 215 ms of which 4 ms to minimize.
[2022-05-18 01:24:51] [INFO ] Deduced a trap composed of 214 places in 217 ms of which 11 ms to minimize.
[2022-05-18 01:24:52] [INFO ] Deduced a trap composed of 203 places in 200 ms of which 1 ms to minimize.
[2022-05-18 01:24:52] [INFO ] Deduced a trap composed of 203 places in 203 ms of which 0 ms to minimize.
[2022-05-18 01:24:52] [INFO ] Deduced a trap composed of 214 places in 208 ms of which 0 ms to minimize.
[2022-05-18 01:24:52] [INFO ] Deduced a trap composed of 205 places in 196 ms of which 0 ms to minimize.
[2022-05-18 01:24:52] [INFO ] Deduced a trap composed of 209 places in 197 ms of which 1 ms to minimize.
[2022-05-18 01:24:53] [INFO ] Deduced a trap composed of 205 places in 198 ms of which 0 ms to minimize.
[2022-05-18 01:24:53] [INFO ] Deduced a trap composed of 207 places in 199 ms of which 0 ms to minimize.
[2022-05-18 01:24:53] [INFO ] Deduced a trap composed of 212 places in 195 ms of which 1 ms to minimize.
[2022-05-18 01:24:54] [INFO ] Deduced a trap composed of 207 places in 206 ms of which 1 ms to minimize.
[2022-05-18 01:24:54] [INFO ] Deduced a trap composed of 214 places in 206 ms of which 0 ms to minimize.
[2022-05-18 01:24:54] [INFO ] Deduced a trap composed of 215 places in 197 ms of which 0 ms to minimize.
[2022-05-18 01:24:55] [INFO ] Deduced a trap composed of 217 places in 204 ms of which 0 ms to minimize.
[2022-05-18 01:24:55] [INFO ] Deduced a trap composed of 210 places in 203 ms of which 0 ms to minimize.
[2022-05-18 01:24:56] [INFO ] Deduced a trap composed of 205 places in 213 ms of which 1 ms to minimize.
[2022-05-18 01:24:57] [INFO ] Deduced a trap composed of 212 places in 200 ms of which 0 ms to minimize.
[2022-05-18 01:24:57] [INFO ] Deduced a trap composed of 207 places in 201 ms of which 0 ms to minimize.
[2022-05-18 01:24:57] [INFO ] Deduced a trap composed of 212 places in 206 ms of which 1 ms to minimize.
[2022-05-18 01:24:58] [INFO ] Deduced a trap composed of 224 places in 213 ms of which 1 ms to minimize.
[2022-05-18 01:24:58] [INFO ] Deduced a trap composed of 201 places in 202 ms of which 0 ms to minimize.
[2022-05-18 01:24:59] [INFO ] Deduced a trap composed of 211 places in 202 ms of which 1 ms to minimize.
[2022-05-18 01:24:59] [INFO ] Deduced a trap composed of 211 places in 210 ms of which 1 ms to minimize.
[2022-05-18 01:24:59] [INFO ] Deduced a trap composed of 210 places in 213 ms of which 1 ms to minimize.
[2022-05-18 01:25:00] [INFO ] Deduced a trap composed of 214 places in 232 ms of which 1 ms to minimize.
[2022-05-18 01:25:00] [INFO ] Deduced a trap composed of 207 places in 213 ms of which 1 ms to minimize.
[2022-05-18 01:25:01] [INFO ] Deduced a trap composed of 209 places in 199 ms of which 0 ms to minimize.
[2022-05-18 01:25:01] [INFO ] Deduced a trap composed of 205 places in 199 ms of which 1 ms to minimize.
[2022-05-18 01:25:01] [INFO ] Deduced a trap composed of 209 places in 200 ms of which 0 ms to minimize.
[2022-05-18 01:25:02] [INFO ] Deduced a trap composed of 220 places in 197 ms of which 1 ms to minimize.
[2022-05-18 01:25:02] [INFO ] Deduced a trap composed of 214 places in 200 ms of which 0 ms to minimize.
[2022-05-18 01:25:02] [INFO ] Deduced a trap composed of 209 places in 198 ms of which 0 ms to minimize.
[2022-05-18 01:25:03] [INFO ] Deduced a trap composed of 211 places in 197 ms of which 0 ms to minimize.
[2022-05-18 01:25:03] [INFO ] Deduced a trap composed of 218 places in 193 ms of which 1 ms to minimize.
[2022-05-18 01:25:04] [INFO ] Deduced a trap composed of 218 places in 198 ms of which 1 ms to minimize.
[2022-05-18 01:25:04] [INFO ] Deduced a trap composed of 207 places in 198 ms of which 0 ms to minimize.
[2022-05-18 01:25:04] [INFO ] Deduced a trap composed of 212 places in 201 ms of which 1 ms to minimize.
[2022-05-18 01:25:05] [INFO ] Deduced a trap composed of 212 places in 200 ms of which 0 ms to minimize.
[2022-05-18 01:25:31] [INFO ] Deduced a trap composed of 2 places in 251 ms of which 0 ms to minimize.
[2022-05-18 01:25:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-18 01:25:31] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2022-05-18 01:25:31] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-18 01:25:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:25:31] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2022-05-18 01:25:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:25:31] [INFO ] [Nat]Absence check using 56 positive place invariants in 13 ms returned sat
[2022-05-18 01:25:31] [INFO ] [Nat]Absence check using 56 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-18 01:25:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:25:37] [INFO ] [Nat]Absence check using state equation in 6176 ms returned unknown
[2022-05-18 01:25:37] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2022-05-18 01:25:37] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-18 01:25:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:25:37] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2022-05-18 01:25:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:25:38] [INFO ] [Nat]Absence check using 56 positive place invariants in 15 ms returned sat
[2022-05-18 01:25:38] [INFO ] [Nat]Absence check using 56 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-18 01:25:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:25:38] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2022-05-18 01:25:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2022-05-18 01:25:38] [INFO ] Deduced a trap composed of 218 places in 229 ms of which 0 ms to minimize.
[2022-05-18 01:25:38] [INFO ] Deduced a trap composed of 216 places in 198 ms of which 0 ms to minimize.
[2022-05-18 01:25:39] [INFO ] Deduced a trap composed of 218 places in 211 ms of which 1 ms to minimize.
[2022-05-18 01:25:39] [INFO ] Deduced a trap composed of 205 places in 202 ms of which 0 ms to minimize.
[2022-05-18 01:25:39] [INFO ] Deduced a trap composed of 222 places in 222 ms of which 1 ms to minimize.
[2022-05-18 01:25:39] [INFO ] Deduced a trap composed of 220 places in 201 ms of which 0 ms to minimize.
[2022-05-18 01:25:40] [INFO ] Deduced a trap composed of 214 places in 206 ms of which 0 ms to minimize.
[2022-05-18 01:25:40] [INFO ] Deduced a trap composed of 218 places in 200 ms of which 0 ms to minimize.
[2022-05-18 01:25:40] [INFO ] Deduced a trap composed of 214 places in 200 ms of which 1 ms to minimize.
[2022-05-18 01:25:40] [INFO ] Deduced a trap composed of 207 places in 206 ms of which 0 ms to minimize.
[2022-05-18 01:25:41] [INFO ] Deduced a trap composed of 216 places in 197 ms of which 1 ms to minimize.
[2022-05-18 01:25:41] [INFO ] Deduced a trap composed of 207 places in 202 ms of which 0 ms to minimize.
[2022-05-18 01:25:41] [INFO ] Deduced a trap composed of 205 places in 199 ms of which 0 ms to minimize.
[2022-05-18 01:25:41] [INFO ] Deduced a trap composed of 207 places in 233 ms of which 0 ms to minimize.
[2022-05-18 01:25:42] [INFO ] Deduced a trap composed of 209 places in 198 ms of which 0 ms to minimize.
[2022-05-18 01:25:42] [INFO ] Deduced a trap composed of 220 places in 203 ms of which 0 ms to minimize.
[2022-05-18 01:25:42] [INFO ] Deduced a trap composed of 220 places in 207 ms of which 1 ms to minimize.
[2022-05-18 01:25:42] [INFO ] Deduced a trap composed of 201 places in 202 ms of which 0 ms to minimize.
[2022-05-18 01:25:43] [INFO ] Deduced a trap composed of 214 places in 193 ms of which 0 ms to minimize.
[2022-05-18 01:25:43] [INFO ] Deduced a trap composed of 204 places in 199 ms of which 0 ms to minimize.
[2022-05-18 01:25:43] [INFO ] Deduced a trap composed of 201 places in 198 ms of which 0 ms to minimize.
[2022-05-18 01:25:43] [INFO ] Deduced a trap composed of 207 places in 201 ms of which 0 ms to minimize.
[2022-05-18 01:25:44] [INFO ] Deduced a trap composed of 205 places in 199 ms of which 0 ms to minimize.
[2022-05-18 01:25:44] [INFO ] Deduced a trap composed of 209 places in 203 ms of which 1 ms to minimize.
[2022-05-18 01:25:44] [INFO ] Deduced a trap composed of 207 places in 202 ms of which 0 ms to minimize.
[2022-05-18 01:25:45] [INFO ] Deduced a trap composed of 218 places in 194 ms of which 0 ms to minimize.
[2022-05-18 01:25:45] [INFO ] Deduced a trap composed of 211 places in 222 ms of which 0 ms to minimize.
[2022-05-18 01:25:45] [INFO ] Deduced a trap composed of 205 places in 200 ms of which 0 ms to minimize.
[2022-05-18 01:25:46] [INFO ] Deduced a trap composed of 211 places in 201 ms of which 1 ms to minimize.
[2022-05-18 01:25:46] [INFO ] Deduced a trap composed of 210 places in 204 ms of which 1 ms to minimize.
[2022-05-18 01:25:46] [INFO ] Deduced a trap composed of 201 places in 215 ms of which 0 ms to minimize.
[2022-05-18 01:25:46] [INFO ] Deduced a trap composed of 207 places in 202 ms of which 0 ms to minimize.
[2022-05-18 01:25:47] [INFO ] Deduced a trap composed of 216 places in 204 ms of which 1 ms to minimize.
[2022-05-18 01:25:47] [INFO ] Deduced a trap composed of 205 places in 199 ms of which 0 ms to minimize.
[2022-05-18 01:25:47] [INFO ] Deduced a trap composed of 216 places in 202 ms of which 0 ms to minimize.
[2022-05-18 01:25:47] [INFO ] Deduced a trap composed of 218 places in 224 ms of which 1 ms to minimize.
[2022-05-18 01:25:48] [INFO ] Deduced a trap composed of 213 places in 201 ms of which 0 ms to minimize.
[2022-05-18 01:25:48] [INFO ] Deduced a trap composed of 213 places in 206 ms of which 1 ms to minimize.
[2022-05-18 01:25:48] [INFO ] Deduced a trap composed of 211 places in 197 ms of which 0 ms to minimize.
[2022-05-18 01:25:49] [INFO ] Deduced a trap composed of 207 places in 239 ms of which 0 ms to minimize.
[2022-05-18 01:25:49] [INFO ] Deduced a trap composed of 209 places in 202 ms of which 0 ms to minimize.
[2022-05-18 01:25:50] [INFO ] Deduced a trap composed of 218 places in 208 ms of which 0 ms to minimize.
[2022-05-18 01:25:50] [INFO ] Deduced a trap composed of 211 places in 202 ms of which 1 ms to minimize.
[2022-05-18 01:25:50] [INFO ] Deduced a trap composed of 212 places in 216 ms of which 0 ms to minimize.
[2022-05-18 01:25:50] [INFO ] Deduced a trap composed of 207 places in 199 ms of which 0 ms to minimize.
[2022-05-18 01:25:51] [INFO ] Deduced a trap composed of 205 places in 195 ms of which 0 ms to minimize.
[2022-05-18 01:25:51] [INFO ] Deduced a trap composed of 209 places in 198 ms of which 0 ms to minimize.
[2022-05-18 01:25:52] [INFO ] Deduced a trap composed of 208 places in 203 ms of which 0 ms to minimize.
[2022-05-18 01:25:52] [INFO ] Deduced a trap composed of 216 places in 209 ms of which 1 ms to minimize.
[2022-05-18 01:25:52] [INFO ] Deduced a trap composed of 214 places in 205 ms of which 0 ms to minimize.
[2022-05-18 01:25:52] [INFO ] Deduced a trap composed of 218 places in 205 ms of which 1 ms to minimize.
[2022-05-18 01:25:53] [INFO ] Deduced a trap composed of 220 places in 195 ms of which 0 ms to minimize.
[2022-05-18 01:25:53] [INFO ] Deduced a trap composed of 205 places in 222 ms of which 1 ms to minimize.
[2022-05-18 01:25:53] [INFO ] Deduced a trap composed of 205 places in 197 ms of which 0 ms to minimize.
[2022-05-18 01:25:54] [INFO ] Deduced a trap composed of 209 places in 200 ms of which 1 ms to minimize.
[2022-05-18 01:25:54] [INFO ] Deduced a trap composed of 207 places in 203 ms of which 1 ms to minimize.
[2022-05-18 01:25:54] [INFO ] Deduced a trap composed of 211 places in 230 ms of which 0 ms to minimize.
[2022-05-18 01:25:54] [INFO ] Deduced a trap composed of 212 places in 193 ms of which 1 ms to minimize.
[2022-05-18 01:25:55] [INFO ] Deduced a trap composed of 209 places in 195 ms of which 1 ms to minimize.
[2022-05-18 01:25:55] [INFO ] Deduced a trap composed of 213 places in 210 ms of which 1 ms to minimize.
[2022-05-18 01:25:55] [INFO ] Deduced a trap composed of 220 places in 194 ms of which 1 ms to minimize.
[2022-05-18 01:25:56] [INFO ] Deduced a trap composed of 218 places in 229 ms of which 1 ms to minimize.
[2022-05-18 01:25:56] [INFO ] Deduced a trap composed of 213 places in 201 ms of which 0 ms to minimize.
[2022-05-18 01:25:57] [INFO ] Deduced a trap composed of 216 places in 201 ms of which 0 ms to minimize.
[2022-05-18 01:25:58] [INFO ] Deduced a trap composed of 209 places in 200 ms of which 0 ms to minimize.
[2022-05-18 01:25:58] [INFO ] Deduced a trap composed of 218 places in 225 ms of which 0 ms to minimize.
[2022-05-18 01:25:58] [INFO ] Deduced a trap composed of 209 places in 189 ms of which 1 ms to minimize.
[2022-05-18 01:25:59] [INFO ] Deduced a trap composed of 215 places in 205 ms of which 1 ms to minimize.
[2022-05-18 01:25:59] [INFO ] Deduced a trap composed of 213 places in 196 ms of which 1 ms to minimize.
[2022-05-18 01:25:59] [INFO ] Deduced a trap composed of 211 places in 201 ms of which 0 ms to minimize.
[2022-05-18 01:26:00] [INFO ] Deduced a trap composed of 205 places in 195 ms of which 1 ms to minimize.
[2022-05-18 01:26:00] [INFO ] Deduced a trap composed of 211 places in 192 ms of which 1 ms to minimize.
[2022-05-18 01:26:00] [INFO ] Deduced a trap composed of 215 places in 193 ms of which 0 ms to minimize.
[2022-05-18 01:26:01] [INFO ] Deduced a trap composed of 220 places in 193 ms of which 0 ms to minimize.
[2022-05-18 01:26:01] [INFO ] Deduced a trap composed of 214 places in 195 ms of which 0 ms to minimize.
[2022-05-18 01:26:02] [INFO ] Deduced a trap composed of 205 places in 198 ms of which 1 ms to minimize.
[2022-05-18 01:26:02] [INFO ] Deduced a trap composed of 211 places in 195 ms of which 0 ms to minimize.
[2022-05-18 01:26:02] [INFO ] Deduced a trap composed of 220 places in 198 ms of which 0 ms to minimize.
[2022-05-18 01:26:02] [INFO ] Deduced a trap composed of 205 places in 221 ms of which 1 ms to minimize.
[2022-05-18 01:26:03] [INFO ] Deduced a trap composed of 213 places in 217 ms of which 0 ms to minimize.
[2022-05-18 01:26:03] [INFO ] Deduced a trap composed of 199 places in 212 ms of which 1 ms to minimize.
[2022-05-18 01:26:05] [INFO ] Deduced a trap composed of 207 places in 199 ms of which 0 ms to minimize.
[2022-05-18 01:26:05] [INFO ] Deduced a trap composed of 210 places in 191 ms of which 1 ms to minimize.
[2022-05-18 01:26:06] [INFO ] Deduced a trap composed of 212 places in 202 ms of which 0 ms to minimize.
[2022-05-18 01:26:06] [INFO ] Deduced a trap composed of 212 places in 222 ms of which 0 ms to minimize.
[2022-05-18 01:26:07] [INFO ] Deduced a trap composed of 203 places in 208 ms of which 1 ms to minimize.
[2022-05-18 01:26:07] [INFO ] Deduced a trap composed of 212 places in 191 ms of which 0 ms to minimize.
[2022-05-18 01:26:23] [INFO ] Deduced a trap composed of 2 places in 267 ms of which 1 ms to minimize.
[2022-05-18 01:26:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-18 01:26:23] [INFO ] [Real]Absence check using 56 positive place invariants in 14 ms returned sat
[2022-05-18 01:26:23] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 4 ms returned unsat
[2022-05-18 01:26:23] [INFO ] [Real]Absence check using 56 positive place invariants in 13 ms returned sat
[2022-05-18 01:26:23] [INFO ] [Real]Absence check using 56 positive and 6 generalized place invariants in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 4, 10, 10, 4, 1, 1] Max seen :[1, 1, 1, 1, 4, 3, 4, 3, 1, 1]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 456 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 456/456 places, 1027/1027 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 456 transition count 1005
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 434 transition count 1005
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 44 place count 434 transition count 984
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 86 place count 413 transition count 984
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 412 transition count 983
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 412 transition count 983
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 411 transition count 982
Applied a total of 90 rules in 110 ms. Remains 411 /456 variables (removed 45) and now considering 982/1027 (removed 45) transitions.
Finished structural reductions, in 1 iterations. Remains : 411/456 places, 982/1027 transitions.
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2022-05-18 01:26:23] [INFO ] Computed 62 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 70702 resets, run finished after 8067 ms. (steps per millisecond=123 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 9592 resets, run finished after 1567 ms. (steps per millisecond=638 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 8888 resets, run finished after 1483 ms. (steps per millisecond=674 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 9492 resets, run finished after 1552 ms. (steps per millisecond=644 ) properties (out of 3) seen :10
[2022-05-18 01:26:36] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-18 01:26:36] [INFO ] Computed 62 place invariants in 22 ms
[2022-05-18 01:26:36] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-18 01:26:36] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-18 01:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:26:36] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2022-05-18 01:26:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:26:36] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-18 01:26:36] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-18 01:26:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:26:36] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2022-05-18 01:26:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:26:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2022-05-18 01:26:37] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 0 ms to minimize.
[2022-05-18 01:26:37] [INFO ] Deduced a trap composed of 160 places in 183 ms of which 0 ms to minimize.
[2022-05-18 01:26:37] [INFO ] Deduced a trap composed of 160 places in 183 ms of which 1 ms to minimize.
[2022-05-18 01:26:37] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 0 ms to minimize.
[2022-05-18 01:26:38] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 1 ms to minimize.
[2022-05-18 01:26:38] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 2 ms to minimize.
[2022-05-18 01:26:38] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 0 ms to minimize.
[2022-05-18 01:26:38] [INFO ] Deduced a trap composed of 156 places in 186 ms of which 0 ms to minimize.
[2022-05-18 01:26:38] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 0 ms to minimize.
[2022-05-18 01:26:39] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 0 ms to minimize.
[2022-05-18 01:26:39] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 0 ms to minimize.
[2022-05-18 01:26:39] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 0 ms to minimize.
[2022-05-18 01:26:39] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 0 ms to minimize.
[2022-05-18 01:26:40] [INFO ] Deduced a trap composed of 164 places in 184 ms of which 1 ms to minimize.
[2022-05-18 01:26:40] [INFO ] Deduced a trap composed of 168 places in 187 ms of which 1 ms to minimize.
[2022-05-18 01:26:40] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 0 ms to minimize.
[2022-05-18 01:26:41] [INFO ] Deduced a trap composed of 158 places in 189 ms of which 1 ms to minimize.
[2022-05-18 01:26:41] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 0 ms to minimize.
[2022-05-18 01:26:41] [INFO ] Deduced a trap composed of 168 places in 184 ms of which 1 ms to minimize.
[2022-05-18 01:26:41] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 1 ms to minimize.
[2022-05-18 01:26:42] [INFO ] Deduced a trap composed of 168 places in 181 ms of which 0 ms to minimize.
[2022-05-18 01:26:42] [INFO ] Deduced a trap composed of 160 places in 187 ms of which 0 ms to minimize.
[2022-05-18 01:26:42] [INFO ] Deduced a trap composed of 162 places in 187 ms of which 1 ms to minimize.
[2022-05-18 01:26:42] [INFO ] Deduced a trap composed of 158 places in 188 ms of which 0 ms to minimize.
[2022-05-18 01:26:42] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 0 ms to minimize.
[2022-05-18 01:26:43] [INFO ] Deduced a trap composed of 156 places in 187 ms of which 0 ms to minimize.
[2022-05-18 01:26:43] [INFO ] Deduced a trap composed of 171 places in 194 ms of which 1 ms to minimize.
[2022-05-18 01:26:43] [INFO ] Deduced a trap composed of 170 places in 185 ms of which 1 ms to minimize.
[2022-05-18 01:26:43] [INFO ] Deduced a trap composed of 166 places in 194 ms of which 0 ms to minimize.
[2022-05-18 01:26:44] [INFO ] Deduced a trap composed of 154 places in 192 ms of which 0 ms to minimize.
[2022-05-18 01:26:44] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 0 ms to minimize.
[2022-05-18 01:26:44] [INFO ] Deduced a trap composed of 160 places in 187 ms of which 0 ms to minimize.
[2022-05-18 01:26:45] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 1 ms to minimize.
[2022-05-18 01:26:45] [INFO ] Deduced a trap composed of 168 places in 187 ms of which 1 ms to minimize.
[2022-05-18 01:26:45] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 0 ms to minimize.
[2022-05-18 01:26:46] [INFO ] Deduced a trap composed of 166 places in 186 ms of which 0 ms to minimize.
[2022-05-18 01:26:46] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 1 ms to minimize.
[2022-05-18 01:26:47] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2022-05-18 01:26:48] [INFO ] Deduced a trap composed of 154 places in 189 ms of which 0 ms to minimize.
[2022-05-18 01:26:51] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 1 ms to minimize.
[2022-05-18 01:26:51] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 0 ms to minimize.
[2022-05-18 01:26:51] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 1 ms to minimize.
[2022-05-18 01:26:51] [INFO ] Deduced a trap composed of 158 places in 189 ms of which 1 ms to minimize.
[2022-05-18 01:26:51] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 0 ms to minimize.
[2022-05-18 01:26:52] [INFO ] Deduced a trap composed of 166 places in 189 ms of which 1 ms to minimize.
[2022-05-18 01:26:52] [INFO ] Deduced a trap composed of 170 places in 187 ms of which 1 ms to minimize.
[2022-05-18 01:26:52] [INFO ] Deduced a trap composed of 166 places in 183 ms of which 0 ms to minimize.
[2022-05-18 01:26:53] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 1 ms to minimize.
[2022-05-18 01:26:54] [INFO ] Deduced a trap composed of 166 places in 195 ms of which 0 ms to minimize.
[2022-05-18 01:26:54] [INFO ] Deduced a trap composed of 158 places in 186 ms of which 1 ms to minimize.
[2022-05-18 01:26:57] [INFO ] Deduced a trap composed of 166 places in 183 ms of which 1 ms to minimize.
[2022-05-18 01:26:57] [INFO ] Deduced a trap composed of 171 places in 194 ms of which 1 ms to minimize.
[2022-05-18 01:26:58] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 1 ms to minimize.
[2022-05-18 01:27:21] [INFO ] Deduced a trap composed of 2 places in 241 ms of which 0 ms to minimize.
[2022-05-18 01:27:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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-18 01:27:21] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-18 01:27:21] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-18 01:27:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:27:22] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2022-05-18 01:27:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:27:22] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2022-05-18 01:27:22] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-18 01:27:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:27:28] [INFO ] [Nat]Absence check using state equation in 6179 ms returned unknown
[2022-05-18 01:27:28] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-18 01:27:28] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-18 01:27:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:27:28] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2022-05-18 01:27:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:27:28] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2022-05-18 01:27:28] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-18 01:27:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:27:28] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2022-05-18 01:27:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 34 ms returned sat
[2022-05-18 01:27:29] [INFO ] Deduced a trap composed of 166 places in 189 ms of which 1 ms to minimize.
[2022-05-18 01:27:29] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 1 ms to minimize.
[2022-05-18 01:27:29] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 0 ms to minimize.
[2022-05-18 01:27:29] [INFO ] Deduced a trap composed of 154 places in 193 ms of which 1 ms to minimize.
[2022-05-18 01:27:30] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 0 ms to minimize.
[2022-05-18 01:27:30] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 0 ms to minimize.
[2022-05-18 01:27:30] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 1 ms to minimize.
[2022-05-18 01:27:30] [INFO ] Deduced a trap composed of 172 places in 184 ms of which 1 ms to minimize.
[2022-05-18 01:27:31] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 1 ms to minimize.
[2022-05-18 01:27:31] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 1 ms to minimize.
[2022-05-18 01:27:31] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 1 ms to minimize.
[2022-05-18 01:27:31] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 1 ms to minimize.
[2022-05-18 01:27:31] [INFO ] Deduced a trap composed of 164 places in 187 ms of which 1 ms to minimize.
[2022-05-18 01:27:32] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 0 ms to minimize.
[2022-05-18 01:27:32] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 0 ms to minimize.
[2022-05-18 01:27:32] [INFO ] Deduced a trap composed of 164 places in 186 ms of which 0 ms to minimize.
[2022-05-18 01:27:32] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 0 ms to minimize.
[2022-05-18 01:27:33] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 0 ms to minimize.
[2022-05-18 01:27:33] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 0 ms to minimize.
[2022-05-18 01:27:33] [INFO ] Deduced a trap composed of 168 places in 187 ms of which 2 ms to minimize.
[2022-05-18 01:27:33] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 0 ms to minimize.
[2022-05-18 01:27:34] [INFO ] Deduced a trap composed of 162 places in 188 ms of which 0 ms to minimize.
[2022-05-18 01:27:34] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 0 ms to minimize.
[2022-05-18 01:27:34] [INFO ] Deduced a trap composed of 160 places in 186 ms of which 1 ms to minimize.
[2022-05-18 01:27:34] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 0 ms to minimize.
[2022-05-18 01:27:35] [INFO ] Deduced a trap composed of 165 places in 202 ms of which 0 ms to minimize.
[2022-05-18 01:27:35] [INFO ] Deduced a trap composed of 160 places in 184 ms of which 0 ms to minimize.
[2022-05-18 01:27:35] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 1 ms to minimize.
[2022-05-18 01:27:35] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 0 ms to minimize.
[2022-05-18 01:27:36] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 0 ms to minimize.
[2022-05-18 01:27:36] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 1 ms to minimize.
[2022-05-18 01:27:36] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 0 ms to minimize.
[2022-05-18 01:27:36] [INFO ] Deduced a trap composed of 164 places in 187 ms of which 1 ms to minimize.
[2022-05-18 01:27:37] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 0 ms to minimize.
[2022-05-18 01:27:37] [INFO ] Deduced a trap composed of 175 places in 187 ms of which 1 ms to minimize.
[2022-05-18 01:27:38] [INFO ] Deduced a trap composed of 163 places in 194 ms of which 0 ms to minimize.
[2022-05-18 01:27:38] [INFO ] Deduced a trap composed of 165 places in 191 ms of which 0 ms to minimize.
[2022-05-18 01:27:38] [INFO ] Deduced a trap composed of 163 places in 194 ms of which 0 ms to minimize.
[2022-05-18 01:27:38] [INFO ] Deduced a trap composed of 179 places in 183 ms of which 0 ms to minimize.
[2022-05-18 01:27:39] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 0 ms to minimize.
[2022-05-18 01:27:39] [INFO ] Deduced a trap composed of 156 places in 190 ms of which 1 ms to minimize.
[2022-05-18 01:27:39] [INFO ] Deduced a trap composed of 167 places in 189 ms of which 0 ms to minimize.
[2022-05-18 01:27:40] [INFO ] Deduced a trap composed of 167 places in 195 ms of which 0 ms to minimize.
[2022-05-18 01:27:40] [INFO ] Deduced a trap composed of 171 places in 192 ms of which 0 ms to minimize.
[2022-05-18 01:27:40] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 0 ms to minimize.
[2022-05-18 01:27:40] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 0 ms to minimize.
[2022-05-18 01:27:41] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 1 ms to minimize.
[2022-05-18 01:28:13] [INFO ] Deduced a trap composed of 2 places in 231 ms of which 0 ms to minimize.
[2022-05-18 01:28:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10, 10, 4] Max seen :[3, 4, 3]
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 24 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Starting structural reductions, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 23 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2022-05-18 01:28:13] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-18 01:28:13] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-18 01:28:14] [INFO ] Implicit Places using invariants in 412 ms returned []
[2022-05-18 01:28:14] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-18 01:28:14] [INFO ] Computed 62 place invariants in 22 ms
[2022-05-18 01:28:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:28:15] [INFO ] Implicit Places using invariants and state equation in 1427 ms returned []
Implicit Place search using SMT with State Equation took 1850 ms to find 0 implicit places.
[2022-05-18 01:28:15] [INFO ] Redundant transitions in 57 ms returned []
[2022-05-18 01:28:15] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-18 01:28:15] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-18 01:28:16] [INFO ] Dead Transitions using invariants and state equation in 397 ms returned []
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-10
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2022-05-18 01:28:16] [INFO ] Computed 62 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 694 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :3
[2022-05-18 01:28:16] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-18 01:28:16] [INFO ] Computed 62 place invariants in 21 ms
[2022-05-18 01:28:16] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-18 01:28:16] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-18 01:28:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:28:16] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2022-05-18 01:28:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:28:16] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2022-05-18 01:28:16] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-18 01:28:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:28:17] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2022-05-18 01:28:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:28:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2022-05-18 01:28:17] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 0 ms to minimize.
[2022-05-18 01:28:17] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 0 ms to minimize.
[2022-05-18 01:28:17] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2022-05-18 01:28:17] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 1 ms to minimize.
[2022-05-18 01:28:18] [INFO ] Deduced a trap composed of 158 places in 189 ms of which 0 ms to minimize.
[2022-05-18 01:28:18] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 0 ms to minimize.
[2022-05-18 01:28:18] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 0 ms to minimize.
[2022-05-18 01:28:18] [INFO ] Deduced a trap composed of 156 places in 190 ms of which 1 ms to minimize.
[2022-05-18 01:28:19] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2022-05-18 01:28:19] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 1 ms to minimize.
[2022-05-18 01:28:19] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 1 ms to minimize.
[2022-05-18 01:28:19] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 1 ms to minimize.
[2022-05-18 01:28:20] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 0 ms to minimize.
[2022-05-18 01:28:20] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 0 ms to minimize.
[2022-05-18 01:28:20] [INFO ] Deduced a trap composed of 168 places in 194 ms of which 0 ms to minimize.
[2022-05-18 01:28:21] [INFO ] Deduced a trap composed of 164 places in 186 ms of which 1 ms to minimize.
[2022-05-18 01:28:21] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 1 ms to minimize.
[2022-05-18 01:28:21] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 0 ms to minimize.
[2022-05-18 01:28:21] [INFO ] Deduced a trap composed of 168 places in 182 ms of which 0 ms to minimize.
[2022-05-18 01:28:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 25 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2022-05-18 01:28:21] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-18 01:28:21] [INFO ] Computed 62 place invariants in 20 ms
[2022-05-18 01:28:22] [INFO ] Dead Transitions using invariants and state equation in 433 ms returned []
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2022-05-18 01:28:22] [INFO ] Computed 62 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 70188 resets, run finished after 8100 ms. (steps per millisecond=123 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9547 resets, run finished after 1563 ms. (steps per millisecond=639 ) properties (out of 1) seen :3
[2022-05-18 01:28:31] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-18 01:28:31] [INFO ] Computed 62 place invariants in 21 ms
[2022-05-18 01:28:32] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-18 01:28:32] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-18 01:28:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:28:32] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2022-05-18 01:28:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:28:32] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-18 01:28:32] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-18 01:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:28:32] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2022-05-18 01:28:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:28:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2022-05-18 01:28:32] [INFO ] Deduced a trap composed of 160 places in 186 ms of which 0 ms to minimize.
[2022-05-18 01:28:33] [INFO ] Deduced a trap composed of 160 places in 182 ms of which 0 ms to minimize.
[2022-05-18 01:28:33] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 0 ms to minimize.
[2022-05-18 01:28:33] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 0 ms to minimize.
[2022-05-18 01:28:33] [INFO ] Deduced a trap composed of 158 places in 188 ms of which 1 ms to minimize.
[2022-05-18 01:28:34] [INFO ] Deduced a trap composed of 158 places in 180 ms of which 0 ms to minimize.
[2022-05-18 01:28:34] [INFO ] Deduced a trap composed of 164 places in 182 ms of which 1 ms to minimize.
[2022-05-18 01:28:34] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 1 ms to minimize.
[2022-05-18 01:28:34] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 0 ms to minimize.
[2022-05-18 01:28:34] [INFO ] Deduced a trap composed of 164 places in 186 ms of which 0 ms to minimize.
[2022-05-18 01:28:35] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 1 ms to minimize.
[2022-05-18 01:28:35] [INFO ] Deduced a trap composed of 158 places in 189 ms of which 0 ms to minimize.
[2022-05-18 01:28:35] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 0 ms to minimize.
[2022-05-18 01:28:36] [INFO ] Deduced a trap composed of 164 places in 185 ms of which 0 ms to minimize.
[2022-05-18 01:28:36] [INFO ] Deduced a trap composed of 168 places in 193 ms of which 1 ms to minimize.
[2022-05-18 01:28:36] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 1 ms to minimize.
[2022-05-18 01:28:36] [INFO ] Deduced a trap composed of 158 places in 188 ms of which 0 ms to minimize.
[2022-05-18 01:28:37] [INFO ] Deduced a trap composed of 160 places in 186 ms of which 0 ms to minimize.
[2022-05-18 01:28:37] [INFO ] Deduced a trap composed of 168 places in 189 ms of which 0 ms to minimize.
[2022-05-18 01:28:37] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 0 ms to minimize.
[2022-05-18 01:28:37] [INFO ] Deduced a trap composed of 168 places in 191 ms of which 1 ms to minimize.
[2022-05-18 01:28:38] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 0 ms to minimize.
[2022-05-18 01:28:38] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 1 ms to minimize.
[2022-05-18 01:28:38] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 0 ms to minimize.
[2022-05-18 01:28:38] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 0 ms to minimize.
[2022-05-18 01:28:39] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 1 ms to minimize.
[2022-05-18 01:28:39] [INFO ] Deduced a trap composed of 171 places in 197 ms of which 1 ms to minimize.
[2022-05-18 01:28:39] [INFO ] Deduced a trap composed of 170 places in 190 ms of which 0 ms to minimize.
[2022-05-18 01:28:39] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 0 ms to minimize.
[2022-05-18 01:28:40] [INFO ] Deduced a trap composed of 154 places in 193 ms of which 0 ms to minimize.
[2022-05-18 01:28:40] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2022-05-18 01:28:40] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 1 ms to minimize.
[2022-05-18 01:28:41] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 0 ms to minimize.
[2022-05-18 01:28:41] [INFO ] Deduced a trap composed of 168 places in 180 ms of which 1 ms to minimize.
[2022-05-18 01:28:41] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 0 ms to minimize.
[2022-05-18 01:28:42] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 0 ms to minimize.
[2022-05-18 01:28:42] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 1 ms to minimize.
[2022-05-18 01:28:43] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2022-05-18 01:28:44] [INFO ] Deduced a trap composed of 154 places in 191 ms of which 0 ms to minimize.
[2022-05-18 01:28:46] [INFO ] Deduced a trap composed of 160 places in 181 ms of which 1 ms to minimize.
[2022-05-18 01:28:47] [INFO ] Deduced a trap composed of 158 places in 182 ms of which 1 ms to minimize.
[2022-05-18 01:28:47] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 0 ms to minimize.
[2022-05-18 01:28:47] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2022-05-18 01:28:47] [INFO ] Deduced a trap composed of 158 places in 189 ms of which 1 ms to minimize.
[2022-05-18 01:28:48] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 0 ms to minimize.
[2022-05-18 01:28:48] [INFO ] Deduced a trap composed of 170 places in 187 ms of which 1 ms to minimize.
[2022-05-18 01:28:48] [INFO ] Deduced a trap composed of 166 places in 189 ms of which 0 ms to minimize.
[2022-05-18 01:28:49] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 0 ms to minimize.
[2022-05-18 01:28:50] [INFO ] Deduced a trap composed of 166 places in 187 ms of which 0 ms to minimize.
[2022-05-18 01:28:50] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 0 ms to minimize.
[2022-05-18 01:28:53] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 0 ms to minimize.
[2022-05-18 01:28:53] [INFO ] Deduced a trap composed of 171 places in 190 ms of which 1 ms to minimize.
[2022-05-18 01:28:53] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 1 ms to minimize.
[2022-05-18 01:29:17] [INFO ] Deduced a trap composed of 2 places in 235 ms of which 0 ms to minimize.
[2022-05-18 01:29:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 18 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Starting structural reductions, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 24 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2022-05-18 01:29:17] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-18 01:29:17] [INFO ] Computed 62 place invariants in 19 ms
[2022-05-18 01:29:17] [INFO ] Implicit Places using invariants in 313 ms returned []
[2022-05-18 01:29:17] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-18 01:29:17] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-18 01:29:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:29:19] [INFO ] Implicit Places using invariants and state equation in 1415 ms returned []
Implicit Place search using SMT with State Equation took 1729 ms to find 0 implicit places.
[2022-05-18 01:29:19] [INFO ] Redundant transitions in 18 ms returned []
[2022-05-18 01:29:19] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-18 01:29:19] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-18 01:29:19] [INFO ] Dead Transitions using invariants and state equation in 394 ms returned []
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-10 in 63528 ms.
Starting property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-11
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2022-05-18 01:29:19] [INFO ] Computed 62 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 709 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :4
[2022-05-18 01:29:19] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-18 01:29:19] [INFO ] Computed 62 place invariants in 18 ms
[2022-05-18 01:29:19] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-18 01:29:19] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-18 01:29:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:29:20] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2022-05-18 01:29:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:29:20] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-18 01:29:20] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-18 01:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:29:25] [INFO ] [Nat]Absence check using state equation in 4948 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 411/411 places, 982/982 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 411 transition count 981
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 410 transition count 981
Applied a total of 2 rules in 27 ms. Remains 410 /411 variables (removed 1) and now considering 981/982 (removed 1) transitions.
[2022-05-18 01:29:25] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 01:29:25] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-18 01:29:25] [INFO ] Dead Transitions using invariants and state equation in 397 ms returned []
Finished structural reductions, in 1 iterations. Remains : 410/411 places, 981/982 transitions.
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 01:29:25] [INFO ] Computed 62 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 72629 resets, run finished after 8574 ms. (steps per millisecond=116 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 8902 resets, run finished after 1516 ms. (steps per millisecond=659 ) properties (out of 1) seen :4
[2022-05-18 01:29:35] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 01:29:35] [INFO ] Computed 62 place invariants in 18 ms
[2022-05-18 01:29:35] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-18 01:29:35] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-18 01:29:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:29:36] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2022-05-18 01:29:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:29:36] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-18 01:29:36] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-18 01:29:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:29:42] [INFO ] [Nat]Absence check using state equation in 6180 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 21 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 16 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2022-05-18 01:29:42] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 01:29:42] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-18 01:29:42] [INFO ] Implicit Places using invariants in 299 ms returned []
[2022-05-18 01:29:42] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 01:29:42] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-18 01:29:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:29:44] [INFO ] Implicit Places using invariants and state equation in 1526 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
[2022-05-18 01:29:44] [INFO ] Redundant transitions in 14 ms returned []
[2022-05-18 01:29:44] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 01:29:44] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-18 01:29:44] [INFO ] Dead Transitions using invariants and state equation in 365 ms returned []
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-11 in 24802 ms.
Starting property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-13
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2022-05-18 01:29:44] [INFO ] Computed 62 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 720 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
[2022-05-18 01:29:44] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-18 01:29:44] [INFO ] Computed 62 place invariants in 22 ms
[2022-05-18 01:29:44] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-18 01:29:44] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-18 01:29:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:29:44] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2022-05-18 01:29:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:29:45] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2022-05-18 01:29:45] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-18 01:29:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:29:45] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2022-05-18 01:29:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:29:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 38 ms returned sat
[2022-05-18 01:29:45] [INFO ] Deduced a trap composed of 166 places in 181 ms of which 1 ms to minimize.
[2022-05-18 01:29:45] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 0 ms to minimize.
[2022-05-18 01:29:45] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 1 ms to minimize.
[2022-05-18 01:29:46] [INFO ] Deduced a trap composed of 154 places in 189 ms of which 0 ms to minimize.
[2022-05-18 01:29:46] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2022-05-18 01:29:46] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 0 ms to minimize.
[2022-05-18 01:29:46] [INFO ] Deduced a trap composed of 160 places in 190 ms of which 0 ms to minimize.
[2022-05-18 01:29:47] [INFO ] Deduced a trap composed of 172 places in 193 ms of which 0 ms to minimize.
[2022-05-18 01:29:47] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 1 ms to minimize.
[2022-05-18 01:29:47] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 0 ms to minimize.
[2022-05-18 01:29:47] [INFO ] Deduced a trap composed of 160 places in 187 ms of which 0 ms to minimize.
[2022-05-18 01:29:48] [INFO ] Deduced a trap composed of 164 places in 184 ms of which 1 ms to minimize.
[2022-05-18 01:29:48] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2022-05-18 01:29:48] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 0 ms to minimize.
[2022-05-18 01:29:48] [INFO ] Deduced a trap composed of 156 places in 189 ms of which 0 ms to minimize.
[2022-05-18 01:29:49] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 0 ms to minimize.
[2022-05-18 01:29:49] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 0 ms to minimize.
[2022-05-18 01:29:49] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 0 ms to minimize.
[2022-05-18 01:29:49] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 1 ms to minimize.
[2022-05-18 01:29:50] [INFO ] Deduced a trap composed of 168 places in 193 ms of which 0 ms to minimize.
[2022-05-18 01:29: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) : [4] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 411/411 places, 982/982 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 411 transition count 981
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 410 transition count 981
Applied a total of 2 rules in 20 ms. Remains 410 /411 variables (removed 1) and now considering 981/982 (removed 1) transitions.
[2022-05-18 01:29:50] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 01:29:50] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-18 01:29:50] [INFO ] Dead Transitions using invariants and state equation in 382 ms returned []
Finished structural reductions, in 1 iterations. Remains : 410/411 places, 981/982 transitions.
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 01:29:50] [INFO ] Computed 62 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 72710 resets, run finished after 8349 ms. (steps per millisecond=119 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9686 resets, run finished after 1557 ms. (steps per millisecond=642 ) properties (out of 1) seen :3
[2022-05-18 01:30:00] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 01:30:00] [INFO ] Computed 62 place invariants in 19 ms
[2022-05-18 01:30:00] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-18 01:30:00] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-18 01:30:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:30:00] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2022-05-18 01:30:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:30:00] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-18 01:30:00] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 14 ms returned sat
[2022-05-18 01:30:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:30:00] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2022-05-18 01:30:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:30:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 55 ms returned sat
[2022-05-18 01:30:01] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 1 ms to minimize.
[2022-05-18 01:30:01] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 1 ms to minimize.
[2022-05-18 01:30:01] [INFO ] Deduced a trap composed of 160 places in 184 ms of which 0 ms to minimize.
[2022-05-18 01:30:01] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 0 ms to minimize.
[2022-05-18 01:30:02] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 1 ms to minimize.
[2022-05-18 01:30:02] [INFO ] Deduced a trap composed of 160 places in 181 ms of which 0 ms to minimize.
[2022-05-18 01:30:02] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 0 ms to minimize.
[2022-05-18 01:30:02] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 0 ms to minimize.
[2022-05-18 01:30:03] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 0 ms to minimize.
[2022-05-18 01:30:03] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 0 ms to minimize.
[2022-05-18 01:30:03] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 1 ms to minimize.
[2022-05-18 01:30:03] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 1 ms to minimize.
[2022-05-18 01:30:04] [INFO ] Deduced a trap composed of 170 places in 192 ms of which 0 ms to minimize.
[2022-05-18 01:30:04] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 0 ms to minimize.
[2022-05-18 01:30:04] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 0 ms to minimize.
[2022-05-18 01:30:04] [INFO ] Deduced a trap composed of 154 places in 193 ms of which 1 ms to minimize.
[2022-05-18 01:30:05] [INFO ] Deduced a trap composed of 166 places in 194 ms of which 0 ms to minimize.
[2022-05-18 01:30:05] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 1 ms to minimize.
[2022-05-18 01:30:05] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 0 ms to minimize.
[2022-05-18 01:30:05] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 0 ms to minimize.
[2022-05-18 01:30:06] [INFO ] Deduced a trap composed of 170 places in 193 ms of which 0 ms to minimize.
[2022-05-18 01:30:06] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 0 ms to minimize.
[2022-05-18 01:30:06] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 1 ms to minimize.
[2022-05-18 01:30:06] [INFO ] Deduced a trap composed of 162 places in 187 ms of which 1 ms to minimize.
[2022-05-18 01:30:06] [INFO ] Deduced a trap composed of 158 places in 188 ms of which 1 ms to minimize.
[2022-05-18 01:30:07] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2022-05-18 01:30:07] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 0 ms to minimize.
[2022-05-18 01:30:07] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 1 ms to minimize.
[2022-05-18 01:30:08] [INFO ] Deduced a trap composed of 156 places in 193 ms of which 1 ms to minimize.
[2022-05-18 01:30:08] [INFO ] Deduced a trap composed of 164 places in 185 ms of which 0 ms to minimize.
[2022-05-18 01:30:09] [INFO ] Deduced a trap composed of 162 places in 182 ms of which 0 ms to minimize.
[2022-05-18 01:30:09] [INFO ] Deduced a trap composed of 166 places in 187 ms of which 0 ms to minimize.
[2022-05-18 01:30:09] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 0 ms to minimize.
[2022-05-18 01:30:09] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 0 ms to minimize.
[2022-05-18 01:30:10] [INFO ] Deduced a trap composed of 168 places in 187 ms of which 0 ms to minimize.
[2022-05-18 01:30:10] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 1 ms to minimize.
[2022-05-18 01:30:10] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 0 ms to minimize.
[2022-05-18 01:30:10] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 0 ms to minimize.
[2022-05-18 01:30:11] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 1 ms to minimize.
[2022-05-18 01:30:11] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 1 ms to minimize.
[2022-05-18 01:30:11] [INFO ] Deduced a trap composed of 154 places in 188 ms of which 0 ms to minimize.
[2022-05-18 01:30:11] [INFO ] Deduced a trap composed of 164 places in 187 ms of which 0 ms to minimize.
[2022-05-18 01:30:12] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 1 ms to minimize.
[2022-05-18 01:30:12] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 1 ms to minimize.
[2022-05-18 01:30:12] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 0 ms to minimize.
[2022-05-18 01:30:12] [INFO ] Deduced a trap composed of 162 places in 187 ms of which 1 ms to minimize.
[2022-05-18 01:30:12] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 0 ms to minimize.
[2022-05-18 01:30:13] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 1 ms to minimize.
[2022-05-18 01:30:13] [INFO ] Deduced a trap composed of 164 places in 186 ms of which 0 ms to minimize.
[2022-05-18 01:30:13] [INFO ] Deduced a trap composed of 154 places in 182 ms of which 0 ms to minimize.
[2022-05-18 01:30:13] [INFO ] Deduced a trap composed of 162 places in 188 ms of which 1 ms to minimize.
[2022-05-18 01:30:14] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 1 ms to minimize.
[2022-05-18 01:30:14] [INFO ] Deduced a trap composed of 168 places in 185 ms of which 0 ms to minimize.
[2022-05-18 01:30:15] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 1 ms to minimize.
[2022-05-18 01:30:15] [INFO ] Deduced a trap composed of 166 places in 185 ms of which 0 ms to minimize.
[2022-05-18 01:30:15] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 1 ms to minimize.
[2022-05-18 01:30:15] [INFO ] Deduced a trap composed of 162 places in 177 ms of which 1 ms to minimize.
[2022-05-18 01:30:16] [INFO ] Deduced a trap composed of 160 places in 182 ms of which 1 ms to minimize.
[2022-05-18 01:30:16] [INFO ] Deduced a trap composed of 168 places in 191 ms of which 0 ms to minimize.
[2022-05-18 01:30:19] [INFO ] Deduced a trap composed of 158 places in 183 ms of which 0 ms to minimize.
[2022-05-18 01:30:19] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 0 ms to minimize.
[2022-05-18 01:30:19] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 1 ms to minimize.
[2022-05-18 01:30:20] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 1 ms to minimize.
[2022-05-18 01:30:21] [INFO ] Deduced a trap composed of 166 places in 180 ms of which 0 ms to minimize.
[2022-05-18 01:30:45] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 0 ms to minimize.
[2022-05-18 01:30:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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) : [4] Max seen :[3]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 15 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 14 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2022-05-18 01:30:45] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 01:30:45] [INFO ] Computed 62 place invariants in 12 ms
[2022-05-18 01:30:46] [INFO ] Implicit Places using invariants in 309 ms returned []
[2022-05-18 01:30:46] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 01:30:46] [INFO ] Computed 62 place invariants in 18 ms
[2022-05-18 01:30:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:30:47] [INFO ] Implicit Places using invariants and state equation in 1448 ms returned []
Implicit Place search using SMT with State Equation took 1758 ms to find 0 implicit places.
[2022-05-18 01:30:47] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-18 01:30:47] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 01:30:47] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-18 01:30:48] [INFO ] Dead Transitions using invariants and state equation in 374 ms returned []
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-13 in 63604 ms.
[2022-05-18 01:30:48] [INFO ] Flatten gal took : 162 ms
[2022-05-18 01:30:48] [INFO ] Applying decomposition
[2022-05-18 01:30:48] [INFO ] Flatten gal took : 107 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/graph11778931397672401005.txt, -o, /tmp/graph11778931397672401005.bin, -w, /tmp/graph11778931397672401005.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/graph11778931397672401005.bin, -l, -1, -v, -w, /tmp/graph11778931397672401005.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-18 01:30:48] [INFO ] Decomposing Gal with order
[2022-05-18 01:30:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:30:49] [INFO ] Removed a total of 2736 redundant transitions.
[2022-05-18 01:30:49] [INFO ] Flatten gal took : 211 ms
[2022-05-18 01:30:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 265 labels/synchronizations in 44 ms.
[2022-05-18 01:30:49] [INFO ] Time to serialize gal into /tmp/UpperBounds8917118536510926553.gal : 16 ms
[2022-05-18 01:30:49] [INFO ] Time to serialize properties into /tmp/UpperBounds1046135770798361052.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/UpperBounds8917118536510926553.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds1046135770798361052.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds8917118536510926553.gal -t CGAL -reachable-file /tmp/UpperBounds1046135770798361052.prop --nowitness
Loading property file /tmp/UpperBounds1046135770798361052.prop.
Detected timeout of ITS tools.
[2022-05-18 01:53:52] [INFO ] Applying decomposition
[2022-05-18 01:53:53] [INFO ] Flatten gal took : 376 ms
[2022-05-18 01:53:53] [INFO ] Decomposing Gal with order
[2022-05-18 01:53:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:53:54] [INFO ] Removed a total of 5759 redundant transitions.
[2022-05-18 01:53:54] [INFO ] Flatten gal took : 910 ms
[2022-05-18 01:53:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 91 ms.
[2022-05-18 01:53:54] [INFO ] Time to serialize gal into /tmp/UpperBounds11910599172289478349.gal : 59 ms
[2022-05-18 01:53:54] [INFO ] Time to serialize properties into /tmp/UpperBounds3554399220177717176.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/UpperBounds11910599172289478349.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds3554399220177717176.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds11910599172289478349.gal -t CGAL -reachable-file /tmp/UpperBounds3554399220177717176.prop --nowitness
Loading property file /tmp/UpperBounds3554399220177717176.prop.
Detected timeout of ITS tools.
[2022-05-18 02:16:30] [INFO ] Flatten gal took : 175 ms
[2022-05-18 02:16:30] [INFO ] Input system was already deterministic with 982 transitions.
[2022-05-18 02:16:30] [INFO ] Transformed 411 places.
[2022-05-18 02:16:30] [INFO ] Transformed 982 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-18 02:17:00] [INFO ] Time to serialize gal into /tmp/UpperBounds18005870879054422940.gal : 11 ms
[2022-05-18 02:17:00] [INFO ] Time to serialize properties into /tmp/UpperBounds6323877065361761089.prop : 0 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/UpperBounds18005870879054422940.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds6323877065361761089.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --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/UpperBounds18005870879054422940.gal -t CGAL -reachable-file /tmp/UpperBounds6323877065361761089.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds6323877065361761089.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J20"
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 PolyORBNT-COL-S10J20, 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-165277027100289"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J20.tgz
mv PolyORBNT-COL-S10J20 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 ;