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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K 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-S02J04T08-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748890813185

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-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 19:00:14] [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:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:00:14] [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:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 19:00:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 673 ms
[2025-06-02 19:00:15] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 614 PT places and 1300.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2025-06-02 19:00:15] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2025-06-02 19:00:15] [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:15] [INFO ] Computed 26 invariants in 14 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[1, 0, 0, 0, 1, 10, 0, 2, 0, 0, 0, 0, 5, 0, 1, 0] Max Struct:[1, 1, 2, 8, 3, 10, 2, 2, 2, 2, 4, 1, 5, 1, 1, 8]
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-12 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 19:00:15] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 19:00:15] [INFO ] Computed 26 invariants in 11 ms
[2025-06-02 19:00:15] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-06-02 19:00:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2025-06-02 19:00:15] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-06-02 19:00:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-02 19:00:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:00:15] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-02 19:00:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-02 19:00:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:00:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 19:00:15] [INFO ] Added : 54 causal constraints over 11 iterations in 136 ms. Result :sat
Minimization took 33 ms.
[2025-06-02 19:00:16] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-02 19:00:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2025-06-02 19:00:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 19:00:16] [INFO ] Added : 28 causal constraints over 6 iterations in 58 ms. Result :sat
Minimization took 22 ms.
[2025-06-02 19:00:16] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:00:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:00:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:00:16] [INFO ] Added : 54 causal constraints over 11 iterations in 77 ms. Result :sat
Minimization took 28 ms.
[2025-06-02 19:00:16] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned unsat
[2025-06-02 19:00:16] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:00:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 19:00:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 19:00:16] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 14 ms.
[2025-06-02 19:00:16] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 19:00:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:00:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 19 ms returned sat
[2025-06-02 19:00:16] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 16 ms to minimize.
[2025-06-02 19:00:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2025-06-02 19:00:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:00:17] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 2 ms to minimize.
[2025-06-02 19:00:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2025-06-02 19:00:17] [INFO ] Added : 58 causal constraints over 12 iterations in 176 ms. Result :sat
Minimization took 26 ms.
[2025-06-02 19:00:17] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:00:17] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-02 19:00:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:17] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:17] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-02 19:00:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:00:17] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:00:17] [INFO ] Added : 54 causal constraints over 11 iterations in 85 ms. Result :sat
Minimization took 50 ms.
[2025-06-02 19:00:17] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:00:17] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-02 19:00:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:17] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2025-06-02 19:00:17] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-06-02 19:00:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 24 ms returned sat
[2025-06-02 19:00:17] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:00:17] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2025-06-02 19:00:17] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2025-06-02 19:00:17] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2025-06-02 19:00:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 162 ms
[2025-06-02 19:00:17] [INFO ] Added : 58 causal constraints over 12 iterations in 272 ms. Result :sat
Minimization took 31 ms.
[2025-06-02 19:00:17] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:17] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-02 19:00:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:17] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:00:17] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:00:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:00:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 19:00:18] [INFO ] Added : 3 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 18 ms.
[2025-06-02 19:00:18] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:18] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:00:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:18] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-06-02 19:00:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2025-06-02 19:00:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 19:00:18] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2025-06-02 19:00:18] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2025-06-02 19:00:18] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
[2025-06-02 19:00:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 121 ms
[2025-06-02 19:00:18] [INFO ] Added : 52 causal constraints over 11 iterations in 217 ms. Result :sat
Minimization took 28 ms.
[2025-06-02 19:00:18] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:00:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:00:18] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:00:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:00:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:00:18] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:00:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:00:18] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2025-06-02 19:00:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2025-06-02 19:00:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:00:18] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2025-06-02 19:00:18] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2025-06-02 19:00:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2025-06-02 19:00:18] [INFO ] Added : 60 causal constraints over 14 iterations in 186 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 2, 8, 1, 2, 2, 2, 4, 1, 1, 8]
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-02 19:00:18] [INFO ] Unfolded HLPN to a Petri net with 614 places and 1242 transitions 5732 arcs in 36 ms.
[2025-06-02 19:00:18] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[1, 2, 8, 2, 2, 2, 4, 1, 1, 8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 2, 8, 2, 2, 2, 4, 1, 1, 8]
[2025-06-02 19:00:18] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 614 cols
[2025-06-02 19:00:18] [INFO ] Computed 50 invariants in 53 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 2, 8, 2, 2, 2, 4, 1, 1, 8]
RANDOM walk for 10001 steps (2 resets) in 76 ms. (129 steps per ms)
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50002 steps (12 resets) in 139 ms. (357 steps per ms)
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-15 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 0] Max Struct:[2, 8, 2, 4]
[2025-06-02 19:00:19] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2025-06-02 19:00:19] [INFO ] Invariant cache hit.
[2025-06-02 19:00:19] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2025-06-02 19:00:19] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 8 ms returned unsat
[2025-06-02 19:00:19] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2025-06-02 19:00:19] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 5 ms returned unsat
[2025-06-02 19:00:19] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2025-06-02 19:00:19] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 6 ms returned unsat
[2025-06-02 19:00:19] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2025-06-02 19:00:19] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 22 ms returned sat
[2025-06-02 19:00:20] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2025-06-02 19:00:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:00:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2025-06-02 19:00:20] [INFO ] [Nat]Absence check using 14 positive and 36 generalized place invariants in 19 ms returned sat
[2025-06-02 19:00:20] [INFO ] [Nat]Absence check using state equation in 786 ms returned sat
[2025-06-02 19:00:20] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:00:21] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:00:21] [INFO ] [Nat]Added 96 Read/Feed constraints in 1014 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 0] Max Struct:[1, 1, 1, 4]
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 8 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 612 transition count 1042
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 540 transition count 1042
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 146 place count 540 transition count 978
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 274 place count 476 transition count 978
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 402 place count 412 transition count 914
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 418 place count 412 transition count 898
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 434 place count 396 transition count 898
Applied a total of 434 rules in 202 ms. Remains 396 /614 variables (removed 218) and now considering 898/1114 (removed 216) transitions.
Running 896 sub problems to find dead transitions.
[2025-06-02 19:00:22] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
// Phase 1: matrix 882 rows 396 cols
[2025-06-02 19:00:22] [INFO ] Computed 48 invariants in 21 ms
[2025-06-02 19:00:22] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 896 unsolved
[2025-06-02 19:00:30] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 2 ms to minimize.
[2025-06-02 19:00:30] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2025-06-02 19:00:30] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2025-06-02 19:00:30] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2025-06-02 19:00:30] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2025-06-02 19:00:30] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 3 ms to minimize.
[2025-06-02 19:00:30] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2025-06-02 19:00:31] [INFO ] Deduced a trap composed of 147 places in 185 ms of which 3 ms to minimize.
[2025-06-02 19:00:31] [INFO ] Deduced a trap composed of 151 places in 174 ms of which 3 ms to minimize.
[2025-06-02 19:00:31] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2025-06-02 19:00:32] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 896 unsolved
[2025-06-02 19:00:41] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2025-06-02 19:00:43] [INFO ] Deduced a trap composed of 218 places in 170 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1278 variables, and 59 constraints, problems are : Problem set: 0 solved, 896 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 34/35 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 896/896 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 896 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 896 unsolved
[2025-06-02 19:00:52] [INFO ] Deduced a trap composed of 134 places in 167 ms of which 2 ms to minimize.
[2025-06-02 19:00:53] [INFO ] Deduced a trap composed of 141 places in 173 ms of which 3 ms to minimize.
[2025-06-02 19:00:53] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1278 variables, and 62 constraints, problems are : Problem set: 0 solved, 896 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 34/35 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/896 constraints, Known Traps: 16/16 constraints]
After SMT, in 41843ms problems are : Problem set: 0 solved, 896 unsolved
Search for dead transitions found 0 dead transitions in 41876ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42100 ms. Remains : 396/614 places, 898/1114 transitions.
[2025-06-02 19:01:04] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
[2025-06-02 19:01:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (412 resets) in 3563 ms. (280 steps per ms)
BEST_FIRST walk for 1000001 steps (177 resets) in 1757 ms. (568 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2025-06-02 19:01:09] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
[2025-06-02 19:01:09] [INFO ] Invariant cache hit.
[2025-06-02 19:01:09] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2025-06-02 19:01:09] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 12 ms returned sat
[2025-06-02 19:01:09] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2025-06-02 19:01:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:01:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2025-06-02 19:01:09] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 14 ms returned sat
[2025-06-02 19:01:10] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2025-06-02 19:01:10] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:01:10] [INFO ] [Nat]Added 96 Read/Feed constraints in 647 ms returned sat
[2025-06-02 19:01:10] [INFO ] Computed and/alt/rep : 368/1302/360 causal constraints (skipped 520 transitions) in 69 ms.
[2025-06-02 19:01:11] [INFO ] Added : 18 causal constraints over 4 iterations in 381 ms. Result :sat
Minimization took 4511 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 8 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 898/898 transitions.
Applied a total of 0 rules in 31 ms. Remains 396 /396 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 396/396 places, 898/898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 898/898 transitions.
Applied a total of 0 rules in 21 ms. Remains 396 /396 variables (removed 0) and now considering 898/898 (removed 0) transitions.
[2025-06-02 19:01:15] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
[2025-06-02 19:01:15] [INFO ] Invariant cache hit.
[2025-06-02 19:01:16] [INFO ] Implicit Places using invariants in 395 ms returned [350, 351, 352, 353, 354, 355, 356, 357]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 398 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 388/396 places, 898/898 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 380 transition count 890
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 380 transition count 890
Applied a total of 16 rules in 29 ms. Remains 380 /388 variables (removed 8) and now considering 890/898 (removed 8) transitions.
[2025-06-02 19:01:16] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
// Phase 1: matrix 874 rows 380 cols
[2025-06-02 19:01:16] [INFO ] Computed 40 invariants in 23 ms
[2025-06-02 19:01:16] [INFO ] Implicit Places using invariants in 529 ms returned []
[2025-06-02 19:01:16] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:01:16] [INFO ] Invariant cache hit.
[2025-06-02 19:01:17] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:01:20] [INFO ] Implicit Places using invariants and state equation in 3901 ms returned []
Implicit Place search using SMT with State Equation took 4435 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 380/396 places, 890/898 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4885 ms. Remains : 380/396 places, 890/898 transitions.
[2025-06-02 19:01:20] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:01:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (421 resets) in 3223 ms. (310 steps per ms)
BEST_FIRST walk for 1000001 steps (151 resets) in 1601 ms. (624 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2025-06-02 19:01:25] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:01:25] [INFO ] Invariant cache hit.
[2025-06-02 19:01:25] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-06-02 19:01:25] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 13 ms returned sat
[2025-06-02 19:01:25] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2025-06-02 19:01:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:01:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-06-02 19:01:25] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 12 ms returned sat
[2025-06-02 19:01:26] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2025-06-02 19:01:26] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:01:26] [INFO ] [Nat]Added 96 Read/Feed constraints in 210 ms returned sat
[2025-06-02 19:01:26] [INFO ] Computed and/alt/rep : 352/1221/344 causal constraints (skipped 528 transitions) in 62 ms.
[2025-06-02 19:01:27] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 2 ms to minimize.
[2025-06-02 19:01:27] [INFO ] Deduced a trap composed of 145 places in 181 ms of which 2 ms to minimize.
[2025-06-02 19:01:27] [INFO ] Deduced a trap composed of 139 places in 220 ms of which 3 ms to minimize.
[2025-06-02 19:01:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 923 ms
[2025-06-02 19:01:28] [INFO ] Added : 28 causal constraints over 7 iterations in 1432 ms. Result :sat
Minimization took 2442 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 8 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 890/890 transitions.
Applied a total of 0 rules in 18 ms. Remains 380 /380 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 380/380 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 890/890 transitions.
Applied a total of 0 rules in 19 ms. Remains 380 /380 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2025-06-02 19:01:30] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:01:30] [INFO ] Invariant cache hit.
[2025-06-02 19:01:31] [INFO ] Implicit Places using invariants in 350 ms returned []
[2025-06-02 19:01:31] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:01:31] [INFO ] Invariant cache hit.
[2025-06-02 19:01:31] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:01:35] [INFO ] Implicit Places using invariants and state equation in 3907 ms returned []
Implicit Place search using SMT with State Equation took 4268 ms to find 0 implicit places.
[2025-06-02 19:01:35] [INFO ] Redundant transitions in 43 ms returned []
Running 888 sub problems to find dead transitions.
[2025-06-02 19:01:35] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:01:35] [INFO ] Invariant cache hit.
[2025-06-02 19:01:35] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:01:42] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2025-06-02 19:01:42] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2025-06-02 19:01:42] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2025-06-02 19:01:42] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2025-06-02 19:01:42] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2025-06-02 19:01:42] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 1 ms to minimize.
[2025-06-02 19:01:42] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2025-06-02 19:01:43] [INFO ] Deduced a trap composed of 151 places in 178 ms of which 3 ms to minimize.
[2025-06-02 19:01:43] [INFO ] Deduced a trap composed of 151 places in 175 ms of which 3 ms to minimize.
[2025-06-02 19:01:44] [INFO ] Deduced a trap composed of 140 places in 159 ms of which 2 ms to minimize.
[2025-06-02 19:01:44] [INFO ] Deduced a trap composed of 145 places in 180 ms of which 2 ms to minimize.
[2025-06-02 19:01:44] [INFO ] Deduced a trap composed of 152 places in 176 ms of which 2 ms to minimize.
[2025-06-02 19:01:44] [INFO ] Deduced a trap composed of 144 places in 162 ms of which 3 ms to minimize.
[2025-06-02 19:01:44] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2025-06-02 19:01:44] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 1 ms to minimize.
[2025-06-02 19:01:50] [INFO ] Deduced a trap composed of 132 places in 158 ms of which 3 ms to minimize.
[2025-06-02 19:01:50] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 2 ms to minimize.
[2025-06-02 19:01:51] [INFO ] Deduced a trap composed of 125 places in 158 ms of which 2 ms to minimize.
[2025-06-02 19:01:51] [INFO ] Deduced a trap composed of 149 places in 154 ms of which 2 ms to minimize.
[2025-06-02 19:01:52] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:01:54] [INFO ] Deduced a trap composed of 218 places in 154 ms of which 3 ms to minimize.
[2025-06-02 19:01:58] [INFO ] Deduced a trap composed of 134 places in 152 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1254 variables, and 60 constraints, problems are : Problem set: 0 solved, 888 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 888/888 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:02:12] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1254 variables, and 61 constraints, problems are : Problem set: 0 solved, 888 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/888 constraints, Known Traps: 23/23 constraints]
After SMT, in 61402ms problems are : Problem set: 0 solved, 888 unsolved
Search for dead transitions found 0 dead transitions in 61412ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65756 ms. Remains : 380/380 places, 890/890 transitions.
RANDOM walk for 40000 steps (23 resets) in 1200 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 382 ms. (104 steps per ms) remains 2/2 properties
[2025-06-02 19:02:37] [INFO ] Flatten gal took : 407 ms
BEST_FIRST walk for 40000 steps (10 resets) in 537 ms. (74 steps per ms) remains 2/2 properties
[2025-06-02 19:02:37] [INFO ] Flatten gal took : 223 ms
[2025-06-02 19:02:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality390962378944510556.gal : 84 ms
[2025-06-02 19:02:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality599419131325859247.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/ReachabilityCardinality390962378944510556.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality599419131325859247.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 ...326
Loading property file /tmp/ReachabilityCardinality599419131325859247.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :9 after 33
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :33 after 49
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :49 after 50
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :50 after 290
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :290 after 663
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :663 after 1954
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1954 after 5299
Interrupted probabilistic random walk after 191929 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 2
Probabilistic random walk after 191929 steps, saw 106393 distinct states, run finished after 3005 ms. (steps per millisecond=63 ) properties seen :0
[2025-06-02 19:02:40] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:02:40] [INFO ] Invariant cache hit.
[2025-06-02 19:02:40] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 135/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/166 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/176 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 195/371 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:02:40] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
[2025-06-02 19:02:40] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2025-06-02 19:02:41] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2025-06-02 19:02:41] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2025-06-02 19:02:41] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/375 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/378 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 874/1252 variables, 378/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1252 variables, 96/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1252 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1254 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1254 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1254 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1254 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1254/1254 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1449 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 380/380 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 135/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/166 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/176 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 195/371 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/375 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/378 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 874/1252 variables, 378/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5299 after 13246
At refinement iteration 15 (INCLUDED_ONLY) 0/1252 variables, 96/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1252 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1252 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1254 variables, 2/522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1254 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:02:46] [INFO ] Deduced a trap composed of 19 places in 3111 ms of which 3 ms to minimize.
[2025-06-02 19:02:46] [INFO ] Deduced a trap composed of 132 places in 181 ms of which 2 ms to minimize.
[2025-06-02 19:02:46] [INFO ] Deduced a trap composed of 157 places in 175 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1254/1254 variables, and 526 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 380/380 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 6497ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 890/890 transitions.
Applied a total of 0 rules in 22 ms. Remains 380 /380 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Running 888 sub problems to find dead transitions.
[2025-06-02 19:02:46] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:02:46] [INFO ] Invariant cache hit.
[2025-06-02 19:02:46] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :13246 after 18616
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:02:54] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2025-06-02 19:02:54] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2025-06-02 19:02:54] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2025-06-02 19:02:54] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:02:54] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2025-06-02 19:02:54] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:02:54] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:02:54] [INFO ] Deduced a trap composed of 151 places in 181 ms of which 2 ms to minimize.
[2025-06-02 19:02:55] [INFO ] Deduced a trap composed of 151 places in 180 ms of which 2 ms to minimize.
[2025-06-02 19:02:55] [INFO ] Deduced a trap composed of 140 places in 181 ms of which 2 ms to minimize.
[2025-06-02 19:02:55] [INFO ] Deduced a trap composed of 145 places in 180 ms of which 2 ms to minimize.
[2025-06-02 19:02:56] [INFO ] Deduced a trap composed of 152 places in 179 ms of which 2 ms to minimize.
[2025-06-02 19:02:56] [INFO ] Deduced a trap composed of 144 places in 178 ms of which 2 ms to minimize.
[2025-06-02 19:02:56] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2025-06-02 19:02:56] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 1 ms to minimize.
[2025-06-02 19:03:02] [INFO ] Deduced a trap composed of 132 places in 172 ms of which 2 ms to minimize.
[2025-06-02 19:03:02] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 3 ms to minimize.
[2025-06-02 19:03:02] [INFO ] Deduced a trap composed of 125 places in 170 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :18616 after 28404
[2025-06-02 19:03:03] [INFO ] Deduced a trap composed of 149 places in 182 ms of which 3 ms to minimize.
[2025-06-02 19:03:04] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:03:06] [INFO ] Deduced a trap composed of 218 places in 181 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1254 variables, and 59 constraints, problems are : Problem set: 0 solved, 888 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 888/888 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 21/59 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:03:17] [INFO ] Deduced a trap composed of 134 places in 202 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 888 unsolved
Detected timeout of ITS tools.
[2025-06-02 19:03:28] [INFO ] Flatten gal took : 108 ms
[2025-06-02 19:03:28] [INFO ] Applying decomposition
[2025-06-02 19:03:28] [INFO ] Flatten gal took : 124 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1254 variables, and 60 constraints, problems are : Problem set: 0 solved, 888 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/888 constraints, Known Traps: 22/22 constraints]
After SMT, in 41429ms problems are : Problem set: 0 solved, 888 unsolved
Search for dead transitions found 0 dead transitions in 41438ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41464 ms. Remains : 380/380 places, 890/890 transitions.
RANDOM walk for 40000 steps (20 resets) in 462 ms. (86 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (12 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
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/graph11624704293264598807.txt' '-o' '/tmp/graph11624704293264598807.bin' '-w' '/tmp/graph11624704293264598807.weights'
BEST_FIRST walk for 40003 steps (9 resets) in 224 ms. (177 steps per ms) remains 2/2 properties
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11624704293264598807.bin' '-l' '-1' '-v' '-w' '/tmp/graph11624704293264598807.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:03:28] [INFO ] Decomposing Gal with order
[2025-06-02 19:03:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:03:29] [INFO ] Removed a total of 730 redundant transitions.
[2025-06-02 19:03:29] [INFO ] Flatten gal took : 431 ms
[2025-06-02 19:03:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 431 labels/synchronizations in 46 ms.
[2025-06-02 19:03:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12473214505928739757.gal : 17 ms
[2025-06-02 19:03:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17828545892695569912.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/ReachabilityCardinality12473214505928739757.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17828545892695569912.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17828545892695569912.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 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 28
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :28 after 50
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :50 after 314
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :314 after 482
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :482 after 678
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :678 after 818
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :818 after 1688
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1688 after 2011
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2011 after 2247
Interrupted probabilistic random walk after 226435 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 2
Probabilistic random walk after 226435 steps, saw 124429 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2025-06-02 19:03:31] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:03:31] [INFO ] Invariant cache hit.
[2025-06-02 19:03:31] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 135/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/166 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/176 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 195/371 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:03:31] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2025-06-02 19:03:32] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2025-06-02 19:03:32] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2025-06-02 19:03:32] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2025-06-02 19:03:32] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/375 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/378 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 874/1252 variables, 378/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2247 after 4559
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1252 variables, 96/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1252 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1254 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1254 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1254 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1254 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1254/1254 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1084 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 380/380 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 135/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/166 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/176 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 195/371 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/375 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/378 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 874/1252 variables, 378/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1252 variables, 96/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1252 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1252 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1254 variables, 2/522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1254 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:03:34] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 2 ms to minimize.
[2025-06-02 19:03:34] [INFO ] Deduced a trap composed of 132 places in 170 ms of which 2 ms to minimize.
[2025-06-02 19:03:34] [INFO ] Deduced a trap composed of 157 places in 170 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1254 variables, 3/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1254 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1254 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1254/1254 variables, and 526 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2141 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 380/380 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 3239ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 263 ms.
Support contains 8 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 890/890 transitions.
Applied a total of 0 rules in 18 ms. Remains 380 /380 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 380/380 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 890/890 transitions.
Applied a total of 0 rules in 13 ms. Remains 380 /380 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2025-06-02 19:03:35] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:03:35] [INFO ] Invariant cache hit.
[2025-06-02 19:03:35] [INFO ] Implicit Places using invariants in 318 ms returned []
[2025-06-02 19:03:35] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:03:35] [INFO ] Invariant cache hit.
[2025-06-02 19:03:35] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4559 after 23417
[2025-06-02 19:03:39] [INFO ] Implicit Places using invariants and state equation in 3844 ms returned []
Implicit Place search using SMT with State Equation took 4167 ms to find 0 implicit places.
[2025-06-02 19:03:39] [INFO ] Redundant transitions in 12 ms returned []
Running 888 sub problems to find dead transitions.
[2025-06-02 19:03:39] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:03:39] [INFO ] Invariant cache hit.
[2025-06-02 19:03:39] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :23417 after 41524
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:03:46] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2025-06-02 19:03:46] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2025-06-02 19:03:46] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2025-06-02 19:03:46] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2025-06-02 19:03:46] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2025-06-02 19:03:47] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2025-06-02 19:03:47] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2025-06-02 19:03:47] [INFO ] Deduced a trap composed of 151 places in 177 ms of which 3 ms to minimize.
[2025-06-02 19:03:47] [INFO ] Deduced a trap composed of 151 places in 173 ms of which 2 ms to minimize.
[2025-06-02 19:03:48] [INFO ] Deduced a trap composed of 140 places in 170 ms of which 2 ms to minimize.
[2025-06-02 19:03:48] [INFO ] Deduced a trap composed of 145 places in 192 ms of which 2 ms to minimize.
[2025-06-02 19:03:48] [INFO ] Deduced a trap composed of 152 places in 197 ms of which 2 ms to minimize.
[2025-06-02 19:03:48] [INFO ] Deduced a trap composed of 144 places in 211 ms of which 2 ms to minimize.
[2025-06-02 19:03:48] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2025-06-02 19:03:49] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :41524 after 79712
[2025-06-02 19:03:54] [INFO ] Deduced a trap composed of 132 places in 178 ms of which 2 ms to minimize.
[2025-06-02 19:03:55] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 3 ms to minimize.
[2025-06-02 19:03:55] [INFO ] Deduced a trap composed of 125 places in 181 ms of which 3 ms to minimize.
[2025-06-02 19:03:56] [INFO ] Deduced a trap composed of 149 places in 168 ms of which 3 ms to minimize.
[2025-06-02 19:03:56] [INFO ] Deduced a trap composed of 3 places in 202 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:03:59] [INFO ] Deduced a trap composed of 218 places in 188 ms of which 2 ms to minimize.
[2025-06-02 19:04:03] [INFO ] Deduced a trap composed of 134 places in 204 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :79712 after 142120
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1254 variables, and 60 constraints, problems are : Problem set: 0 solved, 888 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 888/888 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:04:17] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 3 ms to minimize.
Detected timeout of ITS tools.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1254 variables, and 61 constraints, problems are : Problem set: 0 solved, 888 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/888 constraints, Known Traps: 23/23 constraints]
After SMT, in 61443ms problems are : Problem set: 0 solved, 888 unsolved
Search for dead transitions found 0 dead transitions in 61452ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65655 ms. Remains : 380/380 places, 890/890 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[4]
Starting property specific reduction for PolyORBLF-COL-S02J04T08-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2025-06-02 19:04:40] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:04:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (3 resets) in 33 ms. (294 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2025-06-02 19:04:40] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:04:40] [INFO ] Invariant cache hit.
[2025-06-02 19:04:41] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-06-02 19:04:41] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 11 ms returned sat
[2025-06-02 19:04:41] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2025-06-02 19:04:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:04:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-06-02 19:04:41] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 10 ms returned sat
[2025-06-02 19:04:41] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2025-06-02 19:04:41] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:04:42] [INFO ] [Nat]Added 96 Read/Feed constraints in 204 ms returned sat
[2025-06-02 19:04:42] [INFO ] Computed and/alt/rep : 352/1221/344 causal constraints (skipped 528 transitions) in 60 ms.
[2025-06-02 19:04:42] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 3 ms to minimize.
[2025-06-02 19:04:42] [INFO ] Deduced a trap composed of 145 places in 195 ms of which 3 ms to minimize.
[2025-06-02 19:04:43] [INFO ] Deduced a trap composed of 139 places in 176 ms of which 2 ms to minimize.
[2025-06-02 19:04:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 884 ms
[2025-06-02 19:04:43] [INFO ] Added : 28 causal constraints over 7 iterations in 1393 ms. Result :sat
Minimization took 589 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 8 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 890/890 transitions.
Applied a total of 0 rules in 17 ms. Remains 380 /380 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Running 888 sub problems to find dead transitions.
[2025-06-02 19:04:44] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:04:44] [INFO ] Invariant cache hit.
[2025-06-02 19:04:44] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:04:51] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2025-06-02 19:04:51] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2025-06-02 19:04:51] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 0 ms to minimize.
[2025-06-02 19:04:51] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 2 ms to minimize.
[2025-06-02 19:04:51] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2025-06-02 19:04:51] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2025-06-02 19:04:51] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2025-06-02 19:04:52] [INFO ] Deduced a trap composed of 151 places in 191 ms of which 2 ms to minimize.
[2025-06-02 19:04:52] [INFO ] Deduced a trap composed of 151 places in 173 ms of which 2 ms to minimize.
[2025-06-02 19:04:52] [INFO ] Deduced a trap composed of 140 places in 162 ms of which 2 ms to minimize.
[2025-06-02 19:04:53] [INFO ] Deduced a trap composed of 145 places in 168 ms of which 3 ms to minimize.
[2025-06-02 19:04:53] [INFO ] Deduced a trap composed of 152 places in 169 ms of which 2 ms to minimize.
[2025-06-02 19:04:53] [INFO ] Deduced a trap composed of 144 places in 161 ms of which 3 ms to minimize.
[2025-06-02 19:04:53] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2025-06-02 19:04:53] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 1 ms to minimize.
[2025-06-02 19:04:59] [INFO ] Deduced a trap composed of 132 places in 169 ms of which 2 ms to minimize.
[2025-06-02 19:04:59] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 2 ms to minimize.
[2025-06-02 19:05:00] [INFO ] Deduced a trap composed of 125 places in 165 ms of which 3 ms to minimize.
[2025-06-02 19:05:00] [INFO ] Deduced a trap composed of 149 places in 154 ms of which 2 ms to minimize.
[2025-06-02 19:05:01] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:05:03] [INFO ] Deduced a trap composed of 218 places in 164 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1254 variables, and 59 constraints, problems are : Problem set: 0 solved, 888 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 888/888 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 21/59 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:05:14] [INFO ] Deduced a trap composed of 134 places in 155 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:05:24] [INFO ] Deduced a trap composed of 65 places in 165 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1254 variables, and 61 constraints, problems are : Problem set: 0 solved, 888 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/888 constraints, Known Traps: 23/23 constraints]
After SMT, in 41391ms problems are : Problem set: 0 solved, 888 unsolved
Search for dead transitions found 0 dead transitions in 41406ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41425 ms. Remains : 380/380 places, 890/890 transitions.
[2025-06-02 19:05:25] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:05:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (417 resets) in 3338 ms. (299 steps per ms)
BEST_FIRST walk for 1000000 steps (164 resets) in 1597 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2025-06-02 19:05:30] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:05:30] [INFO ] Invariant cache hit.
[2025-06-02 19:05:30] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2025-06-02 19:05:30] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 12 ms returned sat
[2025-06-02 19:05:30] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2025-06-02 19:05:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:05:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-06-02 19:05:30] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 12 ms returned sat
[2025-06-02 19:05:31] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2025-06-02 19:05:31] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:05:31] [INFO ] [Nat]Added 96 Read/Feed constraints in 210 ms returned sat
[2025-06-02 19:05:31] [INFO ] Computed and/alt/rep : 352/1221/344 causal constraints (skipped 528 transitions) in 51 ms.
[2025-06-02 19:05:32] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 2 ms to minimize.
[2025-06-02 19:05:32] [INFO ] Deduced a trap composed of 145 places in 181 ms of which 2 ms to minimize.
[2025-06-02 19:05:32] [INFO ] Deduced a trap composed of 139 places in 175 ms of which 2 ms to minimize.
[2025-06-02 19:05:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 853 ms
[2025-06-02 19:05:32] [INFO ] Added : 28 causal constraints over 7 iterations in 1330 ms. Result :sat
Minimization took 2456 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 8 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 890/890 transitions.
Applied a total of 0 rules in 24 ms. Remains 380 /380 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 380/380 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 890/890 transitions.
Applied a total of 0 rules in 13 ms. Remains 380 /380 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2025-06-02 19:05:35] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:05:35] [INFO ] Invariant cache hit.
[2025-06-02 19:05:36] [INFO ] Implicit Places using invariants in 334 ms returned []
[2025-06-02 19:05:36] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:05:36] [INFO ] Invariant cache hit.
[2025-06-02 19:05:36] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 19:05:39] [INFO ] Implicit Places using invariants and state equation in 3895 ms returned []
Implicit Place search using SMT with State Equation took 4230 ms to find 0 implicit places.
[2025-06-02 19:05:39] [INFO ] Redundant transitions in 10 ms returned []
Running 888 sub problems to find dead transitions.
[2025-06-02 19:05:39] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:05:39] [INFO ] Invariant cache hit.
[2025-06-02 19:05:39] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:05:47] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2025-06-02 19:05:47] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2025-06-02 19:05:47] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2025-06-02 19:05:47] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2025-06-02 19:05:47] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2025-06-02 19:05:47] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2025-06-02 19:05:47] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:05:47] [INFO ] Deduced a trap composed of 151 places in 172 ms of which 2 ms to minimize.
[2025-06-02 19:05:48] [INFO ] Deduced a trap composed of 151 places in 156 ms of which 3 ms to minimize.
[2025-06-02 19:05:48] [INFO ] Deduced a trap composed of 140 places in 165 ms of which 3 ms to minimize.
[2025-06-02 19:05:48] [INFO ] Deduced a trap composed of 145 places in 167 ms of which 2 ms to minimize.
[2025-06-02 19:05:49] [INFO ] Deduced a trap composed of 152 places in 161 ms of which 2 ms to minimize.
[2025-06-02 19:05:49] [INFO ] Deduced a trap composed of 144 places in 158 ms of which 2 ms to minimize.
[2025-06-02 19:05:49] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2025-06-02 19:05:49] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 2 ms to minimize.
[2025-06-02 19:05:55] [INFO ] Deduced a trap composed of 132 places in 170 ms of which 2 ms to minimize.
[2025-06-02 19:05:55] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 2 ms to minimize.
[2025-06-02 19:05:55] [INFO ] Deduced a trap composed of 125 places in 160 ms of which 2 ms to minimize.
[2025-06-02 19:05:56] [INFO ] Deduced a trap composed of 149 places in 173 ms of which 2 ms to minimize.
[2025-06-02 19:05:56] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:05:59] [INFO ] Deduced a trap composed of 218 places in 162 ms of which 2 ms to minimize.
[2025-06-02 19:06:03] [INFO ] Deduced a trap composed of 134 places in 165 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1254 variables, and 60 constraints, problems are : Problem set: 0 solved, 888 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 888/888 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:06:17] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1254 variables, and 61 constraints, problems are : Problem set: 0 solved, 888 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/888 constraints, Known Traps: 23/23 constraints]
After SMT, in 61310ms problems are : Problem set: 0 solved, 888 unsolved
Search for dead transitions found 0 dead transitions in 61319ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65579 ms. Remains : 380/380 places, 890/890 transitions.
RANDOM walk for 40000 steps (19 resets) in 254 ms. (156 steps per ms) remains 2/2 properties
[2025-06-02 19:06:41] [INFO ] Flatten gal took : 107 ms
BEST_FIRST walk for 40002 steps (8 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
[2025-06-02 19:06:41] [INFO ] Flatten gal took : 137 ms
[2025-06-02 19:06:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4370534940686134651.gal : 7 ms
[2025-06-02 19:06:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6982759735066173910.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/ReachabilityCardinality4370534940686134651.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6982759735066173910.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 ...328
Loading property file /tmp/ReachabilityCardinality6982759735066173910.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :9 after 33
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :33 after 49
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :49 after 50
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :50 after 290
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :290 after 663
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :663 after 1954
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1954 after 5299
Interrupted probabilistic random walk after 218415 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 2
Probabilistic random walk after 218415 steps, saw 120291 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
[2025-06-02 19:06:44] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:06:44] [INFO ] Invariant cache hit.
[2025-06-02 19:06:44] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 135/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/166 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/176 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 195/371 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:06:44] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
[2025-06-02 19:06:44] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 1 ms to minimize.
[2025-06-02 19:06:44] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2025-06-02 19:06:45] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2025-06-02 19:06:45] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/375 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/378 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 874/1252 variables, 378/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1252 variables, 96/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1252 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1254 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1254 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1254 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1254 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1254/1254 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1205 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 380/380 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 135/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/166 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/176 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 195/371 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/375 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/378 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 874/1252 variables, 378/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5299 after 13246
At refinement iteration 15 (INCLUDED_ONLY) 0/1252 variables, 96/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1252 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1252 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1254 variables, 2/522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1254 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:06:47] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 2 ms to minimize.
[2025-06-02 19:06:47] [INFO ] Deduced a trap composed of 132 places in 219 ms of which 3 ms to minimize.
[2025-06-02 19:06:47] [INFO ] Deduced a trap composed of 157 places in 216 ms of which 9 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1254 variables, 3/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1254 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1254 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1254/1254 variables, and 526 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2252 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 380/380 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 3497ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 256 ms.
Support contains 8 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 890/890 transitions.
Applied a total of 0 rules in 11 ms. Remains 380 /380 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Running 888 sub problems to find dead transitions.
[2025-06-02 19:06:48] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:06:48] [INFO ] Invariant cache hit.
[2025-06-02 19:06:48] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :13246 after 18616
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:06:55] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2025-06-02 19:06:55] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2025-06-02 19:06:55] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 0 ms to minimize.
[2025-06-02 19:06:55] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2025-06-02 19:06:56] [INFO ] Deduced a trap composed of 38 places in 393 ms of which 0 ms to minimize.
[2025-06-02 19:06:56] [INFO ] Deduced a trap composed of 38 places in 24 ms of which 1 ms to minimize.
[2025-06-02 19:06:56] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2025-06-02 19:06:56] [INFO ] Deduced a trap composed of 151 places in 192 ms of which 3 ms to minimize.
[2025-06-02 19:06:57] [INFO ] Deduced a trap composed of 151 places in 183 ms of which 2 ms to minimize.
[2025-06-02 19:06:57] [INFO ] Deduced a trap composed of 140 places in 229 ms of which 2 ms to minimize.
[2025-06-02 19:06:57] [INFO ] Deduced a trap composed of 145 places in 179 ms of which 2 ms to minimize.
[2025-06-02 19:06:57] [INFO ] Deduced a trap composed of 152 places in 212 ms of which 2 ms to minimize.
[2025-06-02 19:06:58] [INFO ] Deduced a trap composed of 144 places in 206 ms of which 2 ms to minimize.
[2025-06-02 19:06:58] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:06:58] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 2 ms to minimize.
[2025-06-02 19:07:04] [INFO ] Deduced a trap composed of 132 places in 174 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :18616 after 28404
[2025-06-02 19:07:04] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 2 ms to minimize.
[2025-06-02 19:07:04] [INFO ] Deduced a trap composed of 125 places in 191 ms of which 2 ms to minimize.
[2025-06-02 19:07:05] [INFO ] Deduced a trap composed of 149 places in 165 ms of which 2 ms to minimize.
[2025-06-02 19:07:05] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:07:08] [INFO ] Deduced a trap composed of 218 places in 207 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1254 variables, and 59 constraints, problems are : Problem set: 0 solved, 888 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 888/888 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 21/59 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:07:18] [INFO ] Deduced a trap composed of 134 places in 169 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:07:27] [INFO ] Deduced a trap composed of 66 places in 179 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :28404 after 225960
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 Int declared 378/1254 variables, and 61 constraints, problems are : Problem set: 0 solved, 888 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/888 constraints, Known Traps: 23/23 constraints]
After SMT, in 41523ms problems are : Problem set: 0 solved, 888 unsolved
Search for dead transitions found 0 dead transitions in 41532ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41546 ms. Remains : 380/380 places, 890/890 transitions.
RANDOM walk for 40000 steps (17 resets) in 314 ms. (126 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (10 resets) in 198 ms. (201 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (11 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
Detected timeout of ITS tools.
[2025-06-02 19:07:31] [INFO ] Flatten gal took : 39 ms
[2025-06-02 19:07:31] [INFO ] Applying decomposition
[2025-06-02 19:07:31] [INFO ] Flatten gal took : 39 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/graph16699263745693727648.txt' '-o' '/tmp/graph16699263745693727648.bin' '-w' '/tmp/graph16699263745693727648.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16699263745693727648.bin' '-l' '-1' '-v' '-w' '/tmp/graph16699263745693727648.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:07:31] [INFO ] Decomposing Gal with order
[2025-06-02 19:07:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:07:32] [INFO ] Removed a total of 881 redundant transitions.
[2025-06-02 19:07:32] [INFO ] Flatten gal took : 206 ms
[2025-06-02 19:07:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 437 labels/synchronizations in 55 ms.
[2025-06-02 19:07:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2893835331424756798.gal : 23 ms
[2025-06-02 19:07:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8899135348854823956.prop : 14 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/ReachabilityCardinality2893835331424756798.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8899135348854823956.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 ...328
Loading property file /tmp/ReachabilityCardinality8899135348854823956.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 17
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :17 after 100
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :100 after 125
Interrupted probabilistic random walk after 190582 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 2
Probabilistic random walk after 190582 steps, saw 105735 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2025-06-02 19:07:33] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:07:33] [INFO ] Invariant cache hit.
[2025-06-02 19:07:33] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :125 after 626
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 135/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/166 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/176 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 195/371 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:07:33] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :626 after 1353
[2025-06-02 19:07:33] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
[2025-06-02 19:07:33] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2025-06-02 19:07:33] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 0 ms to minimize.
[2025-06-02 19:07:33] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/375 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/378 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 874/1252 variables, 378/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1252 variables, 96/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1252 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1254 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1254 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1254 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1254 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1254/1254 variables, and 521 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1218 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 380/380 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 135/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/166 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/176 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 195/371 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/375 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1353 after 6445
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/378 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 874/1252 variables, 378/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1252 variables, 96/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1252 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1252 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1254 variables, 2/522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1254 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:07:35] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 2 ms to minimize.
[2025-06-02 19:07:35] [INFO ] Deduced a trap composed of 132 places in 180 ms of which 3 ms to minimize.
[2025-06-02 19:07:36] [INFO ] Deduced a trap composed of 157 places in 173 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1254 variables, 3/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1254 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1254 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1254/1254 variables, and 526 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2231 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 380/380 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 3463ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 136 ms.
Support contains 8 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 890/890 transitions.
Applied a total of 0 rules in 22 ms. Remains 380 /380 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 380/380 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 890/890 transitions.
Applied a total of 0 rules in 10 ms. Remains 380 /380 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2025-06-02 19:07:36] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:07:36] [INFO ] Invariant cache hit.
[2025-06-02 19:07:37] [INFO ] Implicit Places using invariants in 428 ms returned []
[2025-06-02 19:07:37] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:07:37] [INFO ] Invariant cache hit.
[2025-06-02 19:07:37] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :21340 after 21919
[2025-06-02 19:07:41] [INFO ] Implicit Places using invariants and state equation in 3903 ms returned []
Implicit Place search using SMT with State Equation took 4350 ms to find 0 implicit places.
[2025-06-02 19:07:41] [INFO ] Redundant transitions in 7 ms returned []
Running 888 sub problems to find dead transitions.
[2025-06-02 19:07:41] [INFO ] Flow matrix only has 874 transitions (discarded 16 similar events)
[2025-06-02 19:07:41] [INFO ] Invariant cache hit.
[2025-06-02 19:07:41] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :21919 after 51933
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:07:48] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2025-06-02 19:07:48] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2025-06-02 19:07:48] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 0 ms to minimize.
[2025-06-02 19:07:48] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:07:48] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2025-06-02 19:07:48] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2025-06-02 19:07:48] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2025-06-02 19:07:49] [INFO ] Deduced a trap composed of 151 places in 177 ms of which 2 ms to minimize.
[2025-06-02 19:07:49] [INFO ] Deduced a trap composed of 151 places in 182 ms of which 2 ms to minimize.
[2025-06-02 19:07:49] [INFO ] Deduced a trap composed of 140 places in 182 ms of which 2 ms to minimize.
[2025-06-02 19:07:50] [INFO ] Deduced a trap composed of 145 places in 191 ms of which 2 ms to minimize.
[2025-06-02 19:07:50] [INFO ] Deduced a trap composed of 152 places in 176 ms of which 3 ms to minimize.
[2025-06-02 19:07:50] [INFO ] Deduced a trap composed of 144 places in 198 ms of which 2 ms to minimize.
[2025-06-02 19:07:50] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2025-06-02 19:07:50] [INFO ] Deduced a trap composed of 68 places in 126 ms of which 2 ms to minimize.
[2025-06-02 19:07:56] [INFO ] Deduced a trap composed of 132 places in 177 ms of which 2 ms to minimize.
[2025-06-02 19:07:57] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 2 ms to minimize.
[2025-06-02 19:07:57] [INFO ] Deduced a trap composed of 125 places in 161 ms of which 2 ms to minimize.
[2025-06-02 19:07:58] [INFO ] Deduced a trap composed of 149 places in 176 ms of which 2 ms to minimize.
[2025-06-02 19:07:58] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:08:01] [INFO ] Deduced a trap composed of 218 places in 164 ms of which 3 ms to minimize.
[2025-06-02 19:08:05] [INFO ] Deduced a trap composed of 134 places in 173 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :51933 after 238246
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1254 variables, and 60 constraints, problems are : Problem set: 0 solved, 888 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 888/888 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2025-06-02 19:08:18] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1254 variables, and 61 constraints, problems are : Problem set: 0 solved, 888 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/380 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/888 constraints, Known Traps: 23/23 constraints]
After SMT, in 61440ms problems are : Problem set: 0 solved, 888 unsolved
Search for dead transitions found 0 dead transitions in 61451ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65829 ms. Remains : 380/380 places, 890/890 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[4]
Ending property specific reduction for PolyORBLF-COL-S02J04T08-UpperBounds-10 in 241591 ms.
[2025-06-02 19:08:42] [INFO ] Flatten gal took : 36 ms
[2025-06-02 19:08:42] [INFO ] Applying decomposition
[2025-06-02 19:08:42] [INFO ] Flatten gal took : 34 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/graph2718950090699163014.txt' '-o' '/tmp/graph2718950090699163014.bin' '-w' '/tmp/graph2718950090699163014.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2718950090699163014.bin' '-l' '-1' '-v' '-w' '/tmp/graph2718950090699163014.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:08:42] [INFO ] Decomposing Gal with order
[2025-06-02 19:08:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:08:42] [INFO ] Removed a total of 1082 redundant transitions.
[2025-06-02 19:08:42] [INFO ] Flatten gal took : 109 ms
[2025-06-02 19:08:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 411 labels/synchronizations in 36 ms.
[2025-06-02 19:08:42] [INFO ] Time to serialize gal into /tmp/UpperBounds4908678886167305740.gal : 7 ms
[2025-06-02 19:08:42] [INFO ] Time to serialize properties into /tmp/UpperBounds3207821468342802326.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/UpperBounds4908678886167305740.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3207821468342802326.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 ...304
Loading property file /tmp/UpperBounds3207821468342802326.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\_flatf,2.11371e+07,175.938,3422200,2,483273,5,7.356e+06,6,0,2552,5.74027e+06,0
Total reachable state count : 21137112

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property PolyORBLF-COL-S02J04T08-UpperBounds-10 :0 <= gi7.gu36.P_1160_0+gi7.gu36.P_1160_1+gi1.gu7.P_1160_2+gi7.gu36.P_1160_3+gi7.gu36.P_1160_4+gi7.g...208
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-10 0 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-S02J04T08-UpperBounds-10,0,176.306,3422200,1,0,6,7.356e+06,9,1,3354,5.74027e+06,4
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 685145 ms.

BK_STOP 1748891499648

--------------------
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-S02J04T08"
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-S02J04T08, 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-174881266000035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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