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-165277027100280.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is PolyORBNT-COL-S05J40, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277027100280
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 8.1K Apr 30 03:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 03:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 03:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 30 03:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 93K May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652835581866

Running Version 0
[2022-05-18 00:59:43] [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:59:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 00:59:43] [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:59:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 00:59:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 616 ms
[2022-05-18 00:59:43] [INFO ] ms1 symmetric to ms4 in transition trans_489
[2022-05-18 00:59:43] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2022-05-18 00:59:43] [INFO ] ms2 symmetric to ms3 in transition trans_489
[2022-05-18 00:59:43] [INFO ] ms1 symmetric to ms2 in transition trans_488
[2022-05-18 00:59:43] [INFO ] ms2 symmetric to ms3 in transition trans_488
[2022-05-18 00:59:43] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2022-05-18 00:59:43] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2022-05-18 00:59:43] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions in 3 ms.
[2022-05-18 00:59:43] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_375524046937509925.dot
// Phase 1: matrix 38 rows 48 cols
[2022-05-18 00:59:43] [INFO ] Computed 13 place invariants in 6 ms
FORMULA PolyORBNT-COL-S05J40-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-18 00:59:43] [INFO ] Unfolded HLPN to a Petri net with 669 places and 975 transitions in 21 ms.
[2022-05-18 00:59:43] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2022-05-18 00:59:43] [INFO ] Computed 13 place invariants in 7 ms
[2022-05-18 00:59:44] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-18 00:59:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-18 00:59:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:44] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-18 00:59:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:59:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 00:59:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 00:59:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:44] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-18 00:59:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 00:59:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2022-05-18 00:59:44] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
[2022-05-18 00:59:44] [INFO ] Deduced a trap composed of 14 places in 15 ms of which 1 ms to minimize.
[2022-05-18 00:59:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2022-05-18 00:59:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 00:59:44] [INFO ] Added : 36 causal constraints over 8 iterations in 51 ms. Result :sat
Minimization took 15 ms.
[2022-05-18 00:59:44] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 00:59:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-18 00:59:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:44] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-18 00:59:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:59:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 00:59:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 00:59:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:44] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-18 00:59:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 00:59:44] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2022-05-18 00:59:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2022-05-18 00:59:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 00:59:44] [INFO ] Added : 21 causal constraints over 5 iterations in 238 ms. Result :sat
Minimization took 210 ms.
[2022-05-18 00:59:44] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 00:59:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 00:59:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:44] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-18 00:59:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:59:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-18 00:59:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 00:59:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:44] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-18 00:59:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:59:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 00:59:44] [INFO ] Added : 35 causal constraints over 7 iterations in 55 ms. Result :sat
Minimization took 15 ms.
[2022-05-18 00:59:45] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:45] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-18 00:59:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:59:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:45] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:59:45] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 00:59:45] [INFO ] Added : 36 causal constraints over 8 iterations in 43 ms. Result :sat
Minimization took 14 ms.
[2022-05-18 00:59:45] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:45] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-18 00:59:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:59:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:45] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:59:45] [INFO ] Deduced a trap composed of 14 places in 13 ms of which 2 ms to minimize.
[2022-05-18 00:59:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2022-05-18 00:59:45] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 00:59:45] [INFO ] Added : 15 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 11 ms.
[2022-05-18 00:59:45] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:45] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-18 00:59:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:59:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:45] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:59:45] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2022-05-18 00:59:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2022-05-18 00:59:45] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 00:59:45] [INFO ] Added : 22 causal constraints over 5 iterations in 115 ms. Result :sat
Minimization took 54 ms.
[2022-05-18 00:59:45] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:45] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-18 00:59:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:59:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:45] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:59:45] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 00:59:45] [INFO ] Added : 36 causal constraints over 8 iterations in 36 ms. Result :sat
Minimization took 16 ms.
[2022-05-18 00:59:45] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:45] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-18 00:59:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:59:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:45] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 00:59:45] [INFO ] Deduced a trap composed of 15 places in 15 ms of which 0 ms to minimize.
[2022-05-18 00:59:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2022-05-18 00:59:45] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 00:59:45] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 0 ms to minimize.
[2022-05-18 00:59:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2022-05-18 00:59:45] [INFO ] Added : 36 causal constraints over 8 iterations in 137 ms. Result :sat
Minimization took 15 ms.
[2022-05-18 00:59:45] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:45] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-18 00:59:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:59:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:45] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-18 00:59:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 00:59:45] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-18 00:59:46] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2022-05-18 00:59:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2022-05-18 00:59:46] [INFO ] Added : 36 causal constraints over 8 iterations in 166 ms. Result :sat
Minimization took 12 ms.
[2022-05-18 00:59:46] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 00:59:46] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 00:59:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:46] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-18 00:59:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:59:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2022-05-18 00:59:46] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 00:59:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:46] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-18 00:59:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 00:59:46] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 00:59:46] [INFO ] Added : 33 causal constraints over 7 iterations in 98 ms. Result :sat
Minimization took 28 ms.
[2022-05-18 00:59:46] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 00:59:46] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 00:59:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:46] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-18 00:59:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:59:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 00:59:46] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 00:59:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:46] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-18 00:59:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:59:46] [INFO ] Deduced a trap composed of 14 places in 15 ms of which 0 ms to minimize.
[2022-05-18 00:59:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2022-05-18 00:59:46] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 00:59:46] [INFO ] Added : 23 causal constraints over 5 iterations in 366 ms. Result :sat
Minimization took 193 ms.
[2022-05-18 00:59:47] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 00:59:47] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 00:59:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-18 00:59:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:59:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 00:59:47] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 00:59:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:47] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-18 00:59:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-18 00:59:47] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 00:59:47] [INFO ] Added : 36 causal constraints over 8 iterations in 36 ms. Result :sat
Minimization took 13 ms.
[2022-05-18 00:59:47] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 00:59:47] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-18 00:59:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:47] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-18 00:59:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:59:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-18 00:59:47] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-18 00:59:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:47] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2022-05-18 00:59:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-18 00:59:47] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2022-05-18 00:59:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2022-05-18 00:59:47] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-18 00:59:47] [INFO ] Added : 18 causal constraints over 4 iterations in 20 ms. Result :sat
Minimization took 12 ms.
[2022-05-18 00:59:47] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-18 00:59:47] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-18 00:59:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:47] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, 10, -1, -1, 1, 3, -1, -1, -1, 5, 10, -1, 2, 10]
FORMULA PolyORBNT-COL-S05J40-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
[2022-05-18 00:59:47] [INFO ] Unfolded HLPN to a Petri net with 669 places and 975 transitions in 9 ms.
[2022-05-18 00:59:47] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_12421259489501645564.dot
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 40 transitions.
Incomplete random walk after 10000 steps, including 694 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 13) seen :24
FORMULA PolyORBNT-COL-S05J40-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-11 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 159 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10000 steps, including 158 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :14
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10000 steps, including 162 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :14
Incomplete Best-First random walk after 10000 steps, including 137 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10000 steps, including 154 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :14
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :14
Incomplete Best-First random walk after 10001 steps, including 162 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :11
Incomplete Best-First random walk after 10001 steps, including 255 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :2
[2022-05-18 00:59:47] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2022-05-18 00:59:47] [INFO ] Computed 102 place invariants in 72 ms
[2022-05-18 00:59:47] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2022-05-18 00:59:47] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 9 ms returned unsat
[2022-05-18 00:59:47] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2022-05-18 00:59:47] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 6 ms returned unsat
[2022-05-18 00:59:47] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2022-05-18 00:59:47] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 8 ms returned unsat
[2022-05-18 00:59:48] [INFO ] [Real]Absence check using 95 positive place invariants in 23 ms returned sat
[2022-05-18 00:59:48] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 8 ms returned unsat
[2022-05-18 00:59:48] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2022-05-18 00:59:48] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-18 00:59:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:48] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2022-05-18 00:59:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:59:48] [INFO ] [Nat]Absence check using 95 positive place invariants in 23 ms returned sat
[2022-05-18 00:59:48] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-18 00:59:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:48] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2022-05-18 00:59:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 00:59:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2022-05-18 00:59:48] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 83 ms.
[2022-05-18 00:59:49] [INFO ] Added : 9 causal constraints over 2 iterations in 257 ms. Result :sat
Minimization took 189 ms.
[2022-05-18 00:59:49] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2022-05-18 00:59:49] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 17 ms returned unsat
[2022-05-18 00:59:49] [INFO ] [Real]Absence check using 95 positive place invariants in 23 ms returned sat
[2022-05-18 00:59:49] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 17 ms returned unsat
[2022-05-18 00:59:49] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2022-05-18 00:59:49] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 6 ms returned unsat
[2022-05-18 00:59:49] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2022-05-18 00:59:49] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-18 00:59:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:49] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2022-05-18 00:59:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:59:50] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2022-05-18 00:59:50] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-18 00:59:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:50] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2022-05-18 00:59:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 57 ms returned sat
[2022-05-18 00:59:50] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 56 ms.
[2022-05-18 00:59:51] [INFO ] Deduced a trap composed of 343 places in 206 ms of which 1 ms to minimize.
[2022-05-18 00:59:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2022-05-18 00:59:51] [INFO ] Added : 21 causal constraints over 5 iterations in 835 ms. Result :sat
Minimization took 245 ms.
[2022-05-18 00:59:51] [INFO ] [Real]Absence check using 95 positive place invariants in 22 ms returned sat
[2022-05-18 00:59:51] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 4, 1, 1, 1, 1, 1, 1, 10, 1] Max seen :[1, 4, 1, 1, 0, 1, 1, 1, 3, 1]
FORMULA PolyORBNT-COL-S05J40-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 4500 steps, including 263 resets, run finished after 24 ms. (steps per millisecond=187 ) properties (out of 2) seen :2 could not realise parikh vector
Incomplete Parikh walk after 1400 steps, including 93 resets, run finished after 5 ms. (steps per millisecond=280 ) properties (out of 2) seen :2 could not realise parikh vector
FORMULA PolyORBNT-COL-S05J40-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 629 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 624 transition count 889
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 97 place count 578 transition count 889
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 97 place count 578 transition count 845
Deduced a syphon composed of 44 places in 3 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 185 place count 534 transition count 845
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 186 place count 533 transition count 844
Iterating global reduction 2 with 1 rules applied. Total rules applied 187 place count 533 transition count 844
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 191 place count 531 transition count 842
Applied a total of 191 rules in 216 ms. Remains 531 /629 variables (removed 98) and now considering 842/935 (removed 93) transitions.
[2022-05-18 00:59:52] [INFO ] Flow matrix only has 838 transitions (discarded 4 similar events)
// Phase 1: matrix 838 rows 531 cols
[2022-05-18 00:59:52] [INFO ] Computed 97 place invariants in 25 ms
[2022-05-18 00:59:52] [INFO ] Dead Transitions using invariants and state equation in 459 ms returned [501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 542, 543, 544, 545, 546, 548, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 577, 578, 579, 580, 581, 583, 586, 587, 588, 589, 590, 591, 593, 596, 600, 601, 602, 603, 604, 605, 606, 608, 611, 615, 620]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[620, 615, 611, 608, 606, 605, 604, 603, 602, 601, 600, 596, 593, 591, 590, 589, 588, 587, 586, 583, 581, 580, 579, 578, 577, 575, 574, 573, 572, 571, 570, 569, 568, 567, 566, 565, 564, 563, 562, 561, 560, 559, 558, 557, 556, 555, 554, 553, 552, 551, 548, 546, 545, 544, 543, 542, 540, 539, 538, 537, 536, 535, 534, 533, 532, 531, 530, 529, 528, 527, 526, 525, 524, 523, 522, 520, 519, 518, 517, 516, 515, 514, 513, 512, 511, 510, 509, 508, 507, 506, 505, 504, 503, 502, 501]
Starting structural reductions, iteration 1 : 531/629 places, 747/935 transitions.
Applied a total of 0 rules in 33 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 531/629 places, 747/935 transitions.
Normalized transition count is 743 out of 747 initially.
// Phase 1: matrix 743 rows 531 cols
[2022-05-18 00:59:52] [INFO ] Computed 97 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 47354 resets, run finished after 3481 ms. (steps per millisecond=287 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 4414 resets, run finished after 1031 ms. (steps per millisecond=969 ) properties (out of 1) seen :3
[2022-05-18 00:59:57] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-18 00:59:57] [INFO ] Computed 97 place invariants in 25 ms
[2022-05-18 00:59:57] [INFO ] [Real]Absence check using 90 positive place invariants in 16 ms returned sat
[2022-05-18 00:59:57] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-18 00:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:57] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2022-05-18 00:59:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:59:57] [INFO ] [Nat]Absence check using 90 positive place invariants in 17 ms returned sat
[2022-05-18 00:59:57] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 12 ms returned sat
[2022-05-18 00:59:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:59:57] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2022-05-18 00:59:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 00:59:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2022-05-18 00:59:58] [INFO ] Deduced a trap composed of 179 places in 164 ms of which 1 ms to minimize.
[2022-05-18 00:59:58] [INFO ] Deduced a trap composed of 155 places in 137 ms of which 0 ms to minimize.
[2022-05-18 00:59:58] [INFO ] Deduced a trap composed of 173 places in 132 ms of which 0 ms to minimize.
[2022-05-18 00:59:58] [INFO ] Deduced a trap composed of 161 places in 131 ms of which 0 ms to minimize.
[2022-05-18 00:59:58] [INFO ] Deduced a trap composed of 164 places in 129 ms of which 1 ms to minimize.
[2022-05-18 00:59:58] [INFO ] Deduced a trap composed of 167 places in 138 ms of which 0 ms to minimize.
[2022-05-18 00:59:59] [INFO ] Deduced a trap composed of 170 places in 134 ms of which 0 ms to minimize.
[2022-05-18 00:59:59] [INFO ] Deduced a trap composed of 170 places in 129 ms of which 0 ms to minimize.
[2022-05-18 00:59:59] [INFO ] Deduced a trap composed of 161 places in 127 ms of which 0 ms to minimize.
[2022-05-18 00:59:59] [INFO ] Deduced a trap composed of 182 places in 135 ms of which 1 ms to minimize.
[2022-05-18 00:59:59] [INFO ] Deduced a trap composed of 173 places in 134 ms of which 1 ms to minimize.
[2022-05-18 01:00:00] [INFO ] Deduced a trap composed of 176 places in 129 ms of which 0 ms to minimize.
[2022-05-18 01:00:00] [INFO ] Deduced a trap composed of 176 places in 133 ms of which 1 ms to minimize.
[2022-05-18 01:00:00] [INFO ] Deduced a trap composed of 167 places in 128 ms of which 0 ms to minimize.
[2022-05-18 01:00:00] [INFO ] Deduced a trap composed of 170 places in 131 ms of which 1 ms to minimize.
[2022-05-18 01:00:01] [INFO ] Deduced a trap composed of 167 places in 128 ms of which 1 ms to minimize.
[2022-05-18 01:00:01] [INFO ] Deduced a trap composed of 158 places in 132 ms of which 0 ms to minimize.
[2022-05-18 01:00:01] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 1 ms to minimize.
[2022-05-18 01:00:01] [INFO ] Deduced a trap composed of 152 places in 134 ms of which 0 ms to minimize.
[2022-05-18 01:00:01] [INFO ] Deduced a trap composed of 167 places in 127 ms of which 0 ms to minimize.
[2022-05-18 01:00:02] [INFO ] Deduced a trap composed of 170 places in 131 ms of which 1 ms to minimize.
[2022-05-18 01:00:02] [INFO ] Deduced a trap composed of 167 places in 133 ms of which 0 ms to minimize.
[2022-05-18 01:00:02] [INFO ] Deduced a trap composed of 167 places in 132 ms of which 0 ms to minimize.
[2022-05-18 01:00:03] [INFO ] Deduced a trap composed of 149 places in 130 ms of which 1 ms to minimize.
[2022-05-18 01:00:05] [INFO ] Deduced a trap composed of 164 places in 132 ms of which 0 ms to minimize.
[2022-05-18 01:00:05] [INFO ] Deduced a trap composed of 170 places in 126 ms of which 1 ms to minimize.
[2022-05-18 01:00:08] [INFO ] Deduced a trap composed of 167 places in 134 ms of which 0 ms to minimize.
[2022-05-18 01:00:08] [INFO ] Deduced a trap composed of 164 places in 126 ms of which 1 ms to minimize.
[2022-05-18 01:00:08] [INFO ] Deduced a trap composed of 170 places in 131 ms of which 1 ms to minimize.
[2022-05-18 01:00:08] [INFO ] Deduced a trap composed of 173 places in 133 ms of which 0 ms to minimize.
[2022-05-18 01:00:09] [INFO ] Deduced a trap composed of 170 places in 135 ms of which 0 ms to minimize.
[2022-05-18 01:00:09] [INFO ] Deduced a trap composed of 161 places in 129 ms of which 1 ms to minimize.
[2022-05-18 01:00:09] [INFO ] Deduced a trap composed of 158 places in 133 ms of which 0 ms to minimize.
[2022-05-18 01:00:09] [INFO ] Deduced a trap composed of 170 places in 181 ms of which 0 ms to minimize.
[2022-05-18 01:00:42] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 1 ms to minimize.
[2022-05-18 01:00:42] [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) : [10] Max seen :[3]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 21 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Starting structural reductions, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 22 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2022-05-18 01:00:42] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-18 01:00:42] [INFO ] Computed 97 place invariants in 19 ms
[2022-05-18 01:00:43] [INFO ] Implicit Places using invariants in 418 ms returned []
[2022-05-18 01:00:43] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-18 01:00:43] [INFO ] Computed 97 place invariants in 18 ms
[2022-05-18 01:00:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:00:44] [INFO ] Implicit Places using invariants and state equation in 1592 ms returned []
Implicit Place search using SMT with State Equation took 2016 ms to find 0 implicit places.
[2022-05-18 01:00:44] [INFO ] Redundant transitions in 48 ms returned []
[2022-05-18 01:00:44] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-18 01:00:44] [INFO ] Computed 97 place invariants in 12 ms
[2022-05-18 01:00:45] [INFO ] Dead Transitions using invariants and state equation in 379 ms returned []
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Starting property specific reduction for PolyORBNT-COL-S05J40-UpperBounds-12
Normalized transition count is 743 out of 747 initially.
// Phase 1: matrix 743 rows 531 cols
[2022-05-18 01:00:45] [INFO ] Computed 97 place invariants in 16 ms
Incomplete random walk after 10000 steps, including 458 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :3
[2022-05-18 01:00:45] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-18 01:00:45] [INFO ] Computed 97 place invariants in 12 ms
[2022-05-18 01:00:45] [INFO ] [Real]Absence check using 90 positive place invariants in 16 ms returned sat
[2022-05-18 01:00:45] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-18 01:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:00:45] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2022-05-18 01:00:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:00:45] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2022-05-18 01:00:45] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 12 ms returned sat
[2022-05-18 01:00:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:00:45] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2022-05-18 01:00:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:00:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2022-05-18 01:00:46] [INFO ] Deduced a trap composed of 179 places in 136 ms of which 0 ms to minimize.
[2022-05-18 01:00:46] [INFO ] Deduced a trap composed of 155 places in 132 ms of which 0 ms to minimize.
[2022-05-18 01:00:46] [INFO ] Deduced a trap composed of 173 places in 128 ms of which 0 ms to minimize.
[2022-05-18 01:00:46] [INFO ] Deduced a trap composed of 161 places in 128 ms of which 1 ms to minimize.
[2022-05-18 01:00:46] [INFO ] Deduced a trap composed of 164 places in 133 ms of which 0 ms to minimize.
[2022-05-18 01:00:47] [INFO ] Deduced a trap composed of 167 places in 143 ms of which 1 ms to minimize.
[2022-05-18 01:00:47] [INFO ] Deduced a trap composed of 170 places in 133 ms of which 0 ms to minimize.
[2022-05-18 01:00:47] [INFO ] Deduced a trap composed of 170 places in 142 ms of which 1 ms to minimize.
[2022-05-18 01:00:47] [INFO ] Deduced a trap composed of 161 places in 130 ms of which 0 ms to minimize.
[2022-05-18 01:00:47] [INFO ] Deduced a trap composed of 182 places in 136 ms of which 8 ms to minimize.
[2022-05-18 01:00:47] [INFO ] Deduced a trap composed of 173 places in 131 ms of which 1 ms to minimize.
[2022-05-18 01:00:48] [INFO ] Deduced a trap composed of 176 places in 132 ms of which 0 ms to minimize.
[2022-05-18 01:00:48] [INFO ] Deduced a trap composed of 176 places in 133 ms of which 1 ms to minimize.
[2022-05-18 01:00:48] [INFO ] Deduced a trap composed of 167 places in 130 ms of which 1 ms to minimize.
[2022-05-18 01:00:48] [INFO ] Deduced a trap composed of 170 places in 132 ms of which 1 ms to minimize.
[2022-05-18 01:00:49] [INFO ] Deduced a trap composed of 167 places in 129 ms of which 0 ms to minimize.
[2022-05-18 01:00:49] [INFO ] Deduced a trap composed of 158 places in 131 ms of which 1 ms to minimize.
[2022-05-18 01:00:49] [INFO ] Deduced a trap composed of 164 places in 133 ms of which 0 ms to minimize.
[2022-05-18 01:00:49] [INFO ] Deduced a trap composed of 152 places in 127 ms of which 0 ms to minimize.
[2022-05-18 01:00:49] [INFO ] Deduced a trap composed of 167 places in 132 ms of which 1 ms to minimize.
[2022-05-18 01:00:50] [INFO ] Deduced a trap composed of 170 places in 126 ms of which 1 ms to minimize.
[2022-05-18 01:00:50] [INFO ] Deduced a trap composed of 167 places in 132 ms of which 0 ms to minimize.
[2022-05-18 01:00:50] [INFO ] Deduced a trap composed of 167 places in 132 ms of which 1 ms to minimize.
[2022-05-18 01:00:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 30 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2022-05-18 01:00:50] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-18 01:00:50] [INFO ] Computed 97 place invariants in 20 ms
[2022-05-18 01:00:51] [INFO ] Dead Transitions using invariants and state equation in 378 ms returned []
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Normalized transition count is 743 out of 747 initially.
// Phase 1: matrix 743 rows 531 cols
[2022-05-18 01:00:51] [INFO ] Computed 97 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 47345 resets, run finished after 3409 ms. (steps per millisecond=293 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 4504 resets, run finished after 988 ms. (steps per millisecond=1012 ) properties (out of 1) seen :3
[2022-05-18 01:00:55] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-18 01:00:55] [INFO ] Computed 97 place invariants in 23 ms
[2022-05-18 01:00:55] [INFO ] [Real]Absence check using 90 positive place invariants in 16 ms returned sat
[2022-05-18 01:00:55] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-18 01:00:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:00:55] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2022-05-18 01:00:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:00:55] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2022-05-18 01:00:55] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 12 ms returned sat
[2022-05-18 01:00:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:00:56] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2022-05-18 01:00:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:00:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2022-05-18 01:00:56] [INFO ] Deduced a trap composed of 179 places in 128 ms of which 0 ms to minimize.
[2022-05-18 01:00:56] [INFO ] Deduced a trap composed of 155 places in 124 ms of which 1 ms to minimize.
[2022-05-18 01:00:56] [INFO ] Deduced a trap composed of 173 places in 123 ms of which 0 ms to minimize.
[2022-05-18 01:00:56] [INFO ] Deduced a trap composed of 161 places in 125 ms of which 1 ms to minimize.
[2022-05-18 01:00:56] [INFO ] Deduced a trap composed of 164 places in 128 ms of which 0 ms to minimize.
[2022-05-18 01:00:57] [INFO ] Deduced a trap composed of 167 places in 129 ms of which 1 ms to minimize.
[2022-05-18 01:00:57] [INFO ] Deduced a trap composed of 170 places in 125 ms of which 0 ms to minimize.
[2022-05-18 01:00:57] [INFO ] Deduced a trap composed of 170 places in 129 ms of which 0 ms to minimize.
[2022-05-18 01:00:57] [INFO ] Deduced a trap composed of 161 places in 133 ms of which 0 ms to minimize.
[2022-05-18 01:00:57] [INFO ] Deduced a trap composed of 182 places in 135 ms of which 1 ms to minimize.
[2022-05-18 01:00:58] [INFO ] Deduced a trap composed of 173 places in 127 ms of which 0 ms to minimize.
[2022-05-18 01:00:58] [INFO ] Deduced a trap composed of 176 places in 131 ms of which 1 ms to minimize.
[2022-05-18 01:00:58] [INFO ] Deduced a trap composed of 176 places in 129 ms of which 0 ms to minimize.
[2022-05-18 01:00:58] [INFO ] Deduced a trap composed of 167 places in 128 ms of which 0 ms to minimize.
[2022-05-18 01:00:59] [INFO ] Deduced a trap composed of 170 places in 126 ms of which 0 ms to minimize.
[2022-05-18 01:00:59] [INFO ] Deduced a trap composed of 167 places in 133 ms of which 1 ms to minimize.
[2022-05-18 01:00:59] [INFO ] Deduced a trap composed of 158 places in 131 ms of which 0 ms to minimize.
[2022-05-18 01:00:59] [INFO ] Deduced a trap composed of 164 places in 135 ms of which 1 ms to minimize.
[2022-05-18 01:00:59] [INFO ] Deduced a trap composed of 152 places in 125 ms of which 0 ms to minimize.
[2022-05-18 01:01:00] [INFO ] Deduced a trap composed of 167 places in 134 ms of which 1 ms to minimize.
[2022-05-18 01:01:00] [INFO ] Deduced a trap composed of 170 places in 127 ms of which 1 ms to minimize.
[2022-05-18 01:01:00] [INFO ] Deduced a trap composed of 167 places in 131 ms of which 1 ms to minimize.
[2022-05-18 01:01:00] [INFO ] Deduced a trap composed of 167 places in 123 ms of which 0 ms to minimize.
[2022-05-18 01:01:01] [INFO ] Deduced a trap composed of 149 places in 131 ms of which 1 ms to minimize.
[2022-05-18 01:01:03] [INFO ] Deduced a trap composed of 164 places in 130 ms of which 0 ms to minimize.
[2022-05-18 01:01:03] [INFO ] Deduced a trap composed of 170 places in 127 ms of which 1 ms to minimize.
[2022-05-18 01:01:06] [INFO ] Deduced a trap composed of 167 places in 126 ms of which 1 ms to minimize.
[2022-05-18 01:01:06] [INFO ] Deduced a trap composed of 164 places in 127 ms of which 0 ms to minimize.
[2022-05-18 01:01:06] [INFO ] Deduced a trap composed of 170 places in 127 ms of which 0 ms to minimize.
[2022-05-18 01:01:07] [INFO ] Deduced a trap composed of 173 places in 124 ms of which 1 ms to minimize.
[2022-05-18 01:01:07] [INFO ] Deduced a trap composed of 170 places in 126 ms of which 1 ms to minimize.
[2022-05-18 01:01:07] [INFO ] Deduced a trap composed of 161 places in 141 ms of which 0 ms to minimize.
[2022-05-18 01:01:07] [INFO ] Deduced a trap composed of 158 places in 133 ms of which 0 ms to minimize.
[2022-05-18 01:01:08] [INFO ] Deduced a trap composed of 170 places in 124 ms of which 1 ms to minimize.
[2022-05-18 01:01:41] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 1 ms to minimize.
[2022-05-18 01:01:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 29 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Starting structural reductions, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 17 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2022-05-18 01:01:41] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-18 01:01:41] [INFO ] Computed 97 place invariants in 12 ms
[2022-05-18 01:01:41] [INFO ] Implicit Places using invariants in 411 ms returned []
[2022-05-18 01:01:41] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-18 01:01:41] [INFO ] Computed 97 place invariants in 11 ms
[2022-05-18 01:01:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 01:01:43] [INFO ] Implicit Places using invariants and state equation in 1547 ms returned []
Implicit Place search using SMT with State Equation took 1959 ms to find 0 implicit places.
[2022-05-18 01:01:43] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-18 01:01:43] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-18 01:01:43] [INFO ] Computed 97 place invariants in 25 ms
[2022-05-18 01:01:43] [INFO ] Dead Transitions using invariants and state equation in 405 ms returned []
Finished structural reductions, in 1 iterations. Remains : 531/531 places, 747/747 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J40-UpperBounds-12 in 58299 ms.
[2022-05-18 01:01:43] [INFO ] Flatten gal took : 110 ms
[2022-05-18 01:01:43] [INFO ] Applying decomposition
[2022-05-18 01:01:43] [INFO ] Flatten gal took : 74 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/graph6679855730389362828.txt, -o, /tmp/graph6679855730389362828.bin, -w, /tmp/graph6679855730389362828.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/graph6679855730389362828.bin, -l, -1, -v, -w, /tmp/graph6679855730389362828.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-18 01:01:43] [INFO ] Decomposing Gal with order
[2022-05-18 01:01:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:01:44] [INFO ] Removed a total of 721 redundant transitions.
[2022-05-18 01:01:44] [INFO ] Flatten gal took : 260 ms
[2022-05-18 01:01:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 329 labels/synchronizations in 30 ms.
[2022-05-18 01:01:44] [INFO ] Time to serialize gal into /tmp/UpperBounds4606638679606259330.gal : 14 ms
[2022-05-18 01:01:44] [INFO ] Time to serialize properties into /tmp/UpperBounds16407958247497230585.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/UpperBounds4606638679606259330.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds16407958247497230585.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/UpperBounds4606638679606259330.gal -t CGAL -reachable-file /tmp/UpperBounds16407958247497230585.prop --nowitness
Loading property file /tmp/UpperBounds16407958247497230585.prop.
Detected timeout of ITS tools.
[2022-05-18 01:22:47] [INFO ] Applying decomposition
[2022-05-18 01:22:47] [INFO ] Flatten gal took : 280 ms
[2022-05-18 01:22:47] [INFO ] Decomposing Gal with order
[2022-05-18 01:22:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 01:22:47] [INFO ] Removed a total of 2724 redundant transitions.
[2022-05-18 01:22:47] [INFO ] Flatten gal took : 327 ms
[2022-05-18 01:22:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 56 ms.
[2022-05-18 01:22:48] [INFO ] Time to serialize gal into /tmp/UpperBounds16317443255087542989.gal : 37 ms
[2022-05-18 01:22:48] [INFO ] Time to serialize properties into /tmp/UpperBounds13642333904373352544.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds16317443255087542989.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds13642333904373352544.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/UpperBounds16317443255087542989.gal -t CGAL -reachable-file /tmp/UpperBounds13642333904373352544.prop --nowitness
Loading property file /tmp/UpperBounds13642333904373352544.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.10827e+10,412.309,5612208,1.71832e+06,25,1.41452e+07,2669,1808,1.36628e+07,48,2406,0
Total reachable state count : 11082705900

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property PolyORBNT-COL-S05J40-UpperBounds-12 :0 <= QueueJobE.QueueJobE_0 <= 3
FORMULA PolyORBNT-COL-S05J40-UpperBounds-12 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBNT-COL-S05J40-UpperBounds-12,0,493.835,5613760,1,0,1.41452e+07,2669,3740,2.35123e+07,60,2406,54662

BK_STOP 1652837464612

--------------------
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-S05J40"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is PolyORBNT-COL-S05J40, 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-165277027100280"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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