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-165277027100301.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-S10J80, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277027100301
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 9.6K Apr 30 04:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 30 04:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 04:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 04:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K 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 95K 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-S10J80-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J80-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652838497670

Running Version 0
[2022-05-18 01:48:20] [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:48:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 01:48:20] [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:48:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 01:48:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 555 ms
[2022-05-18 01:48:20] [INFO ] ms1 symmetric to ms4 in transition trans_489
[2022-05-18 01:48:20] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2022-05-18 01:48:20] [INFO ] ms2 symmetric to ms3 in transition trans_489
[2022-05-18 01:48:20] [INFO ] ms1 symmetric to ms2 in transition trans_488
[2022-05-18 01:48:20] [INFO ] ms2 symmetric to ms3 in transition trans_488
[2022-05-18 01:48:20] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2022-05-18 01:48:20] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1694 PT places and 13742.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2022-05-18 01:48:20] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions in 3 ms.
[2022-05-18 01:48:20] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_3147403855316538564.dot
// Phase 1: matrix 38 rows 48 cols
[2022-05-18 01:48:20] [INFO ] Computed 13 place invariants in 6 ms
FORMULA PolyORBNT-COL-S10J80-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-18 01:48:20] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 3470 transitions in 52 ms.
[2022-05-18 01:48:20] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2022-05-18 01:48:20] [INFO ] Computed 13 place invariants in 15 ms
[2022-05-18 01:48:21] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:21] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-18 01:48:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:48:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:21] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-18 01:48:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:48:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2022-05-18 01:48:21] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
[2022-05-18 01:48:21] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2022-05-18 01:48:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2022-05-18 01:48:21] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:48:21] [INFO ] Added : 36 causal constraints over 8 iterations in 64 ms. Result :sat
Minimization took 13 ms.
[2022-05-18 01:48:21] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2022-05-18 01:48:21] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:21] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:48:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:48:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:21] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:48:21] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 01:48:21] [INFO ] Added : 36 causal constraints over 8 iterations in 53 ms. Result :sat
Minimization took 14 ms.
[2022-05-18 01:48:21] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:21] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-18 01:48:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:48:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:21] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:48:21] [INFO ] Deduced a trap composed of 14 places in 14 ms of which 1 ms to minimize.
[2022-05-18 01:48:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2022-05-18 01:48:21] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:48:21] [INFO ] Added : 15 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 10 ms.
[2022-05-18 01:48:21] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:21] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-18 01:48:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:48:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:21] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:48:21] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 01:48:21] [INFO ] Added : 36 causal constraints over 8 iterations in 45 ms. Result :sat
Minimization took 17 ms.
[2022-05-18 01:48:21] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:21] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:48:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:48:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:21] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:48:21] [INFO ] Deduced a trap composed of 13 places in 10 ms of which 1 ms to minimize.
[2022-05-18 01:48:21] [INFO ] Deduced a trap composed of 14 places in 12 ms of which 1 ms to minimize.
[2022-05-18 01:48:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 34 ms
[2022-05-18 01:48:21] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 01:48:21] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2022-05-18 01:48:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-05-18 01:48:21] [INFO ] Added : 36 causal constraints over 8 iterations in 153 ms. Result :sat
Minimization took 14 ms.
[2022-05-18 01:48:21] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:48:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:21] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:48:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:48:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:48:22] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:48:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:22] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:48:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:48:22] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:48:22] [INFO ] Added : 36 causal constraints over 8 iterations in 60 ms. Result :sat
Minimization took 15 ms.
[2022-05-18 01:48:22] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:48:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-18 01:48:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:22] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-18 01:48:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:48:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:48:22] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:48:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:22] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-05-18 01:48:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:48:22] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 0 ms to minimize.
[2022-05-18 01:48:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2022-05-18 01:48:22] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 01:48:22] [INFO ] Added : 19 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 17 ms.
[2022-05-18 01:48:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:48:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:48:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:22] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-05-18 01:48:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:48:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:48:22] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:48:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:22] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:48:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:48:22] [INFO ] Deduced a trap composed of 14 places in 12 ms of which 0 ms to minimize.
[2022-05-18 01:48:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2022-05-18 01:48:22] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 01:48:22] [INFO ] Added : 17 causal constraints over 4 iterations in 27 ms. Result :sat
Minimization took 160 ms.
[2022-05-18 01:48:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:48:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:48:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:22] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-18 01:48:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:48:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:48:22] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:48:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:22] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-18 01:48:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 01:48:22] [INFO ] Deduced a trap composed of 14 places in 13 ms of which 0 ms to minimize.
[2022-05-18 01:48:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2022-05-18 01:48:22] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:48:22] [INFO ] Deduced a trap composed of 25 places in 18 ms of which 0 ms to minimize.
[2022-05-18 01:48:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-05-18 01:48:22] [INFO ] Added : 36 causal constraints over 8 iterations in 154 ms. Result :sat
Minimization took 48 ms.
[2022-05-18 01:48:23] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-05-18 01:48:23] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:48:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:23] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-18 01:48:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:48:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 01:48:23] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:48:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:23] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-05-18 01:48:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:48:23] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 0 ms to minimize.
[2022-05-18 01:48:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2022-05-18 01:48:23] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 01:48:23] [INFO ] Added : 22 causal constraints over 5 iterations in 29 ms. Result :sat
Minimization took 54 ms.
[2022-05-18 01:48:23] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:48:23] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 01:48:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:23] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-18 01:48:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:48:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 01:48:23] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 01:48:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:23] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-18 01:48:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 01:48:23] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 01:48:23] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 0 ms to minimize.
[2022-05-18 01:48:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2022-05-18 01:48:23] [INFO ] Added : 36 causal constraints over 8 iterations in 161 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, -1, 1, -1, 1, -1, 2, 10, 10, 4, -1]
FORMULA PolyORBNT-COL-S10J80-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
[2022-05-18 01:48:23] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 3470 transitions in 22 ms.
[2022-05-18 01:48:23] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_9319775242219977791.dot
Deduced a syphon composed of 80 places in 15 ms
Reduce places removed 80 places and 80 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10000 steps, including 102 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :3
[2022-05-18 01:48:24] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1614 cols
[2022-05-18 01:48:24] [INFO ] Computed 192 place invariants in 486 ms
[2022-05-18 01:48:24] [INFO ] [Real]Absence check using 185 positive place invariants in 55 ms returned sat
[2022-05-18 01:48:25] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 34 ms returned sat
[2022-05-18 01:48:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:26] [INFO ] [Real]Absence check using state equation in 1005 ms returned sat
[2022-05-18 01:48:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:48:26] [INFO ] [Nat]Absence check using 185 positive place invariants in 59 ms returned sat
[2022-05-18 01:48:26] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 38 ms returned sat
[2022-05-18 01:48:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:28] [INFO ] [Nat]Absence check using state equation in 2489 ms returned sat
[2022-05-18 01:48:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:48:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 749 ms returned sat
[2022-05-18 01:48:30] [INFO ] Deduced a trap composed of 13 places in 891 ms of which 1 ms to minimize.
[2022-05-18 01:48:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1111 ms
[2022-05-18 01:48:31] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 362 ms.
[2022-05-18 01:48:32] [INFO ] Deduced a trap composed of 9 places in 1151 ms of which 2 ms to minimize.
[2022-05-18 01:48:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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:48:32] [INFO ] [Real]Absence check using 185 positive place invariants in 57 ms returned sat
[2022-05-18 01:48:32] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 43 ms returned unsat
[2022-05-18 01:48:32] [INFO ] [Real]Absence check using 185 positive place invariants in 64 ms returned sat
[2022-05-18 01:48:32] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 47 ms returned sat
[2022-05-18 01:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:33] [INFO ] [Real]Absence check using state equation in 821 ms returned sat
[2022-05-18 01:48:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:48:33] [INFO ] [Nat]Absence check using 185 positive place invariants in 56 ms returned sat
[2022-05-18 01:48:33] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 47 ms returned sat
[2022-05-18 01:48:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:34] [INFO ] [Nat]Absence check using state equation in 994 ms returned sat
[2022-05-18 01:48:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 645 ms returned sat
[2022-05-18 01:48:36] [INFO ] Deduced a trap composed of 453 places in 873 ms of which 2 ms to minimize.
[2022-05-18 01:48:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1466 ms
[2022-05-18 01:48:37] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 272 ms.
[2022-05-18 01:48:37] [INFO ] Added : 7 causal constraints over 2 iterations in 764 ms. Result :sat
[2022-05-18 01:48:38] [INFO ] [Real]Absence check using 185 positive place invariants in 57 ms returned sat
[2022-05-18 01:48:38] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 44 ms returned unsat
[2022-05-18 01:48:38] [INFO ] [Real]Absence check using 185 positive place invariants in 56 ms returned sat
[2022-05-18 01:48:38] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 47 ms returned sat
[2022-05-18 01:48:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:39] [INFO ] [Real]Absence check using state equation in 842 ms returned sat
[2022-05-18 01:48:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:48:39] [INFO ] [Nat]Absence check using 185 positive place invariants in 56 ms returned sat
[2022-05-18 01:48:39] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 46 ms returned sat
[2022-05-18 01:48:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:40] [INFO ] [Nat]Absence check using state equation in 907 ms returned sat
[2022-05-18 01:48:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2022-05-18 01:48:41] [INFO ] Deduced a trap composed of 12 places in 827 ms of which 2 ms to minimize.
[2022-05-18 01:48:42] [INFO ] Deduced a trap composed of 823 places in 766 ms of which 2 ms to minimize.
[2022-05-18 01:48:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1942 ms
[2022-05-18 01:48:42] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 261 ms.
[2022-05-18 01:48:43] [INFO ] Added : 8 causal constraints over 2 iterations in 710 ms. Result :sat
[2022-05-18 01:48:43] [INFO ] [Real]Absence check using 185 positive place invariants in 57 ms returned sat
[2022-05-18 01:48:43] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 51 ms returned unsat
[2022-05-18 01:48:43] [INFO ] [Real]Absence check using 185 positive place invariants in 56 ms returned sat
[2022-05-18 01:48:43] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 47 ms returned sat
[2022-05-18 01:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:44] [INFO ] [Real]Absence check using state equation in 862 ms returned sat
[2022-05-18 01:48:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:48:44] [INFO ] [Nat]Absence check using 185 positive place invariants in 63 ms returned sat
[2022-05-18 01:48:44] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 59 ms returned sat
[2022-05-18 01:48:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:46] [INFO ] [Nat]Absence check using state equation in 1564 ms returned sat
[2022-05-18 01:48:49] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 01:48:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 3172 ms returned sat
[2022-05-18 01:48:50] [INFO ] Deduced a trap composed of 9 places in 1154 ms of which 1 ms to minimize.
[2022-05-18 01:48: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 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-18 01:48:51] [INFO ] [Real]Absence check using 185 positive place invariants in 55 ms returned sat
[2022-05-18 01:48:51] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 39 ms returned sat
[2022-05-18 01:48:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:52] [INFO ] [Real]Absence check using state equation in 977 ms returned sat
[2022-05-18 01:48:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:48:52] [INFO ] [Nat]Absence check using 185 positive place invariants in 58 ms returned sat
[2022-05-18 01:48:52] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 39 ms returned sat
[2022-05-18 01:48:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:55] [INFO ] [Nat]Absence check using state equation in 3405 ms returned sat
[2022-05-18 01:48:57] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 01:48:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1390 ms returned unknown
[2022-05-18 01:48:57] [INFO ] [Real]Absence check using 185 positive place invariants in 56 ms returned sat
[2022-05-18 01:48:57] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 39 ms returned sat
[2022-05-18 01:48:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:48:58] [INFO ] [Real]Absence check using state equation in 1309 ms returned sat
[2022-05-18 01:48:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:48:58] [INFO ] [Nat]Absence check using 185 positive place invariants in 58 ms returned sat
[2022-05-18 01:48:59] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 44 ms returned sat
[2022-05-18 01:48:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:49:01] [INFO ] [Nat]Absence check using state equation in 2913 ms returned sat
[2022-05-18 01:49:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 863 ms returned sat
[2022-05-18 01:49:03] [INFO ] Computed and/alt/rep : 2147/6063/2147 causal constraints (skipped 1223 transitions) in 257 ms.
[2022-05-18 01:49:04] [INFO ] Deduced a trap composed of 9 places in 1114 ms of which 1 ms to minimize.
[2022-05-18 01:49:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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:49:05] [INFO ] [Real]Absence check using 185 positive place invariants in 56 ms returned sat
[2022-05-18 01:49:05] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 47 ms returned sat
[2022-05-18 01:49:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:49:06] [INFO ] [Real]Absence check using state equation in 869 ms returned sat
[2022-05-18 01:49:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:49:06] [INFO ] [Nat]Absence check using 185 positive place invariants in 57 ms returned sat
[2022-05-18 01:49:06] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 45 ms returned sat
[2022-05-18 01:49:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:49:07] [INFO ] [Nat]Absence check using state equation in 1479 ms returned sat
[2022-05-18 01:49:10] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 01:49:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 3295 ms returned unknown
[2022-05-18 01:49:11] [INFO ] [Real]Absence check using 185 positive place invariants in 57 ms returned sat
[2022-05-18 01:49:11] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 41 ms returned sat
[2022-05-18 01:49:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:49:12] [INFO ] [Real]Absence check using state equation in 1028 ms returned sat
[2022-05-18 01:49:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:49:12] [INFO ] [Nat]Absence check using 185 positive place invariants in 56 ms returned sat
[2022-05-18 01:49:12] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 42 ms returned sat
[2022-05-18 01:49:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:49:15] [INFO ] [Nat]Absence check using state equation in 3176 ms returned sat
[2022-05-18 01:49:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 823 ms returned sat
[2022-05-18 01:49:17] [INFO ] Deduced a trap composed of 273 places in 812 ms of which 1 ms to minimize.
[2022-05-18 01:49: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 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [2147483647, 1, 1, 1, 1, 1, 2, 10, 10, 4, 2147483647] Max seen :[0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0]
FORMULA PolyORBNT-COL-S10J80-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 2300 steps, including 145 resets, run finished after 44 ms. (steps per millisecond=52 ) properties (out of 8) seen :3 could not realise parikh vector
Incomplete Parikh walk after 1400 steps, including 94 resets, run finished after 14 ms. (steps per millisecond=100 ) properties (out of 8) seen :5 could not realise parikh vector
FORMULA PolyORBNT-COL-S10J80-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 166 out of 1614 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 1604 transition count 3386
Reduce places removed 4 places and 0 transitions.
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Iterating post reduction 1 with 86 rules applied. Total rules applied 100 place count 1600 transition count 3304
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 2 with 82 rules applied. Total rules applied 182 place count 1518 transition count 3304
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 182 place count 1518 transition count 3301
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 188 place count 1515 transition count 3301
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 189 place count 1514 transition count 3300
Iterating global reduction 3 with 1 rules applied. Total rules applied 190 place count 1514 transition count 3300
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 194 place count 1512 transition count 3298
Applied a total of 194 rules in 701 ms. Remains 1512 /1614 variables (removed 102) and now considering 3298/3390 (removed 92) transitions.
[2022-05-18 01:49:18] [INFO ] Flow matrix only has 3289 transitions (discarded 9 similar events)
// Phase 1: matrix 3289 rows 1512 cols
[2022-05-18 01:49:18] [INFO ] Computed 182 place invariants in 119 ms
[2022-05-18 01:49:20] [INFO ] Dead Transitions using invariants and state equation in 2529 ms returned [1472, 1473, 1474, 1475, 1476, 1477, 1478, 1479, 1480, 1481, 1482, 1483, 1484, 1485, 1486, 1487, 1488, 1489, 1490, 1491, 1493, 1494, 1495, 1496, 1497, 1498, 1499, 1500, 1501, 1502, 1503, 1504, 1505, 1506, 1507, 1508, 1509, 1510, 1511, 1513, 1514, 1515, 1516, 1517, 1519, 1522, 1523, 1524, 1525, 1526, 1527, 1528, 1529, 1530, 1531, 1532, 1533, 1534, 1535, 1536, 1537, 1538, 1539, 1540, 1541, 1542, 1543, 1544, 1545, 1546, 1548, 1549, 1550, 1551, 1552, 1554, 1557, 1558, 1559, 1560, 1561, 1562, 1564, 1567, 1571, 1572, 1573, 1574, 1575, 1576, 1577, 1578, 1579, 1580, 1581, 1582, 1583, 1584, 1585, 1586, 1587, 1588, 1589, 1590, 1591, 1592, 1593, 1594, 1595, 1596, 1597, 1598, 1599, 1600, 1601, 1602, 1604, 1605, 1606, 1607, 1608, 1610, 1613, 1614, 1615, 1616, 1617, 1618, 1620, 1623, 1627, 1628, 1629, 1630, 1631, 1632, 1633, 1635, 1638, 1642, 1647, 1648, 1649, 1650, 1651, 1652, 1653, 1654, 1655, 1656, 1657, 1658, 1659, 1660, 1661, 1662, 1663, 1664, 1665, 1666, 1667, 1668, 1669, 1670, 1671, 1672, 1673, 1674, 1675, 1676, 1677, 1678, 1679, 1680, 1681, 1682, 1683, 1684, 1685, 1686, 1688, 1689, 1690, 1691, 1692, 1694, 1697, 1698, 1699, 1700, 1701, 1702, 1704, 1707, 1711, 1712, 1713, 1714, 1715, 1716, 1717, 1719, 1722, 1726, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1740, 1743, 1747, 1752, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771, 1772, 1773, 1774, 1775, 1776, 1777, 1778, 1779, 1780, 1781, 1782, 1783, 1784, 1785, 1786, 1787, 1788, 1789, 1790, 1791, 1792, 1793, 1794, 1795, 1796, 1797, 1798, 1799, 1800, 1801, 1802, 1803, 1804, 1805, 1806, 1808, 1809, 1810, 1811, 1812, 1814, 1817, 1818, 1819, 1820, 1821, 1822, 1824, 1827, 1831, 1832, 1833, 1834, 1835, 1836, 1837, 1839, 1842, 1846, 1851, 1852, 1853, 1854, 1855, 1856, 1857, 1858, 1860, 1863, 1867, 1872, 1878, 1879, 1880, 1881, 1882, 1883, 1884, 1885, 1886, 1888, 1891, 1895, 1900, 1906, 1913, 1914, 1915, 1916, 1917, 1918, 1919, 1920, 1921, 1922, 1923, 1924, 1925, 1926, 1927, 1928, 1929, 1930, 1931, 1932, 1933, 1934, 1935, 1936, 1937, 1938, 1939, 1940, 1941, 1942, 1943, 1944, 1945, 1946, 1947, 1948, 1949, 1950, 1951, 1952, 1953, 1954, 1955, 1956, 1957, 1958, 1959, 1960, 1961, 1962, 1963, 1964, 1965, 1966, 1967, 1968, 1969, 1970, 1971, 1973, 1974, 1975, 1976, 1977, 1979, 1982, 1983, 1984, 1985, 1986, 1987, 1989, 1992, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2004, 2007, 2011, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023, 2025, 2028, 2032, 2037, 2043, 2044, 2045, 2046, 2047, 2048, 2049, 2050, 2051, 2053, 2056, 2060, 2065, 2071, 2078, 2079, 2080, 2081, 2082, 2083, 2084, 2085, 2086, 2087, 2089, 2092, 2096, 2101, 2107, 2114, 2122, 2123, 2124, 2125, 2126, 2127, 2128, 2129, 2130, 2131, 2132, 2133, 2134, 2135, 2136, 2137, 2138, 2139, 2140, 2141, 2142, 2143, 2144, 2145, 2146, 2147, 2148, 2149, 2150, 2151, 2152, 2153, 2154, 2155, 2156, 2157, 2158, 2159, 2160, 2161, 2162, 2163, 2164, 2165, 2166, 2167, 2168, 2169, 2170, 2171, 2172, 2173, 2174, 2175, 2176, 2177, 2178, 2179, 2180, 2181, 2182, 2183, 2184, 2185, 2186, 2187, 2188, 2189, 2190, 2191, 2193, 2194, 2195, 2196, 2197, 2199, 2202, 2203, 2204, 2205, 2206, 2207, 2209, 2212, 2216, 2217, 2218, 2219, 2220, 2221, 2222, 2224, 2227, 2231, 2236, 2237, 2238, 2239, 2240, 2241, 2242, 2243, 2245, 2248, 2252, 2257, 2263, 2264, 2265, 2266, 2267, 2268, 2269, 2270, 2271, 2273, 2276, 2280, 2285, 2291, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2309, 2312, 2316, 2321, 2327, 2334, 2342, 2343, 2344, 2345, 2346, 2347, 2348, 2349, 2350, 2351, 2352, 2354, 2357, 2361, 2366, 2372, 2379, 2387, 2396, 2397, 2398, 2399, 2400, 2401, 2402, 2403, 2404, 2405, 2406, 2407, 2409, 2412, 2416, 2421, 2427, 2434, 2442, 2451, 2461]
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions :[2461, 2451, 2442, 2434, 2427, 2421, 2416, 2412, 2409, 2407, 2406, 2405, 2404, 2403, 2402, 2401, 2400, 2399, 2398, 2397, 2396, 2387, 2379, 2372, 2366, 2361, 2357, 2354, 2352, 2351, 2350, 2349, 2348, 2347, 2346, 2345, 2344, 2343, 2342, 2334, 2327, 2321, 2316, 2312, 2309, 2307, 2306, 2305, 2304, 2303, 2302, 2301, 2300, 2299, 2298, 2291, 2285, 2280, 2276, 2273, 2271, 2270, 2269, 2268, 2267, 2266, 2265, 2264, 2263, 2257, 2252, 2248, 2245, 2243, 2242, 2241, 2240, 2239, 2238, 2237, 2236, 2231, 2227, 2224, 2222, 2221, 2220, 2219, 2218, 2217, 2216, 2212, 2209, 2207, 2206, 2205, 2204, 2203, 2202, 2199, 2197, 2196, 2195, 2194, 2193, 2191, 2190, 2189, 2188, 2187, 2186, 2185, 2184, 2183, 2182, 2181, 2180, 2179, 2178, 2177, 2176, 2175, 2174, 2173, 2172, 2171, 2170, 2169, 2168, 2167, 2166, 2165, 2164, 2163, 2162, 2161, 2160, 2159, 2158, 2157, 2156, 2155, 2154, 2153, 2152, 2151, 2150, 2149, 2148, 2147, 2146, 2145, 2144, 2143, 2142, 2141, 2140, 2139, 2138, 2137, 2136, 2135, 2134, 2133, 2132, 2131, 2130, 2129, 2128, 2127, 2126, 2125, 2124, 2123, 2122, 2114, 2107, 2101, 2096, 2092, 2089, 2087, 2086, 2085, 2084, 2083, 2082, 2081, 2080, 2079, 2078, 2071, 2065, 2060, 2056, 2053, 2051, 2050, 2049, 2048, 2047, 2046, 2045, 2044, 2043, 2037, 2032, 2028, 2025, 2023, 2022, 2021, 2020, 2019, 2018, 2017, 2016, 2011, 2007, 2004, 2002, 2001, 2000, 1999, 1998, 1997, 1996, 1992, 1989, 1987, 1986, 1985, 1984, 1983, 1982, 1979, 1977, 1976, 1975, 1974, 1973, 1971, 1970, 1969, 1968, 1967, 1966, 1965, 1964, 1963, 1962, 1961, 1960, 1959, 1958, 1957, 1956, 1955, 1954, 1953, 1952, 1951, 1950, 1949, 1948, 1947, 1946, 1945, 1944, 1943, 1942, 1941, 1940, 1939, 1938, 1937, 1936, 1935, 1934, 1933, 1932, 1931, 1930, 1929, 1928, 1927, 1926, 1925, 1924, 1923, 1922, 1921, 1920, 1919, 1918, 1917, 1916, 1915, 1914, 1913, 1906, 1900, 1895, 1891, 1888, 1886, 1885, 1884, 1883, 1882, 1881, 1880, 1879, 1878, 1872, 1867, 1863, 1860, 1858, 1857, 1856, 1855, 1854, 1853, 1852, 1851, 1846, 1842, 1839, 1837, 1836, 1835, 1834, 1833, 1832, 1831, 1827, 1824, 1822, 1821, 1820, 1819, 1818, 1817, 1814, 1812, 1811, 1810, 1809, 1808, 1806, 1805, 1804, 1803, 1802, 1801, 1800, 1799, 1798, 1797, 1796, 1795, 1794, 1793, 1792, 1791, 1790, 1789, 1788, 1787, 1786, 1785, 1784, 1783, 1782, 1781, 1780, 1779, 1778, 1777, 1776, 1775, 1774, 1773, 1772, 1771, 1770, 1769, 1768, 1767, 1766, 1765, 1764, 1763, 1762, 1761, 1760, 1759, 1758, 1752, 1747, 1743, 1740, 1738, 1737, 1736, 1735, 1734, 1733, 1732, 1731, 1726, 1722, 1719, 1717, 1716, 1715, 1714, 1713, 1712, 1711, 1707, 1704, 1702, 1701, 1700, 1699, 1698, 1697, 1694, 1692, 1691, 1690, 1689, 1688, 1686, 1685, 1684, 1683, 1682, 1681, 1680, 1679, 1678, 1677, 1676, 1675, 1674, 1673, 1672, 1671, 1670, 1669, 1668, 1667, 1666, 1665, 1664, 1663, 1662, 1661, 1660, 1659, 1658, 1657, 1656, 1655, 1654, 1653, 1652, 1651, 1650, 1649, 1648, 1647, 1642, 1638, 1635, 1633, 1632, 1631, 1630, 1629, 1628, 1627, 1623, 1620, 1618, 1617, 1616, 1615, 1614, 1613, 1610, 1608, 1607, 1606, 1605, 1604, 1602, 1601, 1600, 1599, 1598, 1597, 1596, 1595, 1594, 1593, 1592, 1591, 1590, 1589, 1588, 1587, 1586, 1585, 1584, 1583, 1582, 1581, 1580, 1579, 1578, 1577, 1576, 1575, 1574, 1573, 1572, 1571, 1567, 1564, 1562, 1561, 1560, 1559, 1558, 1557, 1554, 1552, 1551, 1550, 1549, 1548, 1546, 1545, 1544, 1543, 1542, 1541, 1540, 1539, 1538, 1537, 1536, 1535, 1534, 1533, 1532, 1531, 1530, 1529, 1528, 1527, 1526, 1525, 1524, 1523, 1522, 1519, 1517, 1516, 1515, 1514, 1513, 1511, 1510, 1509, 1508, 1507, 1506, 1505, 1504, 1503, 1502, 1501, 1500, 1499, 1498, 1497, 1496, 1495, 1494, 1493, 1491, 1490, 1489, 1488, 1487, 1486, 1485, 1484, 1483, 1482, 1481, 1480, 1479, 1478, 1477, 1476, 1475, 1474, 1473, 1472]
Starting structural reductions, iteration 1 : 1512/1614 places, 2683/3390 transitions.
Applied a total of 0 rules in 123 ms. Remains 1512 /1512 variables (removed 0) and now considering 2683/2683 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1512/1614 places, 2683/3390 transitions.
Normalized transition count is 2674 out of 2683 initially.
// Phase 1: matrix 2674 rows 1512 cols
[2022-05-18 01:49:21] [INFO ] Computed 182 place invariants in 94 ms
Incomplete random walk after 1000000 steps, including 69494 resets, run finished after 12733 ms. (steps per millisecond=78 ) properties (out of 6) seen :14
FORMULA PolyORBNT-COL-S10J80-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 6453 resets, run finished after 3384 ms. (steps per millisecond=295 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 1000001 steps, including 6410 resets, run finished after 2328 ms. (steps per millisecond=429 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 1000001 steps, including 5133 resets, run finished after 2124 ms. (steps per millisecond=470 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 1000001 steps, including 6525 resets, run finished after 2358 ms. (steps per millisecond=424 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 1000000 steps, including 6486 resets, run finished after 3503 ms. (steps per millisecond=285 ) properties (out of 5) seen :12
[2022-05-18 01:49:47] [INFO ] Flow matrix only has 2674 transitions (discarded 9 similar events)
// Phase 1: matrix 2674 rows 1512 cols
[2022-05-18 01:49:47] [INFO ] Computed 182 place invariants in 136 ms
[2022-05-18 01:49:47] [INFO ] [Real]Absence check using 176 positive place invariants in 51 ms returned sat
[2022-05-18 01:49:47] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 21 ms returned sat
[2022-05-18 01:49:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:49:48] [INFO ] [Real]Absence check using state equation in 939 ms returned sat
[2022-05-18 01:49:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:49:49] [INFO ] [Nat]Absence check using 176 positive place invariants in 53 ms returned sat
[2022-05-18 01:49:49] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 21 ms returned unsat
[2022-05-18 01:49:49] [INFO ] [Real]Absence check using 176 positive place invariants in 50 ms returned sat
[2022-05-18 01:49:49] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 27 ms returned sat
[2022-05-18 01:49:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:49:50] [INFO ] [Real]Absence check using state equation in 692 ms returned sat
[2022-05-18 01:49:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:49:50] [INFO ] [Nat]Absence check using 176 positive place invariants in 53 ms returned sat
[2022-05-18 01:49:50] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 26 ms returned sat
[2022-05-18 01:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:49:51] [INFO ] [Nat]Absence check using state equation in 915 ms returned sat
[2022-05-18 01:49:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:49:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 65 ms returned sat
[2022-05-18 01:49:52] [INFO ] Deduced a trap composed of 668 places in 723 ms of which 1 ms to minimize.
[2022-05-18 01:49:52] [INFO ] Deduced a trap composed of 656 places in 736 ms of which 2 ms to minimize.
[2022-05-18 01:49:53] [INFO ] Deduced a trap composed of 676 places in 701 ms of which 1 ms to minimize.
[2022-05-18 01:49:54] [INFO ] Deduced a trap composed of 662 places in 702 ms of which 1 ms to minimize.
[2022-05-18 01:49:55] [INFO ] Deduced a trap composed of 666 places in 685 ms of which 1 ms to minimize.
[2022-05-18 01:49:56] [INFO ] Deduced a trap composed of 678 places in 659 ms of which 1 ms to minimize.
[2022-05-18 01:49:56] [INFO ] Deduced a trap composed of 674 places in 669 ms of which 1 ms to minimize.
[2022-05-18 01:49:57] [INFO ] Deduced a trap composed of 666 places in 672 ms of which 2 ms to minimize.
[2022-05-18 01:49:58] [INFO ] Deduced a trap composed of 652 places in 666 ms of which 1 ms to minimize.
[2022-05-18 01:49:59] [INFO ] Deduced a trap composed of 664 places in 692 ms of which 1 ms to minimize.
[2022-05-18 01:50:00] [INFO ] Deduced a trap composed of 666 places in 685 ms of which 1 ms to minimize.
[2022-05-18 01:50:01] [INFO ] Deduced a trap composed of 672 places in 677 ms of which 2 ms to minimize.
[2022-05-18 01:50:01] [INFO ] Deduced a trap composed of 656 places in 639 ms of which 1 ms to minimize.
[2022-05-18 01:50:02] [INFO ] Deduced a trap composed of 673 places in 695 ms of which 2 ms to minimize.
[2022-05-18 01:50:03] [INFO ] Deduced a trap composed of 670 places in 688 ms of which 6 ms to minimize.
[2022-05-18 01:50:04] [INFO ] Deduced a trap composed of 662 places in 686 ms of which 1 ms to minimize.
[2022-05-18 01:50:05] [INFO ] Deduced a trap composed of 664 places in 712 ms of which 2 ms to minimize.
[2022-05-18 01:50:06] [INFO ] Deduced a trap composed of 662 places in 687 ms of which 1 ms to minimize.
[2022-05-18 01:50:07] [INFO ] Deduced a trap composed of 666 places in 673 ms of which 1 ms to minimize.
[2022-05-18 01:50:08] [INFO ] Deduced a trap composed of 664 places in 653 ms of which 1 ms to minimize.
[2022-05-18 01:50:08] [INFO ] Deduced a trap composed of 666 places in 666 ms of which 1 ms to minimize.
[2022-05-18 01:50:09] [INFO ] Deduced a trap composed of 678 places in 693 ms of which 1 ms to minimize.
[2022-05-18 01:50:10] [INFO ] Deduced a trap composed of 662 places in 718 ms of which 1 ms to minimize.
[2022-05-18 01:50:11] [INFO ] Deduced a trap composed of 672 places in 698 ms of which 2 ms to minimize.
[2022-05-18 01:50:13] [INFO ] Deduced a trap composed of 664 places in 676 ms of which 1 ms to minimize.
[2022-05-18 01:50:14] [INFO ] Deduced a trap composed of 658 places in 680 ms of which 1 ms to minimize.
[2022-05-18 01:50:16] [INFO ] Deduced a trap composed of 671 places in 704 ms of which 1 ms to minimize.
[2022-05-18 01:50:17] [INFO ] Deduced a trap composed of 662 places in 694 ms of which 2 ms to minimize.
[2022-05-18 01:50:18] [INFO ] Deduced a trap composed of 666 places in 643 ms of which 2 ms to minimize.
[2022-05-18 01:50:19] [INFO ] Deduced a trap composed of 670 places in 639 ms of which 1 ms to minimize.
[2022-05-18 01:50:19] [INFO ] Deduced a trap composed of 664 places in 649 ms of which 2 ms to minimize.
[2022-05-18 01:50:20] [INFO ] Deduced a trap composed of 674 places in 669 ms of which 2 ms to minimize.
[2022-05-18 01:50:21] [INFO ] Deduced a trap composed of 666 places in 651 ms of which 1 ms to minimize.
[2022-05-18 01:50:22] [INFO ] Deduced a trap composed of 670 places in 678 ms of which 1 ms to minimize.
[2022-05-18 01:50:22] [INFO ] Deduced a trap composed of 662 places in 683 ms of which 1 ms to minimize.
[2022-05-18 01:50:23] [INFO ] Deduced a trap composed of 664 places in 660 ms of which 1 ms to minimize.
[2022-05-18 01:50:24] [INFO ] Deduced a trap composed of 674 places in 646 ms of which 9 ms to minimize.
[2022-05-18 01:50:25] [INFO ] Deduced a trap composed of 660 places in 717 ms of which 1 ms to minimize.
[2022-05-18 01:50:26] [INFO ] Deduced a trap composed of 674 places in 702 ms of which 1 ms to minimize.
[2022-05-18 01:50:26] [INFO ] Deduced a trap composed of 682 places in 704 ms of which 1 ms to minimize.
[2022-05-18 01:50:27] [INFO ] Deduced a trap composed of 678 places in 687 ms of which 1 ms to minimize.
[2022-05-18 01:50:28] [INFO ] Deduced a trap composed of 670 places in 687 ms of which 1 ms to minimize.
[2022-05-18 01:50:29] [INFO ] Deduced a trap composed of 654 places in 671 ms of which 1 ms to minimize.
[2022-05-18 01:50:30] [INFO ] Deduced a trap composed of 664 places in 655 ms of which 2 ms to minimize.
[2022-05-18 01:50:31] [INFO ] Deduced a trap composed of 668 places in 711 ms of which 1 ms to minimize.
[2022-05-18 01:50:32] [INFO ] Deduced a trap composed of 666 places in 680 ms of which 2 ms to minimize.
[2022-05-18 01:50:33] [INFO ] Deduced a trap composed of 674 places in 727 ms of which 4 ms to minimize.
[2022-05-18 01:50:34] [INFO ] Deduced a trap composed of 656 places in 721 ms of which 9 ms to minimize.
[2022-05-18 01:50:35] [INFO ] Deduced a trap composed of 666 places in 706 ms of which 1 ms to minimize.
[2022-05-18 01:50:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-18 01:50:35] [INFO ] [Real]Absence check using 176 positive place invariants in 51 ms returned sat
[2022-05-18 01:50:35] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 28 ms returned sat
[2022-05-18 01:50:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:50:36] [INFO ] [Real]Absence check using state equation in 678 ms returned sat
[2022-05-18 01:50:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:50:36] [INFO ] [Nat]Absence check using 176 positive place invariants in 53 ms returned sat
[2022-05-18 01:50:36] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 27 ms returned sat
[2022-05-18 01:50:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:50:43] [INFO ] [Nat]Absence check using state equation in 6638 ms returned unknown
[2022-05-18 01:50:43] [INFO ] [Real]Absence check using 176 positive place invariants in 52 ms returned sat
[2022-05-18 01:50:43] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 31 ms returned sat
[2022-05-18 01:50:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:50:44] [INFO ] [Real]Absence check using state equation in 787 ms returned sat
[2022-05-18 01:50:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:50:44] [INFO ] [Nat]Absence check using 176 positive place invariants in 60 ms returned sat
[2022-05-18 01:50:44] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 29 ms returned sat
[2022-05-18 01:50:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:50:45] [INFO ] [Nat]Absence check using state equation in 1003 ms returned sat
[2022-05-18 01:50:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 307 ms returned sat
[2022-05-18 01:50:46] [INFO ] Deduced a trap composed of 664 places in 687 ms of which 1 ms to minimize.
[2022-05-18 01:50:47] [INFO ] Deduced a trap composed of 674 places in 698 ms of which 2 ms to minimize.
[2022-05-18 01:50:48] [INFO ] Deduced a trap composed of 682 places in 703 ms of which 1 ms to minimize.
[2022-05-18 01:50:48] [INFO ] Deduced a trap composed of 668 places in 708 ms of which 1 ms to minimize.
[2022-05-18 01:50:49] [INFO ] Deduced a trap composed of 664 places in 661 ms of which 1 ms to minimize.
[2022-05-18 01:50:50] [INFO ] Deduced a trap composed of 672 places in 669 ms of which 1 ms to minimize.
[2022-05-18 01:50:51] [INFO ] Deduced a trap composed of 664 places in 644 ms of which 2 ms to minimize.
[2022-05-18 01:50:51] [INFO ] Deduced a trap composed of 664 places in 677 ms of which 1 ms to minimize.
[2022-05-18 01:50:52] [INFO ] Deduced a trap composed of 674 places in 707 ms of which 2 ms to minimize.
[2022-05-18 01:50:53] [INFO ] Deduced a trap composed of 666 places in 665 ms of which 2 ms to minimize.
[2022-05-18 01:50:54] [INFO ] Deduced a trap composed of 680 places in 703 ms of which 2 ms to minimize.
[2022-05-18 01:50:55] [INFO ] Deduced a trap composed of 672 places in 689 ms of which 1 ms to minimize.
[2022-05-18 01:50:56] [INFO ] Deduced a trap composed of 676 places in 654 ms of which 1 ms to minimize.
[2022-05-18 01:50:56] [INFO ] Deduced a trap composed of 668 places in 715 ms of which 1 ms to minimize.
[2022-05-18 01:50:57] [INFO ] Deduced a trap composed of 664 places in 666 ms of which 1 ms to minimize.
[2022-05-18 01:50:58] [INFO ] Deduced a trap composed of 660 places in 702 ms of which 1 ms to minimize.
[2022-05-18 01:50:59] [INFO ] Deduced a trap composed of 664 places in 660 ms of which 1 ms to minimize.
[2022-05-18 01:51:00] [INFO ] Deduced a trap composed of 676 places in 657 ms of which 1 ms to minimize.
[2022-05-18 01:51:01] [INFO ] Deduced a trap composed of 666 places in 662 ms of which 1 ms to minimize.
[2022-05-18 01:51:03] [INFO ] Deduced a trap composed of 658 places in 653 ms of which 1 ms to minimize.
[2022-05-18 01:51:04] [INFO ] Deduced a trap composed of 648 places in 640 ms of which 1 ms to minimize.
[2022-05-18 01:51:04] [INFO ] Deduced a trap composed of 668 places in 632 ms of which 2 ms to minimize.
[2022-05-18 01:51:05] [INFO ] Deduced a trap composed of 656 places in 658 ms of which 1 ms to minimize.
[2022-05-18 01:51:06] [INFO ] Deduced a trap composed of 676 places in 644 ms of which 1 ms to minimize.
[2022-05-18 01:51:06] [INFO ] Deduced a trap composed of 666 places in 634 ms of which 1 ms to minimize.
[2022-05-18 01:51:07] [INFO ] Deduced a trap composed of 660 places in 695 ms of which 1 ms to minimize.
[2022-05-18 01:51:08] [INFO ] Deduced a trap composed of 668 places in 633 ms of which 1 ms to minimize.
[2022-05-18 01:51:10] [INFO ] Deduced a trap composed of 676 places in 656 ms of which 1 ms to minimize.
[2022-05-18 01:51:11] [INFO ] Deduced a trap composed of 678 places in 671 ms of which 3 ms to minimize.
[2022-05-18 01:51:12] [INFO ] Deduced a trap composed of 676 places in 672 ms of which 1 ms to minimize.
[2022-05-18 01:51:12] [INFO ] Deduced a trap composed of 670 places in 681 ms of which 2 ms to minimize.
[2022-05-18 01:51:13] [INFO ] Deduced a trap composed of 674 places in 675 ms of which 1 ms to minimize.
[2022-05-18 01:51:15] [INFO ] Deduced a trap composed of 678 places in 684 ms of which 1 ms to minimize.
[2022-05-18 01:51:16] [INFO ] Deduced a trap composed of 672 places in 680 ms of which 2 ms to minimize.
[2022-05-18 01:51:17] [INFO ] Deduced a trap composed of 680 places in 651 ms of which 1 ms to minimize.
[2022-05-18 01:51:18] [INFO ] Deduced a trap composed of 666 places in 678 ms of which 1 ms to minimize.
[2022-05-18 01:51:19] [INFO ] Deduced a trap composed of 668 places in 659 ms of which 2 ms to minimize.
[2022-05-18 01:51:20] [INFO ] Deduced a trap composed of 656 places in 674 ms of which 1 ms to minimize.
[2022-05-18 01:51:21] [INFO ] Deduced a trap composed of 688 places in 636 ms of which 2 ms to minimize.
[2022-05-18 01:51:22] [INFO ] Deduced a trap composed of 664 places in 682 ms of which 1 ms to minimize.
[2022-05-18 01:51:24] [INFO ] Deduced a trap composed of 674 places in 722 ms of which 2 ms to minimize.
[2022-05-18 01:51:25] [INFO ] Deduced a trap composed of 668 places in 655 ms of which 1 ms to minimize.
[2022-05-18 01:51:26] [INFO ] Deduced a trap composed of 680 places in 688 ms of which 1 ms to minimize.
[2022-05-18 01:51:30] [INFO ] Deduced a trap composed of 9 places in 903 ms of which 2 ms to minimize.
[2022-05-18 01:51:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-18 01:51:30] [INFO ] [Real]Absence check using 176 positive place invariants in 52 ms returned sat
[2022-05-18 01:51:30] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 10, 10, 4, 1] Max seen :[1, 3, 4, 3, 1]
FORMULA PolyORBNT-COL-S10J80-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J80-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 1512 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1512/1512 places, 2683/2683 transitions.
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 81 Pre rules applied. Total rules applied 0 place count 1512 transition count 2602
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 0 with 162 rules applied. Total rules applied 162 place count 1431 transition count 2602
Applied a total of 162 rules in 143 ms. Remains 1431 /1512 variables (removed 81) and now considering 2602/2683 (removed 81) transitions.
Finished structural reductions, in 1 iterations. Remains : 1431/1512 places, 2602/2683 transitions.
Normalized transition count is 2593 out of 2602 initially.
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-18 01:51:30] [INFO ] Computed 182 place invariants in 86 ms
Incomplete random walk after 1000000 steps, including 70429 resets, run finished after 10114 ms. (steps per millisecond=98 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 6262 resets, run finished after 1998 ms. (steps per millisecond=500 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 5134 resets, run finished after 1931 ms. (steps per millisecond=517 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 6379 resets, run finished after 2024 ms. (steps per millisecond=494 ) properties (out of 3) seen :10
[2022-05-18 01:51:46] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-18 01:51:46] [INFO ] Computed 182 place invariants in 83 ms
[2022-05-18 01:51:46] [INFO ] [Real]Absence check using 175 positive place invariants in 44 ms returned sat
[2022-05-18 01:51:46] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 32 ms returned sat
[2022-05-18 01:51:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:51:47] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2022-05-18 01:51:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:51:47] [INFO ] [Real]Added 1 Read/Feed constraints in 36 ms returned sat
[2022-05-18 01:51:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:51:47] [INFO ] [Nat]Absence check using 175 positive place invariants in 46 ms returned sat
[2022-05-18 01:51:47] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 37 ms returned sat
[2022-05-18 01:51:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:51:48] [INFO ] [Nat]Absence check using state equation in 830 ms returned sat
[2022-05-18 01:51:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 120 ms returned sat
[2022-05-18 01:51:49] [INFO ] Deduced a trap composed of 578 places in 576 ms of which 2 ms to minimize.
[2022-05-18 01:51:50] [INFO ] Deduced a trap composed of 576 places in 579 ms of which 10 ms to minimize.
[2022-05-18 01:51:51] [INFO ] Deduced a trap composed of 598 places in 567 ms of which 1 ms to minimize.
[2022-05-18 01:51:51] [INFO ] Deduced a trap composed of 588 places in 562 ms of which 1 ms to minimize.
[2022-05-18 01:51:52] [INFO ] Deduced a trap composed of 558 places in 569 ms of which 1 ms to minimize.
[2022-05-18 01:51:53] [INFO ] Deduced a trap composed of 582 places in 563 ms of which 2 ms to minimize.
[2022-05-18 01:51:53] [INFO ] Deduced a trap composed of 562 places in 564 ms of which 1 ms to minimize.
[2022-05-18 01:51:54] [INFO ] Deduced a trap composed of 576 places in 569 ms of which 1 ms to minimize.
[2022-05-18 01:51:55] [INFO ] Deduced a trap composed of 572 places in 561 ms of which 1 ms to minimize.
[2022-05-18 01:51:55] [INFO ] Deduced a trap composed of 566 places in 564 ms of which 2 ms to minimize.
[2022-05-18 01:51:56] [INFO ] Deduced a trap composed of 578 places in 570 ms of which 1 ms to minimize.
[2022-05-18 01:51:57] [INFO ] Deduced a trap composed of 576 places in 581 ms of which 1 ms to minimize.
[2022-05-18 01:51:57] [INFO ] Deduced a trap composed of 576 places in 581 ms of which 1 ms to minimize.
[2022-05-18 01:51:58] [INFO ] Deduced a trap composed of 572 places in 550 ms of which 1 ms to minimize.
[2022-05-18 01:51:59] [INFO ] Deduced a trap composed of 572 places in 565 ms of which 1 ms to minimize.
[2022-05-18 01:51:59] [INFO ] Deduced a trap composed of 580 places in 562 ms of which 1 ms to minimize.
[2022-05-18 01:52:00] [INFO ] Deduced a trap composed of 578 places in 563 ms of which 1 ms to minimize.
[2022-05-18 01:52:01] [INFO ] Deduced a trap composed of 578 places in 566 ms of which 2 ms to minimize.
[2022-05-18 01:52:01] [INFO ] Deduced a trap composed of 580 places in 562 ms of which 2 ms to minimize.
[2022-05-18 01:52:02] [INFO ] Deduced a trap composed of 578 places in 563 ms of which 1 ms to minimize.
[2022-05-18 01:52:03] [INFO ] Deduced a trap composed of 584 places in 563 ms of which 1 ms to minimize.
[2022-05-18 01:52:05] [INFO ] Deduced a trap composed of 562 places in 546 ms of which 1 ms to minimize.
[2022-05-18 01:52:05] [INFO ] Deduced a trap composed of 576 places in 550 ms of which 1 ms to minimize.
[2022-05-18 01:52:06] [INFO ] Deduced a trap composed of 580 places in 550 ms of which 1 ms to minimize.
[2022-05-18 01:52:33] [INFO ] Deduced a trap composed of 9 places in 832 ms of which 1 ms to minimize.
[2022-05-18 01:52:33] [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:52:33] [INFO ] [Real]Absence check using 175 positive place invariants in 45 ms returned sat
[2022-05-18 01:52:33] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 34 ms returned sat
[2022-05-18 01:52:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:52:34] [INFO ] [Real]Absence check using state equation in 632 ms returned sat
[2022-05-18 01:52:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:52:34] [INFO ] [Nat]Absence check using 175 positive place invariants in 42 ms returned sat
[2022-05-18 01:52:34] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 33 ms returned sat
[2022-05-18 01:52:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:52:41] [INFO ] [Nat]Absence check using state equation in 6660 ms returned unknown
[2022-05-18 01:52:41] [INFO ] [Real]Absence check using 175 positive place invariants in 43 ms returned sat
[2022-05-18 01:52:41] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 27 ms returned sat
[2022-05-18 01:52:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:52:42] [INFO ] [Real]Absence check using state equation in 708 ms returned sat
[2022-05-18 01:52:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:52:42] [INFO ] [Nat]Absence check using 175 positive place invariants in 47 ms returned sat
[2022-05-18 01:52:42] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 28 ms returned sat
[2022-05-18 01:52:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:52:43] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2022-05-18 01:52:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 222 ms returned sat
[2022-05-18 01:52:43] [INFO ] Deduced a trap composed of 576 places in 562 ms of which 1 ms to minimize.
[2022-05-18 01:52:44] [INFO ] Deduced a trap composed of 562 places in 569 ms of which 1 ms to minimize.
[2022-05-18 01:52:45] [INFO ] Deduced a trap composed of 578 places in 591 ms of which 1 ms to minimize.
[2022-05-18 01:52:45] [INFO ] Deduced a trap composed of 568 places in 554 ms of which 1 ms to minimize.
[2022-05-18 01:52:46] [INFO ] Deduced a trap composed of 570 places in 557 ms of which 1 ms to minimize.
[2022-05-18 01:52:47] [INFO ] Deduced a trap composed of 566 places in 566 ms of which 1 ms to minimize.
[2022-05-18 01:52:48] [INFO ] Deduced a trap composed of 570 places in 594 ms of which 1 ms to minimize.
[2022-05-18 01:52:48] [INFO ] Deduced a trap composed of 560 places in 568 ms of which 1 ms to minimize.
[2022-05-18 01:52:49] [INFO ] Deduced a trap composed of 576 places in 556 ms of which 1 ms to minimize.
[2022-05-18 01:52:50] [INFO ] Deduced a trap composed of 574 places in 557 ms of which 1 ms to minimize.
[2022-05-18 01:52:51] [INFO ] Deduced a trap composed of 574 places in 576 ms of which 1 ms to minimize.
[2022-05-18 01:52:52] [INFO ] Deduced a trap composed of 578 places in 573 ms of which 1 ms to minimize.
[2022-05-18 01:52:52] [INFO ] Deduced a trap composed of 576 places in 574 ms of which 1 ms to minimize.
[2022-05-18 01:52:54] [INFO ] Deduced a trap composed of 578 places in 583 ms of which 1 ms to minimize.
[2022-05-18 01:52:55] [INFO ] Deduced a trap composed of 580 places in 581 ms of which 1 ms to minimize.
[2022-05-18 01:52:55] [INFO ] Deduced a trap composed of 572 places in 566 ms of which 1 ms to minimize.
[2022-05-18 01:52:56] [INFO ] Deduced a trap composed of 578 places in 570 ms of which 1 ms to minimize.
[2022-05-18 01:52:57] [INFO ] Deduced a trap composed of 572 places in 581 ms of which 1 ms to minimize.
[2022-05-18 01:52:57] [INFO ] Deduced a trap composed of 568 places in 570 ms of which 1 ms to minimize.
[2022-05-18 01:52:58] [INFO ] Deduced a trap composed of 562 places in 574 ms of which 1 ms to minimize.
[2022-05-18 01:52:59] [INFO ] Deduced a trap composed of 576 places in 566 ms of which 1 ms to minimize.
[2022-05-18 01:53:00] [INFO ] Deduced a trap composed of 566 places in 572 ms of which 1 ms to minimize.
[2022-05-18 01:53:00] [INFO ] Deduced a trap composed of 590 places in 560 ms of which 1 ms to minimize.
[2022-05-18 01:53:01] [INFO ] Deduced a trap composed of 568 places in 561 ms of which 1 ms to minimize.
[2022-05-18 01:53:02] [INFO ] Deduced a trap composed of 572 places in 571 ms of which 1 ms to minimize.
[2022-05-18 01:53:02] [INFO ] Deduced a trap composed of 560 places in 575 ms of which 1 ms to minimize.
[2022-05-18 01:53:03] [INFO ] Deduced a trap composed of 564 places in 575 ms of which 1 ms to minimize.
[2022-05-18 01:53:04] [INFO ] Deduced a trap composed of 560 places in 586 ms of which 1 ms to minimize.
[2022-05-18 01:53:05] [INFO ] Deduced a trap composed of 580 places in 573 ms of which 1 ms to minimize.
[2022-05-18 01:53:05] [INFO ] Deduced a trap composed of 580 places in 564 ms of which 1 ms to minimize.
[2022-05-18 01:53:06] [INFO ] Deduced a trap composed of 564 places in 569 ms of which 1 ms to minimize.
[2022-05-18 01:53:07] [INFO ] Deduced a trap composed of 564 places in 568 ms of which 1 ms to minimize.
[2022-05-18 01:53:08] [INFO ] Deduced a trap composed of 566 places in 578 ms of which 1 ms to minimize.
[2022-05-18 01:53:09] [INFO ] Deduced a trap composed of 576 places in 562 ms of which 1 ms to minimize.
[2022-05-18 01:53:10] [INFO ] Deduced a trap composed of 578 places in 563 ms of which 1 ms to minimize.
[2022-05-18 01:53:11] [INFO ] Deduced a trap composed of 572 places in 558 ms of which 1 ms to minimize.
[2022-05-18 01:53:12] [INFO ] Deduced a trap composed of 580 places in 580 ms of which 1 ms to minimize.
[2022-05-18 01:53:12] [INFO ] Deduced a trap composed of 576 places in 572 ms of which 1 ms to minimize.
[2022-05-18 01:53:13] [INFO ] Deduced a trap composed of 570 places in 567 ms of which 1 ms to minimize.
[2022-05-18 01:53:13] [INFO ] Deduced a trap composed of 578 places in 570 ms of which 2 ms to minimize.
[2022-05-18 01:53:14] [INFO ] Deduced a trap composed of 572 places in 586 ms of which 1 ms to minimize.
[2022-05-18 01:53:15] [INFO ] Deduced a trap composed of 572 places in 560 ms of which 1 ms to minimize.
[2022-05-18 01:53:16] [INFO ] Deduced a trap composed of 568 places in 567 ms of which 1 ms to minimize.
[2022-05-18 01:53:17] [INFO ] Deduced a trap composed of 576 places in 576 ms of which 1 ms to minimize.
[2022-05-18 01:53:17] [INFO ] Deduced a trap composed of 574 places in 556 ms of which 1 ms to minimize.
[2022-05-18 01:53:18] [INFO ] Deduced a trap composed of 576 places in 558 ms of which 1 ms to minimize.
[2022-05-18 01:53:19] [INFO ] Deduced a trap composed of 568 places in 563 ms of which 1 ms to minimize.
[2022-05-18 01:53:20] [INFO ] Deduced a trap composed of 574 places in 584 ms of which 1 ms to minimize.
[2022-05-18 01:53:20] [INFO ] Deduced a trap composed of 582 places in 566 ms of which 1 ms to minimize.
[2022-05-18 01:53:21] [INFO ] Deduced a trap composed of 562 places in 565 ms of which 1 ms to minimize.
[2022-05-18 01:53:22] [INFO ] Deduced a trap composed of 586 places in 557 ms of which 1 ms to minimize.
[2022-05-18 01:53:25] [INFO ] Deduced a trap composed of 582 places in 573 ms of which 1 ms to minimize.
[2022-05-18 01:53:28] [INFO ] Deduced a trap composed of 9 places in 784 ms of which 1 ms to minimize.
[2022-05-18 01:53:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 1431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 77 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1431/1431 places, 2602/2602 transitions.
Starting structural reductions, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 69 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2022-05-18 01:53:28] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-18 01:53:28] [INFO ] Computed 182 place invariants in 84 ms
[2022-05-18 01:53:29] [INFO ] Implicit Places using invariants in 1412 ms returned []
[2022-05-18 01:53:29] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-18 01:53:29] [INFO ] Computed 182 place invariants in 75 ms
[2022-05-18 01:53:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:53:40] [INFO ] Implicit Places using invariants and state equation in 10354 ms returned []
Implicit Place search using SMT with State Equation took 11768 ms to find 0 implicit places.
[2022-05-18 01:53:40] [INFO ] Redundant transitions in 121 ms returned []
[2022-05-18 01:53:40] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-18 01:53:40] [INFO ] Computed 182 place invariants in 85 ms
[2022-05-18 01:53:41] [INFO ] Dead Transitions using invariants and state equation in 1320 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1431/1431 places, 2602/2602 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J80-UpperBounds-09
Normalized transition count is 2593 out of 2602 initially.
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-18 01:53:41] [INFO ] Computed 182 place invariants in 78 ms
Incomplete random walk after 10000 steps, including 713 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :3
[2022-05-18 01:53:41] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-18 01:53:41] [INFO ] Computed 182 place invariants in 79 ms
[2022-05-18 01:53:41] [INFO ] [Real]Absence check using 175 positive place invariants in 46 ms returned sat
[2022-05-18 01:53:42] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 33 ms returned sat
[2022-05-18 01:53:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:53:42] [INFO ] [Real]Absence check using state equation in 709 ms returned sat
[2022-05-18 01:53:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:53:42] [INFO ] [Real]Added 1 Read/Feed constraints in 31 ms returned sat
[2022-05-18 01:53:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:53:43] [INFO ] [Nat]Absence check using 175 positive place invariants in 48 ms returned sat
[2022-05-18 01:53:43] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 35 ms returned sat
[2022-05-18 01:53:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:53:43] [INFO ] [Nat]Absence check using state equation in 835 ms returned sat
[2022-05-18 01:53:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 120 ms returned sat
[2022-05-18 01:53:44] [INFO ] Deduced a trap composed of 578 places in 585 ms of which 2 ms to minimize.
[2022-05-18 01:53:45] [INFO ] Deduced a trap composed of 576 places in 578 ms of which 1 ms to minimize.
[2022-05-18 01:53:46] [INFO ] Deduced a trap composed of 598 places in 563 ms of which 1 ms to minimize.
[2022-05-18 01:53:46] [INFO ] Deduced a trap composed of 588 places in 563 ms of which 2 ms to minimize.
[2022-05-18 01:53:47] [INFO ] Deduced a trap composed of 558 places in 560 ms of which 1 ms to minimize.
[2022-05-18 01:53:48] [INFO ] Deduced a trap composed of 582 places in 545 ms of which 1 ms to minimize.
[2022-05-18 01:53:48] [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 1431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 69 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2022-05-18 01:53:48] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-18 01:53:48] [INFO ] Computed 182 place invariants in 90 ms
[2022-05-18 01:53:49] [INFO ] Dead Transitions using invariants and state equation in 1338 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1431/1431 places, 2602/2602 transitions.
Normalized transition count is 2593 out of 2602 initially.
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-18 01:53:49] [INFO ] Computed 182 place invariants in 76 ms
Incomplete random walk after 1000000 steps, including 70116 resets, run finished after 10120 ms. (steps per millisecond=98 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 6189 resets, run finished after 2069 ms. (steps per millisecond=483 ) properties (out of 1) seen :3
[2022-05-18 01:54:01] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-18 01:54:02] [INFO ] Computed 182 place invariants in 79 ms
[2022-05-18 01:54:02] [INFO ] [Real]Absence check using 175 positive place invariants in 45 ms returned sat
[2022-05-18 01:54:02] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned sat
[2022-05-18 01:54:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:54:02] [INFO ] [Real]Absence check using state equation in 694 ms returned sat
[2022-05-18 01:54:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:54:03] [INFO ] [Real]Added 1 Read/Feed constraints in 36 ms returned sat
[2022-05-18 01:54:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:54:03] [INFO ] [Nat]Absence check using 175 positive place invariants in 46 ms returned sat
[2022-05-18 01:54:03] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 34 ms returned sat
[2022-05-18 01:54:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:54:04] [INFO ] [Nat]Absence check using state equation in 817 ms returned sat
[2022-05-18 01:54:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 117 ms returned sat
[2022-05-18 01:54:04] [INFO ] Deduced a trap composed of 578 places in 571 ms of which 2 ms to minimize.
[2022-05-18 01:54:05] [INFO ] Deduced a trap composed of 576 places in 583 ms of which 2 ms to minimize.
[2022-05-18 01:54:06] [INFO ] Deduced a trap composed of 598 places in 570 ms of which 1 ms to minimize.
[2022-05-18 01:54:07] [INFO ] Deduced a trap composed of 588 places in 570 ms of which 1 ms to minimize.
[2022-05-18 01:54:07] [INFO ] Deduced a trap composed of 558 places in 568 ms of which 1 ms to minimize.
[2022-05-18 01:54:08] [INFO ] Deduced a trap composed of 582 places in 571 ms of which 2 ms to minimize.
[2022-05-18 01:54:09] [INFO ] Deduced a trap composed of 562 places in 562 ms of which 1 ms to minimize.
[2022-05-18 01:54:09] [INFO ] Deduced a trap composed of 576 places in 568 ms of which 1 ms to minimize.
[2022-05-18 01:54:10] [INFO ] Deduced a trap composed of 572 places in 574 ms of which 1 ms to minimize.
[2022-05-18 01:54:11] [INFO ] Deduced a trap composed of 566 places in 567 ms of which 1 ms to minimize.
[2022-05-18 01:54:11] [INFO ] Deduced a trap composed of 578 places in 585 ms of which 1 ms to minimize.
[2022-05-18 01:54:12] [INFO ] Deduced a trap composed of 576 places in 576 ms of which 1 ms to minimize.
[2022-05-18 01:54:13] [INFO ] Deduced a trap composed of 576 places in 565 ms of which 1 ms to minimize.
[2022-05-18 01:54:13] [INFO ] Deduced a trap composed of 572 places in 567 ms of which 1 ms to minimize.
[2022-05-18 01:54:14] [INFO ] Deduced a trap composed of 572 places in 574 ms of which 2 ms to minimize.
[2022-05-18 01:54:15] [INFO ] Deduced a trap composed of 580 places in 568 ms of which 1 ms to minimize.
[2022-05-18 01:54:16] [INFO ] Deduced a trap composed of 578 places in 571 ms of which 1 ms to minimize.
[2022-05-18 01:54:16] [INFO ] Deduced a trap composed of 578 places in 566 ms of which 1 ms to minimize.
[2022-05-18 01:54:17] [INFO ] Deduced a trap composed of 580 places in 563 ms of which 1 ms to minimize.
[2022-05-18 01:54:18] [INFO ] Deduced a trap composed of 578 places in 561 ms of which 1 ms to minimize.
[2022-05-18 01:54:18] [INFO ] Deduced a trap composed of 584 places in 575 ms of which 2 ms to minimize.
[2022-05-18 01:54:20] [INFO ] Deduced a trap composed of 562 places in 572 ms of which 1 ms to minimize.
[2022-05-18 01:54:21] [INFO ] Deduced a trap composed of 576 places in 574 ms of which 1 ms to minimize.
[2022-05-18 01:54:22] [INFO ] Deduced a trap composed of 580 places in 571 ms of which 1 ms to minimize.
[2022-05-18 01:54:48] [INFO ] Deduced a trap composed of 9 places in 839 ms of which 1 ms to minimize.
[2022-05-18 01:54:48] [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 1431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 69 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1431/1431 places, 2602/2602 transitions.
Starting structural reductions, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 65 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2022-05-18 01:54:49] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-18 01:54:49] [INFO ] Computed 182 place invariants in 75 ms
[2022-05-18 01:54:50] [INFO ] Implicit Places using invariants in 1425 ms returned []
[2022-05-18 01:54:50] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-18 01:54:50] [INFO ] Computed 182 place invariants in 74 ms
[2022-05-18 01:54:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:54:59] [INFO ] Implicit Places using invariants and state equation in 9379 ms returned []
Implicit Place search using SMT with State Equation took 10805 ms to find 0 implicit places.
[2022-05-18 01:54:59] [INFO ] Redundant transitions in 48 ms returned []
[2022-05-18 01:54:59] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-18 01:55:00] [INFO ] Computed 182 place invariants in 84 ms
[2022-05-18 01:55:01] [INFO ] Dead Transitions using invariants and state equation in 1398 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1431/1431 places, 2602/2602 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J80-UpperBounds-09 in 79883 ms.
Starting property specific reduction for PolyORBNT-COL-S10J80-UpperBounds-12
Normalized transition count is 2593 out of 2602 initially.
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-18 01:55:01] [INFO ] Computed 182 place invariants in 79 ms
Incomplete random walk after 10000 steps, including 712 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :4
[2022-05-18 01:55:01] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-18 01:55:01] [INFO ] Computed 182 place invariants in 80 ms
[2022-05-18 01:55:01] [INFO ] [Real]Absence check using 175 positive place invariants in 42 ms returned sat
[2022-05-18 01:55:01] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 35 ms returned sat
[2022-05-18 01:55:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:55:02] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2022-05-18 01:55:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:55:02] [INFO ] [Nat]Absence check using 175 positive place invariants in 45 ms returned sat
[2022-05-18 01:55:02] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 35 ms returned sat
[2022-05-18 01:55:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:55:07] [INFO ] [Nat]Absence check using state equation in 4812 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 1431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1431/1431 places, 2602/2602 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 1431 transition count 2601
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 1430 transition count 2601
Applied a total of 2 rules in 82 ms. Remains 1430 /1431 variables (removed 1) and now considering 2601/2602 (removed 1) transitions.
[2022-05-18 01:55:07] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-18 01:55:07] [INFO ] Computed 182 place invariants in 90 ms
[2022-05-18 01:55:09] [INFO ] Dead Transitions using invariants and state equation in 1417 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1430/1431 places, 2601/2602 transitions.
Normalized transition count is 2592 out of 2601 initially.
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-18 01:55:09] [INFO ] Computed 182 place invariants in 76 ms
Incomplete random walk after 1000000 steps, including 72271 resets, run finished after 10430 ms. (steps per millisecond=95 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 5148 resets, run finished after 1946 ms. (steps per millisecond=513 ) properties (out of 1) seen :4
[2022-05-18 01:55:21] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-18 01:55:21] [INFO ] Computed 182 place invariants in 82 ms
[2022-05-18 01:55:21] [INFO ] [Real]Absence check using 175 positive place invariants in 45 ms returned sat
[2022-05-18 01:55:21] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 41 ms returned sat
[2022-05-18 01:55:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:55:22] [INFO ] [Real]Absence check using state equation in 750 ms returned sat
[2022-05-18 01:55:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:55:22] [INFO ] [Nat]Absence check using 175 positive place invariants in 45 ms returned sat
[2022-05-18 01:55:22] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned sat
[2022-05-18 01:55:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:55:29] [INFO ] [Nat]Absence check using state equation in 6618 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 1430 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 73 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/1430 places, 2601/2601 transitions.
Starting structural reductions, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 63 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2022-05-18 01:55:29] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-18 01:55:29] [INFO ] Computed 182 place invariants in 93 ms
[2022-05-18 01:55:31] [INFO ] Implicit Places using invariants in 1494 ms returned []
[2022-05-18 01:55:31] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-18 01:55:31] [INFO ] Computed 182 place invariants in 80 ms
[2022-05-18 01:55:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:55:39] [INFO ] Implicit Places using invariants and state equation in 8197 ms returned []
Implicit Place search using SMT with State Equation took 9693 ms to find 0 implicit places.
[2022-05-18 01:55:39] [INFO ] Redundant transitions in 70 ms returned []
[2022-05-18 01:55:39] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-18 01:55:39] [INFO ] Computed 182 place invariants in 80 ms
[2022-05-18 01:55:40] [INFO ] Dead Transitions using invariants and state equation in 1425 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1430/1430 places, 2601/2601 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J80-UpperBounds-12 in 39537 ms.
Starting property specific reduction for PolyORBNT-COL-S10J80-UpperBounds-14
Normalized transition count is 2593 out of 2602 initially.
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-18 01:55:40] [INFO ] Computed 182 place invariants in 78 ms
Incomplete random walk after 10000 steps, including 702 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :3
[2022-05-18 01:55:41] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2022-05-18 01:55:41] [INFO ] Computed 182 place invariants in 81 ms
[2022-05-18 01:55:41] [INFO ] [Real]Absence check using 175 positive place invariants in 48 ms returned sat
[2022-05-18 01:55:41] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned sat
[2022-05-18 01:55:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:55:42] [INFO ] [Real]Absence check using state equation in 722 ms returned sat
[2022-05-18 01:55:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:55:42] [INFO ] [Nat]Absence check using 175 positive place invariants in 46 ms returned sat
[2022-05-18 01:55:42] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 28 ms returned sat
[2022-05-18 01:55:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:55:43] [INFO ] [Nat]Absence check using state equation in 630 ms returned sat
[2022-05-18 01:55:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:55:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 241 ms returned sat
[2022-05-18 01:55:43] [INFO ] Deduced a trap composed of 576 places in 566 ms of which 2 ms to minimize.
[2022-05-18 01:55:44] [INFO ] Deduced a trap composed of 562 places in 572 ms of which 1 ms to minimize.
[2022-05-18 01:55:45] [INFO ] Deduced a trap composed of 578 places in 597 ms of which 1 ms to minimize.
[2022-05-18 01:55:46] [INFO ] Deduced a trap composed of 568 places in 568 ms of which 1 ms to minimize.
[2022-05-18 01:55:46] [INFO ] Deduced a trap composed of 570 places in 570 ms of which 2 ms to minimize.
[2022-05-18 01:55:47] [INFO ] Deduced a trap composed of 566 places in 557 ms of which 1 ms to minimize.
[2022-05-18 01:55:47] [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 1431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1431/1431 places, 2602/2602 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 1431 transition count 2601
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1430 transition count 2601
Applied a total of 2 rules in 84 ms. Remains 1430 /1431 variables (removed 1) and now considering 2601/2602 (removed 1) transitions.
[2022-05-18 01:55:47] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-18 01:55:47] [INFO ] Computed 182 place invariants in 84 ms
[2022-05-18 01:55:49] [INFO ] Dead Transitions using invariants and state equation in 1421 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1430/1431 places, 2601/2602 transitions.
Normalized transition count is 2592 out of 2601 initially.
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-18 01:55:49] [INFO ] Computed 182 place invariants in 76 ms
Incomplete random walk after 1000000 steps, including 72327 resets, run finished after 10503 ms. (steps per millisecond=95 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 6333 resets, run finished after 2084 ms. (steps per millisecond=479 ) properties (out of 1) seen :3
[2022-05-18 01:56:01] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-18 01:56:01] [INFO ] Computed 182 place invariants in 84 ms
[2022-05-18 01:56:01] [INFO ] [Real]Absence check using 175 positive place invariants in 45 ms returned sat
[2022-05-18 01:56:02] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 33 ms returned sat
[2022-05-18 01:56:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:56:02] [INFO ] [Real]Absence check using state equation in 718 ms returned sat
[2022-05-18 01:56:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:56:02] [INFO ] [Nat]Absence check using 175 positive place invariants in 46 ms returned sat
[2022-05-18 01:56:02] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned sat
[2022-05-18 01:56:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:56:03] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2022-05-18 01:56:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:56:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 442 ms returned sat
[2022-05-18 01:56:04] [INFO ] Deduced a trap composed of 578 places in 600 ms of which 1 ms to minimize.
[2022-05-18 01:56:05] [INFO ] Deduced a trap composed of 578 places in 596 ms of which 1 ms to minimize.
[2022-05-18 01:56:06] [INFO ] Deduced a trap composed of 574 places in 609 ms of which 1 ms to minimize.
[2022-05-18 01:56:06] [INFO ] Deduced a trap composed of 571 places in 613 ms of which 1 ms to minimize.
[2022-05-18 01:56:07] [INFO ] Deduced a trap composed of 589 places in 613 ms of which 1 ms to minimize.
[2022-05-18 01:56:08] [INFO ] Deduced a trap composed of 587 places in 617 ms of which 1 ms to minimize.
[2022-05-18 01:56:08] [INFO ] Deduced a trap composed of 575 places in 619 ms of which 1 ms to minimize.
[2022-05-18 01:56:09] [INFO ] Deduced a trap composed of 582 places in 610 ms of which 1 ms to minimize.
[2022-05-18 01:56:10] [INFO ] Deduced a trap composed of 578 places in 612 ms of which 1 ms to minimize.
[2022-05-18 01:56:11] [INFO ] Deduced a trap composed of 587 places in 604 ms of which 2 ms to minimize.
[2022-05-18 01:56:11] [INFO ] Deduced a trap composed of 576 places in 603 ms of which 2 ms to minimize.
[2022-05-18 01:56:12] [INFO ] Deduced a trap composed of 578 places in 604 ms of which 2 ms to minimize.
[2022-05-18 01:56:13] [INFO ] Deduced a trap composed of 585 places in 619 ms of which 1 ms to minimize.
[2022-05-18 01:56:14] [INFO ] Deduced a trap composed of 562 places in 604 ms of which 1 ms to minimize.
[2022-05-18 01:56:14] [INFO ] Deduced a trap composed of 581 places in 605 ms of which 1 ms to minimize.
[2022-05-18 01:56:15] [INFO ] Deduced a trap composed of 586 places in 613 ms of which 1 ms to minimize.
[2022-05-18 01:56:16] [INFO ] Deduced a trap composed of 582 places in 657 ms of which 1 ms to minimize.
[2022-05-18 01:56:16] [INFO ] Deduced a trap composed of 583 places in 616 ms of which 2 ms to minimize.
[2022-05-18 01:56:17] [INFO ] Deduced a trap composed of 587 places in 609 ms of which 1 ms to minimize.
[2022-05-18 01:56:18] [INFO ] Deduced a trap composed of 587 places in 616 ms of which 1 ms to minimize.
[2022-05-18 01:56:19] [INFO ] Deduced a trap composed of 583 places in 625 ms of which 1 ms to minimize.
[2022-05-18 01:56:19] [INFO ] Deduced a trap composed of 585 places in 609 ms of which 1 ms to minimize.
[2022-05-18 01:56:21] [INFO ] Deduced a trap composed of 589 places in 604 ms of which 1 ms to minimize.
[2022-05-18 01:56:22] [INFO ] Deduced a trap composed of 588 places in 641 ms of which 2 ms to minimize.
[2022-05-18 01:56:22] [INFO ] Deduced a trap composed of 591 places in 605 ms of which 3 ms to minimize.
[2022-05-18 01:56:23] [INFO ] Deduced a trap composed of 573 places in 611 ms of which 1 ms to minimize.
[2022-05-18 01:56:24] [INFO ] Deduced a trap composed of 572 places in 601 ms of which 1 ms to minimize.
[2022-05-18 01:56:25] [INFO ] Deduced a trap composed of 587 places in 595 ms of which 5 ms to minimize.
[2022-05-18 01:56:26] [INFO ] Deduced a trap composed of 582 places in 603 ms of which 1 ms to minimize.
[2022-05-18 01:56:27] [INFO ] Deduced a trap composed of 593 places in 610 ms of which 1 ms to minimize.
[2022-05-18 01:56:28] [INFO ] Deduced a trap composed of 578 places in 604 ms of which 1 ms to minimize.
[2022-05-18 01:56:28] [INFO ] Deduced a trap composed of 591 places in 621 ms of which 1 ms to minimize.
[2022-05-18 01:56:31] [INFO ] Deduced a trap composed of 585 places in 619 ms of which 1 ms to minimize.
[2022-05-18 01:56:32] [INFO ] Deduced a trap composed of 562 places in 571 ms of which 1 ms to minimize.
[2022-05-18 01:56:33] [INFO ] Deduced a trap composed of 562 places in 578 ms of which 1 ms to minimize.
[2022-05-18 01:56:34] [INFO ] Deduced a trap composed of 570 places in 593 ms of which 1 ms to minimize.
[2022-05-18 01:56:35] [INFO ] Deduced a trap composed of 568 places in 582 ms of which 1 ms to minimize.
[2022-05-18 01:56:35] [INFO ] Deduced a trap composed of 568 places in 572 ms of which 2 ms to minimize.
[2022-05-18 01:56:36] [INFO ] Deduced a trap composed of 564 places in 574 ms of which 1 ms to minimize.
[2022-05-18 01:56:37] [INFO ] Deduced a trap composed of 572 places in 568 ms of which 1 ms to minimize.
[2022-05-18 01:56:38] [INFO ] Deduced a trap composed of 578 places in 572 ms of which 1 ms to minimize.
[2022-05-18 01:56:40] [INFO ] Deduced a trap composed of 568 places in 566 ms of which 1 ms to minimize.
[2022-05-18 01:56:40] [INFO ] Deduced a trap composed of 572 places in 594 ms of which 1 ms to minimize.
[2022-05-18 01:56:41] [INFO ] Deduced a trap composed of 570 places in 575 ms of which 2 ms to minimize.
[2022-05-18 01:56:42] [INFO ] Deduced a trap composed of 570 places in 567 ms of which 1 ms to minimize.
[2022-05-18 01:56:43] [INFO ] Deduced a trap composed of 570 places in 567 ms of which 1 ms to minimize.
[2022-05-18 01:56:43] [INFO ] Deduced a trap composed of 564 places in 572 ms of which 1 ms to minimize.
[2022-05-18 01:56:45] [INFO ] Deduced a trap composed of 566 places in 588 ms of which 1 ms to minimize.
[2022-05-18 01:56:45] [INFO ] Deduced a trap composed of 580 places in 584 ms of which 1 ms to minimize.
[2022-05-18 01:56:47] [INFO ] Deduced a trap composed of 580 places in 572 ms of which 1 ms to minimize.
[2022-05-18 01:56:47] [INFO ] Deduced a trap composed of 576 places in 566 ms of which 1 ms to minimize.
[2022-05-18 01:56:47] [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 1430 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 65 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/1430 places, 2601/2601 transitions.
Starting structural reductions, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 63 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2022-05-18 01:56:47] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-18 01:56:48] [INFO ] Computed 182 place invariants in 88 ms
[2022-05-18 01:56:49] [INFO ] Implicit Places using invariants in 1510 ms returned []
[2022-05-18 01:56:49] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-18 01:56:49] [INFO ] Computed 182 place invariants in 77 ms
[2022-05-18 01:56:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:56:57] [INFO ] Implicit Places using invariants and state equation in 8511 ms returned []
Implicit Place search using SMT with State Equation took 10022 ms to find 0 implicit places.
[2022-05-18 01:56:58] [INFO ] Redundant transitions in 70 ms returned []
[2022-05-18 01:56:58] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2022-05-18 01:56:58] [INFO ] Computed 182 place invariants in 81 ms
[2022-05-18 01:56:59] [INFO ] Dead Transitions using invariants and state equation in 1414 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1430/1430 places, 2601/2601 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J80-UpperBounds-14 in 78572 ms.
[2022-05-18 01:56:59] [INFO ] Flatten gal took : 292 ms
[2022-05-18 01:57:00] [INFO ] Applying decomposition
[2022-05-18 01:57:00] [INFO ] Flatten gal took : 210 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/graph11708125592330147442.txt, -o, /tmp/graph11708125592330147442.bin, -w, /tmp/graph11708125592330147442.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/graph11708125592330147442.bin, -l, -1, -v, -w, /tmp/graph11708125592330147442.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-18 01:57:00] [INFO ] Decomposing Gal with order
[2022-05-18 01:57:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:57:01] [INFO ] Removed a total of 4717 redundant transitions.
[2022-05-18 01:57:01] [INFO ] Flatten gal took : 496 ms
[2022-05-18 01:57:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 698 labels/synchronizations in 125 ms.
[2022-05-18 01:57:01] [INFO ] Time to serialize gal into /tmp/UpperBounds8202779797030088456.gal : 32 ms
[2022-05-18 01:57:01] [INFO ] Time to serialize properties into /tmp/UpperBounds18297493994210337147.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/UpperBounds8202779797030088456.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds18297493994210337147.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/UpperBounds8202779797030088456.gal -t CGAL -reachable-file /tmp/UpperBounds18297493994210337147.prop --nowitness
Loading property file /tmp/UpperBounds18297493994210337147.prop.
Detected timeout of ITS tools.
[2022-05-18 02:20:09] [INFO ] Applying decomposition
[2022-05-18 02:20:09] [INFO ] Flatten gal took : 692 ms
[2022-05-18 02:20:10] [INFO ] Decomposing Gal with order
[2022-05-18 02:20:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 02:20:12] [INFO ] Removed a total of 11519 redundant transitions.
[2022-05-18 02:20:12] [INFO ] Flatten gal took : 1227 ms
[2022-05-18 02:20:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 59 ms.
[2022-05-18 02:20:15] [INFO ] Time to serialize gal into /tmp/UpperBounds7458690875415164537.gal : 42 ms
[2022-05-18 02:20:15] [INFO ] Time to serialize properties into /tmp/UpperBounds1190677100046123303.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/UpperBounds7458690875415164537.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds1190677100046123303.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/UpperBounds7458690875415164537.gal -t CGAL -reachable-file /tmp/UpperBounds1190677100046123303.prop --nowitness
Loading property file /tmp/UpperBounds1190677100046123303.prop.
Detected timeout of ITS tools.
[2022-05-18 02:43:18] [INFO ] Flatten gal took : 883 ms
[2022-05-18 02:43:28] [INFO ] Input system was already deterministic with 2602 transitions.
[2022-05-18 02:43:28] [INFO ] Transformed 1431 places.
[2022-05-18 02:43:28] [INFO ] Transformed 2602 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:43:58] [INFO ] Time to serialize gal into /tmp/UpperBounds2025942690086634570.gal : 11 ms
[2022-05-18 02:43:58] [INFO ] Time to serialize properties into /tmp/UpperBounds17365946015578626754.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/UpperBounds2025942690086634570.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17365946015578626754.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/UpperBounds2025942690086634570.gal -t CGAL -reachable-file /tmp/UpperBounds17365946015578626754.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/UpperBounds17365946015578626754.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-S10J80"
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-S10J80, 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-165277027100301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J80.tgz
mv PolyORBNT-COL-S10J80 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;