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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 9.1K Apr 29 13:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 29 13:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 13:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 13:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K May 9 08:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J06T10-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652832727027

Running Version 0
[2022-05-18 00:12:08] [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 00:12:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 00:12:08] [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 00:12:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 00:12:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 671 ms
[2022-05-18 00:12:09] [INFO ] ms1 symmetric to ms2 in transition T_1124
[2022-05-18 00:12:09] [INFO ] ms1 symmetric to ms2 in transition T_1125
[2022-05-18 00:12:09] [INFO ] ms2 symmetric to ms3 in transition T_1125
[2022-05-18 00:12:09] [INFO ] ms1 symmetric to ms4 in transition T_1126
[2022-05-18 00:12:09] [INFO ] ms4 symmetric to ms2 in transition T_1126
[2022-05-18 00:12:09] [INFO ] ms2 symmetric to ms3 in transition T_1126
[2022-05-18 00:12:09] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 49 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
[2022-05-18 00:12:09] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions in 4 ms.
[2022-05-18 00:12:09] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_13644472394923023316.dot
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2022-05-18 00:12:09] [INFO ] Computed 26 place invariants in 13 ms
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-18 00:12:09] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1652 transitions in 38 ms.
[2022-05-18 00:12:09] [INFO ] Unfolded HLPN properties in 0 ms.
[2022-05-18 00:12:09] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2022-05-18 00:12:09] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-18 00:12:09] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2022-05-18 00:12:09] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2022-05-18 00:12:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:09] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-05-18 00:12:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:12:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:12:09] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 00:12:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:09] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2022-05-18 00:12:09] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-18 00:12:09] [INFO ] [Nat]Added 9 Read/Feed constraints in 6 ms returned sat
[2022-05-18 00:12:09] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 5 ms to minimize.
[2022-05-18 00:12:10] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2022-05-18 00:12:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2022-05-18 00:12:10] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 00:12:10] [INFO ] Added : 62 causal constraints over 13 iterations in 157 ms. Result :sat
Minimization took 25 ms.
[2022-05-18 00:12:10] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:12:10] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:12:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:10] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-05-18 00:12:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:12:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:12:10] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:12:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:10] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2022-05-18 00:12:10] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2022-05-18 00:12:10] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2022-05-18 00:12:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2022-05-18 00:12:10] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 00:12:10] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 1 ms to minimize.
[2022-05-18 00:12:10] [INFO ] Deduced a trap composed of 34 places in 19 ms of which 0 ms to minimize.
[2022-05-18 00:12:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2022-05-18 00:12:10] [INFO ] Added : 62 causal constraints over 13 iterations in 180 ms. Result :sat
Minimization took 22 ms.
[2022-05-18 00:12:10] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:12:10] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:12:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:10] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-18 00:12:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:12:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:12:10] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:12:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:10] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2022-05-18 00:12:10] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2022-05-18 00:12:10] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 00:12:10] [INFO ] Added : 48 causal constraints over 11 iterations in 106 ms. Result :sat
Minimization took 24 ms.
[2022-05-18 00:12:10] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:12:10] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:12:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:10] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-18 00:12:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:12:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2022-05-18 00:12:10] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:12:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:11] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2022-05-18 00:12:11] [INFO ] [Nat]Added 9 Read/Feed constraints in 9 ms returned sat
[2022-05-18 00:12:11] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2022-05-18 00:12:11] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
[2022-05-18 00:12:11] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2022-05-18 00:12:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 131 ms
[2022-05-18 00:12:11] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 00:12:11] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2022-05-18 00:12:11] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 0 ms to minimize.
[2022-05-18 00:12:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
[2022-05-18 00:12:11] [INFO ] Added : 58 causal constraints over 13 iterations in 217 ms. Result :sat
Minimization took 56 ms.
[2022-05-18 00:12:11] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-18 00:12:11] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 12 ms returned sat
[2022-05-18 00:12:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:11] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-05-18 00:12:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:12:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:12:11] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:12:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:11] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2022-05-18 00:12:11] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2022-05-18 00:12:11] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2022-05-18 00:12:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-05-18 00:12:11] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 00:12:11] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 1 ms to minimize.
[2022-05-18 00:12:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2022-05-18 00:12:11] [INFO ] Added : 47 causal constraints over 10 iterations in 133 ms. Result :sat
Minimization took 33 ms.
[2022-05-18 00:12:11] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:12:11] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:12:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:11] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-18 00:12:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:12:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:12:11] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 13 ms returned sat
[2022-05-18 00:12:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:12] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2022-05-18 00:12:12] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2022-05-18 00:12:12] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 00:12:12] [INFO ] Added : 63 causal constraints over 13 iterations in 142 ms. Result :sat
Minimization took 44 ms.
[2022-05-18 00:12:12] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:12:12] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:12:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:12] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 00:12:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:12:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:12:12] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:12:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:12] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-18 00:12:12] [INFO ] [Nat]Added 9 Read/Feed constraints in 0 ms returned sat
[2022-05-18 00:12:12] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2022-05-18 00:12:12] [INFO ] Deduced a trap composed of 27 places in 16 ms of which 0 ms to minimize.
[2022-05-18 00:12:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 57 ms
[2022-05-18 00:12:12] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 00:12:12] [INFO ] Added : 61 causal constraints over 13 iterations in 128 ms. Result :sat
Minimization took 26 ms.
[2022-05-18 00:12:12] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:12:12] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 00:12:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:12] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-18 00:12:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:12:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:12:12] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:12:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:12] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-18 00:12:12] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2022-05-18 00:12:12] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2022-05-18 00:12:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2022-05-18 00:12:12] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 00:12:12] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2022-05-18 00:12:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2022-05-18 00:12:12] [INFO ] Added : 63 causal constraints over 14 iterations in 201 ms. Result :sat
Minimization took 22 ms.
[2022-05-18 00:12:12] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:12:12] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:12:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:12] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-18 00:12:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:12:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:12:12] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:12:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:13] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2022-05-18 00:12:13] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:12:13] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2022-05-18 00:12:13] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
[2022-05-18 00:12:13] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2022-05-18 00:12:13] [INFO ] Deduced a trap composed of 15 places in 12 ms of which 0 ms to minimize.
[2022-05-18 00:12:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 134 ms
[2022-05-18 00:12:13] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 00:12:13] [INFO ] Added : 42 causal constraints over 10 iterations in 80 ms. Result :sat
Minimization took 22 ms.
[2022-05-18 00:12:13] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:12:13] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:12:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:13] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 00:12:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:12:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:12:13] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:12:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:13] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2022-05-18 00:12:13] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2022-05-18 00:12:13] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2022-05-18 00:12:13] [INFO ] Deduced a trap composed of 29 places in 19 ms of which 0 ms to minimize.
[2022-05-18 00:12:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2022-05-18 00:12:13] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 00:12:13] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2022-05-18 00:12:13] [INFO ] Deduced a trap composed of 34 places in 23 ms of which 1 ms to minimize.
[2022-05-18 00:12:13] [INFO ] Deduced a trap composed of 34 places in 21 ms of which 0 ms to minimize.
[2022-05-18 00:12:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 100 ms
[2022-05-18 00:12:13] [INFO ] Added : 61 causal constraints over 13 iterations in 222 ms. Result :sat
Minimization took 22 ms.
[2022-05-18 00:12:13] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:12:13] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:12:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:13] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-18 00:12:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:12:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:12:13] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 00:12:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:13] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-18 00:12:13] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2022-05-18 00:12:13] [INFO ] Deduced a trap composed of 30 places in 21 ms of which 0 ms to minimize.
[2022-05-18 00:12:13] [INFO ] Deduced a trap composed of 27 places in 18 ms of which 0 ms to minimize.
[2022-05-18 00:12:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2022-05-18 00:12:13] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 00:12:14] [INFO ] Added : 62 causal constraints over 13 iterations in 102 ms. Result :sat
Minimization took 28 ms.
[2022-05-18 00:12:14] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:12:14] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:12:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:14] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-18 00:12:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:12:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:12:14] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:12:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:14] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2022-05-18 00:12:14] [INFO ] [Nat]Added 9 Read/Feed constraints in 4 ms returned sat
[2022-05-18 00:12:14] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2022-05-18 00:12:14] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2022-05-18 00:12:14] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
[2022-05-18 00:12:14] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2022-05-18 00:12:14] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2022-05-18 00:12:14] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2022-05-18 00:12:14] [INFO ] Deduced a trap composed of 33 places in 19 ms of which 1 ms to minimize.
[2022-05-18 00:12:14] [INFO ] Deduced a trap composed of 30 places in 22 ms of which 4 ms to minimize.
[2022-05-18 00:12:14] [INFO ] Deduced a trap composed of 30 places in 19 ms of which 1 ms to minimize.
[2022-05-18 00:12:14] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 273 ms
[2022-05-18 00:12:14] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 00:12:14] [INFO ] Added : 61 causal constraints over 13 iterations in 101 ms. Result :sat
Minimization took 26 ms.
[2022-05-18 00:12:14] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 00:12:14] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:12:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:14] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 00:12:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:12:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 00:12:14] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 00:12:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:14] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2022-05-18 00:12:14] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:12:14] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2022-05-18 00:12:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2022-05-18 00:12:14] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 00:12:14] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2022-05-18 00:12:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2022-05-18 00:12:14] [INFO ] Added : 56 causal constraints over 12 iterations in 169 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 20, 3, 2, 10, 10, 3, 10, 1, 10, 10]
[2022-05-18 00:12:15] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1652 transitions in 22 ms.
[2022-05-18 00:12:15] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_13550099455097515180.dot
Incomplete random walk after 10000 steps, including 3 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 13) seen :14
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :17
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-05-18 00:12:15] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2022-05-18 00:12:15] [INFO ] Computed 58 place invariants in 119 ms
[2022-05-18 00:12:15] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2022-05-18 00:12:15] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 35 ms returned sat
[2022-05-18 00:12:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:16] [INFO ] [Real]Absence check using state equation in 769 ms returned sat
[2022-05-18 00:12:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:12:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2022-05-18 00:12:16] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 33 ms returned sat
[2022-05-18 00:12:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:17] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2022-05-18 00:12:17] [INFO ] State equation strengthened by 130 read => feed constraints.
[2022-05-18 00:12:17] [INFO ] [Nat]Added 130 Read/Feed constraints in 599 ms returned sat
[2022-05-18 00:12:18] [INFO ] Computed and/alt/rep : 780/1548/770 causal constraints (skipped 860 transitions) in 117 ms.
[2022-05-18 00:12:21] [INFO ] Added : 145 causal constraints over 29 iterations in 3609 ms. Result :unknown
[2022-05-18 00:12:21] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2022-05-18 00:12:21] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 37 ms returned sat
[2022-05-18 00:12:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:22] [INFO ] [Real]Absence check using state equation in 876 ms returned sat
[2022-05-18 00:12:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:12:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2022-05-18 00:12:22] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 37 ms returned sat
[2022-05-18 00:12:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:12:23] [INFO ] [Nat]Absence check using state equation in 718 ms returned sat
[2022-05-18 00:12:25] [INFO ] [Nat]Added 130 Read/Feed constraints in 1715 ms returned sat
[2022-05-18 00:12:25] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 0 ms to minimize.
[2022-05-18 00:12:26] [INFO ] Deduced a trap composed of 73 places in 648 ms of which 1 ms to minimize.
[2022-05-18 00:12:26] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 0 ms to minimize.
[2022-05-18 00:12:26] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 0 ms to minimize.
[2022-05-18 00:12:28] [INFO ] Deduced a trap composed of 434 places in 455 ms of which 1 ms to minimize.
[2022-05-18 00:12: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 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 00:12:28] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2022-05-18 00:12:28] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 48 ms returned unsat
[2022-05-18 00:12:28] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2022-05-18 00:12:28] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 29 ms returned unsat
[2022-05-18 00:12:28] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-05-18 00:12:28] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 34 ms returned unsat
[2022-05-18 00:12:28] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-05-18 00:12:28] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 35 ms returned unsat
[2022-05-18 00:12:28] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2022-05-18 00:12:28] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 29 ms returned unsat
Current structural bounds on expressions (after SMT) : [20, 3, 1, 1, 1, 1, 1] Max seen :[2, 0, 1, 1, 1, 1, 1]
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 377600 steps, including 1000 resets, run finished after 1505 ms. (steps per millisecond=250 ) properties (out of 2) seen :2 could not realise parikh vector
Support contains 11 out of 844 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 842 transition count 1562
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 752 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 182 place count 752 transition count 1462
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 382 place count 652 transition count 1462
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 3 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 522 place count 582 transition count 1392
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 542 place count 582 transition count 1372
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 562 place count 562 transition count 1372
Applied a total of 562 rules in 256 ms. Remains 562 /844 variables (removed 282) and now considering 1372/1652 (removed 280) transitions.
[2022-05-18 00:12:30] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
// Phase 1: matrix 1352 rows 562 cols
[2022-05-18 00:12:30] [INFO ] Computed 56 place invariants in 67 ms
[2022-05-18 00:12:31] [INFO ] Dead Transitions using invariants and state equation in 610 ms returned [1234, 1236, 1237, 1238, 1239, 1240, 1241, 1242, 1243, 1244, 1245, 1248, 1250, 1251, 1252, 1253, 1254, 1255, 1256, 1257, 1258, 1259, 1262, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1273, 1276, 1278, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1290, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301, 1304, 1306, 1307, 1308, 1309, 1310, 1311, 1312, 1313, 1314, 1315, 1318, 1320, 1321, 1322, 1323, 1324, 1325, 1326, 1327, 1328, 1329, 1332, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1341, 1342, 1343, 1346, 1348, 1349, 1350, 1351, 1352, 1353, 1354, 1355, 1356, 1357, 1360, 1362, 1363, 1364, 1365, 1366, 1367, 1368, 1369, 1370, 1371]
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions :[1371, 1370, 1369, 1368, 1367, 1366, 1365, 1364, 1363, 1362, 1360, 1357, 1356, 1355, 1354, 1353, 1352, 1351, 1350, 1349, 1348, 1346, 1343, 1342, 1341, 1340, 1339, 1338, 1337, 1336, 1335, 1334, 1332, 1329, 1328, 1327, 1326, 1325, 1324, 1323, 1322, 1321, 1320, 1318, 1315, 1314, 1313, 1312, 1311, 1310, 1309, 1308, 1307, 1306, 1304, 1301, 1300, 1299, 1298, 1297, 1296, 1295, 1294, 1293, 1292, 1290, 1287, 1286, 1285, 1284, 1283, 1282, 1281, 1280, 1279, 1278, 1276, 1273, 1272, 1271, 1270, 1269, 1268, 1267, 1266, 1265, 1264, 1262, 1259, 1258, 1257, 1256, 1255, 1254, 1253, 1252, 1251, 1250, 1248, 1245, 1244, 1243, 1242, 1241, 1240, 1239, 1238, 1237, 1236, 1234]
Starting structural reductions, iteration 1 : 562/844 places, 1262/1652 transitions.
Reduce places removed 1 places and 20 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 561 transition count 1242
Reduce places removed 20 places and 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 21 place count 541 transition count 1222
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 21 rules in 41 ms. Remains 541 /562 variables (removed 21) and now considering 1222/1262 (removed 40) transitions.
Finished structural reductions, in 2 iterations. Remains : 541/844 places, 1222/1652 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 1202 out of 1222 initially.
// Phase 1: matrix 1202 rows 540 cols
[2022-05-18 00:12:31] [INFO ] Computed 56 place invariants in 52 ms
Incomplete random walk after 1000000 steps, including 375 resets, run finished after 3585 ms. (steps per millisecond=278 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 113 resets, run finished after 1749 ms. (steps per millisecond=571 ) properties (out of 1) seen :2
[2022-05-18 00:12:36] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
// Phase 1: matrix 1202 rows 540 cols
[2022-05-18 00:12:36] [INFO ] Computed 56 place invariants in 28 ms
[2022-05-18 00:12:36] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-18 00:12:36] [INFO ] [Real]Absence check using 13 positive and 43 generalized place invariants in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 3] Max seen :[2, 0]
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652832758638

--------------------
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="PolyORBLF-COL-S02J06T10"
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 PolyORBLF-COL-S02J06T10, 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-165277026900181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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