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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K 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-S06J04T08-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748891960104

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-S06J04T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 19:19:21] [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:19:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:19:21] [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:19:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 19:19:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 666 ms
[2025-06-02 19:19:22] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 810 PT places and 14100.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2025-06-02 19:19:22] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2025-06-02 19:19:22] [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:19:22] [INFO ] Computed 26 invariants in 12 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 6, 1, 0, 0] Max Struct:[1, 5, 5, 8, 35, 1, 1, 1, 5, 2, 8, 6, 6, 1, 43, 5]
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-12 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 19:19:22] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 19:19:22] [INFO ] Computed 26 invariants in 7 ms
[2025-06-02 19:19:22] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-06-02 19:19:22] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2025-06-02 19:19:22] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2025-06-02 19:19:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:19:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:19:22] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:19:22] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-02 19:19:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-02 19:19:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-02 19:19:22] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-02 19:19:22] [INFO ] Added : 2 causal constraints over 1 iterations in 40 ms. Result :sat
Minimization took 102 ms.
[2025-06-02 19:19:22] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-02 19:19:22] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:19:22] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 19:19:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:19:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:19:22] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:19:22] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:19:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 25 ms returned sat
[2025-06-02 19:19:22] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:19:23] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 13 ms to minimize.
[2025-06-02 19:19:23] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:19:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2025-06-02 19:19:23] [INFO ] Added : 56 causal constraints over 12 iterations in 255 ms. Result :sat
Minimization took 28 ms.
[2025-06-02 19:19:23] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:19:23] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:19:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:19:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:19:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:19:23] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:19:23] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:19:23] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:19:23] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:19:23] [INFO ] Added : 54 causal constraints over 11 iterations in 85 ms. Result :sat
Minimization took 38 ms.
[2025-06-02 19:19:23] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:19:23] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:19:23] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 19:19:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:19:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:19:23] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:19:23] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 19:19:23] [INFO ] [Nat]Added 8 Read/Feed constraints in 20 ms returned sat
[2025-06-02 19:19:23] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2025-06-02 19:19:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2025-06-02 19:19:23] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:19:23] [INFO ] Added : 43 causal constraints over 10 iterations in 65 ms. Result :sat
Minimization took 37 ms.
[2025-06-02 19:19:23] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:19:23] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:19:23] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:19:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:19:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:19:23] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2025-06-02 19:19:23] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-06-02 19:19:23] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2025-06-02 19:19:23] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:19:24] [INFO ] Added : 54 causal constraints over 11 iterations in 82 ms. Result :sat
Minimization took 24 ms.
[2025-06-02 19:19:24] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:19:24] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:19:24] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 19:19:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:19:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:19:24] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:19:24] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:19:24] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 19:19:24] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:19:24] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 13 ms.
[2025-06-02 19:19:24] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:19:24] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:19:24] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:19:24] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:19:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:19:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:19:24] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:19:24] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:19:24] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-02 19:19:24] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:19:24] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
[2025-06-02 19:19:24] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2025-06-02 19:19:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 140 ms
[2025-06-02 19:19:24] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 19:19:24] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2025-06-02 19:19:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2025-06-02 19:19:24] [INFO ] Added : 47 causal constraints over 10 iterations in 135 ms. Result :sat
Minimization took 23 ms.
[2025-06-02 19:19:24] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:19:24] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:19:24] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:19:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:19:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:19:24] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:19:24] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-02 19:19:24] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:19:24] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 19:19:24] [INFO ] Added : 9 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 22 ms.
[2025-06-02 19:19:24] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:19:24] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:19:24] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:19:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:19:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:19:24] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-02 19:19:24] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-02 19:19:24] [INFO ] [Nat]Added 8 Read/Feed constraints in 19 ms returned sat
[2025-06-02 19:19:24] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 19:19:24] [INFO ] Added : 54 causal constraints over 11 iterations in 80 ms. Result :sat
Minimization took 32 ms.
[2025-06-02 19:19:25] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:19:25] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:19:25] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:19:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:19:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:19:25] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:19:25] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:19:25] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:19:25] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:19:25] [INFO ] Added : 35 causal constraints over 7 iterations in 52 ms. Result :sat
Minimization took 40 ms.
[2025-06-02 19:19:25] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:19:25] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:19:25] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 19:19:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:19:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:19:25] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:19:25] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-02 19:19:25] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2025-06-02 19:19:25] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:19:25] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 2 ms to minimize.
[2025-06-02 19:19:25] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2025-06-02 19:19:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2025-06-02 19:19:25] [INFO ] Added : 24 causal constraints over 6 iterations in 156 ms. Result :sat
Minimization took 33 ms.
[2025-06-02 19:19:25] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:19:25] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:19:25] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:19:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:19:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:19:25] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:19:25] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:19:25] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:19:25] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:19:25] [INFO ] Added : 29 causal constraints over 6 iterations in 44 ms. Result :sat
Minimization took 36 ms.
[2025-06-02 19:19:25] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:19:25] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:19:25] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:19:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:19:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:19:25] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:19:25] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:19:25] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:19:25] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:19:25] [INFO ] Added : 9 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 5, 5, 8, 35, 1, 1, 5, 2, 8, 6, 43, 5]
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
[2025-06-02 19:19:26] [INFO ] Unfolded HLPN to a Petri net with 810 places and 14014 transitions 118428 arcs in 217 ms.
[2025-06-02 19:19:26] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Ensure Unique test removed 10760 transitions
Reduce redundant transitions removed 10760 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0] Max Struct:[1, 5, 5, 8, 35, 1, 1, 5, 2, 8, 6, 43, 5]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 5, 5, 8, 35, 1, 1, 5, 2, 8, 6, 43, 5]
[2025-06-02 19:19:26] [INFO ] Flow matrix only has 3206 transitions (discarded 48 similar events)
// Phase 1: matrix 3206 rows 810 cols
[2025-06-02 19:19:26] [INFO ] Computed 58 invariants in 208 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 5, 5, 8, 35, 1, 1, 5, 2, 8, 6, 43, 5]
RANDOM walk for 10000 steps (62 resets) in 144 ms. (68 steps per ms)
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-15 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-03 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70005 steps (213 resets) in 330 ms. (211 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 4, 4, 2, 6, 5, 4] Max Struct:[5, 5, 35, 5, 8, 6, 43]
[2025-06-02 19:19:26] [INFO ] Flow matrix only has 3206 transitions (discarded 48 similar events)
[2025-06-02 19:19:26] [INFO ] Invariant cache hit.
[2025-06-02 19:19:27] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2025-06-02 19:19:27] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 28 ms returned unsat
[2025-06-02 19:19:27] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2025-06-02 19:19:27] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 23 ms returned unsat
[2025-06-02 19:19:27] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-02 19:19:27] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 24 ms returned unsat
[2025-06-02 19:19:27] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2025-06-02 19:19:27] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 33 ms returned unsat
[2025-06-02 19:19:27] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-02 19:19:27] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 32 ms returned sat
[2025-06-02 19:19:29] [INFO ] [Real]Absence check using state equation in 2317 ms returned sat
[2025-06-02 19:19:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:19:30] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-02 19:19:30] [INFO ] [Nat]Absence check using 19 positive and 39 generalized place invariants in 28 ms returned sat
[2025-06-02 19:19:31] [INFO ] [Nat]Absence check using state equation in 1314 ms returned sat
[2025-06-02 19:19:31] [INFO ] State equation strengthened by 224 read => feed constraints.
[2025-06-02 19:19:32] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:19:32] [INFO ] [Nat]Added 224 Read/Feed constraints in 1021 ms returned unknown
[2025-06-02 19:19:32] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-02 19:19:32] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 31 ms returned sat
[2025-06-02 19:19:33] [INFO ] [Real]Absence check using state equation in 1229 ms returned sat
[2025-06-02 19:19:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:19:34] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-02 19:19:34] [INFO ] [Nat]Absence check using 19 positive and 39 generalized place invariants in 29 ms returned sat
[2025-06-02 19:19:35] [INFO ] [Nat]Absence check using state equation in 1362 ms returned sat
[2025-06-02 19:19:36] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:19:36] [INFO ] [Nat]Added 224 Read/Feed constraints in 1035 ms returned unknown
[2025-06-02 19:19:36] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-02 19:19:36] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 27 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 4, 4, 2, 6, 5, 4] Max Struct:[1, 4, 4, 2, 8, 6, 4]
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 5] Max Struct:[8, 6]
Support contains 56 out of 810 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 810/810 places, 3254/3254 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 804 transition count 3182
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 150 place count 732 transition count 3182
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 150 place count 732 transition count 3086
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 342 place count 636 transition count 3086
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 534 place count 540 transition count 2990
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 550 place count 540 transition count 2974
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 566 place count 524 transition count 2974
Applied a total of 566 rules in 494 ms. Remains 524 /810 variables (removed 286) and now considering 2974/3254 (removed 280) transitions.
Running 2968 sub problems to find dead transitions.
[2025-06-02 19:19:37] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
// Phase 1: matrix 2926 rows 524 cols
[2025-06-02 19:19:37] [INFO ] Computed 52 invariants in 67 ms
[2025-06-02 19:19:37] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
SMT process timed out in 46837ms, After SMT, problems are : Problem set: 0 solved, 2968 unsolved
Search for dead transitions found 0 dead transitions in 46898ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47430 ms. Remains : 524/810 places, 2974/3254 transitions.
[2025-06-02 19:20:24] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:20:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 5] Max Struct:[8, 6]
RANDOM walk for 1000000 steps (11507 resets) in 15668 ms. (63 steps per ms)
BEST_FIRST walk for 1851322 steps (9996 resets) in 8587 ms. (215 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 5] Max Struct:[8, 6]
[2025-06-02 19:20:48] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:20:48] [INFO ] Invariant cache hit.
[2025-06-02 19:20:48] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2025-06-02 19:20:48] [INFO ] [Real]Absence check using 16 positive and 36 generalized place invariants in 19 ms returned sat
[2025-06-02 19:20:50] [INFO ] [Real]Absence check using state equation in 1656 ms returned sat
[2025-06-02 19:20:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:20:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2025-06-02 19:20:50] [INFO ] [Nat]Absence check using 16 positive and 36 generalized place invariants in 16 ms returned sat
[2025-06-02 19:20:55] [INFO ] [Nat]Absence check using state equation in 5255 ms returned sat
[2025-06-02 19:20:55] [INFO ] State equation strengthened by 224 read => feed constraints.
[2025-06-02 19:20:56] [INFO ] [Nat]Added 224 Read/Feed constraints in 925 ms returned sat
[2025-06-02 19:20:57] [INFO ] Deduced a trap composed of 269 places in 544 ms of which 5 ms to minimize.
[2025-06-02 19:20:58] [INFO ] Deduced a trap composed of 193 places in 516 ms of which 4 ms to minimize.
[2025-06-02 19:20:58] [INFO ] Deduced a trap composed of 254 places in 497 ms of which 4 ms to minimize.
[2025-06-02 19:20:59] [INFO ] Deduced a trap composed of 244 places in 496 ms of which 4 ms to minimize.
[2025-06-02 19:21:00] [INFO ] Deduced a trap composed of 252 places in 537 ms of which 4 ms to minimize.
[2025-06-02 19:21:00] [INFO ] Deduced a trap composed of 254 places in 528 ms of which 3 ms to minimize.
[2025-06-02 19:21:01] [INFO ] Deduced a trap composed of 242 places in 534 ms of which 3 ms to minimize.
[2025-06-02 19:21:02] [INFO ] Deduced a trap composed of 198 places in 532 ms of which 3 ms to minimize.
[2025-06-02 19:21:03] [INFO ] Deduced a trap composed of 243 places in 531 ms of which 3 ms to minimize.
[2025-06-02 19:21:03] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2025-06-02 19:21:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 7644 ms
[2025-06-02 19:21:04] [INFO ] Computed and/alt/rep : 1974/7302/1969 causal constraints (skipped 951 transitions) in 307 ms.
[2025-06-02 19:21:05] [INFO ] Added : 26 causal constraints over 6 iterations in 1349 ms. Result :sat
Minimization took 6466 ms.
[2025-06-02 19:21:12] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2025-06-02 19:21:12] [INFO ] [Real]Absence check using 16 positive and 36 generalized place invariants in 18 ms returned sat
[2025-06-02 19:21:13] [INFO ] [Real]Absence check using state equation in 1057 ms returned sat
[2025-06-02 19:21:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:21:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2025-06-02 19:21:13] [INFO ] [Nat]Absence check using 16 positive and 36 generalized place invariants in 18 ms returned sat
[2025-06-02 19:21:19] [INFO ] [Nat]Absence check using state equation in 5885 ms returned sat
[2025-06-02 19:21:21] [INFO ] [Nat]Added 224 Read/Feed constraints in 2652 ms returned sat
[2025-06-02 19:21:22] [INFO ] Deduced a trap composed of 50 places in 509 ms of which 3 ms to minimize.
[2025-06-02 19:21:23] [INFO ] Deduced a trap composed of 50 places in 467 ms of which 3 ms to minimize.
[2025-06-02 19:21:23] [INFO ] Deduced a trap composed of 50 places in 460 ms of which 3 ms to minimize.
[2025-06-02 19:21:24] [INFO ] Deduced a trap composed of 161 places in 521 ms of which 4 ms to minimize.
[2025-06-02 19:21:25] [INFO ] Deduced a trap composed of 50 places in 527 ms of which 3 ms to minimize.
[2025-06-02 19:21:26] [INFO ] Deduced a trap composed of 161 places in 532 ms of which 3 ms to minimize.
[2025-06-02 19:21:26] [INFO ] Deduced a trap composed of 50 places in 529 ms of which 3 ms to minimize.
[2025-06-02 19:21:27] [INFO ] Deduced a trap composed of 60 places in 502 ms of which 4 ms to minimize.
[2025-06-02 19:21:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 5518 ms
Current structural bounds on expressions (after SMT) : Max Seen:[6, 5] Max Struct:[8, 5]
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-11 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[8]
Support contains 8 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 2974/2974 transitions.
Applied a total of 0 rules in 78 ms. Remains 524 /524 variables (removed 0) and now considering 2974/2974 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 524/524 places, 2974/2974 transitions.
[2025-06-02 19:21:27] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:21:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[8]
RANDOM walk for 1000000 steps (11222 resets) in 13964 ms. (71 steps per ms)
BEST_FIRST walk for 1000001 steps (7974 resets) in 3374 ms. (296 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[8]
[2025-06-02 19:21:44] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:21:44] [INFO ] Invariant cache hit.
[2025-06-02 19:21:44] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2025-06-02 19:21:44] [INFO ] [Real]Absence check using 16 positive and 36 generalized place invariants in 23 ms returned sat
[2025-06-02 19:21:46] [INFO ] [Real]Absence check using state equation in 1578 ms returned sat
[2025-06-02 19:21:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:21:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2025-06-02 19:21:46] [INFO ] [Nat]Absence check using 16 positive and 36 generalized place invariants in 16 ms returned sat
[2025-06-02 19:21:51] [INFO ] [Nat]Absence check using state equation in 5094 ms returned sat
[2025-06-02 19:21:51] [INFO ] State equation strengthened by 224 read => feed constraints.
[2025-06-02 19:21:52] [INFO ] [Nat]Added 224 Read/Feed constraints in 899 ms returned sat
[2025-06-02 19:21:53] [INFO ] Deduced a trap composed of 269 places in 532 ms of which 4 ms to minimize.
[2025-06-02 19:21:54] [INFO ] Deduced a trap composed of 193 places in 540 ms of which 4 ms to minimize.
[2025-06-02 19:21:54] [INFO ] Deduced a trap composed of 254 places in 486 ms of which 3 ms to minimize.
[2025-06-02 19:21:55] [INFO ] Deduced a trap composed of 244 places in 465 ms of which 3 ms to minimize.
[2025-06-02 19:21:56] [INFO ] Deduced a trap composed of 252 places in 471 ms of which 3 ms to minimize.
[2025-06-02 19:21:56] [INFO ] Deduced a trap composed of 254 places in 527 ms of which 3 ms to minimize.
[2025-06-02 19:21:57] [INFO ] Deduced a trap composed of 242 places in 481 ms of which 3 ms to minimize.
[2025-06-02 19:21:58] [INFO ] Deduced a trap composed of 198 places in 529 ms of which 6 ms to minimize.
[2025-06-02 19:21:59] [INFO ] Deduced a trap composed of 243 places in 549 ms of which 4 ms to minimize.
[2025-06-02 19:21:59] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 0 ms to minimize.
[2025-06-02 19:22:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 7462 ms
[2025-06-02 19:22:00] [INFO ] Computed and/alt/rep : 1974/7302/1969 causal constraints (skipped 951 transitions) in 529 ms.
[2025-06-02 19:22:01] [INFO ] Added : 26 causal constraints over 6 iterations in 1604 ms. Result :sat
Minimization took 5176 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[8]
Support contains 8 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 2974/2974 transitions.
Applied a total of 0 rules in 65 ms. Remains 524 /524 variables (removed 0) and now considering 2974/2974 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 524/524 places, 2974/2974 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 2974/2974 transitions.
Applied a total of 0 rules in 65 ms. Remains 524 /524 variables (removed 0) and now considering 2974/2974 (removed 0) transitions.
[2025-06-02 19:22:07] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:22:07] [INFO ] Invariant cache hit.
[2025-06-02 19:22:07] [INFO ] Implicit Places using invariants in 748 ms returned [442, 443, 444, 445, 446, 447, 448, 449]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 763 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 516/524 places, 2974/2974 transitions.
Applied a total of 0 rules in 58 ms. Remains 516 /516 variables (removed 0) and now considering 2974/2974 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 889 ms. Remains : 516/524 places, 2974/2974 transitions.
[2025-06-02 19:22:07] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
// Phase 1: matrix 2926 rows 516 cols
[2025-06-02 19:22:07] [INFO ] Computed 44 invariants in 64 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[8]
RANDOM walk for 1000000 steps (11440 resets) in 13090 ms. (76 steps per ms)
BEST_FIRST walk for 1000001 steps (7959 resets) in 2909 ms. (343 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[8]
[2025-06-02 19:22:24] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:22:24] [INFO ] Invariant cache hit.
[2025-06-02 19:22:24] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2025-06-02 19:22:24] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 16 ms returned sat
[2025-06-02 19:22:25] [INFO ] [Real]Absence check using state equation in 1137 ms returned sat
[2025-06-02 19:22:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:22:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2025-06-02 19:22:25] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 16 ms returned sat
[2025-06-02 19:22:29] [INFO ] [Nat]Absence check using state equation in 4202 ms returned sat
[2025-06-02 19:22:29] [INFO ] State equation strengthened by 224 read => feed constraints.
[2025-06-02 19:22:30] [INFO ] [Nat]Added 224 Read/Feed constraints in 538 ms returned sat
[2025-06-02 19:22:30] [INFO ] Deduced a trap composed of 250 places in 624 ms of which 3 ms to minimize.
[2025-06-02 19:22:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 781 ms
[2025-06-02 19:22:31] [INFO ] Computed and/alt/rep : 1974/7301/1969 causal constraints (skipped 951 transitions) in 204 ms.
[2025-06-02 19:22:32] [INFO ] Deduced a trap composed of 235 places in 521 ms of which 3 ms to minimize.
[2025-06-02 19:22:33] [INFO ] Deduced a trap composed of 39 places in 528 ms of which 3 ms to minimize.
[2025-06-02 19:22:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1844 ms
[2025-06-02 19:22:34] [INFO ] Added : 49 causal constraints over 12 iterations in 4027 ms. Result :sat
Minimization took 6081 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[8]
Support contains 8 out of 516 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 516/516 places, 2974/2974 transitions.
Applied a total of 0 rules in 61 ms. Remains 516 /516 variables (removed 0) and now considering 2974/2974 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 516/516 places, 2974/2974 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 516/516 places, 2974/2974 transitions.
Applied a total of 0 rules in 56 ms. Remains 516 /516 variables (removed 0) and now considering 2974/2974 (removed 0) transitions.
[2025-06-02 19:22:41] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:22:41] [INFO ] Invariant cache hit.
[2025-06-02 19:22:41] [INFO ] Implicit Places using invariants in 736 ms returned []
[2025-06-02 19:22:41] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:22:41] [INFO ] Invariant cache hit.
[2025-06-02 19:22:43] [INFO ] State equation strengthened by 224 read => feed constraints.
[2025-06-02 19:22:57] [INFO ] Implicit Places using invariants and state equation in 15751 ms returned []
Implicit Place search using SMT with State Equation took 16492 ms to find 0 implicit places.
[2025-06-02 19:22:57] [INFO ] Redundant transitions in 132 ms returned []
Running 2968 sub problems to find dead transitions.
[2025-06-02 19:22:57] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:22:57] [INFO ] Invariant cache hit.
[2025-06-02 19:22:57] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
[2025-06-02 19:23:50] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 2 ms to minimize.
[2025-06-02 19:23:50] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 2 ms to minimize.
[2025-06-02 19:23:50] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 1 ms to minimize.
[2025-06-02 19:23:50] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
[2025-06-02 19:23:50] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2025-06-02 19:23:51] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2025-06-02 19:23:51] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2025-06-02 19:23:52] [INFO ] Deduced a trap composed of 231 places in 625 ms of which 3 ms to minimize.
[2025-06-02 19:23:53] [INFO ] Deduced a trap composed of 59 places in 375 ms of which 2 ms to minimize.
[2025-06-02 19:23:54] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
SMT process timed out in 56207ms, After SMT, problems are : Problem set: 0 solved, 2968 unsolved
Search for dead transitions found 0 dead transitions in 56238ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72939 ms. Remains : 516/516 places, 2974/2974 transitions.
RANDOM walk for 40000 steps (472 resets) in 1367 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (311 resets) in 339 ms. (117 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (320 resets) in 315 ms. (126 steps per ms) remains 2/2 properties
[2025-06-02 19:23:54] [INFO ] Flatten gal took : 524 ms
[2025-06-02 19:23:55] [INFO ] Flatten gal took : 217 ms
[2025-06-02 19:23:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17362444642667541584.gal : 102 ms
[2025-06-02 19:23:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2194202972173771195.prop : 1 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/ReachabilityCardinality17362444642667541584.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2194202972173771195.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2194202972173771195.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 45
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :45 after 54
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :54 after 151
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :151 after 178
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :178 after 865
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :865 after 2112
Interrupted probabilistic random walk after 111986 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 2
Probabilistic random walk after 111986 steps, saw 74138 distinct states, run finished after 3004 ms. (steps per millisecond=37 ) properties seen :0
[2025-06-02 19:23:57] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:23:57] [INFO ] Invariant cache hit.
[2025-06-02 19:23:57] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 393/401 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/448 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 11/459 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 53/512 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2112 after 31189
[2025-06-02 19:23:58] [INFO ] Deduced a trap composed of 51 places in 368 ms of which 3 ms to minimize.
[2025-06-02 19:23:58] [INFO ] Deduced a trap composed of 51 places in 395 ms of which 3 ms to minimize.
[2025-06-02 19:23:59] [INFO ] Deduced a trap composed of 39 places in 380 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 3/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/514 variables, 2/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :31189 after 265535
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3440/3442 variables, and 560 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3368 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 514/516 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 393/401 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/448 variables, 10/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/459 variables, 4/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/512 variables, 24/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 3/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 19:24:01] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 2 ms to minimize.
[2025-06-02 19:24:01] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 1 ms to minimize.
[2025-06-02 19:24:01] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 1 ms to minimize.
[2025-06-02 19:24:01] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 4/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/514 variables, 2/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/514 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3440/3442 variables, and 564 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2290 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 514/516 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 5705ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 99 ms.
Support contains 8 out of 516 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 516/516 places, 2974/2974 transitions.
Applied a total of 0 rules in 77 ms. Remains 516 /516 variables (removed 0) and now considering 2974/2974 (removed 0) transitions.
Running 2968 sub problems to find dead transitions.
[2025-06-02 19:24:03] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:24:03] [INFO ] Invariant cache hit.
[2025-06-02 19:24:03] [INFO ] State equation strengthened by 224 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :265535 after 5.97007e+06
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5.97007e+06 after 7.97468e+07
Detected timeout of ITS tools.
[2025-06-02 19:24:45] [INFO ] Flatten gal took : 160 ms
[2025-06-02 19:24:45] [INFO ] Applying decomposition
[2025-06-02 19:24:45] [INFO ] Flatten gal took : 153 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph967473091466843033.txt' '-o' '/tmp/graph967473091466843033.bin' '-w' '/tmp/graph967473091466843033.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph967473091466843033.bin' '-l' '-1' '-v' '-w' '/tmp/graph967473091466843033.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:24:46] [INFO ] Decomposing Gal with order
[2025-06-02 19:24:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:24:47] [INFO ] Removed a total of 1056 redundant transitions.
[2025-06-02 19:24:47] [INFO ] Flatten gal took : 606 ms
[2025-06-02 19:24:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 214 labels/synchronizations in 40 ms.
[2025-06-02 19:24:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5795524380932422277.gal : 37 ms
[2025-06-02 19:24:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16194331018670764848.prop : 1 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/ReachabilityCardinality5795524380932422277.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16194331018670764848.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16194331018670764848.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 18
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :18 after 26
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :26 after 34
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :34 after 53
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :53 after 153
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :153 after 291
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
SMT process timed out in 46760ms, After SMT, problems are : Problem set: 0 solved, 2968 unsolved
Search for dead transitions found 0 dead transitions in 46792ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46884 ms. Remains : 516/516 places, 2974/2974 transitions.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :291 after 762
RANDOM walk for 40000 steps (461 resets) in 888 ms. (44 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (310 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :762 after 1269
Interrupted probabilistic random walk after 153813 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 1
Probabilistic random walk after 153813 steps, saw 103149 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
[2025-06-02 19:24:53] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:24:53] [INFO ] Invariant cache hit.
[2025-06-02 19:24:53] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 393/401 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 47/448 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/459 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/512 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/514 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1269 after 4492
At refinement iteration 11 (OVERLAPS) 2926/3440 variables, 514/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3440 variables, 224/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3440 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3442 variables, 2/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3442 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3442 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/3442 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3442/3442 variables, and 784 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1590 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 516/516 constraints, ReadFeed: 224/224 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 393/401 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/448 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/459 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/512 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 19:24:56] [INFO ] Deduced a trap composed of 51 places in 628 ms of which 3 ms to minimize.
[2025-06-02 19:24:56] [INFO ] Deduced a trap composed of 51 places in 624 ms of which 4 ms to minimize.
[2025-06-02 19:24:57] [INFO ] Deduced a trap composed of 66 places in 628 ms of which 4 ms to minimize.
[2025-06-02 19:24:57] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 2 ms to minimize.
[2025-06-02 19:24:57] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 1 ms to minimize.
[2025-06-02 19:24:57] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/514 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2926/3440 variables, 514/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3440 variables, 224/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3440 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3440 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3442 variables, 2/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3442 variables, 1/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3442 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/3442 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3442/3442 variables, and 791 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6905 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 516/516 constraints, ReadFeed: 224/224 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 8532ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 220 ms.
Support contains 8 out of 516 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 516/516 places, 2974/2974 transitions.
Applied a total of 0 rules in 64 ms. Remains 516 /516 variables (removed 0) and now considering 2974/2974 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 516/516 places, 2974/2974 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 516/516 places, 2974/2974 transitions.
Applied a total of 0 rules in 53 ms. Remains 516 /516 variables (removed 0) and now considering 2974/2974 (removed 0) transitions.
[2025-06-02 19:25:02] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:25:02] [INFO ] Invariant cache hit.
[2025-06-02 19:25:03] [INFO ] Implicit Places using invariants in 752 ms returned []
[2025-06-02 19:25:03] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:25:03] [INFO ] Invariant cache hit.
[2025-06-02 19:25:04] [INFO ] State equation strengthened by 224 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4492 after 24763
[2025-06-02 19:25:19] [INFO ] Implicit Places using invariants and state equation in 16357 ms returned []
Implicit Place search using SMT with State Equation took 17127 ms to find 0 implicit places.
[2025-06-02 19:25:19] [INFO ] Redundant transitions in 202 ms returned []
Running 2968 sub problems to find dead transitions.
[2025-06-02 19:25:19] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:25:19] [INFO ] Invariant cache hit.
[2025-06-02 19:25:19] [INFO ] State equation strengthened by 224 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :24763 after 38643
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
[2025-06-02 19:26:14] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 1 ms to minimize.
[2025-06-02 19:26:14] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 1 ms to minimize.
[2025-06-02 19:26:14] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 3 ms to minimize.
[2025-06-02 19:26:14] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2025-06-02 19:26:15] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 1 ms to minimize.
[2025-06-02 19:26:15] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2025-06-02 19:26:15] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 0 ms to minimize.
[2025-06-02 19:26:16] [INFO ] Deduced a trap composed of 231 places in 642 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/3442 variables, and 46 constraints, problems are : Problem set: 0 solved, 2968 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 2968/1168 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2968 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
[2025-06-02 19:26:24] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 2 ms to minimize.
[2025-06-02 19:26:37] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/3442 variables, and 48 constraints, problems are : Problem set: 0 solved, 2968 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1800/1168 constraints, Known Traps: 10/10 constraints]
After SMT, in 87279ms problems are : Problem set: 0 solved, 2968 unsolved
Search for dead transitions found 0 dead transitions in 87309ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104715 ms. Remains : 516/516 places, 2974/2974 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[6] Max Struct:[8]
Starting property specific reduction for PolyORBLF-COL-S06J04T08-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
[2025-06-02 19:26:47] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:26:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (116 resets) in 132 ms. (75 steps per ms)
BEST_FIRST walk for 10000 steps (91 resets) in 33 ms. (294 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[8]
[2025-06-02 19:26:47] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:26:47] [INFO ] Invariant cache hit.
[2025-06-02 19:26:47] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2025-06-02 19:26:47] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 16 ms returned sat
[2025-06-02 19:26:48] [INFO ] [Real]Absence check using state equation in 1064 ms returned sat
[2025-06-02 19:26:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:26:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2025-06-02 19:26:48] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 15 ms returned sat
[2025-06-02 19:26:50] [INFO ] [Nat]Absence check using state equation in 1468 ms returned sat
[2025-06-02 19:26:50] [INFO ] State equation strengthened by 224 read => feed constraints.
[2025-06-02 19:26:50] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:26:50] [INFO ] [Nat]Added 224 Read/Feed constraints in 688 ms returned sat
[2025-06-02 19:26:51] [INFO ] Computed and/alt/rep : 1974/7301/1969 causal constraints (skipped 951 transitions) in 196 ms.
[2025-06-02 19:26:52] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 0 ms to minimize.
[2025-06-02 19:26:52] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 628 ms
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[8]
Support contains 8 out of 516 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 516/516 places, 2974/2974 transitions.
Applied a total of 0 rules in 61 ms. Remains 516 /516 variables (removed 0) and now considering 2974/2974 (removed 0) transitions.
Running 2968 sub problems to find dead transitions.
[2025-06-02 19:26:53] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:26:53] [INFO ] Invariant cache hit.
[2025-06-02 19:26:53] [INFO ] State equation strengthened by 224 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
SMT process timed out in 46959ms, After SMT, problems are : Problem set: 0 solved, 2968 unsolved
Search for dead transitions found 0 dead transitions in 46987ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47054 ms. Remains : 516/516 places, 2974/2974 transitions.
[2025-06-02 19:27:40] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:27:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[8]
RANDOM walk for 1000000 steps (11457 resets) in 12999 ms. (76 steps per ms)
BEST_FIRST walk for 1000001 steps (8062 resets) in 2865 ms. (348 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[8]
[2025-06-02 19:27:56] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:27:56] [INFO ] Invariant cache hit.
[2025-06-02 19:27:56] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2025-06-02 19:27:56] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 17 ms returned sat
[2025-06-02 19:27:57] [INFO ] [Real]Absence check using state equation in 1134 ms returned sat
[2025-06-02 19:27:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:27:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2025-06-02 19:27:57] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 15 ms returned sat
[2025-06-02 19:28:02] [INFO ] [Nat]Absence check using state equation in 4532 ms returned sat
[2025-06-02 19:28:02] [INFO ] State equation strengthened by 224 read => feed constraints.
[2025-06-02 19:28:03] [INFO ] [Nat]Added 224 Read/Feed constraints in 597 ms returned sat
[2025-06-02 19:28:03] [INFO ] Deduced a trap composed of 250 places in 624 ms of which 3 ms to minimize.
[2025-06-02 19:28:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 802 ms
[2025-06-02 19:28:04] [INFO ] Computed and/alt/rep : 1974/7301/1969 causal constraints (skipped 951 transitions) in 180 ms.
[2025-06-02 19:28:05] [INFO ] Deduced a trap composed of 235 places in 472 ms of which 3 ms to minimize.
[2025-06-02 19:28:06] [INFO ] Deduced a trap composed of 39 places in 534 ms of which 3 ms to minimize.
[2025-06-02 19:28:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1846 ms
[2025-06-02 19:28:08] [INFO ] Added : 49 causal constraints over 12 iterations in 4102 ms. Result :sat
Minimization took 5014 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[8]
Support contains 8 out of 516 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 516/516 places, 2974/2974 transitions.
Applied a total of 0 rules in 60 ms. Remains 516 /516 variables (removed 0) and now considering 2974/2974 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 516/516 places, 2974/2974 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 516/516 places, 2974/2974 transitions.
Applied a total of 0 rules in 52 ms. Remains 516 /516 variables (removed 0) and now considering 2974/2974 (removed 0) transitions.
[2025-06-02 19:28:13] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:28:13] [INFO ] Invariant cache hit.
[2025-06-02 19:28:13] [INFO ] Implicit Places using invariants in 763 ms returned []
[2025-06-02 19:28:13] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:28:13] [INFO ] Invariant cache hit.
[2025-06-02 19:28:15] [INFO ] State equation strengthened by 224 read => feed constraints.
[2025-06-02 19:28:29] [INFO ] Implicit Places using invariants and state equation in 15895 ms returned []
Implicit Place search using SMT with State Equation took 16664 ms to find 0 implicit places.
[2025-06-02 19:28:29] [INFO ] Redundant transitions in 64 ms returned []
Running 2968 sub problems to find dead transitions.
[2025-06-02 19:28:29] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:28:29] [INFO ] Invariant cache hit.
[2025-06-02 19:28:29] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
[2025-06-02 19:29:22] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 1 ms to minimize.
[2025-06-02 19:29:22] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 1 ms to minimize.
[2025-06-02 19:29:22] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 1 ms to minimize.
[2025-06-02 19:29:23] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 1 ms to minimize.
[2025-06-02 19:29:23] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
[2025-06-02 19:29:23] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2025-06-02 19:29:23] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2025-06-02 19:29:24] [INFO ] Deduced a trap composed of 231 places in 625 ms of which 3 ms to minimize.
[2025-06-02 19:29:26] [INFO ] Deduced a trap composed of 59 places in 375 ms of which 2 ms to minimize.
[2025-06-02 19:29:26] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/3442 variables, and 48 constraints, problems are : Problem set: 0 solved, 2968 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 2968/1168 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2968 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
[2025-06-02 19:29:32] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/3442 variables, and 49 constraints, problems are : Problem set: 0 solved, 2968 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1800/1168 constraints, Known Traps: 11/11 constraints]
After SMT, in 86680ms problems are : Problem set: 0 solved, 2968 unsolved
Search for dead transitions found 0 dead transitions in 86708ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103506 ms. Remains : 516/516 places, 2974/2974 transitions.
[2025-06-02 19:29:56] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:29:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[8]
RANDOM walk for 1000000 steps (11515 resets) in 12946 ms. (77 steps per ms)
BEST_FIRST walk for 1000000 steps (8031 resets) in 2878 ms. (347 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[8]
[2025-06-02 19:30:12] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:30:12] [INFO ] Invariant cache hit.
[2025-06-02 19:30:12] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2025-06-02 19:30:12] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 16 ms returned sat
[2025-06-02 19:30:13] [INFO ] [Real]Absence check using state equation in 1156 ms returned sat
[2025-06-02 19:30:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:30:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2025-06-02 19:30:13] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 15 ms returned sat
[2025-06-02 19:30:18] [INFO ] [Nat]Absence check using state equation in 4191 ms returned sat
[2025-06-02 19:30:18] [INFO ] State equation strengthened by 224 read => feed constraints.
[2025-06-02 19:30:18] [INFO ] [Nat]Added 224 Read/Feed constraints in 550 ms returned sat
[2025-06-02 19:30:19] [INFO ] Deduced a trap composed of 250 places in 623 ms of which 3 ms to minimize.
[2025-06-02 19:30:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 789 ms
[2025-06-02 19:30:19] [INFO ] Computed and/alt/rep : 1974/7301/1969 causal constraints (skipped 951 transitions) in 163 ms.
[2025-06-02 19:30:21] [INFO ] Deduced a trap composed of 235 places in 486 ms of which 3 ms to minimize.
[2025-06-02 19:30:22] [INFO ] Deduced a trap composed of 39 places in 532 ms of which 3 ms to minimize.
[2025-06-02 19:30:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1818 ms
[2025-06-02 19:30:23] [INFO ] Added : 49 causal constraints over 12 iterations in 3944 ms. Result :sat
Minimization took 5143 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[8]
Support contains 8 out of 516 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 516/516 places, 2974/2974 transitions.
Applied a total of 0 rules in 57 ms. Remains 516 /516 variables (removed 0) and now considering 2974/2974 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 516/516 places, 2974/2974 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 516/516 places, 2974/2974 transitions.
Applied a total of 0 rules in 54 ms. Remains 516 /516 variables (removed 0) and now considering 2974/2974 (removed 0) transitions.
[2025-06-02 19:30:28] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:30:28] [INFO ] Invariant cache hit.
[2025-06-02 19:30:29] [INFO ] Implicit Places using invariants in 754 ms returned []
[2025-06-02 19:30:29] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:30:29] [INFO ] Invariant cache hit.
[2025-06-02 19:30:30] [INFO ] State equation strengthened by 224 read => feed constraints.
[2025-06-02 19:30:45] [INFO ] Implicit Places using invariants and state equation in 16173 ms returned []
Implicit Place search using SMT with State Equation took 16932 ms to find 0 implicit places.
[2025-06-02 19:30:45] [INFO ] Redundant transitions in 65 ms returned []
Running 2968 sub problems to find dead transitions.
[2025-06-02 19:30:45] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:30:45] [INFO ] Invariant cache hit.
[2025-06-02 19:30:45] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
[2025-06-02 19:31:39] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 2 ms to minimize.
[2025-06-02 19:31:39] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 1 ms to minimize.
[2025-06-02 19:31:39] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 2 ms to minimize.
[2025-06-02 19:31:39] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2025-06-02 19:31:40] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2025-06-02 19:31:40] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 0 ms to minimize.
[2025-06-02 19:31:40] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 0 ms to minimize.
[2025-06-02 19:31:41] [INFO ] Deduced a trap composed of 231 places in 622 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/3442 variables, and 46 constraints, problems are : Problem set: 0 solved, 2968 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 2968/1168 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2968 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
[2025-06-02 19:31:49] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 1 ms to minimize.
[2025-06-02 19:32:02] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/3442 variables, and 48 constraints, problems are : Problem set: 0 solved, 2968 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1800/1168 constraints, Known Traps: 10/10 constraints]
After SMT, in 86948ms problems are : Problem set: 0 solved, 2968 unsolved
Search for dead transitions found 0 dead transitions in 86976ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104045 ms. Remains : 516/516 places, 2974/2974 transitions.
RANDOM walk for 40000 steps (430 resets) in 1324 ms. (30 steps per ms) remains 2/2 properties
[2025-06-02 19:32:13] [INFO ] Flatten gal took : 354 ms
BEST_FIRST walk for 40004 steps (323 resets) in 296 ms. (134 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (334 resets) in 290 ms. (137 steps per ms) remains 2/2 properties
[2025-06-02 19:32:13] [INFO ] Flatten gal took : 195 ms
[2025-06-02 19:32:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10647362929001897830.gal : 22 ms
[2025-06-02 19:32:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16776503075829880564.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/ReachabilityCardinality10647362929001897830.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16776503075829880564.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality16776503075829880564.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 45
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :45 after 54
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :54 after 151
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :151 after 178
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :178 after 865
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :865 after 2112
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2112 after 31189
Interrupted probabilistic random walk after 117840 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 2
Probabilistic random walk after 117840 steps, saw 78200 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
[2025-06-02 19:32:16] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:32:16] [INFO ] Invariant cache hit.
[2025-06-02 19:32:16] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 393/401 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/448 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 11/459 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 53/512 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:32:16] [INFO ] Deduced a trap composed of 51 places in 391 ms of which 3 ms to minimize.
[2025-06-02 19:32:17] [INFO ] Deduced a trap composed of 51 places in 386 ms of which 3 ms to minimize.
[2025-06-02 19:32:17] [INFO ] Deduced a trap composed of 39 places in 389 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 3/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/514 variables, 2/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :31189 after 265535
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3440/3442 variables, and 560 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3355 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 514/516 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 393/401 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/448 variables, 10/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/459 variables, 4/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/512 variables, 24/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 3/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 19:32:19] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 2 ms to minimize.
[2025-06-02 19:32:20] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 2 ms to minimize.
[2025-06-02 19:32:20] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 1 ms to minimize.
[2025-06-02 19:32:20] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 4/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/514 variables, 2/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/514 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3440/3442 variables, and 564 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2324 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 514/516 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 5698ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 102 ms.
Support contains 8 out of 516 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 516/516 places, 2974/2974 transitions.
Applied a total of 0 rules in 54 ms. Remains 516 /516 variables (removed 0) and now considering 2974/2974 (removed 0) transitions.
Running 2968 sub problems to find dead transitions.
[2025-06-02 19:32:22] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:32:22] [INFO ] Invariant cache hit.
[2025-06-02 19:32:22] [INFO ] State equation strengthened by 224 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :265535 after 5.97007e+06
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5.97007e+06 after 7.97468e+07
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :7.97468e+07 after 1.49855e+08
Detected timeout of ITS tools.
[2025-06-02 19:33:03] [INFO ] Flatten gal took : 127 ms
[2025-06-02 19:33:03] [INFO ] Applying decomposition
[2025-06-02 19:33:03] [INFO ] Flatten gal took : 126 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph536429834555303568.txt' '-o' '/tmp/graph536429834555303568.bin' '-w' '/tmp/graph536429834555303568.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph536429834555303568.bin' '-l' '-1' '-v' '-w' '/tmp/graph536429834555303568.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:33:03] [INFO ] Decomposing Gal with order
[2025-06-02 19:33:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:33:04] [INFO ] Removed a total of 1122 redundant transitions.
[2025-06-02 19:33:04] [INFO ] Flatten gal took : 300 ms
[2025-06-02 19:33:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 237 labels/synchronizations in 28 ms.
[2025-06-02 19:33:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10765174866973082826.gal : 26 ms
[2025-06-02 19:33:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14792010098410303471.prop : 1 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/ReachabilityCardinality10765174866973082826.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14792010098410303471.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14792010098410303471.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 18
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :18 after 26
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :26 after 34
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :34 after 45
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :45 after 69
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :69 after 203
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :203 after 543
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :543 after 997
SDD proceeding with computation,1 properties remain. new max is 8192
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
SMT process timed out in 46946ms, After SMT, problems are : Problem set: 0 solved, 2968 unsolved
Search for dead transitions found 0 dead transitions in 46975ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47035 ms. Remains : 516/516 places, 2974/2974 transitions.
SDD size :997 after 2553
RANDOM walk for 40000 steps (479 resets) in 755 ms. (52 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (314 resets) in 290 ms. (137 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2553 after 11050
Interrupted probabilistic random walk after 153406 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 1
Probabilistic random walk after 153406 steps, saw 102866 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
[2025-06-02 19:33:12] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:33:12] [INFO ] Invariant cache hit.
[2025-06-02 19:33:12] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 393/401 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 47/448 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/459 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/512 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/514 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2926/3440 variables, 514/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3440 variables, 224/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3440 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3442 variables, 2/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3442 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3442 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/3442 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3442/3442 variables, and 784 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1466 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 516/516 constraints, ReadFeed: 224/224 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 393/401 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/448 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/459 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/512 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 19:33:14] [INFO ] Deduced a trap composed of 51 places in 560 ms of which 3 ms to minimize.
[2025-06-02 19:33:15] [INFO ] Deduced a trap composed of 51 places in 621 ms of which 3 ms to minimize.
[2025-06-02 19:33:15] [INFO ] Deduced a trap composed of 66 places in 609 ms of which 3 ms to minimize.
[2025-06-02 19:33:16] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 2 ms to minimize.
[2025-06-02 19:33:16] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 2 ms to minimize.
[2025-06-02 19:33:16] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/514 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2926/3440 variables, 514/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3440 variables, 224/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3440 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3440 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3442 variables, 2/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3442 variables, 1/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3442 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/3442 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3442/3442 variables, and 791 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6565 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 516/516 constraints, ReadFeed: 224/224 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 8055ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 215 ms.
Support contains 8 out of 516 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 516/516 places, 2974/2974 transitions.
Applied a total of 0 rules in 53 ms. Remains 516 /516 variables (removed 0) and now considering 2974/2974 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 516/516 places, 2974/2974 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 516/516 places, 2974/2974 transitions.
Applied a total of 0 rules in 53 ms. Remains 516 /516 variables (removed 0) and now considering 2974/2974 (removed 0) transitions.
[2025-06-02 19:33:20] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:33:20] [INFO ] Invariant cache hit.
[2025-06-02 19:33:21] [INFO ] Implicit Places using invariants in 696 ms returned []
[2025-06-02 19:33:21] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:33:21] [INFO ] Invariant cache hit.
[2025-06-02 19:33:22] [INFO ] State equation strengthened by 224 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :11050 after 67162
[2025-06-02 19:33:37] [INFO ] Implicit Places using invariants and state equation in 15788 ms returned []
Implicit Place search using SMT with State Equation took 16494 ms to find 0 implicit places.
[2025-06-02 19:33:37] [INFO ] Redundant transitions in 61 ms returned []
Running 2968 sub problems to find dead transitions.
[2025-06-02 19:33:37] [INFO ] Flow matrix only has 2926 transitions (discarded 48 similar events)
[2025-06-02 19:33:37] [INFO ] Invariant cache hit.
[2025-06-02 19:33:37] [INFO ] State equation strengthened by 224 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :67162 after 204182
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
[2025-06-02 19:34:31] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 2 ms to minimize.
[2025-06-02 19:34:32] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 1 ms to minimize.
[2025-06-02 19:34:32] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 1 ms to minimize.
[2025-06-02 19:34:32] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 0 ms to minimize.
[2025-06-02 19:34:32] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 1 ms to minimize.
[2025-06-02 19:34:32] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 1 ms to minimize.
[2025-06-02 19:34:32] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 0 ms to minimize.
[2025-06-02 19:34:33] [INFO ] Deduced a trap composed of 231 places in 621 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/3442 variables, and 46 constraints, problems are : Problem set: 0 solved, 2968 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 2968/1168 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2968 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 2968 unsolved
[2025-06-02 19:34:41] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 2 ms to minimize.
[2025-06-02 19:34:54] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/3442 variables, and 48 constraints, problems are : Problem set: 0 solved, 2968 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1800/1168 constraints, Known Traps: 10/10 constraints]
After SMT, in 87165ms problems are : Problem set: 0 solved, 2968 unsolved
Search for dead transitions found 0 dead transitions in 87194ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103824 ms. Remains : 516/516 places, 2974/2974 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[6] Max Struct:[8]
Ending property specific reduction for PolyORBLF-COL-S06J04T08-UpperBounds-10 in 497280 ms.
[2025-06-02 19:35:04] [INFO ] Flatten gal took : 116 ms
[2025-06-02 19:35:04] [INFO ] Applying decomposition
[2025-06-02 19:35:04] [INFO ] Flatten gal took : 115 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9150658950101962834.txt' '-o' '/tmp/graph9150658950101962834.bin' '-w' '/tmp/graph9150658950101962834.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9150658950101962834.bin' '-l' '-1' '-v' '-w' '/tmp/graph9150658950101962834.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:35:05] [INFO ] Decomposing Gal with order
[2025-06-02 19:35:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:35:05] [INFO ] Removed a total of 1619 redundant transitions.
[2025-06-02 19:35:05] [INFO ] Flatten gal took : 290 ms
[2025-06-02 19:35:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 926 labels/synchronizations in 48 ms.
[2025-06-02 19:35:05] [INFO ] Time to serialize gal into /tmp/UpperBounds13603653526852542261.gal : 54 ms
[2025-06-02 19:35:05] [INFO ] Time to serialize properties into /tmp/UpperBounds15789594520644211820.prop : 1 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/UpperBounds13603653526852542261.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15789594520644211820.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds15789594520644211820.prop.
ITS-tools command line returned an error code 137
[2025-06-02 19:40:48] [INFO ] Applying decomposition
[2025-06-02 19:40:48] [INFO ] Flatten gal took : 120 ms
[2025-06-02 19:40:48] [INFO ] Decomposing Gal with order
[2025-06-02 19:40:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:40:48] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[CreatedJobs_14],[CreatedJobs_15],[CreatedJobs_16],[CreatedJobs_17],[CreatedJobs_18],[CreatedJobs_19],[CreatedJobs_20],[CreatedJobs_21],[CreatedJobs_22],[CreatedJobs_23],[CreatedJobs_24],[CreatedJobs_25],[CreatedJobs_26],[CreatedJobs_27],[CreatedJobs_28],[CreatedJobs_29],[AwakeTasks_0, IdleTasks_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, Check_Sources_B_0, Check_Sources_E_0, RunB_0, P_1617_0],[AwakeTasks_1, IdleTasks_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, Check_Sources_B_1, Check_Sources_E_1, RunB_1, P_1617_1],[AwakeTasks_2, IdleTasks_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, Check_Sources_B_2, Check_Sources_E_2, RunB_2, P_1617_2],[AwakeTasks_3, IdleTasks_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, Check_Sources_B_3, Check_Sources_E_3, RunB_3, P_1617_3],[AwakeTasks_4, IdleTasks_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, Check_Sources_B_4, Check_Sources_E_4, RunB_4, P_1617_4],[AwakeTasks_5, IdleTasks_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, Check_Sources_B_5, Check_Sources_E_5, RunB_5, P_1617_5],[AwakeTasks_6, IdleTasks_6, P_2321_6, TryAllocateOneTaskE_6, TryAllocateOneTaskB_6, P_2318_6, EnablePollingB_6, FetchJobB_6, ScheduleTaskE_Check_6, ScheduleTaskB_6, Abort_Check_Sources_E_6, Abort_Check_Sources_B_6, P_1158_6, P_1159_6, P_1160_6, NotifyEventEndOfCheckSourcesB_6, Check_Sources_B_6, Check_Sources_E_6, RunB_6, P_1617_6],[AwakeTasks_7, IdleTasks_7, P_2321_7, TryAllocateOneTaskE_7, TryAllocateOneTaskB_7, P_2318_7, EnablePollingB_7, FetchJobB_7, ScheduleTaskE_Check_7, ScheduleTaskB_7, Abort_Check_Sources_E_7, Abort_Check_Sources_B_7, P_1158_7, P_1159_7, P_1160_7, NotifyEventEndOfCheckSourcesB_7, Check_Sources_B_7, Check_Sources_E_7, RunB_7, P_1617_7],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29],[NotifyEventJobQueuedB_30, QueueJobB_30, FetchJobE_30],[NotifyEventJobQueuedB_31, QueueJobB_31, FetchJobE_31],[NotifyEventJobQueuedB_32, QueueJobB_32, FetchJobE_32],[NotifyEventJobQueuedB_33, QueueJobB_33, FetchJobE_33],[NotifyEventJobQueuedB_34, QueueJobB_34, FetchJobE_34],[NotifyEventJobQueuedB_35, QueueJobB_35, FetchJobE_35],[NotifyEventJobQueuedB_36, QueueJobB_36, FetchJobE_36],[NotifyEventJobQueuedB_37, QueueJobB_37, FetchJobE_37],[NotifyEventJobQueuedB_38, QueueJobB_38, FetchJobE_38],[NotifyEventJobQueuedB_39, QueueJobB_39, FetchJobE_39],[PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[PlaceSources_2, ModifiedSrc_2, AbourtToModifySrc_2],[PlaceSources_3, ModifiedSrc_3, AbourtToModifySrc_3],[PlaceSources_4, ModifiedSrc_4, AbourtToModifySrc_4],[PlaceSources_5, ModifiedSrc_5, AbourtToModifySrc_5],[Insert_Source_B_0, P_1119_0, P_2579_0],[Insert_Source_B_1, P_1119_1, P_2579_1],[Insert_Source_B_2, P_1119_2, P_2579_2],[Insert_Source_B_3, P_1119_3, P_2579_3],[Insert_Source_B_4, P_1119_4, P_2579_4],[Insert_Source_B_5, P_1119_5, P_2579_5],[Insert_Source_B_6, P_1119_6, P_2579_6],[Insert_Source_B_7, P_1119_7, P_2579_7],[Insert_Source_B_8, P_1119_8, P_2579_8],[Insert_Source_B_9, P_1119_9, P_2579_9],[Insert_Source_B_10, P_1119_10, P_2579_10],[Insert_Source_B_11, P_1119_11, P_2579_11],[Insert_Source_B_12, P_1119_12, P_2579_12],[Insert_Source_B_13, P_1119_13, P_2579_13],[Insert_Source_B_14, P_1119_14, P_2579_14],[Insert_Source_B_15, P_1119_15, P_2579_15],[Insert_Source_B_16, P_1119_16, P_2579_16],[Insert_Source_B_17, P_1119_17, P_2579_17],[Insert_Source_B_18, P_1119_18, P_2579_18],[Insert_Source_B_19, P_1119_19, P_2579_19],[Insert_Source_B_20, P_1119_20, P_2579_20],[Insert_Source_B_21, P_1119_21, P_2579_21],[Insert_Source_B_22, P_1119_22, P_2579_22],[Insert_Source_B_23, P_1119_23, P_2579_23],[Insert_Source_B_24, P_1119_24, P_2579_24],[Insert_Source_B_25, P_1119_25, P_2579_25],[Insert_Source_B_26, P_1119_26, P_2579_26],[Insert_Source_B_27, P_1119_27, P_2579_27],[Insert_Source_B_28, P_1119_28, P_2579_28],[Insert_Source_B_29, P_1119_29, P_2579_29],[Insert_Source_B_30, P_1119_30, P_2579_30],[Insert_Source_B_31, P_1119_31, P_2579_31],[Insert_Source_B_32, P_1119_32, P_2579_32],[Insert_Source_B_33, P_1119_33, P_2579_33],[Insert_Source_B_34, P_1119_34, P_2579_34],[Insert_Source_B_35, P_1119_35, P_2579_35],[Insert_Source_B_36, P_1119_36, P_2579_36],[Insert_Source_B_37, P_1119_37, P_2579_37],[Insert_Source_B_38, P_1119_38, P_2579_38],[Insert_Source_B_39, P_1119_39, P_2579_39],[Insert_Source_B_40, P_1119_40, P_2579_40],[Insert_Source_B_41, P_1119_41, P_2579_41],[Insert_Source_B_42, P_1119_42, P_2579_42],[Insert_Source_B_43, P_1119_43, P_2579_43],[Insert_Source_B_44, P_1119_44, P_2579_44],[Insert_Source_B_45, P_1119_45, P_2579_45],[Insert_Source_B_46, P_1119_46, P_2579_46],[Insert_Source_B_47, P_1119_47, P_2579_47],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:943)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 19:40:49] [INFO ] Flatten gal took : 187 ms
[2025-06-02 19:40:49] [INFO ] Time to serialize gal into /tmp/UpperBounds9406628593481818221.gal : 21 ms
[2025-06-02 19:40:49] [INFO ] Time to serialize properties into /tmp/UpperBounds18269456108790943230.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/UpperBounds9406628593481818221.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18269456108790943230.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds18269456108790943230.prop.
ITS-tools command line returned an error code 137
[2025-06-02 19:46:36] [INFO ] Flatten gal took : 128 ms
[2025-06-02 19:46:36] [INFO ] Input system was already deterministic with 2974 transitions.
[2025-06-02 19:46:36] [INFO ] Transformed 516 places.
[2025-06-02 19:46:36] [INFO ] Transformed 2974 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 19:47:06] [INFO ] Time to serialize gal into /tmp/UpperBounds11576542187685938577.gal : 27 ms
[2025-06-02 19:47:06] [INFO ] Time to serialize properties into /tmp/UpperBounds12796400899769081289.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/UpperBounds11576542187685938577.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12796400899769081289.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds12796400899769081289.prop.
ITS-tools command line returned an error code 137
Total runtime 2049916 ms.

BK_STOP 1748894011446

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-S06J04T08"
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-S06J04T08, 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-174881266100048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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