Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r167-tall-174881266000034.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is PolyORBLF-COL-S02J04T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266000034
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 154K May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748890808172

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 19:00:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 19:00:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:00:09] [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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 19:00:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 19:00:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 657 ms
[2025-06-02 19:00:10] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 476 PT places and 952.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2025-06-02 19:00:10] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2025-06-02 19:00:10] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 19:00:10] [INFO ] Computed 26 invariants in 18 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[1, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 10, 0, 0, 1, 0] Max Struct:[1, 2, 2, 2, 6, 1, 6, 6, 1, 1, 2, 18, 6, 1, 6, 20]
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 19:00:10] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 19:00:10] [INFO ] Computed 26 invariants in 8 ms
[2025-06-02 19:00:10] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-06-02 19:00:10] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-02 19:00:10] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2025-06-02 19:00:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-02 19:00:10] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:10] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-02 19:00:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-02 19:00:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:00:10] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 19:00:10] [INFO ] Added : 58 causal constraints over 12 iterations in 111 ms. Result :sat
Minimization took 31 ms.
[2025-06-02 19:00:10] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:10] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:10] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 19:00:10] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 19:00:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:10] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:10] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 19:00:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:00:10] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:00:11] [INFO ] Added : 9 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 18 ms.
[2025-06-02 19:00:11] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:11] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-02 19:00:11] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 19:00:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-02 19:00:11] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:11] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:00:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2025-06-02 19:00:11] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:00:11] [INFO ] Added : 61 causal constraints over 14 iterations in 116 ms. Result :sat
Minimization took 25 ms.
[2025-06-02 19:00:11] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:11] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2025-06-02 19:00:11] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 19:00:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:11] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:11] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2025-06-02 19:00:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:00:11] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 9 ms to minimize.
[2025-06-02 19:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2025-06-02 19:00:11] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-06-02 19:00:11] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:11] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:00:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:11] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2025-06-02 19:00:11] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-02 19:00:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 19:00:11] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:00:11] [INFO ] Added : 54 causal constraints over 11 iterations in 80 ms. Result :sat
Minimization took 26 ms.
[2025-06-02 19:00:11] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:11] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:11] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:00:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:11] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:11] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 19:00:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:00:11] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 19:00:11] [INFO ] Added : 58 causal constraints over 13 iterations in 111 ms. Result :sat
Minimization took 31 ms.
[2025-06-02 19:00:12] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:12] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:00:12] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:00:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:12] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2025-06-02 19:00:12] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 19:00:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:00:12] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:00:12] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
[2025-06-02 19:00:12] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2025-06-02 19:00:12] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2025-06-02 19:00:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 147 ms
[2025-06-02 19:00:12] [INFO ] Added : 57 causal constraints over 12 iterations in 249 ms. Result :sat
Minimization took 25 ms.
[2025-06-02 19:00:12] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:12] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:00:12] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:00:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:12] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:00:12] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-02 19:00:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 19:00:12] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:00:12] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 19 ms.
[2025-06-02 19:00:12] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:12] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:00:12] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-02 19:00:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:12] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:12] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:00:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 19:00:12] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:00:12] [INFO ] Added : 54 causal constraints over 11 iterations in 74 ms. Result :sat
Minimization took 24 ms.
[2025-06-02 19:00:12] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:12] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:12] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:00:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:12] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:12] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-02 19:00:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:00:12] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:00:12] [INFO ] Added : 7 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 28 ms.
[2025-06-02 19:00:13] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 1 ms returned unsat
[2025-06-02 19:00:13] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:00:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-02 19:00:13] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:00:13] [INFO ] Added : 10 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 32 ms.
[2025-06-02 19:00:13] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 19:00:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:00:13] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:00:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2025-06-02 19:00:13] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 19:00:13] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2025-06-02 19:00:13] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2025-06-02 19:00:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2025-06-02 19:00:13] [INFO ] Added : 54 causal constraints over 11 iterations in 169 ms. Result :sat
Minimization took 25 ms.
[2025-06-02 19:00:13] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:00:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 19:00:13] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:00:13] [INFO ] Added : 10 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 21 ms.
[2025-06-02 19:00:13] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:00:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:00:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:00:13] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 19:00:13] [INFO ] Added : 9 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 10, 0, 0, 1, 0] Max Struct:[2, 2, 2, 5, 1, 6, 6, 1, 1, 2, 10, 6, 1, 6, 20]
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-02 19:00:13] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 38 ms.
[2025-06-02 19:00:13] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[2, 2, 2, 1, 6, 6, 1, 1, 2, 6, 1, 6, 20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[2, 2, 2, 1, 6, 6, 1, 1, 2, 6, 1, 6, 20]
[2025-06-02 19:00:13] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2025-06-02 19:00:13] [INFO ] Computed 46 invariants in 32 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[2, 2, 2, 1, 6, 6, 1, 1, 2, 6, 1, 6, 20]
RANDOM walk for 10000 steps (4 resets) in 66 ms. (149 steps per ms)
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-14 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70003 steps (19 resets) in 218 ms. (319 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 5, 2] Max Struct:[2, 2, 2, 6, 6, 6, 20]
[2025-06-02 19:00:14] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-02 19:00:14] [INFO ] Invariant cache hit.
[2025-06-02 19:00:14] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2025-06-02 19:00:14] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 17 ms returned unsat
[2025-06-02 19:00:14] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2025-06-02 19:00:14] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 19 ms returned unsat
[2025-06-02 19:00:14] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2025-06-02 19:00:14] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 18 ms returned unsat
[2025-06-02 19:00:14] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2025-06-02 19:00:14] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 16 ms returned unsat
[2025-06-02 19:00:14] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2025-06-02 19:00:14] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 17 ms returned unsat
[2025-06-02 19:00:14] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2025-06-02 19:00:14] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 20 ms returned sat
[2025-06-02 19:00:15] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2025-06-02 19:00:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:15] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-06-02 19:00:15] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 19 ms returned sat
[2025-06-02 19:00:15] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2025-06-02 19:00:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:00:16] [INFO ] [Nat]Added 72 Read/Feed constraints in 384 ms returned sat
[2025-06-02 19:00:16] [INFO ] Deduced a trap composed of 171 places in 177 ms of which 3 ms to minimize.
[2025-06-02 19:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 241 ms
[2025-06-02 19:00:16] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 22 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2025-06-02 19:00:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 19 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2025-06-02 19:00:17] [INFO ] [Nat]Added 72 Read/Feed constraints in 155 ms returned sat
[2025-06-02 19:00:17] [INFO ] Computed and/alt/rep : 558/1858/552 causal constraints (skipped 258 transitions) in 58 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 5, 2] Max Struct:[1, 1, 1, 1, 1, 5, 20]
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-12 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 6 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 474 transition count 776
Reduce places removed 48 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 54 rules applied. Total rules applied 104 place count 426 transition count 770
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 110 place count 420 transition count 770
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 110 place count 420 transition count 722
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 206 place count 372 transition count 722
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 290 place count 330 transition count 680
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 296 place count 330 transition count 674
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 302 place count 324 transition count 674
Applied a total of 302 rules in 153 ms. Remains 324 /476 variables (removed 152) and now considering 674/824 (removed 150) transitions.
Running 672 sub problems to find dead transitions.
[2025-06-02 19:00:21] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
// Phase 1: matrix 662 rows 324 cols
[2025-06-02 19:00:21] [INFO ] Computed 44 invariants in 16 ms
[2025-06-02 19:00:21] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2025-06-02 19:00:26] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2025-06-02 19:00:26] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 1 ms to minimize.
[2025-06-02 19:00:26] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2025-06-02 19:00:26] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2025-06-02 19:00:26] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 0 ms to minimize.
[2025-06-02 19:00:26] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2025-06-02 19:00:27] [INFO ] Deduced a trap composed of 110 places in 148 ms of which 2 ms to minimize.
[2025-06-02 19:00:27] [INFO ] Deduced a trap composed of 114 places in 141 ms of which 8 ms to minimize.
[2025-06-02 19:00:27] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 2 ms to minimize.
[2025-06-02 19:00:27] [INFO ] Deduced a trap composed of 122 places in 129 ms of which 2 ms to minimize.
[2025-06-02 19:00:29] [INFO ] Deduced a trap composed of 102 places in 136 ms of which 2 ms to minimize.
[2025-06-02 19:00:30] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2025-06-02 19:00:30] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2025-06-02 19:00:31] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 2 ms to minimize.
[2025-06-02 19:00:31] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2025-06-02 19:00:37] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/986 variables, and 58 constraints, problems are : Problem set: 0 solved, 672 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 672 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2025-06-02 19:00:46] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2025-06-02 19:00:49] [INFO ] Deduced a trap composed of 168 places in 136 ms of which 2 ms to minimize.
[2025-06-02 19:00:49] [INFO ] Deduced a trap composed of 199 places in 124 ms of which 2 ms to minimize.
[2025-06-02 19:00:49] [INFO ] Deduced a trap composed of 194 places in 125 ms of which 1 ms to minimize.
[2025-06-02 19:00:49] [INFO ] Deduced a trap composed of 167 places in 116 ms of which 2 ms to minimize.
[2025-06-02 19:00:49] [INFO ] Deduced a trap composed of 174 places in 117 ms of which 2 ms to minimize.
[2025-06-02 19:00:49] [INFO ] Deduced a trap composed of 196 places in 126 ms of which 2 ms to minimize.
[2025-06-02 19:00:50] [INFO ] Deduced a trap composed of 181 places in 136 ms of which 2 ms to minimize.
[2025-06-02 19:00:50] [INFO ] Deduced a trap composed of 177 places in 130 ms of which 2 ms to minimize.
[2025-06-02 19:00:50] [INFO ] Deduced a trap composed of 141 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 672 unsolved
SMT process timed out in 41067ms, After SMT, problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 41088ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41267 ms. Remains : 324/476 places, 674/824 transitions.
[2025-06-02 19:01:02] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
[2025-06-02 19:01:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (527 resets) in 2769 ms. (361 steps per ms)
BEST_FIRST walk for 1000000 steps (217 resets) in 1454 ms. (687 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2025-06-02 19:01:07] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
[2025-06-02 19:01:07] [INFO ] Invariant cache hit.
[2025-06-02 19:01:07] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-02 19:01:07] [INFO ] [Real]Absence check using 10 positive and 34 generalized place invariants in 14 ms returned sat
[2025-06-02 19:01:07] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2025-06-02 19:01:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:01:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-02 19:01:07] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 14 ms returned sat
[2025-06-02 19:01:07] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2025-06-02 19:01:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:01:07] [INFO ] [Nat]Added 72 Read/Feed constraints in 235 ms returned sat
[2025-06-02 19:01:08] [INFO ] Computed and/alt/rep : 396/1684/390 causal constraints (skipped 270 transitions) in 43 ms.
[2025-06-02 19:01:09] [INFO ] Added : 74 causal constraints over 15 iterations in 1091 ms. Result :sat
Minimization took 2091 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 6 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 674/674 transitions.
Applied a total of 0 rules in 24 ms. Remains 324 /324 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 324/324 places, 674/674 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 674/674 transitions.
Applied a total of 0 rules in 16 ms. Remains 324 /324 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2025-06-02 19:01:11] [INFO ] Flow matrix only has 662 transitions (discarded 12 similar events)
[2025-06-02 19:01:11] [INFO ] Invariant cache hit.
[2025-06-02 19:01:11] [INFO ] Implicit Places using invariants in 244 ms returned [288, 289, 290, 291, 292, 293]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 249 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 318/324 places, 674/674 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 312 transition count 668
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 312 transition count 668
Applied a total of 12 rules in 29 ms. Remains 312 /318 variables (removed 6) and now considering 668/674 (removed 6) transitions.
[2025-06-02 19:01:11] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
// Phase 1: matrix 656 rows 312 cols
[2025-06-02 19:01:11] [INFO ] Computed 38 invariants in 10 ms
[2025-06-02 19:01:12] [INFO ] Implicit Places using invariants in 245 ms returned []
[2025-06-02 19:01:12] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 19:01:12] [INFO ] Invariant cache hit.
[2025-06-02 19:01:12] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:01:14] [INFO ] Implicit Places using invariants and state equation in 2365 ms returned []
Implicit Place search using SMT with State Equation took 2611 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 312/324 places, 668/674 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2906 ms. Remains : 312/324 places, 668/674 transitions.
[2025-06-02 19:01:14] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 19:01:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (482 resets) in 2505 ms. (399 steps per ms)
BEST_FIRST walk for 1000000 steps (230 resets) in 1339 ms. (746 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2025-06-02 19:01:18] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 19:01:18] [INFO ] Invariant cache hit.
[2025-06-02 19:01:18] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:01:18] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 12 ms returned sat
[2025-06-02 19:01:18] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2025-06-02 19:01:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:01:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:01:18] [INFO ] [Nat]Absence check using 11 positive and 27 generalized place invariants in 13 ms returned sat
[2025-06-02 19:01:18] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2025-06-02 19:01:18] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:01:19] [INFO ] [Nat]Added 72 Read/Feed constraints in 145 ms returned sat
[2025-06-02 19:01:19] [INFO ] Computed and/alt/rep : 390/1677/384 causal constraints (skipped 270 transitions) in 39 ms.
[2025-06-02 19:01:19] [INFO ] Added : 33 causal constraints over 7 iterations in 634 ms. Result :sat
Minimization took 1516 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 6 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 668/668 transitions.
Applied a total of 0 rules in 15 ms. Remains 312 /312 variables (removed 0) and now considering 668/668 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 312/312 places, 668/668 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 668/668 transitions.
Applied a total of 0 rules in 15 ms. Remains 312 /312 variables (removed 0) and now considering 668/668 (removed 0) transitions.
[2025-06-02 19:01:21] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 19:01:21] [INFO ] Invariant cache hit.
[2025-06-02 19:01:21] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-06-02 19:01:21] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 19:01:21] [INFO ] Invariant cache hit.
[2025-06-02 19:01:22] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:01:24] [INFO ] Implicit Places using invariants and state equation in 2401 ms returned []
Implicit Place search using SMT with State Equation took 2645 ms to find 0 implicit places.
[2025-06-02 19:01:24] [INFO ] Redundant transitions in 36 ms returned []
Running 666 sub problems to find dead transitions.
[2025-06-02 19:01:24] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
[2025-06-02 19:01:24] [INFO ] Invariant cache hit.
[2025-06-02 19:01:24] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2025-06-02 19:01:28] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:01:28] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 1 ms to minimize.
[2025-06-02 19:01:28] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2025-06-02 19:01:28] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
[2025-06-02 19:01:28] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2025-06-02 19:01:28] [INFO ] Deduced a trap composed of 165 places in 131 ms of which 2 ms to minimize.
[2025-06-02 19:01:28] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 2 ms to minimize.
[2025-06-02 19:01:29] [INFO ] Deduced a trap composed of 113 places in 129 ms of which 2 ms to minimize.
[2025-06-02 19:01:30] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 1 ms to minimize.
[2025-06-02 19:01:31] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2025-06-02 19:01:37] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 2 ms to minimize.
[2025-06-02 19:01:37] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 2 ms to minimize.
[2025-06-02 19:01:37] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 2 ms to minimize.
[2025-06-02 19:01:37] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 2 ms to minimize.
[2025-06-02 19:01:38] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 2 ms to minimize.
[2025-06-02 19:01:38] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2025-06-02 19:01:38] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Problem TDEAD588 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/311 variables, 1/54 constraints. Problems are: Problem set: 36 solved, 630 unsolved
[2025-06-02 19:01:47] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 1/55 constraints. Problems are: Problem set: 36 solved, 630 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
timeout
(s73 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 311/968 variables, and 55 constraints, problems are : Problem set: 36 solved, 630 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 36 solved, 630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 10/10 constraints. Problems are: Problem set: 36 solved, 630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 26/36 constraints. Problems are: Problem set: 36 solved, 630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 18/54 constraints. Problems are: Problem set: 36 solved, 630 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/54 constraints. Problems are: Problem set: 36 solved, 630 unsolved
At refinement iteration 4 (OVERLAPS) 1/311 variables, 1/55 constraints. Problems are: Problem set: 36 solved, 630 unsolved
[2025-06-02 19:02:08] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 1/56 constraints. Problems are: Problem set: 36 solved, 630 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6)
(s1 4)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 2)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 9)
(s111 1)
(s112 0)
(s113 1)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/968 variables, and 56 constraints, problems are : Problem set: 36 solved, 630 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/666 constraints, Known Traps: 19/19 constraints]
After SMT, in 60787ms problems are : Problem set: 36 solved, 630 unsolved
Search for dead transitions found 36 dead transitions in 60795ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 312/312 places, 632/668 transitions.
Applied a total of 0 rules in 13 ms. Remains 312 /312 variables (removed 0) and now considering 632/632 (removed 0) transitions.
[2025-06-02 19:02:25] [INFO ] Redundant transitions in 8 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63525 ms. Remains : 312/312 places, 632/668 transitions.
[2025-06-02 19:02:25] [INFO ] Flow matrix only has 620 transitions (discarded 12 similar events)
// Phase 1: matrix 620 rows 312 cols
[2025-06-02 19:02:25] [INFO ] Computed 38 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (548 resets) in 2311 ms. (432 steps per ms)
BEST_FIRST walk for 1000001 steps (222 resets) in 1235 ms. (809 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2025-06-02 19:02:28] [INFO ] Flow matrix only has 620 transitions (discarded 12 similar events)
[2025-06-02 19:02:28] [INFO ] Invariant cache hit.
[2025-06-02 19:02:28] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-06-02 19:02:28] [INFO ] [Real]Absence check using 13 positive and 25 generalized place invariants in 10 ms returned sat
[2025-06-02 19:02:28] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2025-06-02 19:02:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:02:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2025-06-02 19:02:28] [INFO ] [Nat]Absence check using 13 positive and 25 generalized place invariants in 14 ms returned sat
[2025-06-02 19:02:29] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2025-06-02 19:02:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:02:29] [INFO ] [Nat]Added 72 Read/Feed constraints in 216 ms returned sat
[2025-06-02 19:02:29] [INFO ] Computed and/alt/rep : 414/1917/408 causal constraints (skipped 210 transitions) in 35 ms.
[2025-06-02 19:02:30] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2025-06-02 19:02:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2025-06-02 19:02:30] [INFO ] Added : 85 causal constraints over 17 iterations in 1313 ms. Result :sat
Minimization took 1800 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 6 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 632/632 transitions.
Applied a total of 0 rules in 12 ms. Remains 312 /312 variables (removed 0) and now considering 632/632 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 312/312 places, 632/632 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 632/632 transitions.
Applied a total of 0 rules in 11 ms. Remains 312 /312 variables (removed 0) and now considering 632/632 (removed 0) transitions.
[2025-06-02 19:02:32] [INFO ] Flow matrix only has 620 transitions (discarded 12 similar events)
[2025-06-02 19:02:32] [INFO ] Invariant cache hit.
[2025-06-02 19:02:33] [INFO ] Implicit Places using invariants in 217 ms returned []
[2025-06-02 19:02:33] [INFO ] Flow matrix only has 620 transitions (discarded 12 similar events)
[2025-06-02 19:02:33] [INFO ] Invariant cache hit.
[2025-06-02 19:02:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:02:35] [INFO ] Implicit Places using invariants and state equation in 2449 ms returned []
Implicit Place search using SMT with State Equation took 2668 ms to find 0 implicit places.
[2025-06-02 19:02:35] [INFO ] Redundant transitions in 24 ms returned []
Running 630 sub problems to find dead transitions.
[2025-06-02 19:02:35] [INFO ] Flow matrix only has 620 transitions (discarded 12 similar events)
[2025-06-02 19:02:35] [INFO ] Invariant cache hit.
[2025-06-02 19:02:35] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2025-06-02 19:02:39] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2025-06-02 19:02:39] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 1 ms to minimize.
[2025-06-02 19:02:39] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 2 ms to minimize.
[2025-06-02 19:02:39] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2025-06-02 19:02:39] [INFO ] Deduced a trap composed of 40 places in 26 ms of which 1 ms to minimize.
[2025-06-02 19:02:40] [INFO ] Deduced a trap composed of 104 places in 129 ms of which 2 ms to minimize.
[2025-06-02 19:02:40] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2025-06-02 19:02:40] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 0 ms to minimize.
[2025-06-02 19:02:40] [INFO ] Deduced a trap composed of 117 places in 122 ms of which 2 ms to minimize.
[2025-06-02 19:02:40] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 2 ms to minimize.
[2025-06-02 19:02:40] [INFO ] Deduced a trap composed of 110 places in 112 ms of which 2 ms to minimize.
[2025-06-02 19:02:40] [INFO ] Deduced a trap composed of 112 places in 114 ms of which 2 ms to minimize.
[2025-06-02 19:02:42] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 2 ms to minimize.
[2025-06-02 19:02:43] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 4 (OVERLAPS) 1/311 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2025-06-02 19:02:53] [INFO ] Deduced a trap composed of 118 places in 129 ms of which 2 ms to minimize.
[2025-06-02 19:02:53] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 2 ms to minimize.
[2025-06-02 19:02:54] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2025-06-02 19:02:58] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2025-06-02 19:02:58] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 311/932 variables, and 56 constraints, problems are : Problem set: 0 solved, 630 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 630/630 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2025-06-02 19:03:09] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 2 ms to minimize.
[2025-06-02 19:03:11] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 2 ms to minimize.
[2025-06-02 19:03:11] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 1 ms to minimize.
[2025-06-02 19:03:11] [INFO ] Deduced a trap composed of 181 places in 122 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 5 (OVERLAPS) 1/311 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Problem TDEAD586 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/312 variables, 1/61 constraints. Problems are: Problem set: 30 solved, 600 unsolved
[2025-06-02 19:03:33] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 1/62 constraints. Problems are: Problem set: 30 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/932 variables, and 62 constraints, problems are : Problem set: 30 solved, 600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/630 constraints, Known Traps: 24/24 constraints]
After SMT, in 60588ms problems are : Problem set: 30 solved, 600 unsolved
Search for dead transitions found 30 dead transitions in 60595ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 312/312 places, 602/632 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 310 transition count 590
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 298 transition count 578
Applied a total of 14 rules in 22 ms. Remains 298 /312 variables (removed 14) and now considering 578/602 (removed 24) transitions.
[2025-06-02 19:03:36] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
// Phase 1: matrix 566 rows 298 cols
[2025-06-02 19:03:36] [INFO ] Computed 38 invariants in 13 ms
[2025-06-02 19:03:36] [INFO ] Implicit Places using invariants in 220 ms returned []
[2025-06-02 19:03:36] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2025-06-02 19:03:36] [INFO ] Invariant cache hit.
[2025-06-02 19:03:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:03:38] [INFO ] Implicit Places using invariants and state equation in 2232 ms returned []
Implicit Place search using SMT with State Equation took 2454 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 298/312 places, 578/632 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65786 ms. Remains : 298/312 places, 578/632 transitions.
[2025-06-02 19:03:38] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2025-06-02 19:03:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[12]
RANDOM walk for 1000000 steps (494 resets) in 2080 ms. (480 steps per ms)
BEST_FIRST walk for 1000001 steps (229 resets) in 1148 ms. (870 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[12]
[2025-06-02 19:03:42] [INFO ] Flow matrix only has 566 transitions (discarded 12 similar events)
[2025-06-02 19:03:42] [INFO ] Invariant cache hit.
[2025-06-02 19:03:42] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:03:42] [INFO ] [Real]Absence check using 11 positive and 27 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[2]
FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-02 19:03:42] [INFO ] Flatten gal took : 84 ms
[2025-06-02 19:03:42] [INFO ] Flatten gal took : 56 ms
[2025-06-02 19:03:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9503111991745995924.gal : 22 ms
[2025-06-02 19:03:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10572649496799218006.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9503111991745995924.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10572649496799218006.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 212950 ms.

BK_STOP 1748891022363

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-S02J04T06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is PolyORBLF-COL-S02J04T06, 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 r167-tall-174881266000034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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