Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089268300427.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBNT-COL-S10J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089268300427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 27 09:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 09:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 12:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 94K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621218497893

Running Version 0
[2021-05-17 02:28:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 02:28:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 02:28:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-17 02:28:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 02:28:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 921 ms
[2021-05-17 02:28:23] [INFO ] ms3 symmetric to ms2 in transition trans_489
[2021-05-17 02:28:23] [INFO ] ms2 symmetric to ms4 in transition trans_489
[2021-05-17 02:28:23] [INFO ] ms4 symmetric to ms1 in transition trans_489
[2021-05-17 02:28:23] [INFO ] ms3 symmetric to ms2 in transition trans_488
[2021-05-17 02:28:23] [INFO ] ms2 symmetric to ms1 in transition trans_488
[2021-05-17 02:28:23] [INFO ] ms2 symmetric to ms1 in transition trans_487
[2021-05-17 02:28:23] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 20 ms.
[2021-05-17 02:28:23] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions in 16 ms.
[2021-05-17 02:28:23] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_2978575894053083364.dot
// Phase 1: matrix 38 rows 48 cols
[2021-05-17 02:28:24] [INFO ] Computed 13 place invariants in 52 ms
[2021-05-17 02:28:24] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 2870 transitions in 95 ms.
[2021-05-17 02:28:24] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2021-05-17 02:28:24] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-17 02:28:24] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2021-05-17 02:28:24] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-17 02:28:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:24] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2021-05-17 02:28:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:28:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-17 02:28:24] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 02:28:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:24] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-17 02:28:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 02:28:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 02:28:24] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 19 ms.
[2021-05-17 02:28:24] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 4 ms to minimize.
[2021-05-17 02:28:24] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2021-05-17 02:28:25] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2021-05-17 02:28:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 291 ms
[2021-05-17 02:28:25] [INFO ] Added : 36 causal constraints over 8 iterations in 508 ms. Result :sat
Minimization took 11 ms.
[2021-05-17 02:28:25] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-17 02:28:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 11 ms returned sat
[2021-05-17 02:28:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:25] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-17 02:28:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:28:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 12 ms returned sat
[2021-05-17 02:28:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 02:28:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:25] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-17 02:28:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 02:28:25] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 02:28:25] [INFO ] Added : 36 causal constraints over 8 iterations in 87 ms. Result :sat
Minimization took 26 ms.
[2021-05-17 02:28:25] [INFO ] [Real]Absence check using 6 positive place invariants in 53 ms returned sat
[2021-05-17 02:28:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 54 ms returned unsat
[2021-05-17 02:28:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 02:28:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 14 ms returned sat
[2021-05-17 02:28:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:25] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2021-05-17 02:28:25] [INFO ] [Real]Absence check using 6 positive place invariants in 15 ms returned sat
[2021-05-17 02:28:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 02:28:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:25] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-17 02:28:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:28:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:28:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 21 ms returned sat
[2021-05-17 02:28:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:25] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2021-05-17 02:28:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 02:28:25] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 33 ms to minimize.
[2021-05-17 02:28:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2021-05-17 02:28:25] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 02:28:25] [INFO ] Added : 19 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 16 ms.
[2021-05-17 02:28:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 02:28:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 02:28:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:25] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-17 02:28:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:28:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:28:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 02:28:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:26] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-17 02:28:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 02:28:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-17 02:28:26] [INFO ] Added : 13 causal constraints over 4 iterations in 224 ms. Result :sat
Minimization took 102 ms.
[2021-05-17 02:28:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 02:28:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2021-05-17 02:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:26] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2021-05-17 02:28:26] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 02:28:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:28:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:28:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 02:28:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:26] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2021-05-17 02:28:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 02:28:26] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 1 ms to minimize.
[2021-05-17 02:28:26] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 5 ms to minimize.
[2021-05-17 02:28:26] [INFO ] Deduced a trap composed of 16 places in 12 ms of which 0 ms to minimize.
[2021-05-17 02:28:26] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2021-05-17 02:28:26] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 0 ms to minimize.
[2021-05-17 02:28:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 165 ms
[2021-05-17 02:28:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 02:28:27] [INFO ] Added : 33 causal constraints over 7 iterations in 166 ms. Result :sat
Minimization took 14 ms.
[2021-05-17 02:28:27] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:28:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2021-05-17 02:28:27] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2021-05-17 02:28:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 11 ms returned sat
[2021-05-17 02:28:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:27] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-17 02:28:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:28:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:28:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 02:28:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:27] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2021-05-17 02:28:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 02:28:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 02:28:27] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2021-05-17 02:28:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2021-05-17 02:28:27] [INFO ] Added : 36 causal constraints over 8 iterations in 188 ms. Result :sat
Minimization took 24 ms.
[2021-05-17 02:28:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 02:28:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 02:28:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:27] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-17 02:28:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:28:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:28:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 02:28:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:27] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-17 02:28:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 02:28:27] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2021-05-17 02:28:27] [INFO ] Deduced a trap composed of 14 places in 13 ms of which 0 ms to minimize.
[2021-05-17 02:28:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
[2021-05-17 02:28:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-17 02:28:27] [INFO ] Added : 36 causal constraints over 8 iterations in 79 ms. Result :sat
Minimization took 14 ms.
[2021-05-17 02:28:27] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:28:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 02:28:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:27] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-17 02:28:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:28:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 02:28:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 02:28:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:27] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-17 02:28:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 02:28:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 02:28:27] [INFO ] Added : 36 causal constraints over 8 iterations in 44 ms. Result :sat
Minimization took 11 ms.
[2021-05-17 02:28:27] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2021-05-17 02:28:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 02:28:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:27] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-17 02:28:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:28:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 02:28:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 02:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:28] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2021-05-17 02:28:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 02:28:28] [INFO ] Deduced a trap composed of 13 places in 15 ms of which 0 ms to minimize.
[2021-05-17 02:28:28] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2021-05-17 02:28:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 50 ms
[2021-05-17 02:28:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 02:28:28] [INFO ] Added : 36 causal constraints over 8 iterations in 63 ms. Result :sat
Minimization took 13 ms.
[2021-05-17 02:28:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 02:28:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2021-05-17 02:28:28] [INFO ] [Real]Absence check using 6 positive place invariants in 52 ms returned sat
[2021-05-17 02:28:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 52 ms returned sat
[2021-05-17 02:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:28] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2021-05-17 02:28:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:28:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2021-05-17 02:28:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 02:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:28] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-05-17 02:28:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 02:28:28] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 1 ms to minimize.
[2021-05-17 02:28:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2021-05-17 02:28:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 02:28:28] [INFO ] Added : 22 causal constraints over 5 iterations in 25 ms. Result :sat
Minimization took 55 ms.
[2021-05-17 02:28:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 02:28:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 02:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 02:28:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:28:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:28:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 02:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:28] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-17 02:28:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 02:28:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-17 02:28:28] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2021-05-17 02:28:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2021-05-17 02:28:28] [INFO ] Added : 36 causal constraints over 8 iterations in 196 ms. Result :sat
Minimization took 19 ms.
[2021-05-17 02:28:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 02:28:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 02:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:29] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-17 02:28:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:28:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 02:28:29] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 02:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:29] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-17 02:28:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 02:28:29] [INFO ] Deduced a trap composed of 13 places in 533 ms of which 0 ms to minimize.
[2021-05-17 02:28:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 538 ms
[2021-05-17 02:28:29] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 02:28:29] [INFO ] Added : 33 causal constraints over 7 iterations in 189 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : [1, -1, 1, 10, 2, 10, 1, 1, -1, -1, -1, -1, 1, 4, -1, 1]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
[2021-05-17 02:28:29] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 2870 transitions in 24 ms.
[2021-05-17 02:28:29] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_9857089795124983857.dot
Deduced a syphon composed of 60 places in 9 ms
Reduce places removed 60 places and 60 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 12) seen :3
FORMULA PolyORBNT-COL-S10J60-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :10
FORMULA PolyORBNT-COL-S10J60-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :1
[2021-05-17 02:28:30] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2021-05-17 02:28:31] [INFO ] Computed 152 place invariants in 364 ms
[2021-05-17 02:28:31] [INFO ] [Real]Absence check using 145 positive place invariants in 37 ms returned sat
[2021-05-17 02:28:31] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 32 ms returned unsat
[2021-05-17 02:28:31] [INFO ] [Real]Absence check using 145 positive place invariants in 67 ms returned sat
[2021-05-17 02:28:31] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 40 ms returned sat
[2021-05-17 02:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:34] [INFO ] [Real]Absence check using state equation in 2571 ms returned sat
[2021-05-17 02:28:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:28:34] [INFO ] [Nat]Absence check using 145 positive place invariants in 84 ms returned sat
[2021-05-17 02:28:34] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 52 ms returned sat
[2021-05-17 02:28:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:37] [INFO ] [Nat]Absence check using state equation in 2653 ms returned sat
[2021-05-17 02:28:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 02:28:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 53 ms returned sat
[2021-05-17 02:28:39] [INFO ] Deduced a trap composed of 506 places in 1234 ms of which 2 ms to minimize.
[2021-05-17 02:28:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1542 ms
[2021-05-17 02:28:39] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 446 ms.
[2021-05-17 02:28:39] [INFO ] Added : 0 causal constraints over 0 iterations in 447 ms. Result :unknown
[2021-05-17 02:28:39] [INFO ] [Real]Absence check using 145 positive place invariants in 126 ms returned sat
[2021-05-17 02:28:40] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 35 ms returned sat
[2021-05-17 02:28:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:41] [INFO ] [Real]Absence check using state equation in 1209 ms returned sat
[2021-05-17 02:28:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:28:41] [INFO ] [Nat]Absence check using 145 positive place invariants in 107 ms returned sat
[2021-05-17 02:28:41] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 34 ms returned sat
[2021-05-17 02:28:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:44] [INFO ] [Nat]Absence check using state equation in 2630 ms returned sat
[2021-05-17 02:28:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 61 ms returned sat
[2021-05-17 02:28:44] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 508 ms.
[2021-05-17 02:28:45] [INFO ] Added : 6 causal constraints over 2 iterations in 981 ms. Result :sat
Minimization took 882 ms.
[2021-05-17 02:28:46] [INFO ] [Real]Absence check using 145 positive place invariants in 68 ms returned sat
[2021-05-17 02:28:46] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 46 ms returned unsat
[2021-05-17 02:28:46] [INFO ] [Real]Absence check using 145 positive place invariants in 74 ms returned sat
[2021-05-17 02:28:46] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 27 ms returned unsat
[2021-05-17 02:28:47] [INFO ] [Real]Absence check using 145 positive place invariants in 37 ms returned sat
[2021-05-17 02:28:47] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 23 ms returned unsat
[2021-05-17 02:28:47] [INFO ] [Real]Absence check using 145 positive place invariants in 70 ms returned sat
[2021-05-17 02:28:47] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 42 ms returned unsat
[2021-05-17 02:28:47] [INFO ] [Real]Absence check using 145 positive place invariants in 53 ms returned sat
[2021-05-17 02:28:47] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 25 ms returned sat
[2021-05-17 02:28:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:48] [INFO ] [Real]Absence check using state equation in 739 ms returned sat
[2021-05-17 02:28:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:28:48] [INFO ] [Nat]Absence check using 145 positive place invariants in 89 ms returned sat
[2021-05-17 02:28:48] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 106 ms returned sat
[2021-05-17 02:28:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:28:53] [INFO ] [Nat]Absence check using state equation in 4637 ms returned unknown
[2021-05-17 02:28:53] [INFO ] [Real]Absence check using 145 positive place invariants in 42 ms returned sat
[2021-05-17 02:28:53] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 19 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 2, 10, 1, 1, 1, 1, 4, 1] Max seen :[1, 0, 3, 1, 1, 1, 1, 0, 1]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 2400 steps, including 167 resets, run finished after 39 ms. (steps per millisecond=61 ) properties (out of 3) seen :3 could not realise parikh vector
Support contains 12 out of 1234 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 1224 transition count 2744
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 142 place count 1158 transition count 2744
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 142 place count 1158 transition count 2679
Deduced a syphon composed of 65 places in 18 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 272 place count 1093 transition count 2679
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 273 place count 1092 transition count 2678
Iterating global reduction 2 with 1 rules applied. Total rules applied 274 place count 1092 transition count 2678
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 2 with 4 rules applied. Total rules applied 278 place count 1090 transition count 2676
Applied a total of 278 rules in 909 ms. Remains 1090 /1234 variables (removed 144) and now considering 2676/2810 (removed 134) transitions.
[2021-05-17 02:28:54] [INFO ] Flow matrix only has 2667 transitions (discarded 9 similar events)
// Phase 1: matrix 2667 rows 1090 cols
[2021-05-17 02:28:55] [INFO ] Computed 142 place invariants in 287 ms
[2021-05-17 02:28:58] [INFO ] Dead Transitions using invariants and state equation in 3316 ms returned [1050, 1051, 1052, 1053, 1054, 1055, 1056, 1057, 1058, 1059, 1060, 1061, 1062, 1063, 1064, 1065, 1066, 1067, 1068, 1069, 1071, 1072, 1073, 1074, 1075, 1076, 1077, 1078, 1079, 1080, 1081, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1091, 1092, 1093, 1094, 1095, 1097, 1100, 1101, 1102, 1103, 1104, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1120, 1121, 1122, 1123, 1124, 1126, 1127, 1128, 1129, 1130, 1132, 1135, 1136, 1137, 1138, 1139, 1140, 1142, 1145, 1149, 1150, 1151, 1152, 1153, 1154, 1155, 1156, 1157, 1158, 1159, 1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1180, 1182, 1183, 1184, 1185, 1186, 1188, 1191, 1192, 1193, 1194, 1195, 1196, 1198, 1201, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1213, 1216, 1220, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1239, 1240, 1241, 1242, 1243, 1244, 1245, 1246, 1247, 1248, 1249, 1250, 1251, 1252, 1253, 1254, 1255, 1256, 1257, 1258, 1259, 1260, 1261, 1262, 1263, 1264, 1266, 1267, 1268, 1269, 1270, 1272, 1275, 1276, 1277, 1278, 1279, 1280, 1282, 1285, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1297, 1300, 1304, 1309, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1318, 1321, 1325, 1330, 1336, 1337, 1338, 1339, 1340, 1341, 1342, 1343, 1344, 1345, 1346, 1347, 1348, 1349, 1350, 1351, 1352, 1353, 1354, 1355, 1356, 1357, 1358, 1359, 1360, 1361, 1362, 1363, 1364, 1365, 1366, 1367, 1368, 1369, 1370, 1371, 1372, 1373, 1374, 1375, 1376, 1377, 1378, 1379, 1380, 1381, 1382, 1383, 1384, 1386, 1387, 1388, 1389, 1390, 1392, 1395, 1396, 1397, 1398, 1399, 1400, 1402, 1405, 1409, 1410, 1411, 1412, 1413, 1414, 1415, 1417, 1420, 1424, 1429, 1430, 1431, 1432, 1433, 1434, 1435, 1436, 1438, 1441, 1445, 1450, 1456, 1457, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1466, 1469, 1473, 1478, 1484, 1491, 1492, 1493, 1494, 1495, 1496, 1497, 1498, 1499, 1500, 1501, 1502, 1503, 1504, 1505, 1506, 1507, 1508, 1509, 1510, 1511, 1512, 1513, 1514, 1515, 1516, 1517, 1518, 1519, 1520, 1521, 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, 1547, 1548, 1549, 1551, 1552, 1553, 1554, 1555, 1557, 1560, 1561, 1562, 1563, 1564, 1565, 1567, 1570, 1574, 1575, 1576, 1577, 1578, 1579, 1580, 1582, 1585, 1589, 1594, 1595, 1596, 1597, 1598, 1599, 1600, 1601, 1603, 1606, 1610, 1615, 1621, 1622, 1623, 1624, 1625, 1626, 1627, 1628, 1629, 1631, 1634, 1638, 1643, 1649, 1656, 1657, 1658, 1659, 1660, 1661, 1662, 1663, 1664, 1665, 1667, 1670, 1674, 1679, 1685, 1692, 1700, 1701, 1702, 1703, 1704, 1705, 1706, 1707, 1708, 1709, 1710, 1711, 1712, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1720, 1721, 1722, 1723, 1724, 1725, 1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748, 1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1771, 1772, 1773, 1774, 1775, 1777, 1780, 1781, 1782, 1783, 1784, 1785, 1787, 1790, 1794, 1795, 1796, 1797, 1798, 1799, 1800, 1802, 1805, 1809, 1814, 1815, 1816, 1817, 1818, 1819, 1820, 1821, 1823, 1826, 1830, 1835, 1841, 1842, 1843, 1844, 1845, 1846, 1847, 1848, 1849, 1851, 1854, 1858, 1863, 1869, 1876, 1877, 1878, 1879, 1880, 1881, 1882, 1883, 1884, 1885, 1887, 1890, 1894, 1899, 1905, 1912, 1920, 1921, 1922, 1923, 1924, 1925, 1926, 1927, 1928, 1929, 1930, 1932, 1935, 1939, 1944, 1950, 1957, 1965, 1974, 1975, 1976, 1977, 1978, 1979, 1980, 1981, 1982, 1983, 1984, 1985, 1987, 1990, 1994, 1999, 2005, 2012, 2020, 2029, 2039]
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions :[2039, 2029, 2020, 2012, 2005, 1999, 1994, 1990, 1987, 1985, 1984, 1983, 1982, 1981, 1980, 1979, 1978, 1977, 1976, 1975, 1974, 1965, 1957, 1950, 1944, 1939, 1935, 1932, 1930, 1929, 1928, 1927, 1926, 1925, 1924, 1923, 1922, 1921, 1920, 1912, 1905, 1899, 1894, 1890, 1887, 1885, 1884, 1883, 1882, 1881, 1880, 1879, 1878, 1877, 1876, 1869, 1863, 1858, 1854, 1851, 1849, 1848, 1847, 1846, 1845, 1844, 1843, 1842, 1841, 1835, 1830, 1826, 1823, 1821, 1820, 1819, 1818, 1817, 1816, 1815, 1814, 1809, 1805, 1802, 1800, 1799, 1798, 1797, 1796, 1795, 1794, 1790, 1787, 1785, 1784, 1783, 1782, 1781, 1780, 1777, 1775, 1774, 1773, 1772, 1771, 1769, 1768, 1767, 1766, 1765, 1764, 1763, 1762, 1761, 1760, 1759, 1758, 1757, 1756, 1755, 1754, 1753, 1752, 1751, 1750, 1749, 1748, 1747, 1746, 1745, 1744, 1743, 1742, 1741, 1740, 1739, 1738, 1737, 1736, 1735, 1734, 1733, 1732, 1731, 1730, 1729, 1728, 1727, 1726, 1725, 1724, 1723, 1722, 1721, 1720, 1719, 1718, 1717, 1716, 1715, 1714, 1713, 1712, 1711, 1710, 1709, 1708, 1707, 1706, 1705, 1704, 1703, 1702, 1701, 1700, 1692, 1685, 1679, 1674, 1670, 1667, 1665, 1664, 1663, 1662, 1661, 1660, 1659, 1658, 1657, 1656, 1649, 1643, 1638, 1634, 1631, 1629, 1628, 1627, 1626, 1625, 1624, 1623, 1622, 1621, 1615, 1610, 1606, 1603, 1601, 1600, 1599, 1598, 1597, 1596, 1595, 1594, 1589, 1585, 1582, 1580, 1579, 1578, 1577, 1576, 1575, 1574, 1570, 1567, 1565, 1564, 1563, 1562, 1561, 1560, 1557, 1555, 1554, 1553, 1552, 1551, 1549, 1548, 1547, 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, 1521, 1520, 1519, 1518, 1517, 1516, 1515, 1514, 1513, 1512, 1511, 1510, 1509, 1508, 1507, 1506, 1505, 1504, 1503, 1502, 1501, 1500, 1499, 1498, 1497, 1496, 1495, 1494, 1493, 1492, 1491, 1484, 1478, 1473, 1469, 1466, 1464, 1463, 1462, 1461, 1460, 1459, 1458, 1457, 1456, 1450, 1445, 1441, 1438, 1436, 1435, 1434, 1433, 1432, 1431, 1430, 1429, 1424, 1420, 1417, 1415, 1414, 1413, 1412, 1411, 1410, 1409, 1405, 1402, 1400, 1399, 1398, 1397, 1396, 1395, 1392, 1390, 1389, 1388, 1387, 1386, 1384, 1383, 1382, 1381, 1380, 1379, 1378, 1377, 1376, 1375, 1374, 1373, 1372, 1371, 1370, 1369, 1368, 1367, 1366, 1365, 1364, 1363, 1362, 1361, 1360, 1359, 1358, 1357, 1356, 1355, 1354, 1353, 1352, 1351, 1350, 1349, 1348, 1347, 1346, 1345, 1344, 1343, 1342, 1341, 1340, 1339, 1338, 1337, 1336, 1330, 1325, 1321, 1318, 1316, 1315, 1314, 1313, 1312, 1311, 1310, 1309, 1304, 1300, 1297, 1295, 1294, 1293, 1292, 1291, 1290, 1289, 1285, 1282, 1280, 1279, 1278, 1277, 1276, 1275, 1272, 1270, 1269, 1268, 1267, 1266, 1264, 1263, 1262, 1261, 1260, 1259, 1258, 1257, 1256, 1255, 1254, 1253, 1252, 1251, 1250, 1249, 1248, 1247, 1246, 1245, 1244, 1243, 1242, 1241, 1240, 1239, 1238, 1237, 1236, 1235, 1234, 1233, 1232, 1231, 1230, 1229, 1228, 1227, 1226, 1225, 1220, 1216, 1213, 1211, 1210, 1209, 1208, 1207, 1206, 1205, 1201, 1198, 1196, 1195, 1194, 1193, 1192, 1191, 1188, 1186, 1185, 1184, 1183, 1182, 1180, 1179, 1178, 1177, 1176, 1175, 1174, 1173, 1172, 1171, 1170, 1169, 1168, 1167, 1166, 1165, 1164, 1163, 1162, 1161, 1160, 1159, 1158, 1157, 1156, 1155, 1154, 1153, 1152, 1151, 1150, 1149, 1145, 1142, 1140, 1139, 1138, 1137, 1136, 1135, 1132, 1130, 1129, 1128, 1127, 1126, 1124, 1123, 1122, 1121, 1120, 1119, 1118, 1117, 1116, 1115, 1114, 1113, 1112, 1111, 1110, 1109, 1108, 1107, 1106, 1105, 1104, 1103, 1102, 1101, 1100, 1097, 1095, 1094, 1093, 1092, 1091, 1089, 1088, 1087, 1086, 1085, 1084, 1083, 1082, 1081, 1080, 1079, 1078, 1077, 1076, 1075, 1074, 1073, 1072, 1071, 1069, 1068, 1067, 1066, 1065, 1064, 1063, 1062, 1061, 1060, 1059, 1058, 1057, 1056, 1055, 1054, 1053, 1052, 1051, 1050]
Starting structural reductions, iteration 1 : 1090/1234 places, 2061/2810 transitions.
Applied a total of 0 rules in 50 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1090/1234 places, 2061/2810 transitions.
Normalized transition count is 2052 out of 2061 initially.
// Phase 1: matrix 2052 rows 1090 cols
[2021-05-17 02:28:58] [INFO ] Computed 142 place invariants in 156 ms
Incomplete random walk after 1000000 steps, including 72778 resets, run finished after 9045 ms. (steps per millisecond=110 ) properties (out of 3) seen :9
FORMULA PolyORBNT-COL-S10J60-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4442 resets, run finished after 1410 ms. (steps per millisecond=709 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 7291 resets, run finished after 1857 ms. (steps per millisecond=538 ) properties (out of 2) seen :7
[2021-05-17 02:29:10] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2021-05-17 02:29:10] [INFO ] Computed 142 place invariants in 47 ms
[2021-05-17 02:29:11] [INFO ] [Real]Absence check using 135 positive place invariants in 54 ms returned sat
[2021-05-17 02:29:11] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 36 ms returned unsat
[2021-05-17 02:29:11] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2021-05-17 02:29:11] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2021-05-17 02:29:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:29:12] [INFO ] [Real]Absence check using state equation in 837 ms returned sat
[2021-05-17 02:29:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:29:12] [INFO ] [Nat]Absence check using 135 positive place invariants in 28 ms returned sat
[2021-05-17 02:29:12] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned sat
[2021-05-17 02:29:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:29:13] [INFO ] [Nat]Absence check using state equation in 924 ms returned sat
[2021-05-17 02:29:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 02:29:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 166 ms returned sat
[2021-05-17 02:29:14] [INFO ] Deduced a trap composed of 446 places in 740 ms of which 1 ms to minimize.
[2021-05-17 02:29:15] [INFO ] Deduced a trap composed of 428 places in 763 ms of which 1 ms to minimize.
[2021-05-17 02:29:15] [INFO ] Deduced a trap composed of 442 places in 574 ms of which 1 ms to minimize.
[2021-05-17 02:29:16] [INFO ] Deduced a trap composed of 434 places in 750 ms of which 1 ms to minimize.
[2021-05-17 02:29:17] [INFO ] Deduced a trap composed of 432 places in 734 ms of which 1 ms to minimize.
[2021-05-17 02:29:18] [INFO ] Deduced a trap composed of 440 places in 528 ms of which 1 ms to minimize.
[2021-05-17 02:29:18] [INFO ] Deduced a trap composed of 450 places in 542 ms of which 1 ms to minimize.
[2021-05-17 02:29:19] [INFO ] Deduced a trap composed of 440 places in 501 ms of which 0 ms to minimize.
[2021-05-17 02:29:20] [INFO ] Deduced a trap composed of 432 places in 538 ms of which 0 ms to minimize.
[2021-05-17 02:29:20] [INFO ] Deduced a trap composed of 436 places in 472 ms of which 1 ms to minimize.
[2021-05-17 02:29:21] [INFO ] Deduced a trap composed of 446 places in 844 ms of which 1 ms to minimize.
[2021-05-17 02:29:22] [INFO ] Deduced a trap composed of 444 places in 772 ms of which 1 ms to minimize.
[2021-05-17 02:29:23] [INFO ] Deduced a trap composed of 446 places in 937 ms of which 1 ms to minimize.
[2021-05-17 02:29:24] [INFO ] Deduced a trap composed of 432 places in 686 ms of which 1 ms to minimize.
[2021-05-17 02:29:24] [INFO ] Deduced a trap composed of 446 places in 497 ms of which 1 ms to minimize.
[2021-05-17 02:29:25] [INFO ] Deduced a trap composed of 444 places in 583 ms of which 1 ms to minimize.
[2021-05-17 02:29:26] [INFO ] Deduced a trap composed of 436 places in 659 ms of which 4 ms to minimize.
[2021-05-17 02:29:27] [INFO ] Deduced a trap composed of 450 places in 844 ms of which 1 ms to minimize.
[2021-05-17 02:29:28] [INFO ] Deduced a trap composed of 456 places in 825 ms of which 1 ms to minimize.
[2021-05-17 02:29:30] [INFO ] Deduced a trap composed of 446 places in 738 ms of which 1 ms to minimize.
[2021-05-17 02:29:30] [INFO ] Deduced a trap composed of 424 places in 803 ms of which 1 ms to minimize.
[2021-05-17 02:29:31] [INFO ] Deduced a trap composed of 438 places in 627 ms of which 1 ms to minimize.
[2021-05-17 02:29:32] [INFO ] Deduced a trap composed of 444 places in 766 ms of which 1 ms to minimize.
[2021-05-17 02:29:33] [INFO ] Deduced a trap composed of 446 places in 843 ms of which 1 ms to minimize.
[2021-05-17 02:29:34] [INFO ] Deduced a trap composed of 432 places in 859 ms of which 1 ms to minimize.
[2021-05-17 02:29:35] [INFO ] Deduced a trap composed of 444 places in 838 ms of which 1 ms to minimize.
[2021-05-17 02:29:36] [INFO ] Deduced a trap composed of 446 places in 876 ms of which 1 ms to minimize.
[2021-05-17 02:29:37] [INFO ] Deduced a trap composed of 442 places in 819 ms of which 1 ms to minimize.
[2021-05-17 02:29:38] [INFO ] Deduced a trap composed of 438 places in 845 ms of which 1 ms to minimize.
[2021-05-17 02:29:39] [INFO ] Deduced a trap composed of 430 places in 904 ms of which 1 ms to minimize.
[2021-05-17 02:29:40] [INFO ] Deduced a trap composed of 440 places in 901 ms of which 1 ms to minimize.
[2021-05-17 02:29:41] [INFO ] Deduced a trap composed of 440 places in 859 ms of which 2 ms to minimize.
[2021-05-17 02:29:43] [INFO ] Deduced a trap composed of 438 places in 857 ms of which 1 ms to minimize.
[2021-05-17 02:29:44] [INFO ] Deduced a trap composed of 448 places in 891 ms of which 1 ms to minimize.
[2021-05-17 02:29:45] [INFO ] Deduced a trap composed of 446 places in 934 ms of which 1 ms to minimize.
[2021-05-17 02:29:46] [INFO ] Deduced a trap composed of 440 places in 835 ms of which 1 ms to minimize.
[2021-05-17 02:29:47] [INFO ] Deduced a trap composed of 440 places in 830 ms of which 1 ms to minimize.
[2021-05-17 02:29:48] [INFO ] Deduced a trap composed of 444 places in 824 ms of which 1 ms to minimize.
[2021-05-17 02:29:49] [INFO ] Deduced a trap composed of 444 places in 867 ms of which 8 ms to minimize.
[2021-05-17 02:29:50] [INFO ] Deduced a trap composed of 444 places in 847 ms of which 1 ms to minimize.
[2021-05-17 02:29:51] [INFO ] Deduced a trap composed of 448 places in 840 ms of which 1 ms to minimize.
[2021-05-17 02:29:56] [INFO ] Deduced a trap composed of 436 places in 5297 ms of which 1 ms to minimize.
[2021-05-17 02:29:57] [INFO ] Deduced a trap composed of 436 places in 762 ms of which 1 ms to minimize.
[2021-05-17 02:29:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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)
Current structural bounds on expressions (after SMT) : [4, 4] Max seen :[4, 3]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 49 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Normalized transition count is 2052 out of 2061 initially.
// Phase 1: matrix 2052 rows 1090 cols
[2021-05-17 02:29:57] [INFO ] Computed 142 place invariants in 42 ms
Incomplete random walk after 1000000 steps, including 72629 resets, run finished after 7715 ms. (steps per millisecond=129 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 7175 resets, run finished after 1472 ms. (steps per millisecond=679 ) properties (out of 1) seen :3
[2021-05-17 02:30:07] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2021-05-17 02:30:07] [INFO ] Computed 142 place invariants in 79 ms
[2021-05-17 02:30:07] [INFO ] [Real]Absence check using 135 positive place invariants in 44 ms returned sat
[2021-05-17 02:30:07] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned sat
[2021-05-17 02:30:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:30:08] [INFO ] [Real]Absence check using state equation in 819 ms returned sat
[2021-05-17 02:30:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:30:08] [INFO ] [Nat]Absence check using 135 positive place invariants in 30 ms returned sat
[2021-05-17 02:30:08] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned sat
[2021-05-17 02:30:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:30:09] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2021-05-17 02:30:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 02:30:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 180 ms returned sat
[2021-05-17 02:30:10] [INFO ] Deduced a trap composed of 446 places in 867 ms of which 1 ms to minimize.
[2021-05-17 02:30:11] [INFO ] Deduced a trap composed of 428 places in 804 ms of which 1 ms to minimize.
[2021-05-17 02:30:12] [INFO ] Deduced a trap composed of 442 places in 871 ms of which 1 ms to minimize.
[2021-05-17 02:30:13] [INFO ] Deduced a trap composed of 434 places in 840 ms of which 1 ms to minimize.
[2021-05-17 02:30:14] [INFO ] Deduced a trap composed of 432 places in 852 ms of which 1 ms to minimize.
[2021-05-17 02:30:15] [INFO ] Deduced a trap composed of 440 places in 843 ms of which 1 ms to minimize.
[2021-05-17 02:30:16] [INFO ] Deduced a trap composed of 450 places in 840 ms of which 17 ms to minimize.
[2021-05-17 02:30:17] [INFO ] Deduced a trap composed of 440 places in 877 ms of which 11 ms to minimize.
[2021-05-17 02:30:17] [INFO ] Deduced a trap composed of 432 places in 864 ms of which 15 ms to minimize.
[2021-05-17 02:30:18] [INFO ] Deduced a trap composed of 436 places in 837 ms of which 1 ms to minimize.
[2021-05-17 02:30:19] [INFO ] Deduced a trap composed of 446 places in 875 ms of which 1 ms to minimize.
[2021-05-17 02:30:20] [INFO ] Deduced a trap composed of 444 places in 831 ms of which 1 ms to minimize.
[2021-05-17 02:30:21] [INFO ] Deduced a trap composed of 446 places in 806 ms of which 1 ms to minimize.
[2021-05-17 02:30:22] [INFO ] Deduced a trap composed of 432 places in 826 ms of which 1 ms to minimize.
[2021-05-17 02:30:23] [INFO ] Deduced a trap composed of 446 places in 869 ms of which 1 ms to minimize.
[2021-05-17 02:30:24] [INFO ] Deduced a trap composed of 444 places in 818 ms of which 1 ms to minimize.
[2021-05-17 02:30:25] [INFO ] Deduced a trap composed of 436 places in 868 ms of which 1 ms to minimize.
[2021-05-17 02:30:26] [INFO ] Deduced a trap composed of 450 places in 874 ms of which 1 ms to minimize.
[2021-05-17 02:30:28] [INFO ] Deduced a trap composed of 456 places in 855 ms of which 1 ms to minimize.
[2021-05-17 02:30:29] [INFO ] Deduced a trap composed of 446 places in 873 ms of which 25 ms to minimize.
[2021-05-17 02:30:30] [INFO ] Deduced a trap composed of 424 places in 892 ms of which 1 ms to minimize.
[2021-05-17 02:30:31] [INFO ] Deduced a trap composed of 438 places in 869 ms of which 1 ms to minimize.
[2021-05-17 02:30:32] [INFO ] Deduced a trap composed of 444 places in 901 ms of which 1 ms to minimize.
[2021-05-17 02:30:33] [INFO ] Deduced a trap composed of 446 places in 866 ms of which 1 ms to minimize.
[2021-05-17 02:30:34] [INFO ] Deduced a trap composed of 432 places in 845 ms of which 1 ms to minimize.
[2021-05-17 02:30:35] [INFO ] Deduced a trap composed of 444 places in 822 ms of which 1 ms to minimize.
[2021-05-17 02:30:36] [INFO ] Deduced a trap composed of 446 places in 830 ms of which 1 ms to minimize.
[2021-05-17 02:30:37] [INFO ] Deduced a trap composed of 442 places in 838 ms of which 1 ms to minimize.
[2021-05-17 02:30:38] [INFO ] Deduced a trap composed of 438 places in 831 ms of which 1 ms to minimize.
[2021-05-17 02:30:39] [INFO ] Deduced a trap composed of 430 places in 830 ms of which 1 ms to minimize.
[2021-05-17 02:30:40] [INFO ] Deduced a trap composed of 440 places in 836 ms of which 1 ms to minimize.
[2021-05-17 02:30:41] [INFO ] Deduced a trap composed of 440 places in 880 ms of which 1 ms to minimize.
[2021-05-17 02:30:43] [INFO ] Deduced a trap composed of 438 places in 864 ms of which 1 ms to minimize.
[2021-05-17 02:30:45] [INFO ] Deduced a trap composed of 448 places in 2548 ms of which 1 ms to minimize.
[2021-05-17 02:30:46] [INFO ] Deduced a trap composed of 446 places in 509 ms of which 1 ms to minimize.
[2021-05-17 02:30:47] [INFO ] Deduced a trap composed of 440 places in 517 ms of which 1 ms to minimize.
[2021-05-17 02:30:47] [INFO ] Deduced a trap composed of 440 places in 507 ms of which 1 ms to minimize.
[2021-05-17 02:30:48] [INFO ] Deduced a trap composed of 444 places in 504 ms of which 1 ms to minimize.
[2021-05-17 02:30:49] [INFO ] Deduced a trap composed of 444 places in 833 ms of which 2 ms to minimize.
[2021-05-17 02:30:49] [INFO ] Deduced a trap composed of 444 places in 434 ms of which 1 ms to minimize.
[2021-05-17 02:30:50] [INFO ] Deduced a trap composed of 448 places in 418 ms of which 1 ms to minimize.
[2021-05-17 02:30:51] [INFO ] Deduced a trap composed of 436 places in 505 ms of which 1 ms to minimize.
[2021-05-17 02:30:51] [INFO ] Deduced a trap composed of 436 places in 412 ms of which 1 ms to minimize.
[2021-05-17 02:30:52] [INFO ] Deduced a trap composed of 442 places in 511 ms of which 15 ms to minimize.
[2021-05-17 02:30:52] [INFO ] Deduced a trap composed of 448 places in 390 ms of which 1 ms to minimize.
[2021-05-17 02:30:53] [INFO ] Deduced a trap composed of 442 places in 444 ms of which 1 ms to minimize.
[2021-05-17 02:30:53] [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)
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 179 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 103 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2021-05-17 02:30:53] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2021-05-17 02:30:53] [INFO ] Computed 142 place invariants in 38 ms
[2021-05-17 02:30:54] [INFO ] Implicit Places using invariants in 1174 ms returned []
[2021-05-17 02:30:54] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2021-05-17 02:30:54] [INFO ] Computed 142 place invariants in 39 ms
[2021-05-17 02:30:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 02:30:59] [INFO ] Implicit Places using invariants and state equation in 4640 ms returned []
Implicit Place search using SMT with State Equation took 5826 ms to find 0 implicit places.
[2021-05-17 02:30:59] [INFO ] Redundant transitions in 155 ms returned []
[2021-05-17 02:30:59] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2021-05-17 02:30:59] [INFO ] Computed 142 place invariants in 46 ms
[2021-05-17 02:31:01] [INFO ] Dead Transitions using invariants and state equation in 1548 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-13
Normalized transition count is 2052 out of 2061 initially.
// Phase 1: matrix 2052 rows 1090 cols
[2021-05-17 02:31:01] [INFO ] Computed 142 place invariants in 55 ms
Incomplete random walk after 10000 steps, including 733 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :3
[2021-05-17 02:31:01] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2021-05-17 02:31:01] [INFO ] Computed 142 place invariants in 42 ms
[2021-05-17 02:31:01] [INFO ] [Real]Absence check using 135 positive place invariants in 60 ms returned sat
[2021-05-17 02:31:01] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 35 ms returned sat
[2021-05-17 02:31:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:31:02] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2021-05-17 02:31:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:31:02] [INFO ] [Nat]Absence check using 135 positive place invariants in 53 ms returned sat
[2021-05-17 02:31:02] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 34 ms returned sat
[2021-05-17 02:31:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:31:03] [INFO ] [Nat]Absence check using state equation in 756 ms returned sat
[2021-05-17 02:31:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 02:31:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 167 ms returned sat
[2021-05-17 02:31:04] [INFO ] Deduced a trap composed of 446 places in 758 ms of which 18 ms to minimize.
[2021-05-17 02:31:05] [INFO ] Deduced a trap composed of 428 places in 722 ms of which 1 ms to minimize.
[2021-05-17 02:31:06] [INFO ] Deduced a trap composed of 442 places in 717 ms of which 1 ms to minimize.
[2021-05-17 02:31:07] [INFO ] Deduced a trap composed of 434 places in 747 ms of which 1 ms to minimize.
[2021-05-17 02:31:08] [INFO ] Deduced a trap composed of 432 places in 945 ms of which 1 ms to minimize.
[2021-05-17 02:31:08] [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 1090 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 77 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2021-05-17 02:31:08] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2021-05-17 02:31:08] [INFO ] Computed 142 place invariants in 62 ms
[2021-05-17 02:31:09] [INFO ] Dead Transitions using invariants and state equation in 1241 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Normalized transition count is 2052 out of 2061 initially.
// Phase 1: matrix 2052 rows 1090 cols
[2021-05-17 02:31:09] [INFO ] Computed 142 place invariants in 48 ms
Incomplete random walk after 1000000 steps, including 72491 resets, run finished after 8537 ms. (steps per millisecond=117 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 7264 resets, run finished after 1710 ms. (steps per millisecond=584 ) properties (out of 1) seen :3
[2021-05-17 02:31:19] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2021-05-17 02:31:19] [INFO ] Computed 142 place invariants in 44 ms
[2021-05-17 02:31:20] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2021-05-17 02:31:20] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 20 ms returned sat
[2021-05-17 02:31:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 02:31:20] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2021-05-17 02:31:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 02:31:20] [INFO ] [Nat]Absence check using 135 positive place invariants in 53 ms returned sat
[2021-05-17 02:31:20] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 34 ms returned sat
[2021-05-17 02:31:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 02:31:21] [INFO ] [Nat]Absence check using state equation in 853 ms returned sat
[2021-05-17 02:31:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 02:31:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 167 ms returned sat
[2021-05-17 02:31:22] [INFO ] Deduced a trap composed of 446 places in 565 ms of which 1 ms to minimize.
[2021-05-17 02:31:23] [INFO ] Deduced a trap composed of 428 places in 527 ms of which 1 ms to minimize.
[2021-05-17 02:31:24] [INFO ] Deduced a trap composed of 442 places in 504 ms of which 1 ms to minimize.
[2021-05-17 02:31:25] [INFO ] Deduced a trap composed of 434 places in 838 ms of which 1 ms to minimize.
[2021-05-17 02:31:25] [INFO ] Deduced a trap composed of 432 places in 495 ms of which 1 ms to minimize.
[2021-05-17 02:31:26] [INFO ] Deduced a trap composed of 440 places in 536 ms of which 0 ms to minimize.
[2021-05-17 02:31:26] [INFO ] Deduced a trap composed of 450 places in 427 ms of which 1 ms to minimize.
[2021-05-17 02:31:27] [INFO ] Deduced a trap composed of 440 places in 501 ms of which 1 ms to minimize.
[2021-05-17 02:31:27] [INFO ] Deduced a trap composed of 432 places in 436 ms of which 1 ms to minimize.
[2021-05-17 02:31:28] [INFO ] Deduced a trap composed of 436 places in 521 ms of which 1 ms to minimize.
[2021-05-17 02:31:29] [INFO ] Deduced a trap composed of 446 places in 526 ms of which 1 ms to minimize.
[2021-05-17 02:31:29] [INFO ] Deduced a trap composed of 444 places in 465 ms of which 1 ms to minimize.
[2021-05-17 02:31:30] [INFO ] Deduced a trap composed of 446 places in 427 ms of which 0 ms to minimize.
[2021-05-17 02:31:30] [INFO ] Deduced a trap composed of 432 places in 444 ms of which 1 ms to minimize.
[2021-05-17 02:31:31] [INFO ] Deduced a trap composed of 446 places in 437 ms of which 1 ms to minimize.
[2021-05-17 02:31:31] [INFO ] Deduced a trap composed of 444 places in 442 ms of which 1 ms to minimize.
[2021-05-17 02:31:32] [INFO ] Deduced a trap composed of 436 places in 431 ms of which 0 ms to minimize.
[2021-05-17 02:31:33] [INFO ] Deduced a trap composed of 450 places in 509 ms of which 1 ms to minimize.
[2021-05-17 02:31:34] [INFO ] Deduced a trap composed of 456 places in 400 ms of which 1 ms to minimize.
[2021-05-17 02:31:35] [INFO ] Deduced a trap composed of 446 places in 442 ms of which 1 ms to minimize.
[2021-05-17 02:31:36] [INFO ] Deduced a trap composed of 424 places in 812 ms of which 2 ms to minimize.
[2021-05-17 02:31:36] [INFO ] Deduced a trap composed of 438 places in 783 ms of which 1 ms to minimize.
[2021-05-17 02:31:37] [INFO ] Deduced a trap composed of 444 places in 756 ms of which 1 ms to minimize.
[2021-05-17 02:31:38] [INFO ] Deduced a trap composed of 446 places in 757 ms of which 1 ms to minimize.
[2021-05-17 02:31:39] [INFO ] Deduced a trap composed of 432 places in 684 ms of which 1 ms to minimize.
[2021-05-17 02:31:40] [INFO ] Deduced a trap composed of 444 places in 516 ms of which 1 ms to minimize.
[2021-05-17 02:31:41] [INFO ] Deduced a trap composed of 446 places in 542 ms of which 1 ms to minimize.
[2021-05-17 02:31:41] [INFO ] Deduced a trap composed of 442 places in 514 ms of which 1 ms to minimize.
[2021-05-17 02:31:42] [INFO ] Deduced a trap composed of 438 places in 420 ms of which 1 ms to minimize.
[2021-05-17 02:31:42] [INFO ] Deduced a trap composed of 430 places in 451 ms of which 1 ms to minimize.
[2021-05-17 02:31:43] [INFO ] Deduced a trap composed of 440 places in 425 ms of which 1 ms to minimize.
[2021-05-17 02:31:44] [INFO ] Deduced a trap composed of 440 places in 436 ms of which 1 ms to minimize.
[2021-05-17 02:31:45] [INFO ] Deduced a trap composed of 438 places in 436 ms of which 1 ms to minimize.
[2021-05-17 02:31:45] [INFO ] Deduced a trap composed of 448 places in 412 ms of which 0 ms to minimize.
[2021-05-17 02:31:46] [INFO ] Deduced a trap composed of 446 places in 411 ms of which 1 ms to minimize.
[2021-05-17 02:31:46] [INFO ] Deduced a trap composed of 440 places in 413 ms of which 1 ms to minimize.
[2021-05-17 02:31:47] [INFO ] Deduced a trap composed of 440 places in 412 ms of which 1 ms to minimize.
[2021-05-17 02:31:47] [INFO ] Deduced a trap composed of 444 places in 409 ms of which 1 ms to minimize.
[2021-05-17 02:31:48] [INFO ] Deduced a trap composed of 444 places in 422 ms of which 1 ms to minimize.
[2021-05-17 02:31:48] [INFO ] Deduced a trap composed of 444 places in 444 ms of which 0 ms to minimize.
[2021-05-17 02:31:49] [INFO ] Deduced a trap composed of 448 places in 449 ms of which 1 ms to minimize.
[2021-05-17 02:31:50] [INFO ] Deduced a trap composed of 436 places in 440 ms of which 1 ms to minimize.
[2021-05-17 02:31:50] [INFO ] Deduced a trap composed of 436 places in 411 ms of which 0 ms to minimize.
[2021-05-17 02:31:51] [INFO ] Deduced a trap composed of 442 places in 807 ms of which 1 ms to minimize.
[2021-05-17 02:31:52] [INFO ] Deduced a trap composed of 448 places in 409 ms of which 1 ms to minimize.
[2021-05-17 02:31:52] [INFO ] Deduced a trap composed of 442 places in 417 ms of which 1 ms to minimize.
[2021-05-17 02:31:53] [INFO ] Deduced a trap composed of 446 places in 458 ms of which 1 ms to minimize.
[2021-05-17 02:31:54] [INFO ] Deduced a trap composed of 442 places in 873 ms of which 1 ms to minimize.
[2021-05-17 02:31:55] [INFO ] Deduced a trap composed of 438 places in 561 ms of which 1 ms to minimize.
[2021-05-17 02:31:56] [INFO ] Deduced a trap composed of 432 places in 420 ms of which 1 ms to minimize.
[2021-05-17 02:31:56] [INFO ] Deduced a trap composed of 438 places in 464 ms of which 1 ms to minimize.
[2021-05-17 02:31:57] [INFO ] Deduced a trap composed of 444 places in 442 ms of which 0 ms to minimize.
[2021-05-17 02:31:57] [INFO ] Deduced a trap composed of 430 places in 527 ms of which 1 ms to minimize.
[2021-05-17 02:31:58] [INFO ] Deduced a trap composed of 436 places in 535 ms of which 1 ms to minimize.
[2021-05-17 02:31:59] [INFO ] Deduced a trap composed of 450 places in 513 ms of which 1 ms to minimize.
[2021-05-17 02:32:00] [INFO ] Deduced a trap composed of 436 places in 815 ms of which 1 ms to minimize.
[2021-05-17 02:32:00] [INFO ] Deduced a trap composed of 438 places in 444 ms of which 0 ms to minimize.
[2021-05-17 02:32:01] [INFO ] Deduced a trap composed of 438 places in 450 ms of which 0 ms to minimize.
[2021-05-17 02:32:02] [INFO ] Deduced a trap composed of 442 places in 545 ms of which 1 ms to minimize.
[2021-05-17 02:32:03] [INFO ] Deduced a trap composed of 446 places in 510 ms of which 0 ms to minimize.
[2021-05-17 02:32:03] [INFO ] Deduced a trap composed of 438 places in 507 ms of which 1 ms to minimize.
[2021-05-17 02:32:04] [INFO ] Deduced a trap composed of 434 places in 521 ms of which 1 ms to minimize.
[2021-05-17 02:32:05] [INFO ] Deduced a trap composed of 442 places in 505 ms of which 1 ms to minimize.
[2021-05-17 02:32:10] [INFO ] Deduced a trap composed of 444 places in 5312 ms of which 1 ms to minimize.
[2021-05-17 02:32:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 1090 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 52 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 51 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2021-05-17 02:32:10] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2021-05-17 02:32:10] [INFO ] Computed 142 place invariants in 64 ms
[2021-05-17 02:32:12] [INFO ] Implicit Places using invariants in 2149 ms returned []
[2021-05-17 02:32:12] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2021-05-17 02:32:12] [INFO ] Computed 142 place invariants in 41 ms
[2021-05-17 02:32:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 02:32:19] [INFO ] Implicit Places using invariants and state equation in 6935 ms returned []
Implicit Place search using SMT with State Equation took 9118 ms to find 0 implicit places.
[2021-05-17 02:32:19] [INFO ] Redundant transitions in 37 ms returned []
[2021-05-17 02:32:19] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2021-05-17 02:32:20] [INFO ] Computed 142 place invariants in 38 ms
[2021-05-17 02:32:21] [INFO ] Dead Transitions using invariants and state equation in 1145 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-13 in 79789 ms.
[2021-05-17 02:32:21] [INFO ] Flatten gal took : 363 ms
[2021-05-17 02:32:21] [INFO ] Applying decomposition
[2021-05-17 02:32:22] [INFO ] Flatten gal took : 271 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/graph9573509988795819662.txt, -o, /tmp/graph9573509988795819662.bin, -w, /tmp/graph9573509988795819662.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/graph9573509988795819662.bin, -l, -1, -v, -w, /tmp/graph9573509988795819662.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 02:32:22] [INFO ] Decomposing Gal with order
[2021-05-17 02:32:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 02:32:23] [INFO ] Removed a total of 4062 redundant transitions.
[2021-05-17 02:32:23] [INFO ] Flatten gal took : 704 ms
[2021-05-17 02:32:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 554 labels/synchronizations in 131 ms.
[2021-05-17 02:32:24] [INFO ] Time to serialize gal into /tmp/UpperBounds5978064320021675992.gal : 66 ms
[2021-05-17 02:32:24] [INFO ] Time to serialize properties into /tmp/UpperBounds6341320893309774566.prop : 3 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/UpperBounds5978064320021675992.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds6341320893309774566.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/UpperBounds5978064320021675992.gal -t CGAL -reachable-file /tmp/UpperBounds6341320893309774566.prop --nowitness
Loading property file /tmp/UpperBounds6341320893309774566.prop.
Detected timeout of ITS tools.
[2021-05-17 02:53:45] [INFO ] Applying decomposition
[2021-05-17 02:53:46] [INFO ] Flatten gal took : 703 ms
[2021-05-17 02:53:46] [INFO ] Decomposing Gal with order
[2021-05-17 02:53:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 02:53:48] [INFO ] Removed a total of 9599 redundant transitions.
[2021-05-17 02:53:48] [INFO ] Flatten gal took : 1189 ms
[2021-05-17 02:53:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 180 ms.
[2021-05-17 02:53:48] [INFO ] Time to serialize gal into /tmp/UpperBounds5934214915241636016.gal : 142 ms
[2021-05-17 02:53:48] [INFO ] Time to serialize properties into /tmp/UpperBounds12430309620924528450.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/UpperBounds5934214915241636016.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds12430309620924528450.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/UpperBounds5934214915241636016.gal -t CGAL -reachable-file /tmp/UpperBounds12430309620924528450.prop --nowitness
Loading property file /tmp/UpperBounds12430309620924528450.prop.
ITS-tools command line returned an error code 137
[2021-05-17 03:12:36] [INFO ] Flatten gal took : 953 ms
[2021-05-17 03:12:42] [INFO ] Input system was already deterministic with 2061 transitions.
[2021-05-17 03:12:42] [INFO ] Transformed 1090 places.
[2021-05-17 03:12:42] [INFO ] Transformed 2061 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
[2021-05-17 03:13:12] [INFO ] Time to serialize gal into /tmp/UpperBounds10995793800151208884.gal : 56 ms
[2021-05-17 03:13:12] [INFO ] Time to serialize properties into /tmp/UpperBounds11634413561387678491.prop : 2 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/UpperBounds10995793800151208884.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds11634413561387678491.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/UpperBounds10995793800151208884.gal -t CGAL -reachable-file /tmp/UpperBounds11634413561387678491.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/UpperBounds11634413561387678491.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-S10J60"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S10J60, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r159-oct2-162089268300427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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