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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 187K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K 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-S02J04T10-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748890854112

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-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 19:00:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 19:00:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:00:55] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 19:00:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 19:00:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 643 ms
[2025-06-02 19:00:56] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2025-06-02 19:00:56] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2025-06-02 19:00:56] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 19:00:56] [INFO ] Computed 26 invariants in 25 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 5, 0, 0, 0, 0, 0, 1, 0, 0, 1, 2, 0, 0] Max Struct:[3, 10, 10, 5, 2, 10, 2, 2, 2, 1, 1, 3, 10, 2, 10, 1]
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 19:00:56] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 19:00:56] [INFO ] Computed 26 invariants in 10 ms
[2025-06-02 19:00:56] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-06-02 19:00:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2025-06-02 19:00:56] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2025-06-02 19:00:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-02 19:00:56] [INFO ] [Real]Added 8 Read/Feed constraints in 8 ms returned sat
[2025-06-02 19:00:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:56] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-02 19:00:56] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-02 19:00:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:00:56] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 19:00:56] [INFO ] Added : 7 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 20 ms.
[2025-06-02 19:00:56] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:56] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:00:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:56] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:56] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-02 19:00:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-02 19:00:57] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 18 ms to minimize.
[2025-06-02 19:00:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2025-06-02 19:00:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 16 ms.
[2025-06-02 19:00:57] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2025-06-02 19:00:57] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2025-06-02 19:00:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2025-06-02 19:00:57] [INFO ] Added : 58 causal constraints over 12 iterations in 277 ms. Result :sat
Minimization took 29 ms.
[2025-06-02 19:00:57] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:00:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:00:57] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 19:00:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:57] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:00:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:00:57] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2025-06-02 19:00:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2025-06-02 19:00:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 17 ms.
[2025-06-02 19:00:57] [INFO ] Added : 25 causal constraints over 5 iterations in 54 ms. Result :sat
Minimization took 25 ms.
[2025-06-02 19:00:57] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:00:57] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:00:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:57] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:00:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:00:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:00:57] [INFO ] Added : 3 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 19 ms.
[2025-06-02 19:00:57] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:00:57] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 19:00:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-06-02 19:00:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:57] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:00:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:00:57] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:00:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2025-06-02 19:00:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:00:58] [INFO ] Added : 26 causal constraints over 6 iterations in 51 ms. Result :sat
Minimization took 26 ms.
[2025-06-02 19:00:58] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:00:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-02 19:00:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:00:58] [INFO ] Added : 6 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 22 ms.
[2025-06-02 19:00:58] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 19:00:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:00:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:00:58] [INFO ] Added : 8 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 24 ms.
[2025-06-02 19:00:58] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:00:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 17 ms returned sat
[2025-06-02 19:00:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 19:00:58] [INFO ] Added : 8 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 21 ms.
[2025-06-02 19:00:58] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:00:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:00:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 19:00:58] [INFO ] Added : 54 causal constraints over 11 iterations in 78 ms. Result :sat
Minimization took 23 ms.
[2025-06-02 19:00:58] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 19:00:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:00:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:00:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:00:59] [INFO ] Added : 7 causal constraints over 2 iterations in 35 ms. Result :sat
Minimization took 18 ms.
[2025-06-02 19:00:59] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:59] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:00:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:59] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:59] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 19:00:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:00:59] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 19:00:59] [INFO ] Added : 10 causal constraints over 2 iterations in 25 ms. Result :sat
Minimization took 21 ms.
[2025-06-02 19:00:59] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:00:59] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:00:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:59] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:59] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-02 19:00:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:00:59] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:00:59] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2025-06-02 19:00:59] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2025-06-02 19:00:59] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2025-06-02 19:00:59] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2025-06-02 19:00:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 194 ms
[2025-06-02 19:00:59] [INFO ] Added : 58 causal constraints over 12 iterations in 289 ms. Result :sat
Minimization took 28 ms.
[2025-06-02 19:00:59] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:59] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:00:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:59] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:00:59] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-02 19:00:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:00:59] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2025-06-02 19:00:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2025-06-02 19:00:59] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:00:59] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2025-06-02 19:00:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2025-06-02 19:01:00] [INFO ] Added : 54 causal constraints over 11 iterations in 141 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[3, 10, 10, 2, 10, 2, 2, 2, 1, 3, 10, 10, 1]
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-02 19:01:00] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 48 ms.
[2025-06-02 19:01:00] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 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, 1, 0, 0] Max Struct:[3, 10, 10, 2, 10, 2, 2, 2, 1, 3, 10, 10, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[3, 10, 10, 2, 10, 2, 2, 2, 1, 3, 10, 10, 1]
[2025-06-02 19:01:00] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2025-06-02 19:01:00] [INFO ] Computed 54 invariants in 56 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[3, 10, 10, 2, 10, 2, 2, 2, 1, 3, 10, 10, 1]
RANDOM walk for 10000 steps (2 resets) in 92 ms. (107 steps per ms)
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70003 steps (18 resets) in 277 ms. (251 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 6, 1] Max Struct:[3, 10, 10, 10, 3, 10, 10]
[2025-06-02 19:01:00] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-02 19:01:00] [INFO ] Invariant cache hit.
[2025-06-02 19:01:00] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2025-06-02 19:01:00] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 8 ms returned unsat
[2025-06-02 19:01:00] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-06-02 19:01:00] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 21 ms returned unsat
[2025-06-02 19:01:00] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2025-06-02 19:01:00] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 23 ms returned unsat
[2025-06-02 19:01:01] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned sat
[2025-06-02 19:01:01] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 24 ms returned unsat
[2025-06-02 19:01:01] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2025-06-02 19:01:01] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 5 ms returned unsat
[2025-06-02 19:01:01] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-06-02 19:01:01] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 22 ms returned sat
[2025-06-02 19:01:01] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2025-06-02 19:01:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:01:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-06-02 19:01:02] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 22 ms returned sat
[2025-06-02 19:01:02] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2025-06-02 19:01:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:01:03] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:01:03] [INFO ] [Nat]Added 120 Read/Feed constraints in 861 ms returned sat
[2025-06-02 19:01:03] [INFO ] Computed and/alt/rep : 720/1388/710 causal constraints (skipped 680 transitions) in 98 ms.
[2025-06-02 19:01:04] [INFO ] Added : 55 causal constraints over 12 iterations in 1053 ms. Result :sat
Minimization took 505 ms.
[2025-06-02 19:01:05] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2025-06-02 19:01:05] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 23 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 6, 1] Max Struct:[1, 1, 1, 1, 1, 10, 1]
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[10]
Support contains 1 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 750 transition count 1322
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 660 transition count 1322
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 182 place count 660 transition count 1242
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 342 place count 580 transition count 1242
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 502 place count 500 transition count 1162
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 522 place count 500 transition count 1142
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 542 place count 480 transition count 1142
Applied a total of 542 rules in 251 ms. Remains 480 /752 variables (removed 272) and now considering 1142/1412 (removed 270) transitions.
Running 1140 sub problems to find dead transitions.
[2025-06-02 19:01:05] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
// Phase 1: matrix 1122 rows 480 cols
[2025-06-02 19:01:05] [INFO ] Computed 52 invariants in 33 ms
[2025-06-02 19:01:05] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2025-06-02 19:01:17] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2025-06-02 19:01:18] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2025-06-02 19:01:18] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2025-06-02 19:01:18] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2025-06-02 19:01:18] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
[2025-06-02 19:01:18] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2025-06-02 19:01:18] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
[2025-06-02 19:01:18] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2025-06-02 19:01:18] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2025-06-02 19:01:18] [INFO ] Deduced a trap composed of 172 places in 239 ms of which 3 ms to minimize.
[2025-06-02 19:01:19] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:01:20] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 2 ms to minimize.
[2025-06-02 19:01:22] [INFO ] Deduced a trap composed of 286 places in 228 ms of which 3 ms to minimize.
[2025-06-02 19:01:28] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 3 ms to minimize.
SMT process timed out in 22778ms, After SMT, problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 22807ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23088 ms. Remains : 480/752 places, 1142/1412 transitions.
[2025-06-02 19:01:28] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2025-06-02 19:01:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[10]
RANDOM walk for 1000000 steps (379 resets) in 4267 ms. (234 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 2046 ms. (488 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9] Max Struct:[10]
[2025-06-02 19:01:34] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2025-06-02 19:01:34] [INFO ] Invariant cache hit.
[2025-06-02 19:01:34] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2025-06-02 19:01:34] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 26 ms returned sat
[2025-06-02 19:01:35] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2025-06-02 19:01:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:01:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2025-06-02 19:01:35] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 14 ms returned sat
[2025-06-02 19:01:35] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2025-06-02 19:01:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:01:36] [INFO ] [Nat]Added 120 Read/Feed constraints in 396 ms returned sat
[2025-06-02 19:01:36] [INFO ] Deduced a trap composed of 78 places in 152 ms of which 2 ms to minimize.
[2025-06-02 19:01:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2025-06-02 19:01:36] [INFO ] Computed and/alt/rep : 370/828/360 causal constraints (skipped 760 transitions) in 84 ms.
[2025-06-02 19:01:37] [INFO ] Added : 26 causal constraints over 6 iterations in 571 ms. Result :sat
Minimization took 4503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9] Max Struct:[10]
Support contains 1 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1142/1142 transitions.
Applied a total of 0 rules in 52 ms. Remains 480 /480 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 480/480 places, 1142/1142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1142/1142 transitions.
Applied a total of 0 rules in 42 ms. Remains 480 /480 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
[2025-06-02 19:01:41] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2025-06-02 19:01:41] [INFO ] Invariant cache hit.
[2025-06-02 19:01:42] [INFO ] Implicit Places using invariants in 505 ms returned [424, 425, 426, 427, 428, 429, 430, 431, 432, 433]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 512 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 470/480 places, 1142/1142 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 460 transition count 1132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 460 transition count 1132
Applied a total of 20 rules in 47 ms. Remains 460 /470 variables (removed 10) and now considering 1132/1142 (removed 10) transitions.
[2025-06-02 19:01:42] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
// Phase 1: matrix 1112 rows 460 cols
[2025-06-02 19:01:42] [INFO ] Computed 42 invariants in 27 ms
[2025-06-02 19:01:42] [INFO ] Implicit Places using invariants in 434 ms returned []
[2025-06-02 19:01:42] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:01:42] [INFO ] Invariant cache hit.
[2025-06-02 19:01:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:01:49] [INFO ] Implicit Places using invariants and state equation in 6732 ms returned []
Implicit Place search using SMT with State Equation took 7171 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 460/480 places, 1132/1142 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7779 ms. Remains : 460/480 places, 1132/1142 transitions.
[2025-06-02 19:01:49] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:01:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[9] Max Struct:[10]
RANDOM walk for 1000000 steps (357 resets) in 3841 ms. (260 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 1687 ms. (592 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9] Max Struct:[10]
[2025-06-02 19:01:54] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:01:54] [INFO ] Invariant cache hit.
[2025-06-02 19:01:55] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2025-06-02 19:01:55] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 14 ms returned sat
[2025-06-02 19:01:55] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2025-06-02 19:01:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:01:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2025-06-02 19:01:55] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 23 ms returned sat
[2025-06-02 19:01:55] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2025-06-02 19:01:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:01:56] [INFO ] [Nat]Added 120 Read/Feed constraints in 639 ms returned sat
[2025-06-02 19:01:56] [INFO ] Deduced a trap composed of 177 places in 202 ms of which 3 ms to minimize.
[2025-06-02 19:01:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2025-06-02 19:01:56] [INFO ] Computed and/alt/rep : 360/808/350 causal constraints (skipped 760 transitions) in 65 ms.
[2025-06-02 19:01:57] [INFO ] Added : 25 causal constraints over 5 iterations in 670 ms. Result :sat
Minimization took 4529 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9] Max Struct:[10]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1132/1132 transitions.
Applied a total of 0 rules in 20 ms. Remains 460 /460 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 460/460 places, 1132/1132 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1132/1132 transitions.
Applied a total of 0 rules in 18 ms. Remains 460 /460 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
[2025-06-02 19:02:02] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:02:02] [INFO ] Invariant cache hit.
[2025-06-02 19:02:02] [INFO ] Implicit Places using invariants in 409 ms returned []
[2025-06-02 19:02:02] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:02:02] [INFO ] Invariant cache hit.
[2025-06-02 19:02:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:02:09] [INFO ] Implicit Places using invariants and state equation in 6562 ms returned []
Implicit Place search using SMT with State Equation took 6973 ms to find 0 implicit places.
[2025-06-02 19:02:09] [INFO ] Redundant transitions in 60 ms returned []
Running 1130 sub problems to find dead transitions.
[2025-06-02 19:02:09] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:02:09] [INFO ] Invariant cache hit.
[2025-06-02 19:02:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2025-06-02 19:02:20] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2025-06-02 19:02:20] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2025-06-02 19:02:20] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2025-06-02 19:02:20] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2025-06-02 19:02:20] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2025-06-02 19:02:20] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2025-06-02 19:02:20] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2025-06-02 19:02:20] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 2 ms to minimize.
[2025-06-02 19:02:20] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2025-06-02 19:02:21] [INFO ] Deduced a trap composed of 180 places in 229 ms of which 2 ms to minimize.
[2025-06-02 19:02:21] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2025-06-02 19:02:21] [INFO ] Deduced a trap composed of 181 places in 233 ms of which 3 ms to minimize.
[2025-06-02 19:02:22] [INFO ] Deduced a trap composed of 168 places in 234 ms of which 3 ms to minimize.
[2025-06-02 19:02:22] [INFO ] Deduced a trap composed of 173 places in 228 ms of which 2 ms to minimize.
[2025-06-02 19:02:23] [INFO ] Deduced a trap composed of 198 places in 229 ms of which 3 ms to minimize.
[2025-06-02 19:02:23] [INFO ] Deduced a trap composed of 187 places in 230 ms of which 3 ms to minimize.
[2025-06-02 19:02:23] [INFO ] Deduced a trap composed of 171 places in 209 ms of which 3 ms to minimize.
[2025-06-02 19:02:24] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 2 ms to minimize.
[2025-06-02 19:02:24] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 1 ms to minimize.
[2025-06-02 19:02:33] [INFO ] Deduced a trap composed of 132 places in 219 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/1572 variables, and 60 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/460 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1130/1130 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2025-06-02 19:02:56] [INFO ] Deduced a trap composed of 286 places in 212 ms of which 3 ms to minimize.
[2025-06-02 19:02:57] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2025-06-02 19:03:05] [INFO ] Deduced a trap composed of 166 places in 234 ms of which 3 ms to minimize.
[2025-06-02 19:03:05] [INFO ] Deduced a trap composed of 266 places in 216 ms of which 4 ms to minimize.
[2025-06-02 19:03:08] [INFO ] Deduced a trap composed of 80 places in 234 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1572 variables, and 65 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/460 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1130 constraints, Known Traps: 25/25 constraints]
After SMT, in 62112ms problems are : Problem set: 0 solved, 1130 unsolved
Search for dead transitions found 0 dead transitions in 62124ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69189 ms. Remains : 460/460 places, 1132/1132 transitions.
RANDOM walk for 40001 steps (17 resets) in 898 ms. (44 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 307 ms. (129 steps per ms) remains 2/2 properties
[2025-06-02 19:03:11] [INFO ] Flatten gal took : 281 ms
[2025-06-02 19:03:11] [INFO ] Flatten gal took : 102 ms
[2025-06-02 19:03:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13534338811544704603.gal : 35 ms
[2025-06-02 19:03:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9333642836787358311.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/ReachabilityCardinality13534338811544704603.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9333642836787358311.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/ReachabilityCardinality9333642836787358311.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 33
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :33 after 43
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :43 after 50
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :50 after 308
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :308 after 449
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :449 after 810
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :810 after 1340
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1340 after 5522
Interrupted probabilistic random walk after 204324 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 2
Probabilistic random walk after 204324 steps, saw 116475 distinct states, run finished after 3005 ms. (steps per millisecond=67 ) properties seen :0
[2025-06-02 19:03:14] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:03:14] [INFO ] Invariant cache hit.
[2025-06-02 19:03:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 175/186 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 188/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 9/383 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 74/457 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:03:15] [INFO ] Deduced a trap composed of 38 places in 242 ms of which 3 ms to minimize.
[2025-06-02 19:03:15] [INFO ] Deduced a trap composed of 38 places in 225 ms of which 3 ms to minimize.
[2025-06-02 19:03:15] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 3 ms to minimize.
[2025-06-02 19:03:15] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 3 ms to minimize.
[2025-06-02 19:03:16] [INFO ] Deduced a trap composed of 38 places in 221 ms of which 10 ms to minimize.
[2025-06-02 19:03:16] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 3 ms to minimize.
[2025-06-02 19:03:16] [INFO ] Deduced a trap composed of 80 places in 203 ms of which 3 ms to minimize.
[2025-06-02 19:03:16] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2025-06-02 19:03:16] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/458 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1112/1570 variables, 458/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1570/1572 variables, and 628 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3381 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 458/460 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 175/186 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 188/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:03:18] [INFO ] Deduced a trap composed of 163 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 9/383 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 74/457 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:03:18] [INFO ] Deduced a trap composed of 161 places in 197 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/457 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/458 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1112/1570 variables, 458/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1570 variables, 120/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1570 variables, 2/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1570 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/1572 variables, 2/634 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1572 variables, 1/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1572 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1572 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5522 after 18522
After SMT solving in domain Int declared 1572/1572 variables, and 635 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2415 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 460/460 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 5817ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 235 ms.
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1132/1132 transitions.
Applied a total of 0 rules in 23 ms. Remains 460 /460 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
Running 1130 sub problems to find dead transitions.
[2025-06-02 19:03:20] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:03:20] [INFO ] Invariant cache hit.
[2025-06-02 19:03:20] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :18522 after 27822
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2025-06-02 19:03:32] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2025-06-02 19:03:32] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2025-06-02 19:03:32] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2025-06-02 19:03:32] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2025-06-02 19:03:32] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:03:32] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2025-06-02 19:03:32] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2025-06-02 19:03:32] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:03:32] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:03:33] [INFO ] Deduced a trap composed of 180 places in 222 ms of which 2 ms to minimize.
[2025-06-02 19:03:33] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:03:33] [INFO ] Deduced a trap composed of 181 places in 213 ms of which 3 ms to minimize.
[2025-06-02 19:03:34] [INFO ] Deduced a trap composed of 168 places in 208 ms of which 3 ms to minimize.
[2025-06-02 19:03:34] [INFO ] Deduced a trap composed of 173 places in 206 ms of which 3 ms to minimize.
[2025-06-02 19:03:35] [INFO ] Deduced a trap composed of 198 places in 218 ms of which 3 ms to minimize.
[2025-06-02 19:03:35] [INFO ] Deduced a trap composed of 187 places in 211 ms of which 3 ms to minimize.
[2025-06-02 19:03:35] [INFO ] Deduced a trap composed of 171 places in 218 ms of which 5 ms to minimize.
[2025-06-02 19:03:36] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 2 ms to minimize.
[2025-06-02 19:03:36] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/1572 variables, and 59 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/460 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1130/1130 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :27822 after 36812
[2025-06-02 19:03:48] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2025-06-02 19:03:52] [INFO ] Deduced a trap composed of 77 places in 220 ms of which 3 ms to minimize.
[2025-06-02 19:03:56] [INFO ] Deduced a trap composed of 270 places in 224 ms of which 3 ms to minimize.
[2025-06-02 19:04:01] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 3 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 19:04:02] [INFO ] Flatten gal took : 87 ms
[2025-06-02 19:04:02] [INFO ] Applying decomposition
[2025-06-02 19:04:02] [INFO ] Flatten gal took : 64 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/graph4918062792233273237.txt' '-o' '/tmp/graph4918062792233273237.bin' '-w' '/tmp/graph4918062792233273237.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4918062792233273237.bin' '-l' '-1' '-v' '-w' '/tmp/graph4918062792233273237.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:04:02] [INFO ] Decomposing Gal with order
[2025-06-02 19:04:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:04:02] [INFO ] Deduced a trap composed of 174 places in 253 ms of which 3 ms to minimize.
[2025-06-02 19:04:02] [INFO ] Removed a total of 1328 redundant transitions.
[2025-06-02 19:04:02] [INFO ] Flatten gal took : 280 ms
[2025-06-02 19:04:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 802 labels/synchronizations in 54 ms.
[2025-06-02 19:04:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality573608545672667608.gal : 20 ms
[2025-06-02 19:04:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7674106934298072760.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/ReachabilityCardinality573608545672667608.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7674106934298072760.prop' '--nowitness'

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/ReachabilityCardinality7674106934298072760.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6 after 10
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1572 variables, and 64 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/460 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1130 constraints, Known Traps: 24/24 constraints]
After SMT, in 42358ms problems are : Problem set: 0 solved, 1130 unsolved
Search for dead transitions found 0 dead transitions in 42372ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42400 ms. Remains : 460/460 places, 1132/1132 transitions.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :10 after 14
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :14 after 14
RANDOM walk for 40000 steps (17 resets) in 369 ms. (108 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :14 after 532
Interrupted probabilistic random walk after 246844 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 2
Probabilistic random walk after 246844 steps, saw 139710 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2025-06-02 19:04:06] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:04:06] [INFO ] Invariant cache hit.
[2025-06-02 19:04:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 175/186 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 188/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 9/383 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 74/457 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:04:06] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 11 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :532 after 3883
[2025-06-02 19:04:07] [INFO ] Deduced a trap composed of 38 places in 205 ms of which 3 ms to minimize.
[2025-06-02 19:04:07] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 3 ms to minimize.
[2025-06-02 19:04:07] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 2 ms to minimize.
[2025-06-02 19:04:07] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 2 ms to minimize.
[2025-06-02 19:04:08] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 3 ms to minimize.
[2025-06-02 19:04:08] [INFO ] Deduced a trap composed of 80 places in 203 ms of which 3 ms to minimize.
[2025-06-02 19:04:08] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2025-06-02 19:04:08] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/458 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1112/1570 variables, 458/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1570 variables, 120/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1570 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1572 variables, 2/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1572 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1572 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1572 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1572/1572 variables, and 631 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3105 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 460/460 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 175/186 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 188/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:04:09] [INFO ] Deduced a trap composed of 163 places in 101 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 9/383 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 74/457 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:04:10] [INFO ] Deduced a trap composed of 161 places in 211 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/457 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/458 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1112/1570 variables, 458/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1570 variables, 120/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1570 variables, 2/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1570 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/1572 variables, 2/634 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1572 variables, 1/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1572 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1572 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1572/1572 variables, and 635 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3312 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 460/460 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 6443ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 380 ms.
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1132/1132 transitions.
Applied a total of 0 rules in 17 ms. Remains 460 /460 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 460/460 places, 1132/1132 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1132/1132 transitions.
Applied a total of 0 rules in 16 ms. Remains 460 /460 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
[2025-06-02 19:04:13] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:04:13] [INFO ] Invariant cache hit.
[2025-06-02 19:04:13] [INFO ] Implicit Places using invariants in 393 ms returned []
[2025-06-02 19:04:13] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:04:13] [INFO ] Invariant cache hit.
[2025-06-02 19:04:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:04:20] [INFO ] Implicit Places using invariants and state equation in 6687 ms returned []
Implicit Place search using SMT with State Equation took 7088 ms to find 0 implicit places.
[2025-06-02 19:04:20] [INFO ] Redundant transitions in 19 ms returned []
Running 1130 sub problems to find dead transitions.
[2025-06-02 19:04:20] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:04:20] [INFO ] Invariant cache hit.
[2025-06-02 19:04:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2025-06-02 19:04:31] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2025-06-02 19:04:31] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2025-06-02 19:04:31] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 11 ms to minimize.
[2025-06-02 19:04:31] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2025-06-02 19:04:32] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:04:32] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2025-06-02 19:04:32] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 0 ms to minimize.
[2025-06-02 19:04:32] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2025-06-02 19:04:32] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2025-06-02 19:04:32] [INFO ] Deduced a trap composed of 180 places in 224 ms of which 2 ms to minimize.
[2025-06-02 19:04:33] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 0 ms to minimize.
[2025-06-02 19:04:33] [INFO ] Deduced a trap composed of 181 places in 212 ms of which 3 ms to minimize.
[2025-06-02 19:04:33] [INFO ] Deduced a trap composed of 168 places in 225 ms of which 3 ms to minimize.
[2025-06-02 19:04:33] [INFO ] Deduced a trap composed of 173 places in 206 ms of which 3 ms to minimize.
[2025-06-02 19:04:34] [INFO ] Deduced a trap composed of 198 places in 222 ms of which 3 ms to minimize.
[2025-06-02 19:04:34] [INFO ] Deduced a trap composed of 187 places in 221 ms of which 2 ms to minimize.
[2025-06-02 19:04:35] [INFO ] Deduced a trap composed of 171 places in 209 ms of which 2 ms to minimize.
[2025-06-02 19:04:35] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 1 ms to minimize.
[2025-06-02 19:04:35] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3883 after 46020
[2025-06-02 19:04:44] [INFO ] Deduced a trap composed of 132 places in 233 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/1572 variables, and 60 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/460 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1130/1130 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1130 unsolved
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2025-06-02 19:05:07] [INFO ] Deduced a trap composed of 286 places in 229 ms of which 3 ms to minimize.
[2025-06-02 19:05:08] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2025-06-02 19:05:16] [INFO ] Deduced a trap composed of 166 places in 236 ms of which 7 ms to minimize.
[2025-06-02 19:05:16] [INFO ] Deduced a trap composed of 266 places in 213 ms of which 2 ms to minimize.
[2025-06-02 19:05:18] [INFO ] Deduced a trap composed of 80 places in 213 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1572 variables, and 65 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/460 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1130 constraints, Known Traps: 25/25 constraints]
After SMT, in 62165ms problems are : Problem set: 0 solved, 1130 unsolved
Search for dead transitions found 0 dead transitions in 62183ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69324 ms. Remains : 460/460 places, 1132/1132 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[9] Max Struct:[10]
Starting property specific reduction for PolyORBLF-COL-S02J04T10-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[10]
[2025-06-02 19:05:22] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:05:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 10000 steps (3 resets) in 39 ms. (250 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 19 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[10]
[2025-06-02 19:05:22] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:05:22] [INFO ] Invariant cache hit.
[2025-06-02 19:05:22] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2025-06-02 19:05:22] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 13 ms returned sat
[2025-06-02 19:05:23] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2025-06-02 19:05:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:05:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2025-06-02 19:05:23] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 15 ms returned sat
[2025-06-02 19:05:23] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2025-06-02 19:05:23] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:05:24] [INFO ] [Nat]Added 120 Read/Feed constraints in 243 ms returned sat
[2025-06-02 19:05:24] [INFO ] Computed and/alt/rep : 360/808/350 causal constraints (skipped 760 transitions) in 66 ms.
[2025-06-02 19:05:24] [INFO ] Deduced a trap composed of 203 places in 224 ms of which 2 ms to minimize.
[2025-06-02 19:05:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
[2025-06-02 19:05:24] [INFO ] Added : 24 causal constraints over 5 iterations in 868 ms. Result :sat
Minimization took 583 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[10]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1132/1132 transitions.
Applied a total of 0 rules in 24 ms. Remains 460 /460 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
Running 1130 sub problems to find dead transitions.
[2025-06-02 19:05:25] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:05:25] [INFO ] Invariant cache hit.
[2025-06-02 19:05:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2025-06-02 19:05:36] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2025-06-02 19:05:36] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2025-06-02 19:05:36] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2025-06-02 19:05:37] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2025-06-02 19:05:37] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2025-06-02 19:05:37] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2025-06-02 19:05:37] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2025-06-02 19:05:37] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2025-06-02 19:05:37] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
[2025-06-02 19:05:37] [INFO ] Deduced a trap composed of 180 places in 221 ms of which 2 ms to minimize.
[2025-06-02 19:05:38] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2025-06-02 19:05:38] [INFO ] Deduced a trap composed of 181 places in 219 ms of which 3 ms to minimize.
[2025-06-02 19:05:38] [INFO ] Deduced a trap composed of 168 places in 242 ms of which 3 ms to minimize.
[2025-06-02 19:05:39] [INFO ] Deduced a trap composed of 173 places in 227 ms of which 2 ms to minimize.
[2025-06-02 19:05:39] [INFO ] Deduced a trap composed of 198 places in 216 ms of which 2 ms to minimize.
[2025-06-02 19:05:40] [INFO ] Deduced a trap composed of 187 places in 236 ms of which 3 ms to minimize.
[2025-06-02 19:05:40] [INFO ] Deduced a trap composed of 171 places in 237 ms of which 3 ms to minimize.
[2025-06-02 19:05:41] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 4 ms to minimize.
[2025-06-02 19:05:41] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/1572 variables, and 59 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/460 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1130/1130 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2025-06-02 19:05:52] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 2 ms to minimize.
[2025-06-02 19:05:56] [INFO ] Deduced a trap composed of 77 places in 223 ms of which 3 ms to minimize.
[2025-06-02 19:06:00] [INFO ] Deduced a trap composed of 270 places in 225 ms of which 2 ms to minimize.
[2025-06-02 19:06:06] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 3 ms to minimize.
[2025-06-02 19:06:07] [INFO ] Deduced a trap composed of 174 places in 219 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1572 variables, and 64 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/460 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1130 constraints, Known Traps: 24/24 constraints]
After SMT, in 42055ms problems are : Problem set: 0 solved, 1130 unsolved
Search for dead transitions found 0 dead transitions in 42066ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42092 ms. Remains : 460/460 places, 1132/1132 transitions.
[2025-06-02 19:06:07] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:06:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[10]
RANDOM walk for 1000000 steps (369 resets) in 3766 ms. (265 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 1750 ms. (571 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8] Max Struct:[10]
[2025-06-02 19:06:13] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:06:13] [INFO ] Invariant cache hit.
[2025-06-02 19:06:13] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2025-06-02 19:06:13] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 14 ms returned sat
[2025-06-02 19:06:13] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2025-06-02 19:06:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:06:13] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2025-06-02 19:06:13] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 13 ms returned sat
[2025-06-02 19:06:14] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2025-06-02 19:06:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:06:14] [INFO ] [Nat]Added 120 Read/Feed constraints in 298 ms returned sat
[2025-06-02 19:06:14] [INFO ] Computed and/alt/rep : 360/808/350 causal constraints (skipped 760 transitions) in 61 ms.
[2025-06-02 19:06:15] [INFO ] Deduced a trap composed of 153 places in 229 ms of which 3 ms to minimize.
[2025-06-02 19:06:15] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2025-06-02 19:06:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 464 ms
[2025-06-02 19:06:15] [INFO ] Added : 28 causal constraints over 6 iterations in 1091 ms. Result :sat
Minimization took 4657 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8] Max Struct:[10]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1132/1132 transitions.
Applied a total of 0 rules in 25 ms. Remains 460 /460 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 460/460 places, 1132/1132 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1132/1132 transitions.
Applied a total of 0 rules in 16 ms. Remains 460 /460 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
[2025-06-02 19:06:20] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:06:20] [INFO ] Invariant cache hit.
[2025-06-02 19:06:20] [INFO ] Implicit Places using invariants in 471 ms returned []
[2025-06-02 19:06:20] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:06:20] [INFO ] Invariant cache hit.
[2025-06-02 19:06:21] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:06:27] [INFO ] Implicit Places using invariants and state equation in 6539 ms returned []
Implicit Place search using SMT with State Equation took 7012 ms to find 0 implicit places.
[2025-06-02 19:06:27] [INFO ] Redundant transitions in 14 ms returned []
Running 1130 sub problems to find dead transitions.
[2025-06-02 19:06:27] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:06:27] [INFO ] Invariant cache hit.
[2025-06-02 19:06:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2025-06-02 19:06:38] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2025-06-02 19:06:38] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2025-06-02 19:06:38] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2025-06-02 19:06:38] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2025-06-02 19:06:38] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2025-06-02 19:06:38] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
[2025-06-02 19:06:39] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2025-06-02 19:06:39] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2025-06-02 19:06:39] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2025-06-02 19:06:39] [INFO ] Deduced a trap composed of 180 places in 206 ms of which 2 ms to minimize.
[2025-06-02 19:06:39] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2025-06-02 19:06:40] [INFO ] Deduced a trap composed of 181 places in 258 ms of which 3 ms to minimize.
[2025-06-02 19:06:40] [INFO ] Deduced a trap composed of 168 places in 232 ms of which 4 ms to minimize.
[2025-06-02 19:06:40] [INFO ] Deduced a trap composed of 173 places in 227 ms of which 4 ms to minimize.
[2025-06-02 19:06:41] [INFO ] Deduced a trap composed of 198 places in 211 ms of which 2 ms to minimize.
[2025-06-02 19:06:41] [INFO ] Deduced a trap composed of 187 places in 224 ms of which 3 ms to minimize.
[2025-06-02 19:06:42] [INFO ] Deduced a trap composed of 171 places in 231 ms of which 2 ms to minimize.
[2025-06-02 19:06:42] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 2 ms to minimize.
[2025-06-02 19:06:43] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 2 ms to minimize.
[2025-06-02 19:06:51] [INFO ] Deduced a trap composed of 132 places in 216 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/1572 variables, and 60 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/460 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1130/1130 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2025-06-02 19:07:14] [INFO ] Deduced a trap composed of 286 places in 234 ms of which 3 ms to minimize.
[2025-06-02 19:07:16] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 2 ms to minimize.
[2025-06-02 19:07:23] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 2 ms to minimize.
[2025-06-02 19:07:24] [INFO ] Deduced a trap composed of 266 places in 221 ms of which 2 ms to minimize.
[2025-06-02 19:07:26] [INFO ] Deduced a trap composed of 80 places in 214 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1572 variables, and 65 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/460 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1130 constraints, Known Traps: 25/25 constraints]
After SMT, in 62141ms problems are : Problem set: 0 solved, 1130 unsolved
Search for dead transitions found 0 dead transitions in 62151ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69204 ms. Remains : 460/460 places, 1132/1132 transitions.
[2025-06-02 19:07:29] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:07:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[8] Max Struct:[10]
RANDOM walk for 1000000 steps (396 resets) in 3687 ms. (271 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1695 ms. (589 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8] Max Struct:[10]
[2025-06-02 19:07:35] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:07:35] [INFO ] Invariant cache hit.
[2025-06-02 19:07:35] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2025-06-02 19:07:35] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 14 ms returned sat
[2025-06-02 19:07:35] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2025-06-02 19:07:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:07:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2025-06-02 19:07:35] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 14 ms returned sat
[2025-06-02 19:07:36] [INFO ] [Nat]Absence check using state equation in 610 ms returned sat
[2025-06-02 19:07:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:07:36] [INFO ] [Nat]Added 120 Read/Feed constraints in 309 ms returned sat
[2025-06-02 19:07:36] [INFO ] Computed and/alt/rep : 360/808/350 causal constraints (skipped 760 transitions) in 67 ms.
[2025-06-02 19:07:37] [INFO ] Deduced a trap composed of 153 places in 232 ms of which 3 ms to minimize.
[2025-06-02 19:07:37] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2025-06-02 19:07:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 489 ms
[2025-06-02 19:07:37] [INFO ] Added : 28 causal constraints over 6 iterations in 1134 ms. Result :sat
Minimization took 4561 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8] Max Struct:[10]
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1132/1132 transitions.
Applied a total of 0 rules in 31 ms. Remains 460 /460 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 460/460 places, 1132/1132 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1132/1132 transitions.
Applied a total of 0 rules in 21 ms. Remains 460 /460 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
[2025-06-02 19:07:42] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:07:42] [INFO ] Invariant cache hit.
[2025-06-02 19:07:42] [INFO ] Implicit Places using invariants in 405 ms returned []
[2025-06-02 19:07:42] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:07:42] [INFO ] Invariant cache hit.
[2025-06-02 19:07:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-02 19:07:49] [INFO ] Implicit Places using invariants and state equation in 6422 ms returned []
Implicit Place search using SMT with State Equation took 6829 ms to find 0 implicit places.
[2025-06-02 19:07:49] [INFO ] Redundant transitions in 13 ms returned []
Running 1130 sub problems to find dead transitions.
[2025-06-02 19:07:49] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:07:49] [INFO ] Invariant cache hit.
[2025-06-02 19:07:49] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2025-06-02 19:08:01] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2025-06-02 19:08:01] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2025-06-02 19:08:01] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2025-06-02 19:08:01] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2025-06-02 19:08:01] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2025-06-02 19:08:01] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:08:01] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2025-06-02 19:08:01] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2025-06-02 19:08:01] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2025-06-02 19:08:02] [INFO ] Deduced a trap composed of 180 places in 234 ms of which 3 ms to minimize.
[2025-06-02 19:08:02] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2025-06-02 19:08:02] [INFO ] Deduced a trap composed of 181 places in 231 ms of which 3 ms to minimize.
[2025-06-02 19:08:03] [INFO ] Deduced a trap composed of 168 places in 230 ms of which 4 ms to minimize.
[2025-06-02 19:08:03] [INFO ] Deduced a trap composed of 173 places in 230 ms of which 3 ms to minimize.
[2025-06-02 19:08:04] [INFO ] Deduced a trap composed of 198 places in 225 ms of which 3 ms to minimize.
[2025-06-02 19:08:04] [INFO ] Deduced a trap composed of 187 places in 217 ms of which 3 ms to minimize.
[2025-06-02 19:08:04] [INFO ] Deduced a trap composed of 171 places in 213 ms of which 3 ms to minimize.
[2025-06-02 19:08:05] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 1 ms to minimize.
[2025-06-02 19:08:05] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2025-06-02 19:08:14] [INFO ] Deduced a trap composed of 132 places in 203 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/1572 variables, and 60 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/460 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1130/1130 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2025-06-02 19:08:36] [INFO ] Deduced a trap composed of 286 places in 230 ms of which 3 ms to minimize.
[2025-06-02 19:08:37] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 2 ms to minimize.
[2025-06-02 19:08:45] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 3 ms to minimize.
[2025-06-02 19:08:45] [INFO ] Deduced a trap composed of 266 places in 203 ms of which 3 ms to minimize.
[2025-06-02 19:08:48] [INFO ] Deduced a trap composed of 80 places in 214 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1572 variables, and 65 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/460 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1130 constraints, Known Traps: 25/25 constraints]
After SMT, in 62643ms problems are : Problem set: 0 solved, 1130 unsolved
Search for dead transitions found 0 dead transitions in 62656ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69530 ms. Remains : 460/460 places, 1132/1132 transitions.
[2025-06-02 19:08:51] [INFO ] Flatten gal took : 53 ms
RANDOM walk for 40000 steps (9 resets) in 346 ms. (115 steps per ms) remains 2/2 properties
[2025-06-02 19:08:51] [INFO ] Flatten gal took : 53 ms
[2025-06-02 19:08:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2996387982607616563.gal : 11 ms
[2025-06-02 19:08:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11757359266099328246.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/ReachabilityCardinality2996387982607616563.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11757359266099328246.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
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality11757359266099328246.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 33
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :33 after 43
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :43 after 50
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :50 after 308
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :308 after 449
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :449 after 810
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :810 after 1340
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1340 after 5522
Interrupted probabilistic random walk after 221228 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 2
Probabilistic random walk after 221228 steps, saw 125682 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
[2025-06-02 19:08:55] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:08:55] [INFO ] Invariant cache hit.
[2025-06-02 19:08:55] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 175/186 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 188/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 9/383 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 74/457 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:08:55] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 3 ms to minimize.
[2025-06-02 19:08:55] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 3 ms to minimize.
[2025-06-02 19:08:55] [INFO ] Deduced a trap composed of 38 places in 232 ms of which 3 ms to minimize.
[2025-06-02 19:08:56] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 3 ms to minimize.
[2025-06-02 19:08:56] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 3 ms to minimize.
[2025-06-02 19:08:56] [INFO ] Deduced a trap composed of 38 places in 225 ms of which 3 ms to minimize.
[2025-06-02 19:08:56] [INFO ] Deduced a trap composed of 80 places in 225 ms of which 2 ms to minimize.
[2025-06-02 19:08:56] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2025-06-02 19:08:56] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/458 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1112/1570 variables, 458/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1570 variables, 120/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1570 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1572 variables, 2/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1572 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1572 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1572 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1572/1572 variables, and 631 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3134 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 460/460 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 175/186 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 188/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:08:58] [INFO ] Deduced a trap composed of 163 places in 108 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 9/383 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 74/457 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:08:58] [INFO ] Deduced a trap composed of 161 places in 204 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/457 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/458 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1112/1570 variables, 458/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1570 variables, 120/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1570 variables, 2/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5522 after 18522
At refinement iteration 19 (INCLUDED_ONLY) 0/1570 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/1572 variables, 2/634 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1572/1572 variables, and 635 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3963 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 460/460 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 7115ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1132/1132 transitions.
Applied a total of 0 rules in 18 ms. Remains 460 /460 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
Running 1130 sub problems to find dead transitions.
[2025-06-02 19:09:02] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:09:02] [INFO ] Invariant cache hit.
[2025-06-02 19:09:02] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :18522 after 27822
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2025-06-02 19:09:13] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2025-06-02 19:09:13] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2025-06-02 19:09:13] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2025-06-02 19:09:13] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2025-06-02 19:09:13] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2025-06-02 19:09:14] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:09:14] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2025-06-02 19:09:14] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2025-06-02 19:09:14] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2025-06-02 19:09:14] [INFO ] Deduced a trap composed of 180 places in 214 ms of which 3 ms to minimize.
[2025-06-02 19:09:15] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2025-06-02 19:09:15] [INFO ] Deduced a trap composed of 181 places in 219 ms of which 3 ms to minimize.
[2025-06-02 19:09:15] [INFO ] Deduced a trap composed of 168 places in 214 ms of which 3 ms to minimize.
[2025-06-02 19:09:15] [INFO ] Deduced a trap composed of 173 places in 209 ms of which 2 ms to minimize.
[2025-06-02 19:09:16] [INFO ] Deduced a trap composed of 198 places in 218 ms of which 3 ms to minimize.
[2025-06-02 19:09:16] [INFO ] Deduced a trap composed of 187 places in 211 ms of which 3 ms to minimize.
[2025-06-02 19:09:17] [INFO ] Deduced a trap composed of 171 places in 221 ms of which 3 ms to minimize.
[2025-06-02 19:09:17] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 2 ms to minimize.
[2025-06-02 19:09:18] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 9.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 4.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/1572 variables, and 59 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/460 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1130/1130 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :27822 after 36812
[2025-06-02 19:09:29] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 1 ms to minimize.
[2025-06-02 19:09:33] [INFO ] Deduced a trap composed of 77 places in 209 ms of which 3 ms to minimize.
[2025-06-02 19:09:37] [INFO ] Deduced a trap composed of 270 places in 210 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 19:09:42] [INFO ] Flatten gal took : 50 ms
[2025-06-02 19:09:42] [INFO ] Applying decomposition
[2025-06-02 19:09:42] [INFO ] Flatten gal took : 48 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/graph14697538356402556223.txt' '-o' '/tmp/graph14697538356402556223.bin' '-w' '/tmp/graph14697538356402556223.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14697538356402556223.bin' '-l' '-1' '-v' '-w' '/tmp/graph14697538356402556223.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:09:42] [INFO ] Decomposing Gal with order
[2025-06-02 19:09:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:09:42] [INFO ] Removed a total of 1194 redundant transitions.
[2025-06-02 19:09:42] [INFO ] Flatten gal took : 129 ms
[2025-06-02 19:09:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 579 labels/synchronizations in 36 ms.
[2025-06-02 19:09:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10684182412666994739.gal : 13 ms
[2025-06-02 19:09:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9284638721457457397.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/ReachabilityCardinality10684182412666994739.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9284638721457457397.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality9284638721457457397.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :7 after 47
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :47 after 730
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :730 after 3922
[2025-06-02 19:09:43] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3922 after 7594
[2025-06-02 19:09:44] [INFO ] Deduced a trap composed of 174 places in 204 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1572 variables, and 64 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/460 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1130 constraints, Known Traps: 24/24 constraints]
After SMT, in 42435ms problems are : Problem set: 0 solved, 1130 unsolved
Search for dead transitions found 0 dead transitions in 42448ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42469 ms. Remains : 460/460 places, 1132/1132 transitions.
RANDOM walk for 40000 steps (19 resets) in 335 ms. (119 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 145 ms. (273 steps per ms) remains 1/2 properties
[2025-06-02 19:09:44] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:09:44] [INFO ] Invariant cache hit.
[2025-06-02 19:09:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 175/186 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 188/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 19:09:45] [INFO ] Deduced a trap composed of 163 places in 103 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/383 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 74/457 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 19:09:45] [INFO ] Deduced a trap composed of 81 places in 221 ms of which 3 ms to minimize.
[2025-06-02 19:09:45] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :7594 after 18162
[2025-06-02 19:09:45] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 3 ms to minimize.
[2025-06-02 19:09:45] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2025-06-02 19:09:46] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 1 ms to minimize.
[2025-06-02 19:09:46] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2025-06-02 19:09:46] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2025-06-02 19:09:46] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/458 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1112/1570 variables, 458/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1570 variables, 120/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1570 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 2/1572 variables, 2/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1572 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1572 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1572 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1572/1572 variables, and 631 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2443 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 460/460 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 175/186 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 188/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/383 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 74/457 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 19:09:47] [INFO ] Deduced a trap composed of 60 places in 217 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/457 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/458 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1112/1570 variables, 458/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1570 variables, 120/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1570 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1570 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/1572 variables, 2/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1572 variables, 1/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1572 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1572 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1572/1572 variables, and 633 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3307 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 460/460 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 5764ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 89 ms.
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1132/1132 transitions.
Applied a total of 0 rules in 15 ms. Remains 460 /460 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 460/460 places, 1132/1132 transitions.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :18162 after 31281
RANDOM walk for 40000 steps (17 resets) in 348 ms. (114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 344514 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 344514 steps, saw 192347 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
[2025-06-02 19:09:53] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:09:53] [INFO ] Invariant cache hit.
[2025-06-02 19:09:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 175/186 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 188/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 19:09:54] [INFO ] Deduced a trap composed of 163 places in 106 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/383 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 74/457 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 19:09:54] [INFO ] Deduced a trap composed of 81 places in 222 ms of which 2 ms to minimize.
[2025-06-02 19:09:54] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 3 ms to minimize.
[2025-06-02 19:09:54] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 2 ms to minimize.
[2025-06-02 19:09:54] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2025-06-02 19:09:55] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2025-06-02 19:09:55] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
[2025-06-02 19:09:55] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
[2025-06-02 19:09:55] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/458 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1112/1570 variables, 458/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1570 variables, 120/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1570 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 2/1572 variables, 2/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1572 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1572 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1572 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1572/1572 variables, and 631 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2362 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 460/460 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 175/186 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 188/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/383 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 74/457 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 19:09:56] [INFO ] Deduced a trap composed of 60 places in 214 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/457 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/458 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1112/1570 variables, 458/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1570 variables, 120/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1570 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1570 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/1572 variables, 2/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1572 variables, 1/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1572 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1572 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1572/1572 variables, and 633 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3285 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 460/460 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 5659ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 111 ms.
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1132/1132 transitions.
Applied a total of 0 rules in 14 ms. Remains 460 /460 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 460/460 places, 1132/1132 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1132/1132 transitions.
Applied a total of 0 rules in 14 ms. Remains 460 /460 variables (removed 0) and now considering 1132/1132 (removed 0) transitions.
[2025-06-02 19:09:59] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:09:59] [INFO ] Invariant cache hit.
[2025-06-02 19:10:00] [INFO ] Implicit Places using invariants in 408 ms returned []
[2025-06-02 19:10:00] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:10:00] [INFO ] Invariant cache hit.
[2025-06-02 19:10:00] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :31281 after 43583
[2025-06-02 19:10:06] [INFO ] Implicit Places using invariants and state equation in 6493 ms returned []
Implicit Place search using SMT with State Equation took 6904 ms to find 0 implicit places.
[2025-06-02 19:10:06] [INFO ] Redundant transitions in 14 ms returned []
Running 1130 sub problems to find dead transitions.
[2025-06-02 19:10:06] [INFO ] Flow matrix only has 1112 transitions (discarded 20 similar events)
[2025-06-02 19:10:06] [INFO ] Invariant cache hit.
[2025-06-02 19:10:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2025-06-02 19:10:21] [INFO ] Deduced a trap composed of 38 places in 2880 ms of which 3 ms to minimize.
[2025-06-02 19:10:21] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2025-06-02 19:10:21] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2025-06-02 19:10:21] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2025-06-02 19:10:21] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2025-06-02 19:10:21] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 0 ms to minimize.
[2025-06-02 19:10:21] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2025-06-02 19:10:21] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2025-06-02 19:10:21] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2025-06-02 19:10:22] [INFO ] Deduced a trap composed of 180 places in 240 ms of which 2 ms to minimize.
[2025-06-02 19:10:22] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2025-06-02 19:10:22] [INFO ] Deduced a trap composed of 181 places in 269 ms of which 3 ms to minimize.
[2025-06-02 19:10:23] [INFO ] Deduced a trap composed of 168 places in 286 ms of which 3 ms to minimize.
[2025-06-02 19:10:23] [INFO ] Deduced a trap composed of 173 places in 249 ms of which 2 ms to minimize.
[2025-06-02 19:10:24] [INFO ] Deduced a trap composed of 198 places in 256 ms of which 2 ms to minimize.
[2025-06-02 19:10:24] [INFO ] Deduced a trap composed of 187 places in 249 ms of which 3 ms to minimize.
[2025-06-02 19:10:24] [INFO ] Deduced a trap composed of 171 places in 239 ms of which 3 ms to minimize.
[2025-06-02 19:10:25] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 2 ms to minimize.
[2025-06-02 19:10:25] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :43583 after 100064
Detected timeout of ITS tools.
[2025-06-02 19:10:33] [INFO ] Deduced a trap composed of 132 places in 216 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/1572 variables, and 60 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/460 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1130/1130 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2025-06-02 19:10:53] [INFO ] Deduced a trap composed of 286 places in 228 ms of which 3 ms to minimize.
[2025-06-02 19:10:55] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
[2025-06-02 19:11:02] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 3 ms to minimize.
[2025-06-02 19:11:03] [INFO ] Deduced a trap composed of 266 places in 195 ms of which 2 ms to minimize.
[2025-06-02 19:11:05] [INFO ] Deduced a trap composed of 80 places in 215 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1572 variables, and 65 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/460 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1130 constraints, Known Traps: 25/25 constraints]
After SMT, in 62487ms problems are : Problem set: 0 solved, 1130 unsolved
Search for dead transitions found 0 dead transitions in 62500ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69445 ms. Remains : 460/460 places, 1132/1132 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[8] Max Struct:[10]
Ending property specific reduction for PolyORBLF-COL-S02J04T10-UpperBounds-12 in 346413 ms.
[2025-06-02 19:11:09] [INFO ] Flatten gal took : 58 ms
[2025-06-02 19:11:09] [INFO ] Applying decomposition
[2025-06-02 19:11:09] [INFO ] Flatten gal took : 42 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/graph15395640109935524923.txt' '-o' '/tmp/graph15395640109935524923.bin' '-w' '/tmp/graph15395640109935524923.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15395640109935524923.bin' '-l' '-1' '-v' '-w' '/tmp/graph15395640109935524923.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:11:09] [INFO ] Decomposing Gal with order
[2025-06-02 19:11:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:11:09] [INFO ] Removed a total of 1027 redundant transitions.
[2025-06-02 19:11:09] [INFO ] Flatten gal took : 116 ms
[2025-06-02 19:11:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 682 labels/synchronizations in 36 ms.
[2025-06-02 19:11:09] [INFO ] Time to serialize gal into /tmp/UpperBounds7114301847033611423.gal : 11 ms
[2025-06-02 19:11:09] [INFO ] Time to serialize properties into /tmp/UpperBounds15503623900087959042.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/UpperBounds7114301847033611423.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15503623900087959042.prop' '--nowitness'

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 ...284
Loading property file /tmp/UpperBounds15503623900087959042.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.36308e+08,941.432,7180532,27532,74821,3.49978e+06,2.78995e+06,2793,3.52442e+07,1499,3.78985e+07,0
Total reachable state count : 136307772

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property PolyORBLF-COL-S02J04T10-UpperBounds-12 :0 <= i1.u1.cIdleTasks <= 10
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-12 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBLF-COL-S02J04T10-UpperBounds-12,0,955.712,7180532,1,0,3.49978e+06,2.78995e+06,2968,3.52442e+07,1638,3.78985e+07,12440
Total runtime 1572068 ms.

BK_STOP 1748892427572

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J04T10"
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-S02J04T10, 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-174881266000036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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